/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/hard2.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 10:47:58,789 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 10:47:58,791 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 10:47:58,822 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 10:47:58,822 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 10:47:58,823 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 10:47:58,826 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 10:47:58,831 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 10:47:58,832 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 10:47:58,833 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 10:47:58,833 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 10:47:58,834 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 10:47:58,834 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 10:47:58,835 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 10:47:58,836 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 10:47:58,837 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 10:47:58,837 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 10:47:58,838 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 10:47:58,839 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 10:47:58,841 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 10:47:58,842 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 10:47:58,843 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 10:47:58,843 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 10:47:58,844 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 10:47:58,845 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 10:47:58,848 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 10:47:58,848 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 10:47:58,848 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 10:47:58,849 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 10:47:58,849 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 10:47:58,850 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 10:47:58,850 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 10:47:58,851 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 10:47:58,851 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 10:47:58,852 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 10:47:58,853 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 10:47:58,853 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 10:47:58,853 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 10:47:58,854 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 10:47:58,854 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 10:47:58,854 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 10:47:58,855 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 10:47:58,856 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 10:47:58,863 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 10:47:58,863 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 10:47:58,864 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 10:47:58,864 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 10:47:58,864 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 10:47:58,865 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 10:47:58,865 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 10:47:58,865 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 10:47:58,865 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 10:47:58,865 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 10:47:58,865 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 10:47:58,866 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 10:47:58,866 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 10:47:58,866 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 10:47:58,866 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 10:47:58,866 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:47:58,867 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 10:47:58,867 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 10:47:58,867 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 10:47:58,867 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 10:47:58,867 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 10:47:58,867 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-28 10:47:58,868 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 10:47:59,045 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 10:47:59,061 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 10:47:59,063 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 10:47:59,064 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 10:47:59,064 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 10:47:59,065 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench/hard2.c [2022-04-28 10:47:59,145 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62da242d/8f7e541d56e7425ab63707869975fa13/FLAGc182629f8 [2022-04-28 10:47:59,502 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 10:47:59,503 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard2.c [2022-04-28 10:47:59,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62da242d/8f7e541d56e7425ab63707869975fa13/FLAGc182629f8 [2022-04-28 10:47:59,518 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/f62da242d/8f7e541d56e7425ab63707869975fa13 [2022-04-28 10:47:59,520 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 10:47:59,521 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 10:47:59,522 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 10:47:59,522 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 10:47:59,526 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 10:47:59,527 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,527 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5f26ccad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59, skipping insertion in model container [2022-04-28 10:47:59,528 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,534 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 10:47:59,543 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 10:47:59,716 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard2.c[526,539] [2022-04-28 10:47:59,745 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:47:59,753 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 10:47:59,763 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench/hard2.c[526,539] [2022-04-28 10:47:59,770 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 10:47:59,786 INFO L208 MainTranslator]: Completed translation [2022-04-28 10:47:59,787 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59 WrapperNode [2022-04-28 10:47:59,787 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 10:47:59,788 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 10:47:59,788 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 10:47:59,788 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 10:47:59,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,805 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,805 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,815 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,820 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,821 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 10:47:59,822 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 10:47:59,822 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 10:47:59,822 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 10:47:59,825 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59" (1/1) ... [2022-04-28 10:47:59,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 10:47:59,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:47:59,864 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 10:47:59,865 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 10:47:59,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 10:47:59,892 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 10:47:59,892 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 10:47:59,893 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 10:47:59,893 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 10:47:59,893 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 10:47:59,894 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 10:47:59,894 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 10:47:59,894 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 10:47:59,894 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 10:47:59,894 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 10:47:59,894 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 10:47:59,895 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 10:47:59,895 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 10:47:59,896 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 10:47:59,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 10:47:59,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 10:47:59,897 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 10:47:59,897 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 10:47:59,897 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 10:47:59,948 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 10:47:59,949 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 10:48:00,075 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 10:48:00,081 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 10:48:00,082 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-28 10:48:00,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:48:00 BoogieIcfgContainer [2022-04-28 10:48:00,083 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 10:48:00,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 10:48:00,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 10:48:00,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 10:48:00,108 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 10:47:59" (1/3) ... [2022-04-28 10:48:00,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c81e89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:48:00, skipping insertion in model container [2022-04-28 10:48:00,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 10:47:59" (2/3) ... [2022-04-28 10:48:00,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1c81e89f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 10:48:00, skipping insertion in model container [2022-04-28 10:48:00,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 10:48:00" (3/3) ... [2022-04-28 10:48:00,111 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2.c [2022-04-28 10:48:00,121 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 10:48:00,122 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 10:48:00,180 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 10:48:00,194 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@7b2839d5, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6494a99 [2022-04-28 10:48:00,194 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 10:48:00,207 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 10:48:00,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-04-28 10:48:00,213 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:00,213 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:48:00,214 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:00,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:00,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1030421658, now seen corresponding path program 1 times [2022-04-28 10:48:00,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:00,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2052867572] [2022-04-28 10:48:00,236 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:48:00,236 INFO L85 PathProgramCache]: Analyzing trace with hash 1030421658, now seen corresponding path program 2 times [2022-04-28 10:48:00,238 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:00,238 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392984211] [2022-04-28 10:48:00,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:00,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:00,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:00,407 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:48:00,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:00,424 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 10:48:00,424 INFO L290 TraceCheckUtils]: 1: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 10:48:00,425 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {32#true} {32#true} #90#return; {32#true} is VALID [2022-04-28 10:48:00,426 INFO L272 TraceCheckUtils]: 0: Hoare triple {32#true} call ULTIMATE.init(); {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:48:00,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {32#true} is VALID [2022-04-28 10:48:00,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {32#true} assume true; {32#true} is VALID [2022-04-28 10:48:00,427 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32#true} {32#true} #90#return; {32#true} is VALID [2022-04-28 10:48:00,427 INFO L272 TraceCheckUtils]: 4: Hoare triple {32#true} call #t~ret5 := main(); {32#true} is VALID [2022-04-28 10:48:00,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {32#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {37#(= main_~q~0 0)} is VALID [2022-04-28 10:48:00,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {37#(= main_~q~0 0)} assume !false; {37#(= main_~q~0 0)} is VALID [2022-04-28 10:48:00,430 INFO L272 TraceCheckUtils]: 7: Hoare triple {37#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {38#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:00,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {38#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {39#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:48:00,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {39#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {33#false} is VALID [2022-04-28 10:48:00,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#false} assume !false; {33#false} is VALID [2022-04-28 10:48:00,432 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 10:48:00,432 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:48:00,432 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392984211] [2022-04-28 10:48:00,433 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392984211] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:00,433 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:00,433 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:48:00,436 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:48:00,436 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2052867572] [2022-04-28 10:48:00,436 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2052867572] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:00,436 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:00,436 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:48:00,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041549012] [2022-04-28 10:48:00,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:48:00,441 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:48:00,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:48:00,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:48:00,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:00,458 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:48:00,459 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:00,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:48:00,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:48:00,478 INFO L87 Difference]: Start difference. First operand has 29 states, 15 states have (on average 1.6) internal successors, (24), 16 states have internal predecessors, (24), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:48:00,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:00,984 INFO L93 Difference]: Finished difference Result 66 states and 111 transitions. [2022-04-28 10:48:00,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:48:00,985 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2022-04-28 10:48:00,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:48:00,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:48:00,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-28 10:48:00,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:48:01,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 111 transitions. [2022-04-28 10:48:01,001 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 111 transitions. [2022-04-28 10:48:01,114 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:01,122 INFO L225 Difference]: With dead ends: 66 [2022-04-28 10:48:01,122 INFO L226 Difference]: Without dead ends: 35 [2022-04-28 10:48:01,125 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:48:01,128 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 39 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:48:01,129 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 48 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 107 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:48:01,142 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-04-28 10:48:01,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 28. [2022-04-28 10:48:01,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:48:01,157 INFO L82 GeneralOperation]: Start isEquivalent. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:48:01,158 INFO L74 IsIncluded]: Start isIncluded. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:48:01,158 INFO L87 Difference]: Start difference. First operand 35 states. Second operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:48:01,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:01,163 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 10:48:01,163 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 10:48:01,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:01,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:01,164 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-28 10:48:01,165 INFO L87 Difference]: Start difference. First operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 35 states. [2022-04-28 10:48:01,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:01,168 INFO L93 Difference]: Finished difference Result 35 states and 47 transitions. [2022-04-28 10:48:01,168 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 47 transitions. [2022-04-28 10:48:01,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:01,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:01,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:48:01,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:48:01,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:48:01,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 35 transitions. [2022-04-28 10:48:01,173 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 35 transitions. Word has length 11 [2022-04-28 10:48:01,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:48:01,173 INFO L495 AbstractCegarLoop]: Abstraction has 28 states and 35 transitions. [2022-04-28 10:48:01,174 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.1666666666666667) internal successors, (7), 4 states have internal predecessors, (7), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-28 10:48:01,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 35 transitions. [2022-04-28 10:48:01,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:01,213 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 35 transitions. [2022-04-28 10:48:01,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-04-28 10:48:01,214 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:01,214 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:48:01,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-28 10:48:01,215 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:01,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:01,215 INFO L85 PathProgramCache]: Analyzing trace with hash -1237898617, now seen corresponding path program 1 times [2022-04-28 10:48:01,216 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:01,216 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1259825558] [2022-04-28 10:48:01,217 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:48:01,217 INFO L85 PathProgramCache]: Analyzing trace with hash -1237898617, now seen corresponding path program 2 times [2022-04-28 10:48:01,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:01,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1358321438] [2022-04-28 10:48:01,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:01,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:01,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:01,306 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-28 10:48:01,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:01,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-28 10:48:01,315 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 10:48:01,315 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {309#true} {309#true} #90#return; {309#true} is VALID [2022-04-28 10:48:01,315 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2022-04-28 10:48:01,318 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:01,322 INFO L290 TraceCheckUtils]: 0: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-04-28 10:48:01,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-04-28 10:48:01,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 10:48:01,324 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {314#(= main_~A~0 main_~r~0)} #76#return; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 10:48:01,324 INFO L272 TraceCheckUtils]: 0: Hoare triple {309#true} call ULTIMATE.init(); {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-28 10:48:01,325 INFO L290 TraceCheckUtils]: 1: Hoare triple {321#(and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {309#true} is VALID [2022-04-28 10:48:01,325 INFO L290 TraceCheckUtils]: 2: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 10:48:01,325 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {309#true} {309#true} #90#return; {309#true} is VALID [2022-04-28 10:48:01,325 INFO L272 TraceCheckUtils]: 4: Hoare triple {309#true} call #t~ret5 := main(); {309#true} is VALID [2022-04-28 10:48:01,326 INFO L290 TraceCheckUtils]: 5: Hoare triple {309#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 10:48:01,326 INFO L290 TraceCheckUtils]: 6: Hoare triple {314#(= main_~A~0 main_~r~0)} assume !false; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 10:48:01,326 INFO L272 TraceCheckUtils]: 7: Hoare triple {314#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {309#true} is VALID [2022-04-28 10:48:01,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {309#true} ~cond := #in~cond; {309#true} is VALID [2022-04-28 10:48:01,327 INFO L290 TraceCheckUtils]: 9: Hoare triple {309#true} assume !(0 == ~cond); {309#true} is VALID [2022-04-28 10:48:01,327 INFO L290 TraceCheckUtils]: 10: Hoare triple {309#true} assume true; {309#true} is VALID [2022-04-28 10:48:01,328 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {309#true} {314#(= main_~A~0 main_~r~0)} #76#return; {314#(= main_~A~0 main_~r~0)} is VALID [2022-04-28 10:48:01,329 INFO L272 TraceCheckUtils]: 12: Hoare triple {314#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {319#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:01,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {319#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {320#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:48:01,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {320#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {310#false} is VALID [2022-04-28 10:48:01,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {310#false} assume !false; {310#false} is VALID [2022-04-28 10:48:01,330 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 10:48:01,330 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:48:01,330 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1358321438] [2022-04-28 10:48:01,331 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1358321438] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:01,331 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:01,331 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:48:01,331 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:48:01,331 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1259825558] [2022-04-28 10:48:01,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1259825558] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:01,332 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:01,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:48:01,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989105388] [2022-04-28 10:48:01,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:48:01,333 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-28 10:48:01,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:48:01,333 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:48:01,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:01,346 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:48:01,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:01,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:48:01,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:48:01,347 INFO L87 Difference]: Start difference. First operand 28 states and 35 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:48:01,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:01,682 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2022-04-28 10:48:01,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:48:01,682 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 16 [2022-04-28 10:48:01,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:48:01,684 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:48:01,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:48:01,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:48:01,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 49 transitions. [2022-04-28 10:48:01,690 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 49 transitions. [2022-04-28 10:48:01,738 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 10:48:01,740 INFO L225 Difference]: With dead ends: 41 [2022-04-28 10:48:01,740 INFO L226 Difference]: Without dead ends: 39 [2022-04-28 10:48:01,741 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 10:48:01,742 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 28 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:48:01,742 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 40 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:48:01,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-28 10:48:01,749 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 32. [2022-04-28 10:48:01,749 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:48:01,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:48:01,750 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:48:01,751 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:48:01,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:01,753 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-28 10:48:01,753 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-04-28 10:48:01,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:01,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:01,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 10:48:01,755 INFO L87 Difference]: Start difference. First operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-28 10:48:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:01,757 INFO L93 Difference]: Finished difference Result 39 states and 50 transitions. [2022-04-28 10:48:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 50 transitions. [2022-04-28 10:48:01,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:01,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:01,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:48:01,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:48:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 19 states have internal predecessors, (22), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 10:48:01,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-04-28 10:48:01,762 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 16 [2022-04-28 10:48:01,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:48:01,762 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-04-28 10:48:01,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-28 10:48:01,762 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 38 transitions. [2022-04-28 10:48:01,804 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 10:48:01,804 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-04-28 10:48:01,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-04-28 10:48:01,806 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:01,806 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:48:01,806 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-28 10:48:01,809 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:01,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:01,810 INFO L85 PathProgramCache]: Analyzing trace with hash 998817914, now seen corresponding path program 1 times [2022-04-28 10:48:01,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:01,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [320535685] [2022-04-28 10:48:01,811 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:48:01,811 INFO L85 PathProgramCache]: Analyzing trace with hash 998817914, now seen corresponding path program 2 times [2022-04-28 10:48:01,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:01,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577203012] [2022-04-28 10:48:01,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:01,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:01,837 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:48:01,837 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1557839609] [2022-04-28 10:48:01,837 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:48:01,837 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:01,838 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:48:01,851 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 10:48:01,867 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 10:48:01,908 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:48:01,908 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:48:01,910 INFO L263 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 10:48:01,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:01,953 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:48:02,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {556#true} call ULTIMATE.init(); {556#true} is VALID [2022-04-28 10:48:02,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {556#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {556#true} is VALID [2022-04-28 10:48:02,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-28 10:48:02,122 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {556#true} {556#true} #90#return; {556#true} is VALID [2022-04-28 10:48:02,122 INFO L272 TraceCheckUtils]: 4: Hoare triple {556#true} call #t~ret5 := main(); {556#true} is VALID [2022-04-28 10:48:02,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {556#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:02,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:02,124 INFO L272 TraceCheckUtils]: 7: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {556#true} is VALID [2022-04-28 10:48:02,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-28 10:48:02,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-28 10:48:02,124 INFO L290 TraceCheckUtils]: 10: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-28 10:48:02,125 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {556#true} {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:02,125 INFO L272 TraceCheckUtils]: 12: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {556#true} is VALID [2022-04-28 10:48:02,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {556#true} ~cond := #in~cond; {556#true} is VALID [2022-04-28 10:48:02,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {556#true} assume !(0 == ~cond); {556#true} is VALID [2022-04-28 10:48:02,126 INFO L290 TraceCheckUtils]: 15: Hoare triple {556#true} assume true; {556#true} is VALID [2022-04-28 10:48:02,127 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {556#true} {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:02,127 INFO L272 TraceCheckUtils]: 17: Hoare triple {576#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {613#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:02,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {613#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {617#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:02,128 INFO L290 TraceCheckUtils]: 19: Hoare triple {617#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {557#false} is VALID [2022-04-28 10:48:02,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {557#false} assume !false; {557#false} is VALID [2022-04-28 10:48:02,129 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 10:48:02,129 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:48:02,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:48:02,129 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577203012] [2022-04-28 10:48:02,130 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:48:02,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1557839609] [2022-04-28 10:48:02,130 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1557839609] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:02,130 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:02,130 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:48:02,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:48:02,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [320535685] [2022-04-28 10:48:02,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [320535685] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:02,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:02,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:48:02,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420440909] [2022-04-28 10:48:02,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:48:02,132 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-28 10:48:02,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:48:02,133 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:48:02,147 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:02,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:48:02,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:02,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:48:02,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:48:02,148 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:48:02,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:02,317 INFO L93 Difference]: Finished difference Result 60 states and 78 transitions. [2022-04-28 10:48:02,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:48:02,318 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 21 [2022-04-28 10:48:02,318 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:48:02,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:48:02,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 10:48:02,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:48:02,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 72 transitions. [2022-04-28 10:48:02,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 72 transitions. [2022-04-28 10:48:02,389 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 10:48:02,391 INFO L225 Difference]: With dead ends: 60 [2022-04-28 10:48:02,391 INFO L226 Difference]: Without dead ends: 46 [2022-04-28 10:48:02,392 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:48:02,393 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 8 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:48:02,393 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 105 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:48:02,394 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-04-28 10:48:02,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-04-28 10:48:02,405 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:48:02,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:48:02,406 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:48:02,407 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:48:02,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:02,410 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-28 10:48:02,410 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-28 10:48:02,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:02,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:02,411 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 46 states. [2022-04-28 10:48:02,411 INFO L87 Difference]: Start difference. First operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 46 states. [2022-04-28 10:48:02,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:02,414 INFO L93 Difference]: Finished difference Result 46 states and 57 transitions. [2022-04-28 10:48:02,414 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-28 10:48:02,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:02,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:02,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:48:02,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:48:02,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 25 states have (on average 1.2) internal successors, (30), 27 states have internal predecessors, (30), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 10:48:02,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 57 transitions. [2022-04-28 10:48:02,417 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 57 transitions. Word has length 21 [2022-04-28 10:48:02,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:48:02,417 INFO L495 AbstractCegarLoop]: Abstraction has 46 states and 57 transitions. [2022-04-28 10:48:02,418 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.0) internal successors, (10), 4 states have internal predecessors, (10), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 10:48:02,418 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 46 states and 57 transitions. [2022-04-28 10:48:02,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:02,479 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 57 transitions. [2022-04-28 10:48:02,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-28 10:48:02,480 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:02,480 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] [2022-04-28 10:48:02,505 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 10:48:02,702 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:02,702 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:02,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:02,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1073979732, now seen corresponding path program 1 times [2022-04-28 10:48:02,703 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:02,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [642610091] [2022-04-28 10:48:02,704 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 10:48:02,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1073979732, now seen corresponding path program 2 times [2022-04-28 10:48:02,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:02,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1873073241] [2022-04-28 10:48:02,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:02,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:02,715 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:48:02,716 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [88429631] [2022-04-28 10:48:02,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:48:02,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:02,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:48:02,717 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 10:48:02,733 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 10:48:02,763 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:48:02,763 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:48:02,764 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 10:48:02,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:02,782 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:48:05,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {929#true} call ULTIMATE.init(); {929#true} is VALID [2022-04-28 10:48:05,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {929#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {929#true} is VALID [2022-04-28 10:48:05,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-28 10:48:05,769 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {929#true} {929#true} #90#return; {929#true} is VALID [2022-04-28 10:48:05,769 INFO L272 TraceCheckUtils]: 4: Hoare triple {929#true} call #t~ret5 := main(); {929#true} is VALID [2022-04-28 10:48:05,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {929#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:05,773 INFO L290 TraceCheckUtils]: 6: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:05,773 INFO L272 TraceCheckUtils]: 7: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {929#true} is VALID [2022-04-28 10:48:05,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-28 10:48:05,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-28 10:48:05,774 INFO L290 TraceCheckUtils]: 10: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-28 10:48:05,775 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #76#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:05,775 INFO L272 TraceCheckUtils]: 12: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {929#true} is VALID [2022-04-28 10:48:05,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-28 10:48:05,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-28 10:48:05,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-28 10:48:05,779 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:05,779 INFO L272 TraceCheckUtils]: 17: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {929#true} is VALID [2022-04-28 10:48:05,779 INFO L290 TraceCheckUtils]: 18: Hoare triple {929#true} ~cond := #in~cond; {929#true} is VALID [2022-04-28 10:48:05,779 INFO L290 TraceCheckUtils]: 19: Hoare triple {929#true} assume !(0 == ~cond); {929#true} is VALID [2022-04-28 10:48:05,779 INFO L290 TraceCheckUtils]: 20: Hoare triple {929#true} assume true; {929#true} is VALID [2022-04-28 10:48:05,780 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {929#true} {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:05,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:05,781 INFO L290 TraceCheckUtils]: 23: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !false; {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:05,782 INFO L272 TraceCheckUtils]: 24: Hoare triple {949#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:05,782 INFO L290 TraceCheckUtils]: 25: Hoare triple {1007#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1011#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:05,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {1011#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {930#false} is VALID [2022-04-28 10:48:05,785 INFO L290 TraceCheckUtils]: 27: Hoare triple {930#false} assume !false; {930#false} is VALID [2022-04-28 10:48:05,785 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 10:48:05,785 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:48:05,785 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:48:05,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1873073241] [2022-04-28 10:48:05,787 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:48:05,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [88429631] [2022-04-28 10:48:05,787 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [88429631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:05,787 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:05,787 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:48:05,787 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:48:05,787 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [642610091] [2022-04-28 10:48:05,788 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [642610091] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:05,788 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:05,788 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:48:05,788 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [178558569] [2022-04-28 10:48:05,788 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:48:05,789 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 10:48:05,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:48:05,789 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 10:48:05,808 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 10:48:05,808 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:48:05,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:05,811 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:48:05,811 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 10:48:05,812 INFO L87 Difference]: Start difference. First operand 46 states and 57 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:48:05,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:05,992 INFO L93 Difference]: Finished difference Result 59 states and 74 transitions. [2022-04-28 10:48:05,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:48:05,993 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 28 [2022-04-28 10:48:05,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:48:05,993 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 10:48:05,994 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-28 10:48:05,995 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 10:48:05,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-04-28 10:48:05,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-04-28 10:48:06,044 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 10:48:06,046 INFO L225 Difference]: With dead ends: 59 [2022-04-28 10:48:06,046 INFO L226 Difference]: Without dead ends: 52 [2022-04-28 10:48:06,046 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:48:06,049 INFO L413 NwaCegarLoop]: 25 mSDtfsCounter, 9 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:48:06,049 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 81 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:48:06,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-28 10:48:06,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2022-04-28 10:48:06,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:48:06,082 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:48:06,084 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:48:06,085 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:48:06,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:06,089 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 10:48:06,089 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 10:48:06,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:06,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:06,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-28 10:48:06,090 INFO L87 Difference]: Start difference. First operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 52 states. [2022-04-28 10:48:06,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:06,092 INFO L93 Difference]: Finished difference Result 52 states and 64 transitions. [2022-04-28 10:48:06,092 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 64 transitions. [2022-04-28 10:48:06,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:06,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:06,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:48:06,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:48:06,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 29 states have (on average 1.206896551724138) internal successors, (35), 31 states have internal predecessors, (35), 15 states have call successors, (15), 7 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 10:48:06,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 63 transitions. [2022-04-28 10:48:06,096 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 63 transitions. Word has length 28 [2022-04-28 10:48:06,096 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:48:06,096 INFO L495 AbstractCegarLoop]: Abstraction has 51 states and 63 transitions. [2022-04-28 10:48:06,096 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 10:48:06,096 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 51 states and 63 transitions. [2022-04-28 10:48:06,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:06,165 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 63 transitions. [2022-04-28 10:48:06,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-04-28 10:48:06,166 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:06,167 INFO L195 NwaCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:48:06,196 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 10:48:06,393 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,SelfDestructingSolverStorable3 [2022-04-28 10:48:06,393 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:06,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:06,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1568039909, now seen corresponding path program 1 times [2022-04-28 10:48:06,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:06,394 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [874835731] [2022-04-28 10:48:09,103 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:48:09,104 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:48:09,104 INFO L85 PathProgramCache]: Analyzing trace with hash 1568039909, now seen corresponding path program 2 times [2022-04-28 10:48:09,104 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:09,104 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1584765872] [2022-04-28 10:48:09,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:09,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:09,114 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:48:09,114 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1204251745] [2022-04-28 10:48:09,114 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:48:09,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:09,114 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:48:09,116 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 10:48:09,133 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 10:48:09,164 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:48:09,165 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:48:09,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 10:48:09,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:09,187 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:48:09,373 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-28 10:48:09,373 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-28 10:48:09,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #90#return; {1343#true} is VALID [2022-04-28 10:48:09,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret5 := main(); {1343#true} is VALID [2022-04-28 10:48:09,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:09,377 INFO L290 TraceCheckUtils]: 6: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:09,378 INFO L272 TraceCheckUtils]: 7: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,378 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,379 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:09,379 INFO L272 TraceCheckUtils]: 12: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,382 INFO L290 TraceCheckUtils]: 15: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,382 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:09,383 INFO L272 TraceCheckUtils]: 17: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,383 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,383 INFO L290 TraceCheckUtils]: 19: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,383 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,384 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#true} {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:09,384 INFO L290 TraceCheckUtils]: 22: Hoare triple {1363#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 10:48:09,385 INFO L290 TraceCheckUtils]: 23: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !false; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 10:48:09,385 INFO L272 TraceCheckUtils]: 24: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,386 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,389 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1343#true} {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #76#return; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 10:48:09,389 INFO L272 TraceCheckUtils]: 29: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,401 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,401 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,401 INFO L290 TraceCheckUtils]: 32: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,405 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1343#true} {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-28 10:48:09,406 INFO L272 TraceCheckUtils]: 34: Hoare triple {1415#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:09,406 INFO L290 TraceCheckUtils]: 35: Hoare triple {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:09,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {1456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1344#false} is VALID [2022-04-28 10:48:09,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-28 10:48:09,407 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 4 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-28 10:48:09,407 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:48:09,590 INFO L290 TraceCheckUtils]: 37: Hoare triple {1344#false} assume !false; {1344#false} is VALID [2022-04-28 10:48:09,591 INFO L290 TraceCheckUtils]: 36: Hoare triple {1456#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1344#false} is VALID [2022-04-28 10:48:09,591 INFO L290 TraceCheckUtils]: 35: Hoare triple {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1456#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:09,592 INFO L272 TraceCheckUtils]: 34: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1452#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:09,593 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 10:48:09,593 INFO L290 TraceCheckUtils]: 32: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,593 INFO L290 TraceCheckUtils]: 31: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,593 INFO L290 TraceCheckUtils]: 30: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,594 INFO L272 TraceCheckUtils]: 29: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,595 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #76#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 10:48:09,595 INFO L290 TraceCheckUtils]: 27: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,595 INFO L290 TraceCheckUtils]: 26: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,595 INFO L290 TraceCheckUtils]: 25: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,595 INFO L272 TraceCheckUtils]: 24: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,596 INFO L290 TraceCheckUtils]: 23: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !false; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 10:48:09,598 INFO L290 TraceCheckUtils]: 22: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 10:48:09,599 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 10:48:09,599 INFO L290 TraceCheckUtils]: 20: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,599 INFO L290 TraceCheckUtils]: 19: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,599 INFO L290 TraceCheckUtils]: 18: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,599 INFO L272 TraceCheckUtils]: 17: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,601 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 10:48:09,601 INFO L290 TraceCheckUtils]: 15: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,601 INFO L290 TraceCheckUtils]: 14: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,601 INFO L290 TraceCheckUtils]: 13: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,601 INFO L272 TraceCheckUtils]: 12: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,601 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1343#true} {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} #76#return; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 10:48:09,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {1343#true} assume !(0 == ~cond); {1343#true} is VALID [2022-04-28 10:48:09,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {1343#true} ~cond := #in~cond; {1343#true} is VALID [2022-04-28 10:48:09,602 INFO L272 TraceCheckUtils]: 7: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1343#true} is VALID [2022-04-28 10:48:09,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !false; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 10:48:09,603 INFO L290 TraceCheckUtils]: 5: Hoare triple {1343#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1472#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-28 10:48:09,603 INFO L272 TraceCheckUtils]: 4: Hoare triple {1343#true} call #t~ret5 := main(); {1343#true} is VALID [2022-04-28 10:48:09,603 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1343#true} {1343#true} #90#return; {1343#true} is VALID [2022-04-28 10:48:09,603 INFO L290 TraceCheckUtils]: 2: Hoare triple {1343#true} assume true; {1343#true} is VALID [2022-04-28 10:48:09,603 INFO L290 TraceCheckUtils]: 1: Hoare triple {1343#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1343#true} is VALID [2022-04-28 10:48:09,603 INFO L272 TraceCheckUtils]: 0: Hoare triple {1343#true} call ULTIMATE.init(); {1343#true} is VALID [2022-04-28 10:48:09,603 INFO L134 CoverageAnalysis]: Checked inductivity of 54 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 10:48:09,603 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:48:09,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1584765872] [2022-04-28 10:48:09,604 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:48:09,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1204251745] [2022-04-28 10:48:09,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1204251745] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-28 10:48:09,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:48:09,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-28 10:48:09,604 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:48:09,604 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [874835731] [2022-04-28 10:48:09,604 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [874835731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:09,604 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:09,604 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 10:48:09,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475380673] [2022-04-28 10:48:09,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:48:09,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-28 10:48:09,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:48:09,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:48:09,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:09,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 10:48:09,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:09,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 10:48:09,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:48:09,626 INFO L87 Difference]: Start difference. First operand 51 states and 63 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:48:11,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:11,002 INFO L93 Difference]: Finished difference Result 63 states and 78 transitions. [2022-04-28 10:48:11,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 10:48:11,003 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 38 [2022-04-28 10:48:11,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:48:11,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:48:11,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 10:48:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-28 10:48:11,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 47 transitions. [2022-04-28 10:48:11,006 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 47 transitions. [2022-04-28 10:48:11,050 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 10:48:11,052 INFO L225 Difference]: With dead ends: 63 [2022-04-28 10:48:11,052 INFO L226 Difference]: Without dead ends: 61 [2022-04-28 10:48:11,053 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 68 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-28 10:48:11,053 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 8 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 89 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:48:11,054 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 89 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:48:11,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-04-28 10:48:11,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 58. [2022-04-28 10:48:11,101 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:48:11,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 10:48:11,103 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 10:48:11,104 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 10:48:11,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:11,110 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-04-28 10:48:11,110 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-28 10:48:11,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:11,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:11,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-28 10:48:11,113 INFO L87 Difference]: Start difference. First operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 61 states. [2022-04-28 10:48:11,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:11,118 INFO L93 Difference]: Finished difference Result 61 states and 76 transitions. [2022-04-28 10:48:11,118 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-28 10:48:11,119 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:11,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:11,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:48:11,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:48:11,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 36 states have internal predecessors, (39), 17 states have call successors, (17), 8 states have call predecessors, (17), 7 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 10:48:11,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 71 transitions. [2022-04-28 10:48:11,123 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 71 transitions. Word has length 38 [2022-04-28 10:48:11,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:48:11,123 INFO L495 AbstractCegarLoop]: Abstraction has 58 states and 71 transitions. [2022-04-28 10:48:11,124 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, (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 10:48:11,124 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 58 states and 71 transitions. [2022-04-28 10:48:11,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:11,217 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 71 transitions. [2022-04-28 10:48:11,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-04-28 10:48:11,218 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:11,218 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] [2022-04-28 10:48:11,243 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 10:48:11,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:11,431 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:11,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:11,432 INFO L85 PathProgramCache]: Analyzing trace with hash -697745896, now seen corresponding path program 1 times [2022-04-28 10:48:11,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:11,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [602349691] [2022-04-28 10:48:13,810 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:48:13,810 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:48:13,810 INFO L85 PathProgramCache]: Analyzing trace with hash -697745896, now seen corresponding path program 2 times [2022-04-28 10:48:13,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:13,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [402262615] [2022-04-28 10:48:13,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:13,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:13,826 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:48:13,827 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1039116858] [2022-04-28 10:48:13,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:48:13,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:13,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:48:13,832 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 10:48:13,833 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 10:48:13,883 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:48:13,883 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:48:13,884 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 10:48:13,899 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:13,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:48:14,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-28 10:48:14,374 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1943#true} is VALID [2022-04-28 10:48:14,374 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:14,374 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #90#return; {1943#true} is VALID [2022-04-28 10:48:14,374 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret5 := main(); {1943#true} is VALID [2022-04-28 10:48:14,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:14,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:14,375 INFO L272 TraceCheckUtils]: 7: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:14,376 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:14,376 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:14,376 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:14,376 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1943#true} {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:14,377 INFO L272 TraceCheckUtils]: 12: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:14,377 INFO L290 TraceCheckUtils]: 13: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:14,377 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:14,377 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:14,378 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1943#true} {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:14,378 INFO L272 TraceCheckUtils]: 17: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:14,379 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:14,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:14,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:14,380 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1943#true} {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:14,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:48:14,381 INFO L290 TraceCheckUtils]: 23: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:48:14,381 INFO L272 TraceCheckUtils]: 24: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:14,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:14,381 INFO L290 TraceCheckUtils]: 26: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:14,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:14,382 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:48:14,382 INFO L272 TraceCheckUtils]: 29: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:14,382 INFO L290 TraceCheckUtils]: 30: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:14,382 INFO L290 TraceCheckUtils]: 31: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:14,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:14,383 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:48:14,383 INFO L272 TraceCheckUtils]: 34: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:14,387 INFO L290 TraceCheckUtils]: 35: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:14,387 INFO L290 TraceCheckUtils]: 36: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:14,387 INFO L290 TraceCheckUtils]: 37: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:14,388 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:48:14,389 INFO L290 TraceCheckUtils]: 39: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:48:14,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:48:14,390 INFO L272 TraceCheckUtils]: 41: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:14,390 INFO L290 TraceCheckUtils]: 42: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:14,390 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:14,390 INFO L290 TraceCheckUtils]: 44: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:14,391 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:48:14,391 INFO L272 TraceCheckUtils]: 46: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:14,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:14,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:14,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:14,392 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1943#true} {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:48:14,393 INFO L290 TraceCheckUtils]: 51: Hoare triple {2015#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:48:14,393 INFO L290 TraceCheckUtils]: 52: Hoare triple {1963#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 10:48:14,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !false; {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-28 10:48:14,394 INFO L272 TraceCheckUtils]: 54: Hoare triple {2106#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:14,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:14,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {2117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1944#false} is VALID [2022-04-28 10:48:14,395 INFO L290 TraceCheckUtils]: 57: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-28 10:48:14,397 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 10:48:14,397 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:48:15,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {1944#false} assume !false; {1944#false} is VALID [2022-04-28 10:48:15,682 INFO L290 TraceCheckUtils]: 56: Hoare triple {2117#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1944#false} is VALID [2022-04-28 10:48:15,683 INFO L290 TraceCheckUtils]: 55: Hoare triple {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2117#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:15,688 INFO L272 TraceCheckUtils]: 54: Hoare triple {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {2113#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:15,691 INFO L290 TraceCheckUtils]: 53: Hoare triple {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !false; {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 10:48:15,708 INFO L290 TraceCheckUtils]: 52: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {2133#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 10:48:15,734 INFO L290 TraceCheckUtils]: 51: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 10:48:15,735 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:48:15,735 INFO L290 TraceCheckUtils]: 49: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:15,735 INFO L290 TraceCheckUtils]: 48: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:15,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:15,736 INFO L272 TraceCheckUtils]: 46: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:15,736 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:48:15,736 INFO L290 TraceCheckUtils]: 44: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:15,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:15,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:15,737 INFO L272 TraceCheckUtils]: 41: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:15,738 INFO L290 TraceCheckUtils]: 40: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !false; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:48:15,739 INFO L290 TraceCheckUtils]: 39: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:48:15,740 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #80#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:48:15,740 INFO L290 TraceCheckUtils]: 37: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:15,740 INFO L290 TraceCheckUtils]: 36: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:15,740 INFO L290 TraceCheckUtils]: 35: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:15,740 INFO L272 TraceCheckUtils]: 34: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:15,746 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #78#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:48:15,746 INFO L290 TraceCheckUtils]: 32: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:15,746 INFO L290 TraceCheckUtils]: 31: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:15,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:15,747 INFO L272 TraceCheckUtils]: 29: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:15,749 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1943#true} {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #76#return; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:48:15,749 INFO L290 TraceCheckUtils]: 27: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:15,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:15,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:15,749 INFO L272 TraceCheckUtils]: 24: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:15,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !false; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:48:15,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2144#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:48:15,762 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {1943#true} {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 10:48:15,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:15,762 INFO L290 TraceCheckUtils]: 19: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:15,762 INFO L290 TraceCheckUtils]: 18: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:15,762 INFO L272 TraceCheckUtils]: 17: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:15,763 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {1943#true} {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 10:48:15,763 INFO L290 TraceCheckUtils]: 15: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:15,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:15,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:15,764 INFO L272 TraceCheckUtils]: 12: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:15,764 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {1943#true} {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #76#return; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 10:48:15,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:15,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {1943#true} assume !(0 == ~cond); {1943#true} is VALID [2022-04-28 10:48:15,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {1943#true} ~cond := #in~cond; {1943#true} is VALID [2022-04-28 10:48:15,765 INFO L272 TraceCheckUtils]: 7: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1943#true} is VALID [2022-04-28 10:48:15,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !false; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 10:48:15,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {1943#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2140#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 10:48:15,766 INFO L272 TraceCheckUtils]: 4: Hoare triple {1943#true} call #t~ret5 := main(); {1943#true} is VALID [2022-04-28 10:48:15,766 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1943#true} {1943#true} #90#return; {1943#true} is VALID [2022-04-28 10:48:15,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {1943#true} assume true; {1943#true} is VALID [2022-04-28 10:48:15,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {1943#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {1943#true} is VALID [2022-04-28 10:48:15,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {1943#true} call ULTIMATE.init(); {1943#true} is VALID [2022-04-28 10:48:15,767 INFO L134 CoverageAnalysis]: Checked inductivity of 135 backedges. 16 proven. 7 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-28 10:48:15,767 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:48:15,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [402262615] [2022-04-28 10:48:15,767 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:48:15,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1039116858] [2022-04-28 10:48:15,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1039116858] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:48:15,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:48:15,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-28 10:48:15,768 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:48:15,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [602349691] [2022-04-28 10:48:15,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [602349691] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:48:15,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:48:15,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 10:48:15,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798022143] [2022-04-28 10:48:15,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:48:15,769 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 58 [2022-04-28 10:48:15,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:48:15,769 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:48:15,807 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 10:48:15,807 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 10:48:15,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:15,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 10:48:15,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-28 10:48:15,808 INFO L87 Difference]: Start difference. First operand 58 states and 71 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:48:16,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:16,414 INFO L93 Difference]: Finished difference Result 124 states and 158 transitions. [2022-04-28 10:48:16,414 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-28 10:48:16,414 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 58 [2022-04-28 10:48:16,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:48:16,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:48:16,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 10:48:16,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:48:16,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 101 transitions. [2022-04-28 10:48:16,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 101 transitions. [2022-04-28 10:48:16,515 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 10:48:16,519 INFO L225 Difference]: With dead ends: 124 [2022-04-28 10:48:16,519 INFO L226 Difference]: Without dead ends: 95 [2022-04-28 10:48:16,520 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 104 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-28 10:48:16,521 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 11 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:48:16,521 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 142 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:48:16,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-04-28 10:48:16,580 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 93. [2022-04-28 10:48:16,580 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:48:16,581 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 10:48:16,581 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 10:48:16,581 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 10:48:16,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:16,585 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-28 10:48:16,585 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-28 10:48:16,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:16,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:16,586 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-04-28 10:48:16,587 INFO L87 Difference]: Start difference. First operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) Second operand 95 states. [2022-04-28 10:48:16,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:48:16,590 INFO L93 Difference]: Finished difference Result 95 states and 114 transitions. [2022-04-28 10:48:16,590 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 114 transitions. [2022-04-28 10:48:16,591 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:48:16,591 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:48:16,591 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:48:16,591 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:48:16,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 56 states have (on average 1.1607142857142858) internal successors, (65), 59 states have internal predecessors, (65), 24 states have call successors, (24), 13 states have call predecessors, (24), 12 states have return successors, (22), 20 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 10:48:16,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 111 transitions. [2022-04-28 10:48:16,594 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 111 transitions. Word has length 58 [2022-04-28 10:48:16,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:48:16,595 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 111 transitions. [2022-04-28 10:48:16,595 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-28 10:48:16,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 111 transitions. [2022-04-28 10:48:16,733 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:48:16,733 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 111 transitions. [2022-04-28 10:48:16,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-28 10:48:16,734 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:48:16,734 INFO L195 NwaCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:48:16,753 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 10:48:16,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:16,943 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:48:16,944 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:48:16,944 INFO L85 PathProgramCache]: Analyzing trace with hash -833392887, now seen corresponding path program 3 times [2022-04-28 10:48:16,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:48:16,944 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1085515500] [2022-04-28 10:48:21,045 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:48:21,046 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:48:21,046 INFO L85 PathProgramCache]: Analyzing trace with hash -833392887, now seen corresponding path program 4 times [2022-04-28 10:48:21,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:48:21,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [852162722] [2022-04-28 10:48:21,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:48:21,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:48:21,056 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:48:21,057 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [479631724] [2022-04-28 10:48:21,057 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:48:21,057 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:48:21,057 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:48:21,063 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 10:48:21,072 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 10:48:21,121 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:48:21,122 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:48:21,123 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 10:48:21,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:48:21,159 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:48:29,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {2926#true} call ULTIMATE.init(); {2926#true} is VALID [2022-04-28 10:48:29,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {2926#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {2926#true} is VALID [2022-04-28 10:48:29,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 10:48:29,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2926#true} {2926#true} #90#return; {2926#true} is VALID [2022-04-28 10:48:29,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {2926#true} call #t~ret5 := main(); {2926#true} is VALID [2022-04-28 10:48:29,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {2926#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2926#true} is VALID [2022-04-28 10:48:29,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {2926#true} assume !false; {2926#true} is VALID [2022-04-28 10:48:29,914 INFO L272 TraceCheckUtils]: 7: Hoare triple {2926#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 10:48:29,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:29,915 INFO L290 TraceCheckUtils]: 9: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:29,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:29,916 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {2926#true} #76#return; {2966#(= main_~q~0 0)} is VALID [2022-04-28 10:48:29,916 INFO L272 TraceCheckUtils]: 12: Hoare triple {2966#(= main_~q~0 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 10:48:29,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:29,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:29,918 INFO L290 TraceCheckUtils]: 15: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:29,918 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {2966#(= main_~q~0 0)} #78#return; {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:29,918 INFO L272 TraceCheckUtils]: 17: Hoare triple {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 10:48:29,919 INFO L290 TraceCheckUtils]: 18: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 10:48:29,919 INFO L290 TraceCheckUtils]: 19: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 10:48:29,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 10:48:29,919 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2926#true} {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:29,920 INFO L290 TraceCheckUtils]: 22: Hoare triple {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:48:29,921 INFO L290 TraceCheckUtils]: 23: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:48:29,921 INFO L272 TraceCheckUtils]: 24: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 10:48:29,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 10:48:29,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 10:48:29,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 10:48:29,922 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #76#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:48:29,922 INFO L272 TraceCheckUtils]: 29: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 10:48:29,922 INFO L290 TraceCheckUtils]: 30: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 10:48:29,922 INFO L290 TraceCheckUtils]: 31: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 10:48:29,922 INFO L290 TraceCheckUtils]: 32: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 10:48:29,923 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #78#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:48:29,923 INFO L272 TraceCheckUtils]: 34: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 10:48:29,923 INFO L290 TraceCheckUtils]: 35: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 10:48:29,923 INFO L290 TraceCheckUtils]: 36: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 10:48:29,923 INFO L290 TraceCheckUtils]: 37: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 10:48:29,924 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:48:29,925 INFO L290 TraceCheckUtils]: 39: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:48:29,925 INFO L290 TraceCheckUtils]: 40: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:48:29,925 INFO L272 TraceCheckUtils]: 41: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 10:48:29,925 INFO L290 TraceCheckUtils]: 42: Hoare triple {2926#true} ~cond := #in~cond; {2926#true} is VALID [2022-04-28 10:48:29,926 INFO L290 TraceCheckUtils]: 43: Hoare triple {2926#true} assume !(0 == ~cond); {2926#true} is VALID [2022-04-28 10:48:29,926 INFO L290 TraceCheckUtils]: 44: Hoare triple {2926#true} assume true; {2926#true} is VALID [2022-04-28 10:48:29,926 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {2926#true} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:48:29,926 INFO L272 TraceCheckUtils]: 46: Hoare triple {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 10:48:29,927 INFO L290 TraceCheckUtils]: 47: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:29,927 INFO L290 TraceCheckUtils]: 48: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:29,927 INFO L290 TraceCheckUtils]: 49: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:29,929 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {3001#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {3086#(and (= main_~A~0 main_~r~0) (= (mod (* main_~B~0 main_~p~0) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:48:29,929 INFO L290 TraceCheckUtils]: 51: Hoare triple {3086#(and (= main_~A~0 main_~r~0) (= (mod (* main_~B~0 main_~p~0) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-28 10:48:29,930 INFO L290 TraceCheckUtils]: 52: Hoare triple {2982#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:48:29,930 INFO L290 TraceCheckUtils]: 53: Hoare triple {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !false; {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:48:29,930 INFO L272 TraceCheckUtils]: 54: Hoare triple {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {2926#true} is VALID [2022-04-28 10:48:29,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {2926#true} ~cond := #in~cond; {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:29,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {2955#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:29,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:48:29,935 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {2959#(not (= |__VERIFIER_assert_#in~cond| 0))} {3093#(and (= (+ main_~q~0 (* (- 1) main_~p~0)) 0) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #82#return; {3112#(exists ((main_~A~0 Int)) (= (+ (* (- 1) main_~B~0 main_~p~0) main_~A~0) (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:48:29,936 INFO L272 TraceCheckUtils]: 59: Hoare triple {3112#(exists ((main_~A~0 Int)) (= (+ (* (- 1) main_~B~0 main_~p~0) main_~A~0) (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3116#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:48:29,936 INFO L290 TraceCheckUtils]: 60: Hoare triple {3116#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3120#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:48:29,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {3120#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2927#false} is VALID [2022-04-28 10:48:29,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {2927#false} assume !false; {2927#false} is VALID [2022-04-28 10:48:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 49 proven. 37 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-28 10:48:29,937 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:48:53,335 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:49:06,407 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:49:06,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [852162722] [2022-04-28 10:49:06,408 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:49:06,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [479631724] [2022-04-28 10:49:06,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [479631724] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:49:06,408 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:49:06,408 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2022-04-28 10:49:06,408 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:49:06,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1085515500] [2022-04-28 10:49:06,408 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1085515500] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:49:06,409 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:49:06,409 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:49:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714846366] [2022-04-28 10:49:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:49:06,409 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-28 10:49:06,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:49:06,410 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 10:49:06,450 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 10:49:06,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:49:06,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:49:06,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:49:06,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=218, Unknown=2, NotChecked=0, Total=272 [2022-04-28 10:49:06,452 INFO L87 Difference]: Start difference. First operand 93 states and 111 transitions. Second operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 10:49:08,643 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 10:49:10,649 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 10:49:12,690 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 10:49:14,715 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 10:49:21,327 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 10:49:21,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:21,386 INFO L93 Difference]: Finished difference Result 117 states and 139 transitions. [2022-04-28 10:49:21,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:49:21,386 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) Word has length 63 [2022-04-28 10:49:21,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:49:21,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 10:49:21,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-28 10:49:21,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 10:49:21,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 76 transitions. [2022-04-28 10:49:21,390 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 76 transitions. [2022-04-28 10:49:21,524 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 10:49:21,527 INFO L225 Difference]: With dead ends: 117 [2022-04-28 10:49:21,527 INFO L226 Difference]: Without dead ends: 105 [2022-04-28 10:49:21,527 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 8.3s TimeCoverageRelationStatistics Valid=81, Invalid=337, Unknown=2, NotChecked=0, Total=420 [2022-04-28 10:49:21,528 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 22 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 20 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 10.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 10.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:49:21,528 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 134 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 243 Invalid, 5 Unknown, 43 Unchecked, 10.4s Time] [2022-04-28 10:49:21,528 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-04-28 10:49:21,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2022-04-28 10:49:21,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:49:21,610 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 10:49:21,610 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 10:49:21,611 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 10:49:21,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:21,616 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-04-28 10:49:21,616 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-04-28 10:49:21,616 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:49:21,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:49:21,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 105 states. [2022-04-28 10:49:21,617 INFO L87 Difference]: Start difference. First operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 105 states. [2022-04-28 10:49:21,621 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:21,621 INFO L93 Difference]: Finished difference Result 105 states and 126 transitions. [2022-04-28 10:49:21,621 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 126 transitions. [2022-04-28 10:49:21,622 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:49:21,622 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:49:21,622 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:49:21,622 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:49:21,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 66 states have internal predecessors, (71), 28 states have call successors, (28), 14 states have call predecessors, (28), 13 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 10:49:21,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 125 transitions. [2022-04-28 10:49:21,626 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 125 transitions. Word has length 63 [2022-04-28 10:49:21,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:49:21,626 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 125 transitions. [2022-04-28 10:49:21,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.0) internal successors, (20), 8 states have internal predecessors, (20), 6 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 6 states have call predecessors, (10), 5 states have call successors, (10) [2022-04-28 10:49:21,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 104 states and 125 transitions. [2022-04-28 10:49:21,783 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 10:49:21,783 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 125 transitions. [2022-04-28 10:49:21,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2022-04-28 10:49:21,784 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:49:21,784 INFO L195 NwaCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:49:21,800 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-04-28 10:49:21,987 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:49:21,987 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:49:21,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:49:21,988 INFO L85 PathProgramCache]: Analyzing trace with hash -711069715, now seen corresponding path program 1 times [2022-04-28 10:49:21,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:49:21,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1610875738] [2022-04-28 10:49:22,544 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:49:22,544 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:49:22,544 INFO L85 PathProgramCache]: Analyzing trace with hash -711069715, now seen corresponding path program 2 times [2022-04-28 10:49:22,545 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:49:22,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395198659] [2022-04-28 10:49:22,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:49:22,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:49:22,555 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:49:22,555 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1828525649] [2022-04-28 10:49:22,555 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:49:22,555 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:49:22,555 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:49:22,560 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 10:49:22,593 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 10:49:22,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:49:22,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:49:22,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 174 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 10:49:22,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:49:22,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:49:23,291 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 10:49:23,291 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {3830#true} is VALID [2022-04-28 10:49:23,291 INFO L290 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:23,291 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #90#return; {3830#true} is VALID [2022-04-28 10:49:23,291 INFO L272 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret5 := main(); {3830#true} is VALID [2022-04-28 10:49:23,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {3830#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,292 INFO L272 TraceCheckUtils]: 7: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:23,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:23,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:23,293 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3830#true} {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,293 INFO L272 TraceCheckUtils]: 12: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,293 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:23,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:23,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:23,294 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3830#true} {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,294 INFO L272 TraceCheckUtils]: 17: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,294 INFO L290 TraceCheckUtils]: 18: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:23,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:23,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:23,294 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3830#true} {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:23,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !false; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:23,295 INFO L272 TraceCheckUtils]: 24: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:23,296 INFO L290 TraceCheckUtils]: 26: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:23,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:23,296 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #76#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:23,296 INFO L272 TraceCheckUtils]: 29: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:23,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:23,297 INFO L290 TraceCheckUtils]: 32: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:23,298 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #78#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:23,298 INFO L272 TraceCheckUtils]: 34: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,298 INFO L290 TraceCheckUtils]: 35: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:23,298 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:23,298 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:23,299 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #80#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:23,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:23,300 INFO L290 TraceCheckUtils]: 40: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !false; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:23,300 INFO L272 TraceCheckUtils]: 41: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,300 INFO L290 TraceCheckUtils]: 42: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:23,300 INFO L290 TraceCheckUtils]: 43: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:23,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:23,301 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #82#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:23,301 INFO L272 TraceCheckUtils]: 46: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,301 INFO L290 TraceCheckUtils]: 47: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:23,301 INFO L290 TraceCheckUtils]: 48: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:23,301 INFO L290 TraceCheckUtils]: 49: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:23,302 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3830#true} {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} #84#return; {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:23,302 INFO L290 TraceCheckUtils]: 51: Hoare triple {3902#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (<= 0 main_~q~0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,303 INFO L290 TraceCheckUtils]: 52: Hoare triple {3850#(and (= main_~A~0 main_~r~0) (<= 0 main_~q~0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,303 INFO L290 TraceCheckUtils]: 53: Hoare triple {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,304 INFO L272 TraceCheckUtils]: 54: Hoare triple {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,304 INFO L290 TraceCheckUtils]: 55: Hoare triple {3830#true} ~cond := #in~cond; {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:49:23,305 INFO L290 TraceCheckUtils]: 56: Hoare triple {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:23,305 INFO L290 TraceCheckUtils]: 57: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:23,306 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {3993#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {4014#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,306 INFO L272 TraceCheckUtils]: 59: Hoare triple {4014#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:23,306 INFO L290 TraceCheckUtils]: 60: Hoare triple {3830#true} ~cond := #in~cond; {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:49:23,307 INFO L290 TraceCheckUtils]: 61: Hoare triple {4003#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:23,307 INFO L290 TraceCheckUtils]: 62: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:23,308 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {4014#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {4030#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-28 10:49:23,308 INFO L290 TraceCheckUtils]: 64: Hoare triple {4030#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} assume !(1 != ~p~0); {4034#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-28 10:49:23,309 INFO L272 TraceCheckUtils]: 65: Hoare triple {4034#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:49:23,309 INFO L290 TraceCheckUtils]: 66: Hoare triple {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:49:23,310 INFO L290 TraceCheckUtils]: 67: Hoare triple {4042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 10:49:23,310 INFO L290 TraceCheckUtils]: 68: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 10:49:23,310 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 66 proven. 11 refuted. 0 times theorem prover too weak. 132 trivial. 0 not checked. [2022-04-28 10:49:23,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:49:34,939 INFO L290 TraceCheckUtils]: 68: Hoare triple {3831#false} assume !false; {3831#false} is VALID [2022-04-28 10:49:34,939 INFO L290 TraceCheckUtils]: 67: Hoare triple {4042#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3831#false} is VALID [2022-04-28 10:49:34,939 INFO L290 TraceCheckUtils]: 66: Hoare triple {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4042#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:49:34,940 INFO L272 TraceCheckUtils]: 65: Hoare triple {4058#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4038#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:49:34,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {4062#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {4058#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 10:49:34,941 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {4066#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} #84#return; {4062#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 10:49:34,941 INFO L290 TraceCheckUtils]: 62: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:34,942 INFO L290 TraceCheckUtils]: 61: Hoare triple {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:34,942 INFO L290 TraceCheckUtils]: 60: Hoare triple {3830#true} ~cond := #in~cond; {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:49:34,942 INFO L272 TraceCheckUtils]: 59: Hoare triple {4066#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,944 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} {3830#true} #82#return; {4066#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-28 10:49:34,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:34,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {4007#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:34,945 INFO L290 TraceCheckUtils]: 55: Hoare triple {3830#true} ~cond := #in~cond; {4076#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:49:34,945 INFO L272 TraceCheckUtils]: 54: Hoare triple {3830#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,945 INFO L290 TraceCheckUtils]: 53: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-28 10:49:34,945 INFO L290 TraceCheckUtils]: 52: Hoare triple {3830#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {3830#true} is VALID [2022-04-28 10:49:34,946 INFO L290 TraceCheckUtils]: 51: Hoare triple {3830#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {3830#true} is VALID [2022-04-28 10:49:34,946 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3830#true} {3830#true} #84#return; {3830#true} is VALID [2022-04-28 10:49:34,946 INFO L290 TraceCheckUtils]: 49: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:34,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:34,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:34,946 INFO L272 TraceCheckUtils]: 46: Hoare triple {3830#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,946 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {3830#true} {3830#true} #82#return; {3830#true} is VALID [2022-04-28 10:49:34,946 INFO L290 TraceCheckUtils]: 44: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:34,947 INFO L290 TraceCheckUtils]: 43: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:34,947 INFO L290 TraceCheckUtils]: 42: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:34,947 INFO L272 TraceCheckUtils]: 41: Hoare triple {3830#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,947 INFO L290 TraceCheckUtils]: 40: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-28 10:49:34,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {3830#true} assume !(~r~0 >= ~d~0); {3830#true} is VALID [2022-04-28 10:49:34,947 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {3830#true} {3830#true} #80#return; {3830#true} is VALID [2022-04-28 10:49:34,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:34,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:34,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L272 TraceCheckUtils]: 34: Hoare triple {3830#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {3830#true} {3830#true} #78#return; {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L290 TraceCheckUtils]: 31: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L290 TraceCheckUtils]: 30: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L272 TraceCheckUtils]: 29: Hoare triple {3830#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {3830#true} {3830#true} #76#return; {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L290 TraceCheckUtils]: 27: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L290 TraceCheckUtils]: 26: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L290 TraceCheckUtils]: 25: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:34,948 INFO L272 TraceCheckUtils]: 24: Hoare triple {3830#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L290 TraceCheckUtils]: 23: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {3830#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3830#true} {3830#true} #80#return; {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L272 TraceCheckUtils]: 17: Hoare triple {3830#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {3830#true} {3830#true} #78#return; {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:34,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L290 TraceCheckUtils]: 13: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L272 TraceCheckUtils]: 12: Hoare triple {3830#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {3830#true} {3830#true} #76#return; {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L290 TraceCheckUtils]: 9: Hoare triple {3830#true} assume !(0 == ~cond); {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {3830#true} ~cond := #in~cond; {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L272 TraceCheckUtils]: 7: Hoare triple {3830#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {3830#true} assume !false; {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {3830#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {3830#true} call #t~ret5 := main(); {3830#true} is VALID [2022-04-28 10:49:34,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3830#true} {3830#true} #90#return; {3830#true} is VALID [2022-04-28 10:49:34,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {3830#true} assume true; {3830#true} is VALID [2022-04-28 10:49:34,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {3830#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {3830#true} is VALID [2022-04-28 10:49:34,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {3830#true} call ULTIMATE.init(); {3830#true} is VALID [2022-04-28 10:49:34,951 INFO L134 CoverageAnalysis]: Checked inductivity of 209 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 139 trivial. 0 not checked. [2022-04-28 10:49:34,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:49:34,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395198659] [2022-04-28 10:49:34,951 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:49:34,951 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1828525649] [2022-04-28 10:49:34,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1828525649] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:49:34,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:49:34,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-28 10:49:34,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:49:34,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1610875738] [2022-04-28 10:49:34,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1610875738] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:49:34,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:49:34,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 10:49:34,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [574349267] [2022-04-28 10:49:34,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:49:34,953 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-28 10:49:34,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:49:34,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 10:49:34,992 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 10:49:34,992 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 10:49:34,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:49:34,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 10:49:34,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=189, Unknown=0, NotChecked=0, Total=240 [2022-04-28 10:49:34,993 INFO L87 Difference]: Start difference. First operand 104 states and 125 transitions. Second operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 10:49:35,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:35,753 INFO L93 Difference]: Finished difference Result 132 states and 157 transitions. [2022-04-28 10:49:35,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:49:35,753 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 69 [2022-04-28 10:49:35,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:49:35,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 10:49:35,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-04-28 10:49:35,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 10:49:35,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 87 transitions. [2022-04-28 10:49:35,757 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 87 transitions. [2022-04-28 10:49:35,827 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 10:49:35,828 INFO L225 Difference]: With dead ends: 132 [2022-04-28 10:49:35,829 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 10:49:35,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 139 GetRequests, 121 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:49:35,830 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 13 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-28 10:49:35,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 127 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 320 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-28 10:49:35,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 10:49:35,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 10:49:35,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:49:35,892 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 10:49:35,892 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 10:49:35,892 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 10:49:35,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:35,895 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-28 10:49:35,895 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-28 10:49:35,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:49:35,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:49:35,896 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 10:49:35,896 INFO L87 Difference]: Start difference. First operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) Second operand 83 states. [2022-04-28 10:49:35,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:49:35,898 INFO L93 Difference]: Finished difference Result 83 states and 97 transitions. [2022-04-28 10:49:35,899 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-28 10:49:35,901 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:49:35,901 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:49:35,901 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:49:35,901 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:49:35,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 49 states have (on average 1.1224489795918366) internal successors, (55), 52 states have internal predecessors, (55), 22 states have call successors, (22), 12 states have call predecessors, (22), 11 states have return successors, (20), 18 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 10:49:35,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 97 transitions. [2022-04-28 10:49:35,904 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 97 transitions. Word has length 69 [2022-04-28 10:49:35,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:49:35,905 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 97 transitions. [2022-04-28 10:49:35,905 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.1) internal successors, (21), 9 states have internal predecessors, (21), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-28 10:49:35,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 97 transitions. [2022-04-28 10:49:36,027 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 10:49:36,027 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 97 transitions. [2022-04-28 10:49:36,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-28 10:49:36,028 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:49:36,028 INFO L195 NwaCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:49:36,043 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 10:49:36,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:49:36,232 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:49:36,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:49:36,232 INFO L85 PathProgramCache]: Analyzing trace with hash -1680019059, now seen corresponding path program 5 times [2022-04-28 10:49:36,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:49:36,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [402638574] [2022-04-28 10:49:40,418 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:49:40,418 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:49:40,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1680019059, now seen corresponding path program 6 times [2022-04-28 10:49:40,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:49:40,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2068828793] [2022-04-28 10:49:40,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:49:40,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:49:40,430 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:49:40,430 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [665691075] [2022-04-28 10:49:40,430 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:49:40,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:49:40,430 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:49:40,433 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 10:49:40,458 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 10:49:40,485 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 10:49:40,486 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:49:40,486 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-28 10:49:40,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:49:40,499 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:49:44,493 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:49:44,936 INFO L272 TraceCheckUtils]: 0: Hoare triple {4859#true} call ULTIMATE.init(); {4859#true} is VALID [2022-04-28 10:49:44,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {4859#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {4859#true} is VALID [2022-04-28 10:49:44,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,936 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4859#true} {4859#true} #90#return; {4859#true} is VALID [2022-04-28 10:49:44,936 INFO L272 TraceCheckUtils]: 4: Hoare triple {4859#true} call #t~ret5 := main(); {4859#true} is VALID [2022-04-28 10:49:44,937 INFO L290 TraceCheckUtils]: 5: Hoare triple {4859#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,937 INFO L290 TraceCheckUtils]: 6: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,937 INFO L272 TraceCheckUtils]: 7: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,937 INFO L290 TraceCheckUtils]: 10: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,938 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,938 INFO L272 TraceCheckUtils]: 12: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,938 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,939 INFO L272 TraceCheckUtils]: 17: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,939 INFO L290 TraceCheckUtils]: 20: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,943 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,944 INFO L290 TraceCheckUtils]: 22: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,946 INFO L290 TraceCheckUtils]: 23: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,946 INFO L272 TraceCheckUtils]: 24: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,946 INFO L290 TraceCheckUtils]: 27: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,946 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,946 INFO L272 TraceCheckUtils]: 29: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,947 INFO L290 TraceCheckUtils]: 30: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,947 INFO L290 TraceCheckUtils]: 31: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,947 INFO L290 TraceCheckUtils]: 32: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,947 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,947 INFO L272 TraceCheckUtils]: 34: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,947 INFO L290 TraceCheckUtils]: 35: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,947 INFO L290 TraceCheckUtils]: 36: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,948 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {4859#true} {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,948 INFO L290 TraceCheckUtils]: 39: Hoare triple {4879#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,949 INFO L272 TraceCheckUtils]: 41: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,949 INFO L290 TraceCheckUtils]: 42: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,949 INFO L290 TraceCheckUtils]: 43: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,949 INFO L290 TraceCheckUtils]: 44: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,949 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {4859#true} {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,950 INFO L272 TraceCheckUtils]: 46: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,950 INFO L290 TraceCheckUtils]: 47: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,950 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4859#true} {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,950 INFO L272 TraceCheckUtils]: 51: Hoare triple {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,950 INFO L290 TraceCheckUtils]: 52: Hoare triple {4859#true} ~cond := #in~cond; {5022#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:49:44,951 INFO L290 TraceCheckUtils]: 53: Hoare triple {5022#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:44,951 INFO L290 TraceCheckUtils]: 54: Hoare triple {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:49:44,952 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5026#(not (= |__VERIFIER_assert_#in~cond| 0))} {4982#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,952 INFO L290 TraceCheckUtils]: 56: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,953 INFO L290 TraceCheckUtils]: 57: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,953 INFO L272 TraceCheckUtils]: 58: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,953 INFO L290 TraceCheckUtils]: 59: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,953 INFO L290 TraceCheckUtils]: 60: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,953 INFO L290 TraceCheckUtils]: 61: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,954 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {4859#true} {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,954 INFO L272 TraceCheckUtils]: 63: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4859#true} is VALID [2022-04-28 10:49:44,954 INFO L290 TraceCheckUtils]: 64: Hoare triple {4859#true} ~cond := #in~cond; {4859#true} is VALID [2022-04-28 10:49:44,954 INFO L290 TraceCheckUtils]: 65: Hoare triple {4859#true} assume !(0 == ~cond); {4859#true} is VALID [2022-04-28 10:49:44,954 INFO L290 TraceCheckUtils]: 66: Hoare triple {4859#true} assume true; {4859#true} is VALID [2022-04-28 10:49:44,954 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {4859#true} {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:49:44,956 INFO L290 TraceCheckUtils]: 68: Hoare triple {5033#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5073#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (<= 0 aux_mod_v_main_~p~0_51_22) (= (div (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) main_~d~0) (< aux_mod_v_main_~p~0_51_22 2) (= (mod (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) 0))))} is VALID [2022-04-28 10:49:44,958 INFO L290 TraceCheckUtils]: 69: Hoare triple {5073#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (<= 0 aux_mod_v_main_~p~0_51_22) (= (div (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) main_~d~0) (< aux_mod_v_main_~p~0_51_22 2) (= (mod (* main_~B~0 (+ (* main_~p~0 2) aux_mod_v_main_~p~0_51_22)) 2) 0))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} is VALID [2022-04-28 10:49:44,959 INFO L290 TraceCheckUtils]: 70: Hoare triple {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} assume !false; {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} is VALID [2022-04-28 10:49:44,960 INFO L272 TraceCheckUtils]: 71: Hoare triple {5077#(and (= main_~B~0 1) (exists ((aux_mod_v_main_~p~0_51_22 Int)) (and (= (mod (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2) 0) (<= 0 aux_mod_v_main_~p~0_51_22) (= (+ (* (- 1) (div (* main_~B~0 (+ aux_mod_v_main_~p~0_51_22 (* main_~q~0 2))) 2)) main_~A~0) main_~r~0) (< aux_mod_v_main_~p~0_51_22 2))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5084#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:49:44,960 INFO L290 TraceCheckUtils]: 72: Hoare triple {5084#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5088#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:49:44,960 INFO L290 TraceCheckUtils]: 73: Hoare triple {5088#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4860#false} is VALID [2022-04-28 10:49:44,960 INFO L290 TraceCheckUtils]: 74: Hoare triple {4860#false} assume !false; {4860#false} is VALID [2022-04-28 10:49:44,961 INFO L134 CoverageAnalysis]: Checked inductivity of 259 backedges. 55 proven. 9 refuted. 0 times theorem prover too weak. 195 trivial. 0 not checked. [2022-04-28 10:49:44,961 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:50:03,152 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:52:26,195 WARN L232 SmtUtils]: Spent 28.42s on a formula simplification. DAG size of input: 69 DAG size of output: 65 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-28 10:52:26,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:52:26,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2068828793] [2022-04-28 10:52:26,203 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:52:26,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [665691075] [2022-04-28 10:52:26,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [665691075] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:52:26,204 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:52:26,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11] total 11 [2022-04-28 10:52:26,204 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:52:26,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [402638574] [2022-04-28 10:52:26,204 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [402638574] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:52:26,204 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:52:26,204 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 10:52:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183954338] [2022-04-28 10:52:26,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:52:26,204 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2022-04-28 10:52:26,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:52:26,205 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 10:52:26,257 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 10:52:26,257 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 10:52:26,257 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:52:26,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 10:52:26,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=157, Unknown=2, NotChecked=0, Total=210 [2022-04-28 10:52:26,258 INFO L87 Difference]: Start difference. First operand 83 states and 97 transitions. Second operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 10:52:26,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:26,793 INFO L93 Difference]: Finished difference Result 96 states and 110 transitions. [2022-04-28 10:52:26,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-28 10:52:26,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 75 [2022-04-28 10:52:26,794 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:52:26,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 10:52:26,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-28 10:52:26,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 10:52:26,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 63 transitions. [2022-04-28 10:52:26,797 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 63 transitions. [2022-04-28 10:52:26,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:52:26,869 INFO L225 Difference]: With dead ends: 96 [2022-04-28 10:52:26,869 INFO L226 Difference]: Without dead ends: 94 [2022-04-28 10:52:26,869 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 80 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 58 ImplicationChecksByTransitivity, 35.2s TimeCoverageRelationStatistics Valid=62, Invalid=208, Unknown=2, NotChecked=0, Total=272 [2022-04-28 10:52:26,870 INFO L413 NwaCegarLoop]: 26 mSDtfsCounter, 19 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:52:26,870 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 104 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 165 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-04-28 10:52:26,871 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-04-28 10:52:26,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2022-04-28 10:52:26,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:52:26,924 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 10:52:26,924 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 10:52:26,924 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 10:52:26,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:26,927 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-04-28 10:52:26,927 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-04-28 10:52:26,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:52:26,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:52:26,928 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 94 states. [2022-04-28 10:52:26,928 INFO L87 Difference]: Start difference. First operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) Second operand 94 states. [2022-04-28 10:52:26,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:26,931 INFO L93 Difference]: Finished difference Result 94 states and 108 transitions. [2022-04-28 10:52:26,932 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-04-28 10:52:26,932 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:52:26,932 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:52:26,932 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:52:26,932 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:52:26,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 57 states have (on average 1.1228070175438596) internal successors, (64), 61 states have internal predecessors, (64), 23 states have call successors, (23), 14 states have call predecessors, (23), 13 states have return successors, (21), 18 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 10:52:26,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 108 transitions. [2022-04-28 10:52:26,935 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 108 transitions. Word has length 75 [2022-04-28 10:52:26,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:52:26,936 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 108 transitions. [2022-04-28 10:52:26,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 1.9090909090909092) internal successors, (21), 10 states have internal predecessors, (21), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-28 10:52:26,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 108 transitions. [2022-04-28 10:52:27,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:52:27,108 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 108 transitions. [2022-04-28 10:52:27,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-28 10:52:27,109 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:52:27,109 INFO L195 NwaCegarLoop]: trace histogram [13, 12, 12, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:52:27,133 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 10:52:27,309 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:52:27,310 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:52:27,310 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:52:27,310 INFO L85 PathProgramCache]: Analyzing trace with hash -576191946, now seen corresponding path program 1 times [2022-04-28 10:52:27,310 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:52:27,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2082875877] [2022-04-28 10:52:31,400 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:52:31,400 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:52:31,400 INFO L85 PathProgramCache]: Analyzing trace with hash -576191946, now seen corresponding path program 2 times [2022-04-28 10:52:31,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:52:31,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1486336875] [2022-04-28 10:52:31,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:52:31,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:52:31,410 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:52:31,410 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1052634789] [2022-04-28 10:52:31,410 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:52:31,410 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:52:31,410 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:52:31,420 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 10:52:31,443 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 10:52:31,476 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:52:31,476 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:52:31,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:52:31,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:31,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:52:33,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {5730#true} call ULTIMATE.init(); {5730#true} is VALID [2022-04-28 10:52:33,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {5730#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {5730#true} is VALID [2022-04-28 10:52:33,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,441 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5730#true} {5730#true} #90#return; {5730#true} is VALID [2022-04-28 10:52:33,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {5730#true} call #t~ret5 := main(); {5730#true} is VALID [2022-04-28 10:52:33,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {5730#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 10:52:33,442 INFO L290 TraceCheckUtils]: 6: Hoare triple {5750#(<= 1 main_~d~0)} assume !false; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 10:52:33,442 INFO L272 TraceCheckUtils]: 7: Hoare triple {5750#(<= 1 main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,442 INFO L290 TraceCheckUtils]: 8: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,442 INFO L290 TraceCheckUtils]: 9: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,442 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {5730#true} {5750#(<= 1 main_~d~0)} #76#return; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 10:52:33,442 INFO L272 TraceCheckUtils]: 12: Hoare triple {5750#(<= 1 main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,443 INFO L290 TraceCheckUtils]: 14: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,443 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {5730#true} {5750#(<= 1 main_~d~0)} #78#return; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 10:52:33,443 INFO L272 TraceCheckUtils]: 17: Hoare triple {5750#(<= 1 main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,444 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {5730#true} {5750#(<= 1 main_~d~0)} #80#return; {5750#(<= 1 main_~d~0)} is VALID [2022-04-28 10:52:33,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {5750#(<= 1 main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 10:52:33,445 INFO L290 TraceCheckUtils]: 23: Hoare triple {5802#(<= 1 (div main_~d~0 2))} assume !false; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 10:52:33,445 INFO L272 TraceCheckUtils]: 24: Hoare triple {5802#(<= 1 (div main_~d~0 2))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,445 INFO L290 TraceCheckUtils]: 25: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,446 INFO L290 TraceCheckUtils]: 27: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,446 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {5730#true} {5802#(<= 1 (div main_~d~0 2))} #76#return; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 10:52:33,446 INFO L272 TraceCheckUtils]: 29: Hoare triple {5802#(<= 1 (div main_~d~0 2))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,446 INFO L290 TraceCheckUtils]: 30: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,446 INFO L290 TraceCheckUtils]: 31: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,446 INFO L290 TraceCheckUtils]: 32: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,447 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {5730#true} {5802#(<= 1 (div main_~d~0 2))} #78#return; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 10:52:33,447 INFO L272 TraceCheckUtils]: 34: Hoare triple {5802#(<= 1 (div main_~d~0 2))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,447 INFO L290 TraceCheckUtils]: 35: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,447 INFO L290 TraceCheckUtils]: 36: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,447 INFO L290 TraceCheckUtils]: 37: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,448 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {5730#true} {5802#(<= 1 (div main_~d~0 2))} #80#return; {5802#(<= 1 (div main_~d~0 2))} is VALID [2022-04-28 10:52:33,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {5802#(<= 1 (div main_~d~0 2))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 10:52:33,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !false; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 10:52:33,449 INFO L272 TraceCheckUtils]: 41: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,450 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #76#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 10:52:33,450 INFO L272 TraceCheckUtils]: 46: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,451 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #78#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 10:52:33,451 INFO L272 TraceCheckUtils]: 51: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,452 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #80#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 10:52:33,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !(~r~0 >= ~d~0); {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 10:52:33,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !false; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 10:52:33,453 INFO L272 TraceCheckUtils]: 58: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,454 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #82#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 10:52:33,454 INFO L272 TraceCheckUtils]: 63: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5730#true} is VALID [2022-04-28 10:52:33,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {5730#true} ~cond := #in~cond; {5730#true} is VALID [2022-04-28 10:52:33,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {5730#true} assume !(0 == ~cond); {5730#true} is VALID [2022-04-28 10:52:33,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {5730#true} assume true; {5730#true} is VALID [2022-04-28 10:52:33,455 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {5730#true} {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} #84#return; {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} is VALID [2022-04-28 10:52:33,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {5854#(and (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (<= 1 (div (div main_~d~0 2) 2)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5942#(and (< 0 (div main_~r~0 2)) (< main_~d~0 (+ main_~r~0 1)))} is VALID [2022-04-28 10:52:33,456 INFO L290 TraceCheckUtils]: 69: Hoare triple {5942#(and (< 0 (div main_~r~0 2)) (< main_~d~0 (+ main_~r~0 1)))} assume !(~r~0 >= ~d~0); {5731#false} is VALID [2022-04-28 10:52:33,456 INFO L290 TraceCheckUtils]: 70: Hoare triple {5731#false} assume !false; {5731#false} is VALID [2022-04-28 10:52:33,456 INFO L272 TraceCheckUtils]: 71: Hoare triple {5731#false} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5731#false} is VALID [2022-04-28 10:52:33,457 INFO L290 TraceCheckUtils]: 72: Hoare triple {5731#false} ~cond := #in~cond; {5731#false} is VALID [2022-04-28 10:52:33,457 INFO L290 TraceCheckUtils]: 73: Hoare triple {5731#false} assume !(0 == ~cond); {5731#false} is VALID [2022-04-28 10:52:33,457 INFO L290 TraceCheckUtils]: 74: Hoare triple {5731#false} assume true; {5731#false} is VALID [2022-04-28 10:52:33,457 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {5731#false} {5731#false} #82#return; {5731#false} is VALID [2022-04-28 10:52:33,457 INFO L272 TraceCheckUtils]: 76: Hoare triple {5731#false} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5731#false} is VALID [2022-04-28 10:52:33,457 INFO L290 TraceCheckUtils]: 77: Hoare triple {5731#false} ~cond := #in~cond; {5731#false} is VALID [2022-04-28 10:52:33,457 INFO L290 TraceCheckUtils]: 78: Hoare triple {5731#false} assume 0 == ~cond; {5731#false} is VALID [2022-04-28 10:52:33,457 INFO L290 TraceCheckUtils]: 79: Hoare triple {5731#false} assume !false; {5731#false} is VALID [2022-04-28 10:52:33,458 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 84 proven. 0 refuted. 0 times theorem prover too weak. 222 trivial. 0 not checked. [2022-04-28 10:52:33,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 10:52:33,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:52:33,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1486336875] [2022-04-28 10:52:33,458 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:52:33,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052634789] [2022-04-28 10:52:33,458 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052634789] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:52:33,458 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:52:33,458 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:52:33,459 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:52:33,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2082875877] [2022-04-28 10:52:33,459 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2082875877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:52:33,459 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:52:33,459 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 10:52:33,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [919988493] [2022-04-28 10:52:33,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:52:33,460 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 80 [2022-04-28 10:52:33,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:52:33,460 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 10:52:33,506 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 10:52:33,506 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 10:52:33,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:52:33,507 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 10:52:33,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:52:33,507 INFO L87 Difference]: Start difference. First operand 94 states and 108 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 10:52:33,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:33,828 INFO L93 Difference]: Finished difference Result 122 states and 147 transitions. [2022-04-28 10:52:33,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 10:52:33,829 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 80 [2022-04-28 10:52:33,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:52:33,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 10:52:33,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-28 10:52:33,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 10:52:33,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 95 transitions. [2022-04-28 10:52:33,832 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 95 transitions. [2022-04-28 10:52:33,911 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 10:52:33,913 INFO L225 Difference]: With dead ends: 122 [2022-04-28 10:52:33,913 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 10:52:33,913 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 75 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-04-28 10:52:33,914 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 8 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:52:33,914 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 114 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 10:52:33,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 10:52:33,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 82. [2022-04-28 10:52:33,974 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:52:33,974 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:52:33,974 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:52:33,975 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:52:33,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:33,977 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-28 10:52:33,977 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-28 10:52:33,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:52:33,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:52:33,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 92 states. [2022-04-28 10:52:33,978 INFO L87 Difference]: Start difference. First operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Second operand 92 states. [2022-04-28 10:52:33,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:33,980 INFO L93 Difference]: Finished difference Result 92 states and 107 transitions. [2022-04-28 10:52:33,980 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 107 transitions. [2022-04-28 10:52:33,980 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:52:33,981 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:52:33,981 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:52:33,981 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:52:33,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 50 states have (on average 1.08) internal successors, (54), 52 states have internal predecessors, (54), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:52:33,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2022-04-28 10:52:33,983 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 80 [2022-04-28 10:52:33,983 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:52:33,983 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2022-04-28 10:52:33,983 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 5 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-28 10:52:33,983 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 82 states and 90 transitions. [2022-04-28 10:52:34,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:52:34,092 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2022-04-28 10:52:34,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 10:52:34,093 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:52:34,093 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:52:34,110 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-28 10:52:34,293 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,SelfDestructingSolverStorable9 [2022-04-28 10:52:34,294 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:52:34,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:52:34,294 INFO L85 PathProgramCache]: Analyzing trace with hash -182652584, now seen corresponding path program 3 times [2022-04-28 10:52:34,294 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:52:34,294 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [247003844] [2022-04-28 10:52:38,381 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:52:38,381 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:52:38,381 INFO L85 PathProgramCache]: Analyzing trace with hash -182652584, now seen corresponding path program 4 times [2022-04-28 10:52:38,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:52:38,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962340057] [2022-04-28 10:52:38,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:52:38,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:52:38,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:52:38,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [366382411] [2022-04-28 10:52:38,391 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:52:38,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:52:38,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:52:38,396 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 10:52:38,396 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 10:52:38,436 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:52:38,436 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:52:38,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-28 10:52:38,449 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:38,451 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:52:39,439 INFO L272 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {6569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #90#return; {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L272 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret5 := main(); {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {6569#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {6569#true} assume !false; {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L272 TraceCheckUtils]: 7: Hoare triple {6569#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L290 TraceCheckUtils]: 8: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L290 TraceCheckUtils]: 9: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6569#true} {6569#true} #76#return; {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L272 TraceCheckUtils]: 12: Hoare triple {6569#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,441 INFO L290 TraceCheckUtils]: 14: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,441 INFO L290 TraceCheckUtils]: 15: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,441 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6569#true} {6569#true} #78#return; {6569#true} is VALID [2022-04-28 10:52:39,441 INFO L272 TraceCheckUtils]: 17: Hoare triple {6569#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,441 INFO L290 TraceCheckUtils]: 20: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,441 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6569#true} {6569#true} #80#return; {6569#true} is VALID [2022-04-28 10:52:39,441 INFO L290 TraceCheckUtils]: 22: Hoare triple {6569#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,442 INFO L290 TraceCheckUtils]: 23: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !false; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,442 INFO L272 TraceCheckUtils]: 24: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,442 INFO L290 TraceCheckUtils]: 26: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,442 INFO L290 TraceCheckUtils]: 27: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,442 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #76#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,442 INFO L272 TraceCheckUtils]: 29: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,443 INFO L290 TraceCheckUtils]: 30: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,443 INFO L290 TraceCheckUtils]: 31: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,446 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #78#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,446 INFO L272 TraceCheckUtils]: 34: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,447 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #80#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,449 INFO L290 TraceCheckUtils]: 39: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:52:39,449 INFO L290 TraceCheckUtils]: 40: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !false; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:52:39,449 INFO L272 TraceCheckUtils]: 41: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,449 INFO L290 TraceCheckUtils]: 43: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,450 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #76#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:52:39,450 INFO L272 TraceCheckUtils]: 46: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,450 INFO L290 TraceCheckUtils]: 47: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,450 INFO L290 TraceCheckUtils]: 48: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,450 INFO L290 TraceCheckUtils]: 49: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,451 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #78#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:52:39,451 INFO L272 TraceCheckUtils]: 51: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,451 INFO L290 TraceCheckUtils]: 52: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,451 INFO L290 TraceCheckUtils]: 53: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,451 INFO L290 TraceCheckUtils]: 54: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,452 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #80#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:52:39,452 INFO L290 TraceCheckUtils]: 56: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:52:39,453 INFO L290 TraceCheckUtils]: 57: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !false; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:52:39,453 INFO L272 TraceCheckUtils]: 58: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,453 INFO L290 TraceCheckUtils]: 59: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,453 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,453 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,454 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #82#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:52:39,454 INFO L272 TraceCheckUtils]: 63: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,454 INFO L290 TraceCheckUtils]: 64: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,454 INFO L290 TraceCheckUtils]: 65: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,454 INFO L290 TraceCheckUtils]: 66: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,455 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6569#true} {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #84#return; {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:52:39,456 INFO L290 TraceCheckUtils]: 68: Hoare triple {6692#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !false; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,457 INFO L272 TraceCheckUtils]: 71: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,457 INFO L290 TraceCheckUtils]: 72: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,457 INFO L290 TraceCheckUtils]: 73: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,457 INFO L290 TraceCheckUtils]: 74: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,458 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #82#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,458 INFO L272 TraceCheckUtils]: 76: Hoare triple {6640#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,458 INFO L290 TraceCheckUtils]: 77: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,458 INFO L290 TraceCheckUtils]: 78: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,459 INFO L290 TraceCheckUtils]: 79: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,459 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6569#true} {6640#(= (mod main_~p~0 2) 0)} #84#return; {6640#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:52:39,460 INFO L290 TraceCheckUtils]: 81: Hoare triple {6640#(= (mod main_~p~0 2) 0)} assume !(1 != ~p~0); {6570#false} is VALID [2022-04-28 10:52:39,460 INFO L272 TraceCheckUtils]: 82: Hoare triple {6570#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6570#false} is VALID [2022-04-28 10:52:39,460 INFO L290 TraceCheckUtils]: 83: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2022-04-28 10:52:39,460 INFO L290 TraceCheckUtils]: 84: Hoare triple {6570#false} assume 0 == ~cond; {6570#false} is VALID [2022-04-28 10:52:39,460 INFO L290 TraceCheckUtils]: 85: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2022-04-28 10:52:39,460 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 41 proven. 4 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 10:52:39,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:52:39,680 INFO L290 TraceCheckUtils]: 85: Hoare triple {6570#false} assume !false; {6570#false} is VALID [2022-04-28 10:52:39,680 INFO L290 TraceCheckUtils]: 84: Hoare triple {6570#false} assume 0 == ~cond; {6570#false} is VALID [2022-04-28 10:52:39,680 INFO L290 TraceCheckUtils]: 83: Hoare triple {6570#false} ~cond := #in~cond; {6570#false} is VALID [2022-04-28 10:52:39,680 INFO L272 TraceCheckUtils]: 82: Hoare triple {6570#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {6570#false} is VALID [2022-04-28 10:52:39,681 INFO L290 TraceCheckUtils]: 81: Hoare triple {6843#(not (= main_~p~0 1))} assume !(1 != ~p~0); {6570#false} is VALID [2022-04-28 10:52:39,681 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #84#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,681 INFO L290 TraceCheckUtils]: 79: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,681 INFO L290 TraceCheckUtils]: 78: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,681 INFO L290 TraceCheckUtils]: 77: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,681 INFO L272 TraceCheckUtils]: 76: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,682 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #82#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,682 INFO L290 TraceCheckUtils]: 74: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,682 INFO L290 TraceCheckUtils]: 73: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,682 INFO L290 TraceCheckUtils]: 72: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,682 INFO L272 TraceCheckUtils]: 71: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,682 INFO L290 TraceCheckUtils]: 70: Hoare triple {6843#(not (= main_~p~0 1))} assume !false; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,683 INFO L290 TraceCheckUtils]: 69: Hoare triple {6843#(not (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,683 INFO L290 TraceCheckUtils]: 68: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,684 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #84#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 10:52:39,684 INFO L290 TraceCheckUtils]: 66: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,684 INFO L290 TraceCheckUtils]: 65: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,684 INFO L290 TraceCheckUtils]: 64: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,684 INFO L272 TraceCheckUtils]: 63: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,685 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #82#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 10:52:39,685 INFO L290 TraceCheckUtils]: 61: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,685 INFO L290 TraceCheckUtils]: 60: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,685 INFO L290 TraceCheckUtils]: 59: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,685 INFO L272 TraceCheckUtils]: 58: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,685 INFO L290 TraceCheckUtils]: 57: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !false; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 10:52:39,685 INFO L290 TraceCheckUtils]: 56: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !(~r~0 >= ~d~0); {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 10:52:39,686 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #80#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 10:52:39,686 INFO L290 TraceCheckUtils]: 54: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,686 INFO L290 TraceCheckUtils]: 53: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,686 INFO L290 TraceCheckUtils]: 52: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,686 INFO L272 TraceCheckUtils]: 51: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,686 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #78#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 10:52:39,686 INFO L290 TraceCheckUtils]: 49: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,687 INFO L290 TraceCheckUtils]: 48: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,687 INFO L290 TraceCheckUtils]: 47: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,687 INFO L272 TraceCheckUtils]: 46: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,704 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {6569#true} {6883#(not (= (div main_~p~0 2) 1))} #76#return; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 10:52:39,704 INFO L290 TraceCheckUtils]: 44: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,704 INFO L290 TraceCheckUtils]: 43: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,704 INFO L290 TraceCheckUtils]: 42: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,704 INFO L272 TraceCheckUtils]: 41: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,704 INFO L290 TraceCheckUtils]: 40: Hoare triple {6883#(not (= (div main_~p~0 2) 1))} assume !false; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 10:52:39,705 INFO L290 TraceCheckUtils]: 39: Hoare triple {6843#(not (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6883#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-28 10:52:39,706 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #80#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,706 INFO L290 TraceCheckUtils]: 37: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,707 INFO L290 TraceCheckUtils]: 36: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,707 INFO L290 TraceCheckUtils]: 35: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,707 INFO L272 TraceCheckUtils]: 34: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,707 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #78#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,708 INFO L290 TraceCheckUtils]: 32: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,708 INFO L272 TraceCheckUtils]: 29: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,709 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {6569#true} {6843#(not (= main_~p~0 1))} #76#return; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,709 INFO L290 TraceCheckUtils]: 26: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,709 INFO L290 TraceCheckUtils]: 25: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,709 INFO L272 TraceCheckUtils]: 24: Hoare triple {6843#(not (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,709 INFO L290 TraceCheckUtils]: 23: Hoare triple {6843#(not (= main_~p~0 1))} assume !false; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,710 INFO L290 TraceCheckUtils]: 22: Hoare triple {6569#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6843#(not (= main_~p~0 1))} is VALID [2022-04-28 10:52:39,710 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {6569#true} {6569#true} #80#return; {6569#true} is VALID [2022-04-28 10:52:39,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,710 INFO L272 TraceCheckUtils]: 17: Hoare triple {6569#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {6569#true} {6569#true} #78#return; {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L290 TraceCheckUtils]: 15: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L290 TraceCheckUtils]: 14: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L290 TraceCheckUtils]: 13: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L272 TraceCheckUtils]: 12: Hoare triple {6569#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {6569#true} {6569#true} #76#return; {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {6569#true} assume !(0 == ~cond); {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {6569#true} ~cond := #in~cond; {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L272 TraceCheckUtils]: 7: Hoare triple {6569#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {6569#true} assume !false; {6569#true} is VALID [2022-04-28 10:52:39,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {6569#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6569#true} is VALID [2022-04-28 10:52:39,712 INFO L272 TraceCheckUtils]: 4: Hoare triple {6569#true} call #t~ret5 := main(); {6569#true} is VALID [2022-04-28 10:52:39,712 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6569#true} {6569#true} #90#return; {6569#true} is VALID [2022-04-28 10:52:39,712 INFO L290 TraceCheckUtils]: 2: Hoare triple {6569#true} assume true; {6569#true} is VALID [2022-04-28 10:52:39,712 INFO L290 TraceCheckUtils]: 1: Hoare triple {6569#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {6569#true} is VALID [2022-04-28 10:52:39,712 INFO L272 TraceCheckUtils]: 0: Hoare triple {6569#true} call ULTIMATE.init(); {6569#true} is VALID [2022-04-28 10:52:39,712 INFO L134 CoverageAnalysis]: Checked inductivity of 357 backedges. 36 proven. 9 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 10:52:39,712 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:52:39,712 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962340057] [2022-04-28 10:52:39,713 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:52:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [366382411] [2022-04-28 10:52:39,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [366382411] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:52:39,713 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:52:39,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-28 10:52:39,713 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:52:39,713 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [247003844] [2022-04-28 10:52:39,713 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [247003844] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:52:39,713 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:52:39,713 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 10:52:39,713 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094577869] [2022-04-28 10:52:39,714 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:52:39,714 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 86 [2022-04-28 10:52:39,714 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:52:39,714 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 10:52:39,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:52:39,759 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 10:52:39,759 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:52:39,760 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 10:52:39,760 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:52:39,760 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 10:52:39,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:39,928 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-04-28 10:52:39,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 10:52:39,928 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 86 [2022-04-28 10:52:39,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:52:39,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 10:52:39,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 10:52:39,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 10:52:39,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 70 transitions. [2022-04-28 10:52:39,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 70 transitions. [2022-04-28 10:52:39,995 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 10:52:39,996 INFO L225 Difference]: With dead ends: 91 [2022-04-28 10:52:39,996 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 10:52:39,997 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 165 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-28 10:52:39,997 INFO L413 NwaCegarLoop]: 48 mSDtfsCounter, 1 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 10:52:39,998 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 105 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 10:52:39,998 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 10:52:40,068 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 10:52:40,069 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:52:40,069 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:52:40,069 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:52:40,069 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:52:40,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:40,071 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 10:52:40,071 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 10:52:40,072 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:52:40,072 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:52:40,073 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 83 states. [2022-04-28 10:52:40,073 INFO L87 Difference]: Start difference. First operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 83 states. [2022-04-28 10:52:40,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:52:40,078 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 10:52:40,078 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 10:52:40,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:52:40,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:52:40,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:52:40,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:52:40,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 51 states have (on average 1.0784313725490196) internal successors, (55), 52 states have internal predecessors, (55), 19 states have call successors, (19), 13 states have call predecessors, (19), 12 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 10:52:40,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-04-28 10:52:40,082 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 86 [2022-04-28 10:52:40,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:52:40,082 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-04-28 10:52:40,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-28 10:52:40,082 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 91 transitions. [2022-04-28 10:52:40,229 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 10:52:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 10:52:40,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2022-04-28 10:52:40,231 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:52:40,231 INFO L195 NwaCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:52:40,247 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 10:52:40,431 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:52:40,432 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:52:40,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:52:40,432 INFO L85 PathProgramCache]: Analyzing trace with hash 1256657556, now seen corresponding path program 7 times [2022-04-28 10:52:40,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:52:40,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1670809376] [2022-04-28 10:52:42,987 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:52:42,987 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:52:42,987 INFO L85 PathProgramCache]: Analyzing trace with hash 1256657556, now seen corresponding path program 8 times [2022-04-28 10:52:42,987 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:52:42,988 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2009525184] [2022-04-28 10:52:42,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:52:42,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:52:42,999 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:52:42,999 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1134953513] [2022-04-28 10:52:42,999 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 10:52:42,999 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:52:42,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:52:43,001 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 10:52:43,004 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 10:52:43,058 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 10:52:43,058 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:52:43,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:52:43,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:52:43,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:52:43,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2022-04-28 10:52:43,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {7604#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {7604#true} is VALID [2022-04-28 10:52:43,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #90#return; {7604#true} is VALID [2022-04-28 10:52:43,708 INFO L272 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret5 := main(); {7604#true} is VALID [2022-04-28 10:52:43,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {7604#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:52:43,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !false; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:52:43,709 INFO L272 TraceCheckUtils]: 7: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,709 INFO L290 TraceCheckUtils]: 8: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,709 INFO L290 TraceCheckUtils]: 9: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,709 INFO L290 TraceCheckUtils]: 10: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,710 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7604#true} {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #76#return; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:52:43,710 INFO L272 TraceCheckUtils]: 12: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,710 INFO L290 TraceCheckUtils]: 14: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,710 INFO L290 TraceCheckUtils]: 15: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,711 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7604#true} {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:52:43,711 INFO L272 TraceCheckUtils]: 17: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,711 INFO L290 TraceCheckUtils]: 18: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,711 INFO L290 TraceCheckUtils]: 19: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,711 INFO L290 TraceCheckUtils]: 20: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,711 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7604#true} {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-28 10:52:43,712 INFO L290 TraceCheckUtils]: 22: Hoare triple {7624#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:52:43,719 INFO L290 TraceCheckUtils]: 23: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !false; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:52:43,720 INFO L272 TraceCheckUtils]: 24: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,721 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7604#true} {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #76#return; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:52:43,721 INFO L272 TraceCheckUtils]: 29: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,722 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7604#true} {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:52:43,722 INFO L272 TraceCheckUtils]: 34: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,722 INFO L290 TraceCheckUtils]: 35: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,723 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7604#true} {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:52:43,723 INFO L290 TraceCheckUtils]: 39: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 10:52:43,724 INFO L290 TraceCheckUtils]: 40: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !false; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 10:52:43,724 INFO L272 TraceCheckUtils]: 41: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,724 INFO L290 TraceCheckUtils]: 42: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,724 INFO L290 TraceCheckUtils]: 43: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,724 INFO L290 TraceCheckUtils]: 44: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,725 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #76#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 10:52:43,725 INFO L272 TraceCheckUtils]: 46: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,725 INFO L290 TraceCheckUtils]: 49: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,726 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #78#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 10:52:43,726 INFO L272 TraceCheckUtils]: 51: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,726 INFO L290 TraceCheckUtils]: 52: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,727 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #80#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 10:52:43,728 INFO L290 TraceCheckUtils]: 56: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 10:52:43,728 INFO L290 TraceCheckUtils]: 57: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !false; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 10:52:43,728 INFO L272 TraceCheckUtils]: 58: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,728 INFO L290 TraceCheckUtils]: 59: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,728 INFO L290 TraceCheckUtils]: 60: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,729 INFO L290 TraceCheckUtils]: 61: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,729 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #82#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 10:52:43,729 INFO L272 TraceCheckUtils]: 63: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,729 INFO L290 TraceCheckUtils]: 64: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,729 INFO L290 TraceCheckUtils]: 65: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,730 INFO L290 TraceCheckUtils]: 66: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,730 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7604#true} {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #84#return; {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-28 10:52:43,731 INFO L290 TraceCheckUtils]: 68: Hoare triple {7728#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-28 10:52:43,731 INFO L290 TraceCheckUtils]: 69: Hoare triple {7676#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:52:43,732 INFO L290 TraceCheckUtils]: 70: Hoare triple {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !false; {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:52:43,732 INFO L272 TraceCheckUtils]: 71: Hoare triple {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,732 INFO L290 TraceCheckUtils]: 72: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,733 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7604#true} {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #82#return; {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:52:43,733 INFO L272 TraceCheckUtils]: 76: Hoare triple {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:52:43,733 INFO L290 TraceCheckUtils]: 77: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:52:43,733 INFO L290 TraceCheckUtils]: 78: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:52:43,733 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:52:43,734 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7604#true} {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:52:43,735 INFO L290 TraceCheckUtils]: 81: Hoare triple {7819#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7856#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1))} is VALID [2022-04-28 10:52:43,736 INFO L290 TraceCheckUtils]: 82: Hoare triple {7856#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (+ (* (- 2) main_~B~0) main_~A~0) main_~r~0) (= (div (* main_~B~0 2) 2) main_~d~0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 10:52:43,736 INFO L290 TraceCheckUtils]: 83: Hoare triple {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} assume !false; {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-28 10:52:43,737 INFO L272 TraceCheckUtils]: 84: Hoare triple {7860#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:52:43,738 INFO L290 TraceCheckUtils]: 85: Hoare triple {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:52:43,738 INFO L290 TraceCheckUtils]: 86: Hoare triple {7871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7605#false} is VALID [2022-04-28 10:52:43,738 INFO L290 TraceCheckUtils]: 87: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2022-04-28 10:52:43,739 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 10:52:43,739 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:53:14,841 INFO L290 TraceCheckUtils]: 87: Hoare triple {7605#false} assume !false; {7605#false} is VALID [2022-04-28 10:53:14,842 INFO L290 TraceCheckUtils]: 86: Hoare triple {7871#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {7605#false} is VALID [2022-04-28 10:53:14,842 INFO L290 TraceCheckUtils]: 85: Hoare triple {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7871#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:53:14,843 INFO L272 TraceCheckUtils]: 84: Hoare triple {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7867#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:53:14,843 INFO L290 TraceCheckUtils]: 83: Hoare triple {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !false; {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 10:53:14,853 INFO L290 TraceCheckUtils]: 82: Hoare triple {7894#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7887#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 10:53:14,873 INFO L290 TraceCheckUtils]: 81: Hoare triple {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7894#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-28 10:53:14,873 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {7604#true} {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:53:14,874 INFO L290 TraceCheckUtils]: 79: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:14,874 INFO L290 TraceCheckUtils]: 78: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:14,874 INFO L290 TraceCheckUtils]: 77: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:14,874 INFO L272 TraceCheckUtils]: 76: Hoare triple {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:14,874 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {7604#true} {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:53:14,874 INFO L290 TraceCheckUtils]: 74: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:14,874 INFO L290 TraceCheckUtils]: 73: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:14,874 INFO L290 TraceCheckUtils]: 72: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:14,875 INFO L272 TraceCheckUtils]: 71: Hoare triple {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:14,875 INFO L290 TraceCheckUtils]: 70: Hoare triple {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !false; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:53:14,902 INFO L290 TraceCheckUtils]: 69: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7898#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-28 10:53:15,230 INFO L290 TraceCheckUtils]: 68: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 10:53:15,232 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #84#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 10:53:15,232 INFO L290 TraceCheckUtils]: 66: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,232 INFO L290 TraceCheckUtils]: 65: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,232 INFO L272 TraceCheckUtils]: 63: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,236 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #82#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 10:53:15,236 INFO L290 TraceCheckUtils]: 61: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,236 INFO L290 TraceCheckUtils]: 60: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,236 INFO L290 TraceCheckUtils]: 59: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,236 INFO L272 TraceCheckUtils]: 58: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !false; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 10:53:15,246 INFO L290 TraceCheckUtils]: 56: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !(~r~0 >= ~d~0); {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 10:53:15,247 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #80#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 10:53:15,247 INFO L290 TraceCheckUtils]: 54: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,247 INFO L290 TraceCheckUtils]: 53: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,247 INFO L290 TraceCheckUtils]: 52: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,247 INFO L272 TraceCheckUtils]: 51: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,248 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #78#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 10:53:15,248 INFO L290 TraceCheckUtils]: 49: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,248 INFO L290 TraceCheckUtils]: 48: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,248 INFO L290 TraceCheckUtils]: 47: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,249 INFO L272 TraceCheckUtils]: 46: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,250 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {7604#true} {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #76#return; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 10:53:15,250 INFO L290 TraceCheckUtils]: 44: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,250 INFO L290 TraceCheckUtils]: 43: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,250 INFO L290 TraceCheckUtils]: 42: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,250 INFO L272 TraceCheckUtils]: 41: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,254 INFO L290 TraceCheckUtils]: 40: Hoare triple {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !false; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 10:53:15,436 INFO L290 TraceCheckUtils]: 39: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7939#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-28 10:53:15,437 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {7604#true} {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #80#return; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 10:53:15,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,438 INFO L290 TraceCheckUtils]: 35: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,438 INFO L272 TraceCheckUtils]: 34: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,438 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {7604#true} {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #78#return; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 10:53:15,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,439 INFO L272 TraceCheckUtils]: 29: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,439 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {7604#true} {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #76#return; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 10:53:15,440 INFO L290 TraceCheckUtils]: 27: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,440 INFO L290 TraceCheckUtils]: 26: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,440 INFO L290 TraceCheckUtils]: 25: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,440 INFO L272 TraceCheckUtils]: 24: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,441 INFO L290 TraceCheckUtils]: 23: Hoare triple {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !false; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 10:53:15,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7935#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-28 10:53:15,474 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {7604#true} {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #80#return; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 10:53:15,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,474 INFO L272 TraceCheckUtils]: 17: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,474 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {7604#true} {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #78#return; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 10:53:15,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,475 INFO L272 TraceCheckUtils]: 12: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,475 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {7604#true} {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #76#return; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 10:53:15,475 INFO L290 TraceCheckUtils]: 10: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {7604#true} assume !(0 == ~cond); {7604#true} is VALID [2022-04-28 10:53:15,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {7604#true} ~cond := #in~cond; {7604#true} is VALID [2022-04-28 10:53:15,475 INFO L272 TraceCheckUtils]: 7: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {7604#true} is VALID [2022-04-28 10:53:15,476 INFO L290 TraceCheckUtils]: 6: Hoare triple {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !false; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 10:53:15,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {7604#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8078#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-28 10:53:15,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {7604#true} call #t~ret5 := main(); {7604#true} is VALID [2022-04-28 10:53:15,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7604#true} {7604#true} #90#return; {7604#true} is VALID [2022-04-28 10:53:15,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {7604#true} assume true; {7604#true} is VALID [2022-04-28 10:53:15,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {7604#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {7604#true} is VALID [2022-04-28 10:53:15,476 INFO L272 TraceCheckUtils]: 0: Hoare triple {7604#true} call ULTIMATE.init(); {7604#true} is VALID [2022-04-28 10:53:15,477 INFO L134 CoverageAnalysis]: Checked inductivity of 362 backedges. 26 proven. 24 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-28 10:53:15,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:53:15,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2009525184] [2022-04-28 10:53:15,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:53:15,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1134953513] [2022-04-28 10:53:15,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1134953513] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:53:15,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:53:15,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-28 10:53:15,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:53:15,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1670809376] [2022-04-28 10:53:15,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1670809376] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:53:15,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:53:15,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:53:15,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1172170193] [2022-04-28 10:53:15,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:53:15,479 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-28 10:53:15,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:53:15,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 10:53:15,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:53:15,524 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:53:15,524 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:53:15,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:53:15,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2022-04-28 10:53:15,524 INFO L87 Difference]: Start difference. First operand 83 states and 91 transitions. Second operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 10:53:16,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:53:16,651 INFO L93 Difference]: Finished difference Result 152 states and 176 transitions. [2022-04-28 10:53:16,651 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 10:53:16,651 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 88 [2022-04-28 10:53:16,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:53:16,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 10:53:16,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-04-28 10:53:16,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 10:53:16,656 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 115 transitions. [2022-04-28 10:53:16,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 115 transitions. [2022-04-28 10:53:16,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:53:16,755 INFO L225 Difference]: With dead ends: 152 [2022-04-28 10:53:16,755 INFO L226 Difference]: Without dead ends: 133 [2022-04-28 10:53:16,757 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 176 GetRequests, 158 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=64, Invalid=207, Unknown=1, NotChecked=0, Total=272 [2022-04-28 10:53:16,758 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-28 10:53:16,758 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 219 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-28 10:53:16,758 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-04-28 10:53:16,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 131. [2022-04-28 10:53:16,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:53:16,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 10:53:16,857 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 10:53:16,857 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 10:53:16,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:53:16,859 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-04-28 10:53:16,860 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-04-28 10:53:16,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:53:16,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:53:16,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 133 states. [2022-04-28 10:53:16,861 INFO L87 Difference]: Start difference. First operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 133 states. [2022-04-28 10:53:16,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:53:16,863 INFO L93 Difference]: Finished difference Result 133 states and 147 transitions. [2022-04-28 10:53:16,864 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 147 transitions. [2022-04-28 10:53:16,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:53:16,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:53:16,864 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:53:16,864 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:53:16,864 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 83 states have (on average 1.0843373493975903) internal successors, (90), 84 states have internal predecessors, (90), 28 states have call successors, (28), 20 states have call predecessors, (28), 19 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-28 10:53:16,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 144 transitions. [2022-04-28 10:53:16,867 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 144 transitions. Word has length 88 [2022-04-28 10:53:16,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:53:16,867 INFO L495 AbstractCegarLoop]: Abstraction has 131 states and 144 transitions. [2022-04-28 10:53:16,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.2) internal successors, (22), 9 states have internal predecessors, (22), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-28 10:53:16,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 144 transitions. [2022-04-28 10:53:17,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:53:17,066 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 144 transitions. [2022-04-28 10:53:17,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2022-04-28 10:53:17,067 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:53:17,067 INFO L195 NwaCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:53:17,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-28 10:53:17,271 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,SelfDestructingSolverStorable11 [2022-04-28 10:53:17,271 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:53:17,272 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:53:17,272 INFO L85 PathProgramCache]: Analyzing trace with hash 921896973, now seen corresponding path program 9 times [2022-04-28 10:53:17,272 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:53:17,272 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1603119089] [2022-04-28 10:53:21,353 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:53:21,353 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:53:21,353 INFO L85 PathProgramCache]: Analyzing trace with hash 921896973, now seen corresponding path program 10 times [2022-04-28 10:53:21,354 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:53:21,354 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066465817] [2022-04-28 10:53:21,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:53:21,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:53:21,369 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:53:21,370 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [879671831] [2022-04-28 10:53:21,370 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 10:53:21,370 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:53:21,370 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:53:21,372 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 10:53:21,376 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 10:53:21,435 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 10:53:21,435 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:53:21,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 188 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 10:53:21,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:53:21,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:53:24,287 INFO L272 TraceCheckUtils]: 0: Hoare triple {8981#true} call ULTIMATE.init(); {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {8981#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8981#true} {8981#true} #90#return; {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L272 TraceCheckUtils]: 4: Hoare triple {8981#true} call #t~ret5 := main(); {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {8981#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L290 TraceCheckUtils]: 6: Hoare triple {8981#true} assume !false; {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L272 TraceCheckUtils]: 7: Hoare triple {8981#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L290 TraceCheckUtils]: 10: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {8981#true} {8981#true} #76#return; {8981#true} is VALID [2022-04-28 10:53:24,287 INFO L272 TraceCheckUtils]: 12: Hoare triple {8981#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,288 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {8981#true} {8981#true} #78#return; {8981#true} is VALID [2022-04-28 10:53:24,288 INFO L272 TraceCheckUtils]: 17: Hoare triple {8981#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,288 INFO L290 TraceCheckUtils]: 18: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,288 INFO L290 TraceCheckUtils]: 19: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,288 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {8981#true} {8981#true} #80#return; {8981#true} is VALID [2022-04-28 10:53:24,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {8981#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9052#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:53:24,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {9052#(= (mod main_~p~0 2) 0)} assume !false; {9052#(= (mod main_~p~0 2) 0)} is VALID [2022-04-28 10:53:24,289 INFO L272 TraceCheckUtils]: 24: Hoare triple {9052#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,289 INFO L290 TraceCheckUtils]: 25: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:53:24,289 INFO L290 TraceCheckUtils]: 26: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:53:24,290 INFO L290 TraceCheckUtils]: 27: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:53:24,290 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9052#(= (mod main_~p~0 2) 0)} #76#return; {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,290 INFO L272 TraceCheckUtils]: 29: Hoare triple {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,290 INFO L290 TraceCheckUtils]: 31: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,290 INFO L290 TraceCheckUtils]: 32: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,291 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {8981#true} {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #78#return; {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,291 INFO L272 TraceCheckUtils]: 34: Hoare triple {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,291 INFO L290 TraceCheckUtils]: 35: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,291 INFO L290 TraceCheckUtils]: 36: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,291 INFO L290 TraceCheckUtils]: 37: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,292 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {8981#true} {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,293 INFO L290 TraceCheckUtils]: 39: Hoare triple {9073#(and (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,293 INFO L272 TraceCheckUtils]: 41: Hoare triple {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,293 INFO L290 TraceCheckUtils]: 42: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,293 INFO L290 TraceCheckUtils]: 43: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,293 INFO L290 TraceCheckUtils]: 44: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,294 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {8981#true} {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #76#return; {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,294 INFO L272 TraceCheckUtils]: 46: Hoare triple {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,294 INFO L290 TraceCheckUtils]: 47: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:53:24,294 INFO L290 TraceCheckUtils]: 48: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:53:24,295 INFO L290 TraceCheckUtils]: 49: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:53:24,295 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9107#(and (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #78#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,295 INFO L272 TraceCheckUtils]: 51: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,296 INFO L290 TraceCheckUtils]: 52: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,296 INFO L290 TraceCheckUtils]: 53: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,296 INFO L290 TraceCheckUtils]: 54: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,296 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {8981#true} {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #80#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,296 INFO L290 TraceCheckUtils]: 56: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !false; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,297 INFO L272 TraceCheckUtils]: 58: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,297 INFO L290 TraceCheckUtils]: 59: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,297 INFO L290 TraceCheckUtils]: 61: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,297 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {8981#true} {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #82#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,298 INFO L272 TraceCheckUtils]: 63: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,298 INFO L290 TraceCheckUtils]: 64: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,298 INFO L290 TraceCheckUtils]: 65: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,298 INFO L290 TraceCheckUtils]: 66: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,298 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {8981#true} {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} #84#return; {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-28 10:53:24,307 INFO L290 TraceCheckUtils]: 68: Hoare triple {9141#(and (= main_~A~0 main_~r~0) (= (mod (div main_~p~0 2) 2) 0) (= main_~q~0 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9196#(and (= main_~A~0 main_~r~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~q~0 0))} is VALID [2022-04-28 10:53:24,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {9196#(and (= main_~A~0 main_~r~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:53:24,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !false; {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:53:24,309 INFO L272 TraceCheckUtils]: 71: Hoare triple {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,309 INFO L290 TraceCheckUtils]: 72: Hoare triple {8981#true} ~cond := #in~cond; {8981#true} is VALID [2022-04-28 10:53:24,309 INFO L290 TraceCheckUtils]: 73: Hoare triple {8981#true} assume !(0 == ~cond); {8981#true} is VALID [2022-04-28 10:53:24,309 INFO L290 TraceCheckUtils]: 74: Hoare triple {8981#true} assume true; {8981#true} is VALID [2022-04-28 10:53:24,309 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {8981#true} {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #82#return; {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-28 10:53:24,309 INFO L272 TraceCheckUtils]: 76: Hoare triple {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,310 INFO L290 TraceCheckUtils]: 77: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:53:24,310 INFO L290 TraceCheckUtils]: 78: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:53:24,310 INFO L290 TraceCheckUtils]: 79: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:53:24,311 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9200#(and (= main_~q~0 main_~p~0) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {9234#(and (= main_~q~0 main_~p~0) (= main_~r~0 (+ main_~A~0 (* (- 1) (* main_~B~0 main_~p~0)))) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)))} is VALID [2022-04-28 10:53:24,312 INFO L290 TraceCheckUtils]: 81: Hoare triple {9234#(and (= main_~q~0 main_~p~0) (= main_~r~0 (+ main_~A~0 (* (- 1) (* main_~B~0 main_~p~0)))) (< (div (- main_~p~0) (- 2)) (+ (div main_~p~0 2) 1)))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9238#(and (= main_~p~0 (div main_~q~0 2)) (< (div (* (- 1) main_~q~0) (- 2)) (+ (div main_~q~0 2) 1)) (= (+ main_~A~0 (* (- 1) (* main_~B~0 main_~q~0))) main_~r~0))} is VALID [2022-04-28 10:53:24,315 INFO L290 TraceCheckUtils]: 82: Hoare triple {9238#(and (= main_~p~0 (div main_~q~0 2)) (< (div (* (- 1) main_~q~0) (- 2)) (+ (div main_~q~0 2) 1)) (= (+ main_~A~0 (* (- 1) (* main_~B~0 main_~q~0))) main_~r~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} is VALID [2022-04-28 10:53:24,316 INFO L290 TraceCheckUtils]: 83: Hoare triple {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} assume !false; {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} is VALID [2022-04-28 10:53:24,316 INFO L272 TraceCheckUtils]: 84: Hoare triple {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8981#true} is VALID [2022-04-28 10:53:24,316 INFO L290 TraceCheckUtils]: 85: Hoare triple {8981#true} ~cond := #in~cond; {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:53:24,317 INFO L290 TraceCheckUtils]: 86: Hoare triple {9062#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:53:24,317 INFO L290 TraceCheckUtils]: 87: Hoare triple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:53:24,320 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {9066#(not (= |__VERIFIER_assert_#in~cond| 0))} {9242#(and (< (div (+ main_~p~0 (* (- 1) main_~q~0)) (- 2)) (+ (div (+ main_~q~0 (* (- 1) main_~p~0)) 2) 1)) (= main_~p~0 (div (+ main_~q~0 (* (- 1) main_~p~0)) 2)) (= main_~r~0 (+ (* (- 1) main_~d~0) (* (- 1) (* main_~B~0 (+ main_~q~0 (* (- 1) main_~p~0)))) main_~A~0)))} #82#return; {9261#(exists ((aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 Int) (aux_div_main_~q~0_41 Int) (aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77 Int)) (and (<= (+ (* 2 aux_div_main_~q~0_41) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (<= (+ (* main_~p~0 2) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (= (* main_~B~0 main_~p~0) main_~d~0) (<= 0 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (< (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77) (+ (* main_~p~0 2) 2 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77)) (< aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 (+ aux_div_main_~q~0_41 1))))} is VALID [2022-04-28 10:53:24,320 INFO L272 TraceCheckUtils]: 89: Hoare triple {9261#(exists ((aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 Int) (aux_div_main_~q~0_41 Int) (aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77 Int)) (and (<= (+ (* 2 aux_div_main_~q~0_41) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (<= (+ (* main_~p~0 2) aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77)) (= (* main_~B~0 main_~p~0) main_~d~0) (<= 0 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77) (< (* 2 aux_div_aux_mod_aux_mod_main_~q~0_41_59_77) (+ (* main_~p~0 2) 2 aux_mod_aux_mod_aux_mod_main_~q~0_41_59_77)) (< aux_div_aux_mod_aux_mod_main_~q~0_41_59_77 (+ aux_div_main_~q~0_41 1))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9265#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:53:24,321 INFO L290 TraceCheckUtils]: 90: Hoare triple {9265#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9269#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:53:24,321 INFO L290 TraceCheckUtils]: 91: Hoare triple {9269#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8982#false} is VALID [2022-04-28 10:53:24,321 INFO L290 TraceCheckUtils]: 92: Hoare triple {8982#false} assume !false; {8982#false} is VALID [2022-04-28 10:53:24,322 INFO L134 CoverageAnalysis]: Checked inductivity of 418 backedges. 126 proven. 48 refuted. 0 times theorem prover too weak. 244 trivial. 0 not checked. [2022-04-28 10:53:24,322 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:53:51,724 WARN L828 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-28 10:54:02,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:54:02,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1066465817] [2022-04-28 10:54:02,923 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:54:02,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [879671831] [2022-04-28 10:54:02,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [879671831] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-28 10:54:02,923 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-28 10:54:02,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16] total 16 [2022-04-28 10:54:02,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:54:02,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1603119089] [2022-04-28 10:54:02,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1603119089] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:54:02,924 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:54:02,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 10:54:02,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274692061] [2022-04-28 10:54:02,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:54:02,924 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 93 [2022-04-28 10:54:02,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:54:02,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 10:54:03,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:54:03,001 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 10:54:03,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:54:03,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 10:54:03,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=353, Unknown=0, NotChecked=0, Total=420 [2022-04-28 10:54:03,002 INFO L87 Difference]: Start difference. First operand 131 states and 144 transitions. Second operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 10:54:08,865 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 10:54:10,869 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 10:54:12,873 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 10:54:14,875 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 10:54:15,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:54:15,667 INFO L93 Difference]: Finished difference Result 150 states and 171 transitions. [2022-04-28 10:54:15,667 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-28 10:54:15,667 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) Word has length 93 [2022-04-28 10:54:15,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:54:15,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 10:54:15,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-28 10:54:15,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 10:54:15,671 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 83 transitions. [2022-04-28 10:54:15,671 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 83 transitions. [2022-04-28 10:54:15,755 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 10:54:15,758 INFO L225 Difference]: With dead ends: 150 [2022-04-28 10:54:15,758 INFO L226 Difference]: Without dead ends: 148 [2022-04-28 10:54:15,758 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 84 SyntacticMatches, 2 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=98, Invalid=502, Unknown=0, NotChecked=0, Total=600 [2022-04-28 10:54:15,759 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 19 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 399 mSolverCounterSat, 28 mSolverCounterUnsat, 4 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 9.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 399 IncrementalHoareTripleChecker+Invalid, 4 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 9.1s IncrementalHoareTripleChecker+Time [2022-04-28 10:54:15,759 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 198 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 399 Invalid, 4 Unknown, 59 Unchecked, 9.1s Time] [2022-04-28 10:54:15,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-28 10:54:15,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2022-04-28 10:54:15,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:54:15,879 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 10:54:15,879 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 10:54:15,880 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 10:54:15,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:54:15,883 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2022-04-28 10:54:15,883 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2022-04-28 10:54:15,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:54:15,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:54:15,884 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 148 states. [2022-04-28 10:54:15,884 INFO L87 Difference]: Start difference. First operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) Second operand 148 states. [2022-04-28 10:54:15,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:54:15,887 INFO L93 Difference]: Finished difference Result 148 states and 169 transitions. [2022-04-28 10:54:15,887 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 169 transitions. [2022-04-28 10:54:15,888 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:54:15,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:54:15,888 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:54:15,888 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:54:15,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 90 states have (on average 1.0888888888888888) internal successors, (98), 94 states have internal predecessors, (98), 33 states have call successors, (33), 21 states have call predecessors, (33), 20 states have return successors, (31), 28 states have call predecessors, (31), 31 states have call successors, (31) [2022-04-28 10:54:15,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 162 transitions. [2022-04-28 10:54:15,892 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 162 transitions. Word has length 93 [2022-04-28 10:54:15,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:54:15,892 INFO L495 AbstractCegarLoop]: Abstraction has 144 states and 162 transitions. [2022-04-28 10:54:15,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 1.6666666666666667) internal successors, (25), 12 states have internal predecessors, (25), 8 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 7 states have call successors, (15) [2022-04-28 10:54:15,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 162 transitions. [2022-04-28 10:54:16,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:54:16,171 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 162 transitions. [2022-04-28 10:54:16,172 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-28 10:54:16,172 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 10:54:16,172 INFO L195 NwaCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 10:54:16,196 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 10:54:16,387 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,SelfDestructingSolverStorable12 [2022-04-28 10:54:16,388 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 10:54:16,388 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 10:54:16,388 INFO L85 PathProgramCache]: Analyzing trace with hash 2013246961, now seen corresponding path program 5 times [2022-04-28 10:54:16,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 10:54:16,388 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [119383460] [2022-04-28 10:54:18,783 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-28 10:54:18,783 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-28 10:54:18,783 INFO L85 PathProgramCache]: Analyzing trace with hash 2013246961, now seen corresponding path program 6 times [2022-04-28 10:54:18,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 10:54:18,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1525084261] [2022-04-28 10:54:18,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 10:54:18,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 10:54:18,792 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 10:54:18,792 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [972337475] [2022-04-28 10:54:18,792 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 10:54:18,792 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 10:54:18,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 10:54:18,795 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 10:54:18,796 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 10:54:18,856 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 10:54:18,856 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 10:54:18,857 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 10:54:18,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 10:54:18,871 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 10:54:19,112 INFO L272 TraceCheckUtils]: 0: Hoare triple {10211#true} call ULTIMATE.init(); {10211#true} is VALID [2022-04-28 10:54:19,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {10211#true} is VALID [2022-04-28 10:54:19,113 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,113 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #90#return; {10211#true} is VALID [2022-04-28 10:54:19,113 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret5 := main(); {10211#true} is VALID [2022-04-28 10:54:19,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {10211#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,113 INFO L290 TraceCheckUtils]: 6: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,113 INFO L272 TraceCheckUtils]: 7: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,114 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #76#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,114 INFO L272 TraceCheckUtils]: 12: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,114 INFO L290 TraceCheckUtils]: 13: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,114 INFO L290 TraceCheckUtils]: 14: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,114 INFO L290 TraceCheckUtils]: 15: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,115 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #78#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,115 INFO L272 TraceCheckUtils]: 17: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,115 INFO L290 TraceCheckUtils]: 18: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,115 INFO L290 TraceCheckUtils]: 19: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,115 INFO L290 TraceCheckUtils]: 20: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,115 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #80#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,116 INFO L290 TraceCheckUtils]: 22: Hoare triple {10231#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,116 INFO L290 TraceCheckUtils]: 23: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,116 INFO L272 TraceCheckUtils]: 24: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,116 INFO L290 TraceCheckUtils]: 25: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,116 INFO L290 TraceCheckUtils]: 26: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,116 INFO L290 TraceCheckUtils]: 27: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,116 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #76#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,116 INFO L272 TraceCheckUtils]: 29: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,117 INFO L290 TraceCheckUtils]: 30: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,117 INFO L290 TraceCheckUtils]: 31: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,117 INFO L290 TraceCheckUtils]: 32: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,117 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #78#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,117 INFO L272 TraceCheckUtils]: 34: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,117 INFO L290 TraceCheckUtils]: 35: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,117 INFO L290 TraceCheckUtils]: 36: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,117 INFO L290 TraceCheckUtils]: 37: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,118 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #80#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,118 INFO L290 TraceCheckUtils]: 39: Hoare triple {10231#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,118 INFO L290 TraceCheckUtils]: 40: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,118 INFO L272 TraceCheckUtils]: 41: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,119 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #76#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,119 INFO L272 TraceCheckUtils]: 46: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,119 INFO L290 TraceCheckUtils]: 47: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,119 INFO L290 TraceCheckUtils]: 48: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,119 INFO L290 TraceCheckUtils]: 49: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,119 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #78#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,119 INFO L272 TraceCheckUtils]: 51: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,120 INFO L290 TraceCheckUtils]: 52: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,120 INFO L290 TraceCheckUtils]: 53: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,120 INFO L290 TraceCheckUtils]: 54: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,120 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #80#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,120 INFO L290 TraceCheckUtils]: 56: Hoare triple {10231#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,121 INFO L290 TraceCheckUtils]: 57: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,121 INFO L272 TraceCheckUtils]: 58: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,121 INFO L290 TraceCheckUtils]: 59: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,121 INFO L290 TraceCheckUtils]: 60: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,121 INFO L290 TraceCheckUtils]: 61: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,121 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #82#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,121 INFO L272 TraceCheckUtils]: 63: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,121 INFO L290 TraceCheckUtils]: 64: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,121 INFO L290 TraceCheckUtils]: 65: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,121 INFO L290 TraceCheckUtils]: 66: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,122 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #84#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,122 INFO L290 TraceCheckUtils]: 68: Hoare triple {10231#(= main_~B~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,122 INFO L290 TraceCheckUtils]: 69: Hoare triple {10231#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,123 INFO L290 TraceCheckUtils]: 70: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,123 INFO L272 TraceCheckUtils]: 71: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,123 INFO L290 TraceCheckUtils]: 72: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,123 INFO L290 TraceCheckUtils]: 73: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,123 INFO L290 TraceCheckUtils]: 74: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,123 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #82#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,123 INFO L272 TraceCheckUtils]: 76: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,123 INFO L290 TraceCheckUtils]: 77: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:19,124 INFO L290 TraceCheckUtils]: 78: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:19,124 INFO L290 TraceCheckUtils]: 79: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:19,124 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10211#true} {10231#(= main_~B~0 1)} #84#return; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,124 INFO L290 TraceCheckUtils]: 81: Hoare triple {10231#(= main_~B~0 1)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,124 INFO L290 TraceCheckUtils]: 82: Hoare triple {10231#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,125 INFO L290 TraceCheckUtils]: 83: Hoare triple {10231#(= main_~B~0 1)} assume !false; {10231#(= main_~B~0 1)} is VALID [2022-04-28 10:54:19,125 INFO L272 TraceCheckUtils]: 84: Hoare triple {10231#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,125 INFO L290 TraceCheckUtils]: 85: Hoare triple {10211#true} ~cond := #in~cond; {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:54:19,125 INFO L290 TraceCheckUtils]: 86: Hoare triple {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:54:19,126 INFO L290 TraceCheckUtils]: 87: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:54:19,126 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10231#(= main_~B~0 1)} #82#return; {10483#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-28 10:54:19,126 INFO L272 TraceCheckUtils]: 89: Hoare triple {10483#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:19,126 INFO L290 TraceCheckUtils]: 90: Hoare triple {10211#true} ~cond := #in~cond; {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:54:19,127 INFO L290 TraceCheckUtils]: 91: Hoare triple {10472#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:54:19,127 INFO L290 TraceCheckUtils]: 92: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:54:19,128 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10483#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #84#return; {10499#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} is VALID [2022-04-28 10:54:19,128 INFO L290 TraceCheckUtils]: 94: Hoare triple {10499#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} assume !(1 != ~p~0); {10503#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} is VALID [2022-04-28 10:54:19,129 INFO L272 TraceCheckUtils]: 95: Hoare triple {10503#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:54:19,129 INFO L290 TraceCheckUtils]: 96: Hoare triple {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10511#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:54:19,130 INFO L290 TraceCheckUtils]: 97: Hoare triple {10511#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10212#false} is VALID [2022-04-28 10:54:19,130 INFO L290 TraceCheckUtils]: 98: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-28 10:54:19,131 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 108 proven. 4 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-28 10:54:19,131 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 10:54:34,469 INFO L290 TraceCheckUtils]: 98: Hoare triple {10212#false} assume !false; {10212#false} is VALID [2022-04-28 10:54:34,470 INFO L290 TraceCheckUtils]: 97: Hoare triple {10511#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {10212#false} is VALID [2022-04-28 10:54:34,470 INFO L290 TraceCheckUtils]: 96: Hoare triple {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {10511#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 10:54:34,470 INFO L272 TraceCheckUtils]: 95: Hoare triple {10527#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10507#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 10:54:34,471 INFO L290 TraceCheckUtils]: 94: Hoare triple {10531#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {10527#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 10:54:34,473 INFO L284 TraceCheckUtils]: 93: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10535#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #84#return; {10531#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-28 10:54:34,473 INFO L290 TraceCheckUtils]: 92: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:54:34,473 INFO L290 TraceCheckUtils]: 91: Hoare triple {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:54:34,474 INFO L290 TraceCheckUtils]: 90: Hoare triple {10211#true} ~cond := #in~cond; {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:54:34,474 INFO L272 TraceCheckUtils]: 89: Hoare triple {10535#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,474 INFO L284 TraceCheckUtils]: 88: Hoare quadruple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} {10211#true} #82#return; {10535#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-28 10:54:34,475 INFO L290 TraceCheckUtils]: 87: Hoare triple {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:54:34,475 INFO L290 TraceCheckUtils]: 86: Hoare triple {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {10476#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 10:54:34,475 INFO L290 TraceCheckUtils]: 85: Hoare triple {10211#true} ~cond := #in~cond; {10545#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 10:54:34,475 INFO L272 TraceCheckUtils]: 84: Hoare triple {10211#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,475 INFO L290 TraceCheckUtils]: 83: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 10:54:34,475 INFO L290 TraceCheckUtils]: 82: Hoare triple {10211#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10211#true} is VALID [2022-04-28 10:54:34,475 INFO L290 TraceCheckUtils]: 81: Hoare triple {10211#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {10211#true} {10211#true} #84#return; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 79: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 78: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 77: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L272 TraceCheckUtils]: 76: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L284 TraceCheckUtils]: 75: Hoare quadruple {10211#true} {10211#true} #82#return; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 74: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 73: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 72: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L272 TraceCheckUtils]: 71: Hoare triple {10211#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 70: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 69: Hoare triple {10211#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 68: Hoare triple {10211#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {10211#true} {10211#true} #84#return; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 66: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 65: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L290 TraceCheckUtils]: 64: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,476 INFO L272 TraceCheckUtils]: 63: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {10211#true} {10211#true} #82#return; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 61: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 60: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 59: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L272 TraceCheckUtils]: 58: Hoare triple {10211#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 57: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 56: Hoare triple {10211#true} assume !(~r~0 >= ~d~0); {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10211#true} {10211#true} #80#return; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 54: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 53: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 52: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L272 TraceCheckUtils]: 51: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10211#true} {10211#true} #78#return; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 49: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 48: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L290 TraceCheckUtils]: 47: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L272 TraceCheckUtils]: 46: Hoare triple {10211#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,477 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10211#true} {10211#true} #76#return; {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L290 TraceCheckUtils]: 44: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L290 TraceCheckUtils]: 43: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L272 TraceCheckUtils]: 41: Hoare triple {10211#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {10211#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L284 TraceCheckUtils]: 38: Hoare quadruple {10211#true} {10211#true} #80#return; {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L290 TraceCheckUtils]: 37: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L290 TraceCheckUtils]: 36: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L290 TraceCheckUtils]: 35: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L272 TraceCheckUtils]: 34: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,478 INFO L284 TraceCheckUtils]: 33: Hoare quadruple {10211#true} {10211#true} #78#return; {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L290 TraceCheckUtils]: 31: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L290 TraceCheckUtils]: 30: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L272 TraceCheckUtils]: 29: Hoare triple {10211#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {10211#true} {10211#true} #76#return; {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L290 TraceCheckUtils]: 27: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L290 TraceCheckUtils]: 26: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L290 TraceCheckUtils]: 25: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L272 TraceCheckUtils]: 24: Hoare triple {10211#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L290 TraceCheckUtils]: 23: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L290 TraceCheckUtils]: 22: Hoare triple {10211#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10211#true} is VALID [2022-04-28 10:54:34,479 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {10211#true} {10211#true} #80#return; {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L290 TraceCheckUtils]: 19: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L290 TraceCheckUtils]: 18: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L272 TraceCheckUtils]: 17: Hoare triple {10211#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L284 TraceCheckUtils]: 16: Hoare quadruple {10211#true} {10211#true} #78#return; {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L290 TraceCheckUtils]: 13: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L272 TraceCheckUtils]: 12: Hoare triple {10211#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {10211#true} {10211#true} #76#return; {10211#true} is VALID [2022-04-28 10:54:34,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {10211#true} assume !(0 == ~cond); {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {10211#true} ~cond := #in~cond; {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L272 TraceCheckUtils]: 7: Hoare triple {10211#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L290 TraceCheckUtils]: 6: Hoare triple {10211#true} assume !false; {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L290 TraceCheckUtils]: 5: Hoare triple {10211#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L272 TraceCheckUtils]: 4: Hoare triple {10211#true} call #t~ret5 := main(); {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10211#true} {10211#true} #90#return; {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {10211#true} assume true; {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {10211#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3); {10211#true} is VALID [2022-04-28 10:54:34,481 INFO L272 TraceCheckUtils]: 0: Hoare triple {10211#true} call ULTIMATE.init(); {10211#true} is VALID [2022-04-28 10:54:34,482 INFO L134 CoverageAnalysis]: Checked inductivity of 478 backedges. 110 proven. 2 refuted. 0 times theorem prover too weak. 366 trivial. 0 not checked. [2022-04-28 10:54:34,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 10:54:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1525084261] [2022-04-28 10:54:34,482 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 10:54:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972337475] [2022-04-28 10:54:34,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972337475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 10:54:34,482 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 10:54:34,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 14 [2022-04-28 10:54:34,482 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 10:54:34,482 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [119383460] [2022-04-28 10:54:34,482 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [119383460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 10:54:34,482 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 10:54:34,482 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 10:54:34,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266067404] [2022-04-28 10:54:34,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 10:54:34,483 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-28 10:54:34,483 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 10:54:34,483 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:54:34,511 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 10:54:34,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 10:54:34,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 10:54:34,511 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 10:54:34,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2022-04-28 10:54:34,511 INFO L87 Difference]: Start difference. First operand 144 states and 162 transitions. Second operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:54:34,999 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:54:35,000 INFO L93 Difference]: Finished difference Result 144 states and 162 transitions. [2022-04-28 10:54:35,000 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 10:54:35,000 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-28 10:54:35,000 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 10:54:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:54:35,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 10:54:35,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:54:35,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 43 transitions. [2022-04-28 10:54:35,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 43 transitions. [2022-04-28 10:54:35,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:54:35,050 INFO L225 Difference]: With dead ends: 144 [2022-04-28 10:54:35,050 INFO L226 Difference]: Without dead ends: 0 [2022-04-28 10:54:35,051 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 201 GetRequests, 184 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2022-04-28 10:54:35,051 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 23 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 10:54:35,052 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 70 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 10:54:35,052 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-04-28 10:54:35,052 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-04-28 10:54:35,052 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 10:54:35,052 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:54:35,052 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:54:35,053 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:54:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:54:35,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:54:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:54:35,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:54:35,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:54:35,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:54:35,053 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-04-28 10:54:35,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 10:54:35,053 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-04-28 10:54:35,053 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:54:35,053 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:54:35,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 10:54:35,054 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 10:54:35,054 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 10:54:35,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-04-28 10:54:35,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-04-28 10:54:35,054 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 99 [2022-04-28 10:54:35,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 10:54:35,054 INFO L495 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-04-28 10:54:35,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 8 states have (on average 2.375) internal successors, (19), 7 states have internal predecessors, (19), 4 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (8), 4 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-28 10:54:35,054 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 0 states and 0 transitions. [2022-04-28 10:54:35,054 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 10:54:35,054 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-04-28 10:54:35,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 10:54:35,057 INFO L805 garLoopResultBuilder]: Registering result SAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 10:54:35,075 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 10:54:35,267 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,SelfDestructingSolverStorable13 [2022-04-28 10:54:35,269 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-04-28 10:54:39,866 INFO L899 garLoopResultBuilder]: For program point reach_errorEXIT(line 8) no Hoare annotation was computed. [2022-04-28 10:54:39,866 INFO L899 garLoopResultBuilder]: For program point reach_errorENTRY(line 8) no Hoare annotation was computed. [2022-04-28 10:54:39,866 INFO L899 garLoopResultBuilder]: For program point reach_errorFINAL(line 8) no Hoare annotation was computed. [2022-04-28 10:54:39,866 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notENTRY(lines 11 13) no Hoare annotation was computed. [2022-04-28 10:54:39,866 INFO L899 garLoopResultBuilder]: For program point L12(line 12) no Hoare annotation was computed. [2022-04-28 10:54:39,866 INFO L899 garLoopResultBuilder]: For program point L12-2(lines 11 13) no Hoare annotation was computed. [2022-04-28 10:54:39,866 INFO L899 garLoopResultBuilder]: For program point assume_abort_if_notEXIT(lines 11 13) no Hoare annotation was computed. [2022-04-28 10:54:39,867 INFO L895 garLoopResultBuilder]: At program point L33-2(lines 33 41) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 10:54:39,867 INFO L902 garLoopResultBuilder]: At program point L58(line 58) the Hoare annotation is: true [2022-04-28 10:54:39,867 INFO L902 garLoopResultBuilder]: At program point mainEXIT(lines 22 60) the Hoare annotation is: true [2022-04-28 10:54:39,867 INFO L902 garLoopResultBuilder]: At program point mainFINAL(lines 22 60) the Hoare annotation is: true [2022-04-28 10:54:39,867 INFO L895 garLoopResultBuilder]: At program point L44(line 44) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 10:54:39,867 INFO L895 garLoopResultBuilder]: At program point L44-1(line 44) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 10:54:39,867 INFO L895 garLoopResultBuilder]: At program point L36(lines 33 41) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 10:54:39,867 INFO L895 garLoopResultBuilder]: At program point L34(line 34) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 10:54:39,867 INFO L895 garLoopResultBuilder]: At program point L34-1(line 34) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 10:54:39,867 INFO L902 garLoopResultBuilder]: At program point mainENTRY(lines 22 60) the Hoare annotation is: true [2022-04-28 10:54:39,867 INFO L895 garLoopResultBuilder]: At program point L57(line 57) the Hoare annotation is: (and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1)) [2022-04-28 10:54:39,867 INFO L895 garLoopResultBuilder]: At program point L51(lines 51 54) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 10:54:39,867 INFO L895 garLoopResultBuilder]: At program point L51-2(lines 22 60) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 10:54:39,868 INFO L895 garLoopResultBuilder]: At program point L45(lines 43 55) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 10:54:39,868 INFO L895 garLoopResultBuilder]: At program point L43-1(lines 43 55) the Hoare annotation is: (and (= main_~d~0 main_~p~0) (= main_~d~0 1) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)) [2022-04-28 10:54:39,868 INFO L895 garLoopResultBuilder]: At program point L35(line 35) the Hoare annotation is: (let ((.cse0 (= main_~q~0 0)) (.cse1 (= main_~B~0 1)) (.cse2 (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))) (or (and .cse0 .cse1 .cse2 (= main_~B~0 main_~d~0) (= main_~p~0 1)) (let ((.cse3 (div main_~d~0 2))) (and (= (* main_~B~0 main_~p~0) main_~d~0) (<= .cse3 main_~r~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) .cse0 .cse1 (= (mod main_~p~0 2) 0) (<= 1 (div .cse3 2)) .cse2)) (and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) .cse0 .cse1 .cse2))) [2022-04-28 10:54:39,868 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:54:39,868 INFO L895 garLoopResultBuilder]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: (and (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|)) [2022-04-28 10:54:39,868 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.initEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:54:39,868 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startEXIT(line -1) the Hoare annotation is: true [2022-04-28 10:54:39,868 INFO L902 garLoopResultBuilder]: At program point L-1(line -1) the Hoare annotation is: true [2022-04-28 10:54:39,868 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2022-04-28 10:54:39,868 INFO L902 garLoopResultBuilder]: At program point ULTIMATE.startFINAL(line -1) the Hoare annotation is: true [2022-04-28 10:54:39,868 INFO L895 garLoopResultBuilder]: At program point L16(lines 16 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 10:54:39,868 INFO L895 garLoopResultBuilder]: At program point L15(lines 15 18) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 10:54:39,868 INFO L902 garLoopResultBuilder]: At program point __VERIFIER_assertENTRY(lines 14 20) the Hoare annotation is: true [2022-04-28 10:54:39,868 INFO L895 garLoopResultBuilder]: At program point L15-2(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 10:54:39,868 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertEXIT(lines 14 20) the Hoare annotation is: (or (= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond) (not (<= 1 |__VERIFIER_assert_#in~cond|))) [2022-04-28 10:54:39,868 INFO L895 garLoopResultBuilder]: At program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 17) the Hoare annotation is: (not (<= 1 |__VERIFIER_assert_#in~cond|)) [2022-04-28 10:54:39,871 INFO L356 BasicCegarLoop]: Path program histogram: [10, 6, 2, 2, 2, 2, 2, 2] [2022-04-28 10:54:39,872 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 10:54:39,874 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 10:54:39,883 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 10:54:39,884 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 10:54:39,884 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 10:54:39,885 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 10:54:39,889 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 10:54:39,908 INFO L163 areAnnotationChecker]: CFG has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 10:54:39,917 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 10:54:39 BoogieIcfgContainer [2022-04-28 10:54:39,917 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 10:54:39,918 INFO L158 Benchmark]: Toolchain (without parser) took 400397.11ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 129.9MB in the beginning and 132.8MB in the end (delta: -2.9MB). Peak memory consumption was 104.5MB. Max. memory is 8.0GB. [2022-04-28 10:54:39,918 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 146.1MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 10:54:39,919 INFO L158 Benchmark]: CACSL2BoogieTranslator took 264.96ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 129.7MB in the beginning and 194.1MB in the end (delta: -64.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 10:54:39,919 INFO L158 Benchmark]: Boogie Preprocessor took 33.59ms. Allocated memory is still 217.1MB. Free memory was 194.1MB in the beginning and 192.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 10:54:39,919 INFO L158 Benchmark]: RCFGBuilder took 261.20ms. Allocated memory is still 217.1MB. Free memory was 192.5MB in the beginning and 180.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 10:54:39,919 INFO L158 Benchmark]: TraceAbstraction took 399832.38ms. Allocated memory is still 217.1MB. Free memory was 179.9MB in the beginning and 132.8MB in the end (delta: 47.1MB). Peak memory consumption was 118.4MB. Max. memory is 8.0GB. [2022-04-28 10:54:39,921 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 180.4MB. Free memory was 146.2MB in the beginning and 146.1MB in the end (delta: 136.4kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 264.96ms. Allocated memory was 180.4MB in the beginning and 217.1MB in the end (delta: 36.7MB). Free memory was 129.7MB in the beginning and 194.1MB in the end (delta: -64.3MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 33.59ms. Allocated memory is still 217.1MB. Free memory was 194.1MB in the beginning and 192.5MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 261.20ms. Allocated memory is still 217.1MB. Free memory was 192.5MB in the beginning and 180.5MB in the end (delta: 12.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 399832.38ms. Allocated memory is still 217.1MB. Free memory was 179.9MB in the beginning and 132.8MB in the end (delta: 47.1MB). Peak memory consumption was 118.4MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 17]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 36 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 399.7s, OverallIterations: 14, TraceHistogramMax: 16, PathProgramHistogramMax: 10, EmptinessCheckTime: 0.0s, AutomataDifference: 35.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 4.6s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 9 mSolverCounterUnknown, 271 SdHoareTripleChecker+Valid, 21.4s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 219 mSDsluCounter, 1576 SdHoareTripleChecker+Invalid, 21.4s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 135 IncrementalHoareTripleChecker+Unchecked, 1112 mSDsCounter, 216 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2333 IncrementalHoareTripleChecker+Invalid, 2693 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 216 mSolverCounterUnsat, 464 mSDtfsCounter, 2333 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 1316 GetRequests, 1146 SyntacticMatches, 18 SemanticMatches, 152 ConstructedPredicates, 0 IntricatePredicates, 2 DeprecatedPredicates, 377 ImplicationChecksByTransitivity, 50.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=144occurred in iteration=13, InterpolantAutomatonStates: 111, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.9s AutomataMinimizationTime, 14 MinimizatonAttempts, 37 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 29 LocationsWithAnnotation, 563 PreInvPairs, 795 NumberOfFragments, 582 HoareAnnotationTreeSize, 563 FomulaSimplifications, 1034 FormulaSimplificationTreeSizeReduction, 0.9s HoareSimplificationTime, 29 FomulaSimplificationsInter, 3734 FormulaSimplificationTreeSizeReductionInter, 3.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 33]: Loop Invariant Derived loop invariant: (((((q == 0 && B == 1) && B * q + r == A) && B == d) && p == 1) || (((((((B * p == d && d / 2 <= r) && -p / -2 % 2 == 0) && q == 0) && B == 1) && p % 2 == 0) && 1 <= d / 2 / 2) && B * q + r == A)) || ((((B * 2 == d && p == 2) && q == 0) && B == 1) && B * q + r == A) - ProcedureContractResult [Line: 22]: Procedure Contract for main Derived contract for procedure main: 1 - ProcedureContractResult [Line: 14]: Procedure Contract for __VERIFIER_assert Derived contract for procedure __VERIFIER_assert: \old(cond) == cond || !(1 <= \old(cond)) RESULT: Ultimate proved your program to be correct! [2022-04-28 10:54:39,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...