/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 13:12:07,404 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 13:12:07,406 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 13:12:07,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 13:12:07,429 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 13:12:07,430 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 13:12:07,431 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 13:12:07,433 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 13:12:07,434 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 13:12:07,435 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 13:12:07,436 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 13:12:07,436 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 13:12:07,437 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 13:12:07,438 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 13:12:07,438 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 13:12:07,439 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 13:12:07,440 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 13:12:07,441 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 13:12:07,442 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 13:12:07,443 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 13:12:07,444 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 13:12:07,445 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 13:12:07,446 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 13:12:07,447 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 13:12:07,447 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 13:12:07,450 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 13:12:07,450 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 13:12:07,450 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 13:12:07,451 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 13:12:07,451 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 13:12:07,452 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 13:12:07,452 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 13:12:07,452 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 13:12:07,453 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 13:12:07,454 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 13:12:07,454 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 13:12:07,455 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 13:12:07,455 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 13:12:07,455 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 13:12:07,456 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 13:12:07,456 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 13:12:07,460 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 13:12:07,460 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 13:12:07,466 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 13:12:07,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 13:12:07,468 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 13:12:07,468 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 13:12:07,468 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 13:12:07,468 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 13:12:07,469 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 13:12:07,469 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 13:12:07,469 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 13:12:07,469 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 13:12:07,469 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 13:12:07,469 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 13:12:07,470 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 13:12:07,470 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 13:12:07,470 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 13:12:07,470 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:12:07,470 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 13:12:07,470 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 13:12:07,470 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 13:12:07,471 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 13:12:07,471 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 13:12:07,471 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 13:12:07,471 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-08 13:12:07,667 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 13:12:07,684 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 13:12:07,686 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 13:12:07,687 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 13:12:07,687 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 13:12:07,688 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c [2022-04-08 13:12:07,740 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f2c861f/2c2814b23dd64658888dc32981ee32af/FLAG536944a96 [2022-04-08 13:12:08,070 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 13:12:08,071 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c [2022-04-08 13:12:08,077 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f2c861f/2c2814b23dd64658888dc32981ee32af/FLAG536944a96 [2022-04-08 13:12:08,087 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/51f2c861f/2c2814b23dd64658888dc32981ee32af [2022-04-08 13:12:08,088 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 13:12:08,089 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 13:12:08,091 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 13:12:08,091 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 13:12:08,102 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 13:12:08,103 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,104 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c260793 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08, skipping insertion in model container [2022-04-08 13:12:08,104 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,110 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 13:12:08,123 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 13:12:08,253 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c[526,539] [2022-04-08 13:12:08,286 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:12:08,293 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 13:12:08,304 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/hard2_unwindbound100.c[526,539] [2022-04-08 13:12:08,310 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:12:08,320 INFO L208 MainTranslator]: Completed translation [2022-04-08 13:12:08,321 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08 WrapperNode [2022-04-08 13:12:08,321 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 13:12:08,322 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 13:12:08,322 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 13:12:08,322 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 13:12:08,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,335 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,335 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,340 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,343 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,344 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,346 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 13:12:08,347 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 13:12:08,347 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 13:12:08,347 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 13:12:08,348 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08" (1/1) ... [2022-04-08 13:12:08,356 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:12:08,367 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:08,377 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-08 13:12:08,378 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-08 13:12:08,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 13:12:08,402 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 13:12:08,402 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 13:12:08,402 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 13:12:08,402 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 13:12:08,403 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 13:12:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 13:12:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 13:12:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 13:12:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 13:12:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 13:12:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 13:12:08,403 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 13:12:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 13:12:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 13:12:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 13:12:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 13:12:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 13:12:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 13:12:08,404 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 13:12:08,456 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 13:12:08,458 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 13:12:08,583 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 13:12:08,589 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 13:12:08,589 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-04-08 13:12:08,591 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:12:08 BoogieIcfgContainer [2022-04-08 13:12:08,591 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 13:12:08,592 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 13:12:08,592 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 13:12:08,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 13:12:08,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:12:08" (1/3) ... [2022-04-08 13:12:08,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf554e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:12:08, skipping insertion in model container [2022-04-08 13:12:08,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:12:08" (2/3) ... [2022-04-08 13:12:08,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5bf554e5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:12:08, skipping insertion in model container [2022-04-08 13:12:08,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:12:08" (3/3) ... [2022-04-08 13:12:08,605 INFO L111 eAbstractionObserver]: Analyzing ICFG hard2_unwindbound100.c [2022-04-08 13:12:08,608 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 13:12:08,608 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 13:12:08,658 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 13:12:08,664 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 13:12:08,664 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 13:12:08,681 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:12:08,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 13:12:08,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:08,689 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:08,690 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:08,694 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:08,694 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 1 times [2022-04-08 13:12:08,700 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:08,700 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [521271121] [2022-04-08 13:12:08,708 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:08,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1682617676, now seen corresponding path program 2 times [2022-04-08 13:12:08,711 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:08,712 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [321441955] [2022-04-08 13:12:08,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:08,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:08,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:08,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:08,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:08,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-08 13:12:08,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 13:12:08,856 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-08 13:12:08,858 INFO L272 TraceCheckUtils]: 0: Hoare triple {34#true} call ULTIMATE.init(); {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:12:08,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {39#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {34#true} is VALID [2022-04-08 13:12:08,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {34#true} assume true; {34#true} is VALID [2022-04-08 13:12:08,859 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {34#true} {34#true} #92#return; {34#true} is VALID [2022-04-08 13:12:08,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {34#true} call #t~ret7 := main(); {34#true} is VALID [2022-04-08 13:12:08,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {34#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {34#true} is VALID [2022-04-08 13:12:08,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {34#true} assume !true; {35#false} is VALID [2022-04-08 13:12:08,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#false} assume !true; {35#false} is VALID [2022-04-08 13:12:08,861 INFO L272 TraceCheckUtils]: 8: Hoare triple {35#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {35#false} is VALID [2022-04-08 13:12:08,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {35#false} ~cond := #in~cond; {35#false} is VALID [2022-04-08 13:12:08,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {35#false} assume 0 == ~cond; {35#false} is VALID [2022-04-08 13:12:08,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {35#false} assume !false; {35#false} is VALID [2022-04-08 13:12:08,862 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-08 13:12:08,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:08,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [321441955] [2022-04-08 13:12:08,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [321441955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:08,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:08,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:12:08,866 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:08,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [521271121] [2022-04-08 13:12:08,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [521271121] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:08,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:08,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:12:08,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1474971034] [2022-04-08 13:12:08,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:08,873 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 13:12:08,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:08,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:08,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:08,907 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 13:12:08,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:08,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 13:12:08,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 13:12:08,936 INFO L87 Difference]: Start difference. First operand has 31 states, 17 states have (on average 1.5294117647058822) internal successors, (26), 18 states have internal predecessors, (26), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:09,156 INFO L93 Difference]: Finished difference Result 57 states and 91 transitions. [2022-04-08 13:12:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 13:12:09,156 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 13:12:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:09,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 13:12:09,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:09,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-04-08 13:12:09,184 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-04-08 13:12:09,294 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-08 13:12:09,304 INFO L225 Difference]: With dead ends: 57 [2022-04-08 13:12:09,304 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 13:12:09,309 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 13:12:09,313 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 6 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:09,315 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:09,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 13:12:09,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-04-08 13:12:09,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:09,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:09,351 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:09,351 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:09,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:09,356 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 13:12:09,356 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 13:12:09,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:09,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:09,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-08 13:12:09,360 INFO L87 Difference]: Start difference. First operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 27 states. [2022-04-08 13:12:09,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:09,366 INFO L93 Difference]: Finished difference Result 27 states and 37 transitions. [2022-04-08 13:12:09,367 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 37 transitions. [2022-04-08 13:12:09,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:09,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:09,368 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:09,368 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:09,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 14 states have (on average 1.4285714285714286) internal successors, (20), 15 states have internal predecessors, (20), 9 states have call successors, (9), 3 states have call predecessors, (9), 2 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:09,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 36 transitions. [2022-04-08 13:12:09,375 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 36 transitions. Word has length 12 [2022-04-08 13:12:09,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:09,376 INFO L478 AbstractCegarLoop]: Abstraction has 26 states and 36 transitions. [2022-04-08 13:12:09,377 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:09,377 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 36 transitions. [2022-04-08 13:12:09,417 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-08 13:12:09,418 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 36 transitions. [2022-04-08 13:12:09,421 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-04-08 13:12:09,422 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:09,426 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:09,426 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 13:12:09,427 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:09,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:09,428 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 1 times [2022-04-08 13:12:09,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:09,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [255916137] [2022-04-08 13:12:09,431 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:09,431 INFO L85 PathProgramCache]: Analyzing trace with hash -2144676086, now seen corresponding path program 2 times [2022-04-08 13:12:09,432 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:09,432 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [120884321] [2022-04-08 13:12:09,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:09,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:09,474 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:09,554 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:09,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:09,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-08 13:12:09,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 13:12:09,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-08 13:12:09,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {262#true} call ULTIMATE.init(); {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:12:09,582 INFO L290 TraceCheckUtils]: 1: Hoare triple {270#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {262#true} is VALID [2022-04-08 13:12:09,582 INFO L290 TraceCheckUtils]: 2: Hoare triple {262#true} assume true; {262#true} is VALID [2022-04-08 13:12:09,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {262#true} {262#true} #92#return; {262#true} is VALID [2022-04-08 13:12:09,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {262#true} call #t~ret7 := main(); {262#true} is VALID [2022-04-08 13:12:09,583 INFO L290 TraceCheckUtils]: 5: Hoare triple {262#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {267#(= main_~q~0 0)} is VALID [2022-04-08 13:12:09,584 INFO L290 TraceCheckUtils]: 6: Hoare triple {267#(= main_~q~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-08 13:12:09,584 INFO L290 TraceCheckUtils]: 7: Hoare triple {267#(= main_~q~0 0)} assume !!(#t~post5 < 100);havoc #t~post5; {267#(= main_~q~0 0)} is VALID [2022-04-08 13:12:09,585 INFO L272 TraceCheckUtils]: 8: Hoare triple {267#(= main_~q~0 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {268#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:09,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {268#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {269#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:12:09,586 INFO L290 TraceCheckUtils]: 10: Hoare triple {269#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {263#false} is VALID [2022-04-08 13:12:09,586 INFO L290 TraceCheckUtils]: 11: Hoare triple {263#false} assume !false; {263#false} is VALID [2022-04-08 13:12:09,587 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-08 13:12:09,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:09,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [120884321] [2022-04-08 13:12:09,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [120884321] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:09,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:09,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:09,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:09,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [255916137] [2022-04-08 13:12:09,592 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [255916137] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:09,592 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:09,592 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:09,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [641790444] [2022-04-08 13:12:09,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:09,594 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 13:12:09,594 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:09,594 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:09,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:09,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:12:09,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:09,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:12:09,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:12:09,606 INFO L87 Difference]: Start difference. First operand 26 states and 36 transitions. Second operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:09,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:09,945 INFO L93 Difference]: Finished difference Result 41 states and 56 transitions. [2022-04-08 13:12:09,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:12:09,946 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 12 [2022-04-08 13:12:09,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:09,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:09,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:09,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:09,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:09,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 13:12:10,006 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:10,010 INFO L225 Difference]: With dead ends: 41 [2022-04-08 13:12:10,010 INFO L226 Difference]: Without dead ends: 39 [2022-04-08 13:12:10,010 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:12:10,011 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 24 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:10,012 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 85 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:12:10,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-04-08 13:12:10,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 30. [2022-04-08 13:12:10,019 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:10,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,019 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,020 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:10,022 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 13:12:10,022 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 13:12:10,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:10,023 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:10,024 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 13:12:10,024 INFO L87 Difference]: Start difference. First operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 39 states. [2022-04-08 13:12:10,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:10,026 INFO L93 Difference]: Finished difference Result 39 states and 54 transitions. [2022-04-08 13:12:10,026 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 54 transitions. [2022-04-08 13:12:10,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:10,027 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:10,027 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:10,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:10,028 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,029 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 39 transitions. [2022-04-08 13:12:10,029 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 39 transitions. Word has length 12 [2022-04-08 13:12:10,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:10,030 INFO L478 AbstractCegarLoop]: Abstraction has 30 states and 39 transitions. [2022-04-08 13:12:10,030 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 4 states have internal predecessors, (8), 2 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:10,030 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 39 transitions. [2022-04-08 13:12:10,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:10,067 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 39 transitions. [2022-04-08 13:12:10,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-04-08 13:12:10,068 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:10,068 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:10,068 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-04-08 13:12:10,068 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:10,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 1 times [2022-04-08 13:12:10,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:10,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1402648817] [2022-04-08 13:12:10,070 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1842794081, now seen corresponding path program 2 times [2022-04-08 13:12:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:10,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665468421] [2022-04-08 13:12:10,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:10,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:10,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:10,112 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:10,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:10,126 INFO L290 TraceCheckUtils]: 0: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:10,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:10,131 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:10,132 INFO L272 TraceCheckUtils]: 0: Hoare triple {501#true} call ULTIMATE.init(); {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:12:10,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {508#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:10,133 INFO L290 TraceCheckUtils]: 2: Hoare triple {506#(<= ~counter~0 0)} assume true; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:10,133 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {506#(<= ~counter~0 0)} {501#true} #92#return; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:10,134 INFO L272 TraceCheckUtils]: 4: Hoare triple {506#(<= ~counter~0 0)} call #t~ret7 := main(); {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:10,134 INFO L290 TraceCheckUtils]: 5: Hoare triple {506#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {506#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:10,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {506#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {507#(<= |main_#t~post5| 0)} is VALID [2022-04-08 13:12:10,135 INFO L290 TraceCheckUtils]: 7: Hoare triple {507#(<= |main_#t~post5| 0)} assume !(#t~post5 < 100);havoc #t~post5; {502#false} is VALID [2022-04-08 13:12:10,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {502#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {502#false} is VALID [2022-04-08 13:12:10,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {502#false} assume !(#t~post6 < 100);havoc #t~post6; {502#false} is VALID [2022-04-08 13:12:10,136 INFO L272 TraceCheckUtils]: 10: Hoare triple {502#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {502#false} is VALID [2022-04-08 13:12:10,136 INFO L290 TraceCheckUtils]: 11: Hoare triple {502#false} ~cond := #in~cond; {502#false} is VALID [2022-04-08 13:12:10,136 INFO L290 TraceCheckUtils]: 12: Hoare triple {502#false} assume 0 == ~cond; {502#false} is VALID [2022-04-08 13:12:10,136 INFO L290 TraceCheckUtils]: 13: Hoare triple {502#false} assume !false; {502#false} is VALID [2022-04-08 13:12:10,137 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-08 13:12:10,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:10,137 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665468421] [2022-04-08 13:12:10,137 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665468421] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:10,137 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:10,137 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:12:10,138 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:10,138 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1402648817] [2022-04-08 13:12:10,138 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1402648817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:10,138 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:10,138 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:12:10,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [979768747] [2022-04-08 13:12:10,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:10,139 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 13:12:10,139 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:10,139 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:10,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:10,153 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:10,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:10,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:10,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:10,154 INFO L87 Difference]: Start difference. First operand 30 states and 39 transitions. Second operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:10,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:10,360 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-04-08 13:12:10,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:12:10,361 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 14 [2022-04-08 13:12:10,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:10,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:10,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 13:12:10,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:10,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 58 transitions. [2022-04-08 13:12:10,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 58 transitions. [2022-04-08 13:12:10,414 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:10,416 INFO L225 Difference]: With dead ends: 46 [2022-04-08 13:12:10,416 INFO L226 Difference]: Without dead ends: 32 [2022-04-08 13:12:10,417 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:12:10,419 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 6 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:10,420 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 73 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:12:10,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-08 13:12:10,435 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-08 13:12:10,435 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:10,436 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,436 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,436 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:10,445 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 13:12:10,445 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 13:12:10,446 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:10,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:10,447 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-08 13:12:10,448 INFO L87 Difference]: Start difference. First operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 32 states. [2022-04-08 13:12:10,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:10,454 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-08 13:12:10,454 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 13:12:10,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:10,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:10,454 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:10,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:10,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 9 states have call successors, (9), 4 states have call predecessors, (9), 3 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-08 13:12:10,456 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 14 [2022-04-08 13:12:10,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:10,457 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-08 13:12:10,457 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.5) internal successors, (10), 3 states have internal predecessors, (10), 3 states have call successors, (3), 3 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-04-08 13:12:10,457 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-08 13:12:10,493 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-08 13:12:10,493 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-08 13:12:10,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 13:12:10,496 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:10,496 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:10,496 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-04-08 13:12:10,498 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:10,499 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:10,499 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 1 times [2022-04-08 13:12:10,499 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:10,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1714498433] [2022-04-08 13:12:10,503 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:10,503 INFO L85 PathProgramCache]: Analyzing trace with hash 311129497, now seen corresponding path program 2 times [2022-04-08 13:12:10,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:10,503 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862234861] [2022-04-08 13:12:10,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:10,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:10,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:10,567 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:12:10,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:10,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-08 13:12:10,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:10,574 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-08 13:12:10,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-04-08 13:12:10,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:10,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-08 13:12:10,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-08 13:12:10,579 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:10,580 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:10,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {733#true} call ULTIMATE.init(); {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:12:10,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {745#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {733#true} is VALID [2022-04-08 13:12:10,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:10,581 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {733#true} {733#true} #92#return; {733#true} is VALID [2022-04-08 13:12:10,581 INFO L272 TraceCheckUtils]: 4: Hoare triple {733#true} call #t~ret7 := main(); {733#true} is VALID [2022-04-08 13:12:10,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {733#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:10,582 INFO L290 TraceCheckUtils]: 6: Hoare triple {738#(= main_~A~0 main_~r~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:10,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {738#(= main_~A~0 main_~r~0)} assume !!(#t~post5 < 100);havoc #t~post5; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:10,583 INFO L272 TraceCheckUtils]: 8: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {733#true} is VALID [2022-04-08 13:12:10,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {733#true} ~cond := #in~cond; {733#true} is VALID [2022-04-08 13:12:10,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {733#true} assume !(0 == ~cond); {733#true} is VALID [2022-04-08 13:12:10,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {733#true} assume true; {733#true} is VALID [2022-04-08 13:12:10,584 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {733#true} {738#(= main_~A~0 main_~r~0)} #78#return; {738#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:10,584 INFO L272 TraceCheckUtils]: 13: Hoare triple {738#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {743#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:10,585 INFO L290 TraceCheckUtils]: 14: Hoare triple {743#(not (= |__VERIFIER_assert_#in~cond| 0))} ~cond := #in~cond; {744#(not (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:12:10,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {744#(not (= __VERIFIER_assert_~cond 0))} assume 0 == ~cond; {734#false} is VALID [2022-04-08 13:12:10,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {734#false} assume !false; {734#false} is VALID [2022-04-08 13:12:10,586 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-08 13:12:10,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:10,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862234861] [2022-04-08 13:12:10,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862234861] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:10,586 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:10,586 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:10,586 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:10,587 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1714498433] [2022-04-08 13:12:10,587 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1714498433] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:10,587 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:10,587 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:10,587 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139762485] [2022-04-08 13:12:10,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:10,587 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 13:12:10,588 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:10,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:10,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:10,599 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:12:10,599 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:12:10,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:12:10,600 INFO L87 Difference]: Start difference. First operand 32 states and 41 transitions. Second operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:10,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:10,912 INFO L93 Difference]: Finished difference Result 46 states and 60 transitions. [2022-04-08 13:12:10,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:12:10,912 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 17 [2022-04-08 13:12:10,912 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:10,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:10,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:10,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:10,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-04-08 13:12:10,920 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-04-08 13:12:10,987 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:10,988 INFO L225 Difference]: With dead ends: 46 [2022-04-08 13:12:10,989 INFO L226 Difference]: Without dead ends: 44 [2022-04-08 13:12:10,989 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:12:10,990 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 19 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:10,990 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 78 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:12:10,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-04-08 13:12:10,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 36. [2022-04-08 13:12:10,998 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:10,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,999 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:10,999 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:11,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:11,001 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 13:12:11,001 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 13:12:11,002 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:11,002 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:11,002 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 13:12:11,002 INFO L87 Difference]: Start difference. First operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 44 states. [2022-04-08 13:12:11,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:11,004 INFO L93 Difference]: Finished difference Result 44 states and 58 transitions. [2022-04-08 13:12:11,004 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 58 transitions. [2022-04-08 13:12:11,005 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:11,005 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:11,005 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:11,005 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:11,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 23 states have internal predecessors, (28), 9 states have call successors, (9), 5 states have call predecessors, (9), 4 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:12:11,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-04-08 13:12:11,007 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 17 [2022-04-08 13:12:11,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:11,007 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-04-08 13:12:11,007 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.8333333333333333) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:12:11,007 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 44 transitions. [2022-04-08 13:12:11,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:11,041 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-04-08 13:12:11,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 13:12:11,041 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:11,042 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:11,042 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-04-08 13:12:11,042 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:11,042 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:11,042 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 1 times [2022-04-08 13:12:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:11,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2139216903] [2022-04-08 13:12:11,043 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:11,043 INFO L85 PathProgramCache]: Analyzing trace with hash -1912623062, now seen corresponding path program 2 times [2022-04-08 13:12:11,043 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:11,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572265836] [2022-04-08 13:12:11,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:11,044 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:11,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:11,056 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1661410550] [2022-04-08 13:12:11,056 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:11,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:11,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:11,058 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-08 13:12:11,066 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-08 13:12:11,105 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:11,105 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:11,107 INFO L263 TraceCheckSpWp]: Trace formula consists of 93 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 13:12:11,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:11,132 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:11,389 INFO L272 TraceCheckUtils]: 0: Hoare triple {1008#true} call ULTIMATE.init(); {1008#true} is VALID [2022-04-08 13:12:11,389 INFO L290 TraceCheckUtils]: 1: Hoare triple {1008#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1008#true} is VALID [2022-04-08 13:12:11,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 13:12:11,389 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1008#true} {1008#true} #92#return; {1008#true} is VALID [2022-04-08 13:12:11,389 INFO L272 TraceCheckUtils]: 4: Hoare triple {1008#true} call #t~ret7 := main(); {1008#true} is VALID [2022-04-08 13:12:11,390 INFO L290 TraceCheckUtils]: 5: Hoare triple {1008#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:11,391 INFO L290 TraceCheckUtils]: 6: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:11,391 INFO L290 TraceCheckUtils]: 7: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:11,391 INFO L272 TraceCheckUtils]: 8: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1008#true} is VALID [2022-04-08 13:12:11,391 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-08 13:12:11,392 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-08 13:12:11,392 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 13:12:11,392 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:11,393 INFO L272 TraceCheckUtils]: 13: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1008#true} is VALID [2022-04-08 13:12:11,393 INFO L290 TraceCheckUtils]: 14: Hoare triple {1008#true} ~cond := #in~cond; {1008#true} is VALID [2022-04-08 13:12:11,393 INFO L290 TraceCheckUtils]: 15: Hoare triple {1008#true} assume !(0 == ~cond); {1008#true} is VALID [2022-04-08 13:12:11,393 INFO L290 TraceCheckUtils]: 16: Hoare triple {1008#true} assume true; {1008#true} is VALID [2022-04-08 13:12:11,394 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1008#true} {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:11,394 INFO L272 TraceCheckUtils]: 18: Hoare triple {1028#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:12:11,395 INFO L290 TraceCheckUtils]: 19: Hoare triple {1068#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1072#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:11,395 INFO L290 TraceCheckUtils]: 20: Hoare triple {1072#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1009#false} is VALID [2022-04-08 13:12:11,395 INFO L290 TraceCheckUtils]: 21: Hoare triple {1009#false} assume !false; {1009#false} is VALID [2022-04-08 13:12:11,396 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-08 13:12:11,396 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:12:11,396 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572265836] [2022-04-08 13:12:11,396 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:11,396 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1661410550] [2022-04-08 13:12:11,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1661410550] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:11,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:11,397 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:11,397 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:11,397 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2139216903] [2022-04-08 13:12:11,397 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2139216903] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:11,397 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:11,398 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:11,398 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1759579803] [2022-04-08 13:12:11,398 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:11,398 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 13:12:11,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:11,399 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:12:11,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:11,412 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:11,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:11,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:11,413 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:11,413 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:12:11,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:11,584 INFO L93 Difference]: Finished difference Result 65 states and 87 transitions. [2022-04-08 13:12:11,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:12:11,584 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 22 [2022-04-08 13:12:11,584 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:11,584 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:12:11,586 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 13:12:11,586 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:12:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 81 transitions. [2022-04-08 13:12:11,588 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 81 transitions. [2022-04-08 13:12:11,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:11,653 INFO L225 Difference]: With dead ends: 65 [2022-04-08 13:12:11,653 INFO L226 Difference]: Without dead ends: 50 [2022-04-08 13:12:11,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:12:11,655 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 10 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:11,655 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:11,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-04-08 13:12:11,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2022-04-08 13:12:11,676 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:11,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:11,679 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:11,680 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:11,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:11,682 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 13:12:11,682 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 13:12:11,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:11,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:11,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-08 13:12:11,683 INFO L87 Difference]: Start difference. First operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 50 states. [2022-04-08 13:12:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:11,687 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2022-04-08 13:12:11,687 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 13:12:11,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:11,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:11,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:11,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:11,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 31 states have internal predecessors, (37), 15 states have call successors, (15), 6 states have call predecessors, (15), 5 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:11,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2022-04-08 13:12:11,690 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 22 [2022-04-08 13:12:11,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:11,690 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2022-04-08 13:12:11,691 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 4 states have internal predecessors, (11), 2 states have call successors, (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-08 13:12:11,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 64 transitions. [2022-04-08 13:12:11,745 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:11,745 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2022-04-08 13:12:11,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 13:12:11,746 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:11,746 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:11,772 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-08 13:12:11,959 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:11,959 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:11,960 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:11,960 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 1 times [2022-04-08 13:12:11,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:11,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1390827800] [2022-04-08 13:12:11,961 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:11,961 INFO L85 PathProgramCache]: Analyzing trace with hash 214651490, now seen corresponding path program 2 times [2022-04-08 13:12:11,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:11,961 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464317082] [2022-04-08 13:12:11,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:11,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:11,973 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:11,973 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [804644950] [2022-04-08 13:12:11,973 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:11,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:11,974 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:11,981 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-08 13:12:12,006 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-08 13:12:12,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:12,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:12,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:12:12,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:12,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:12,234 INFO L272 TraceCheckUtils]: 0: Hoare triple {1410#true} call ULTIMATE.init(); {1410#true} is VALID [2022-04-08 13:12:12,234 INFO L290 TraceCheckUtils]: 1: Hoare triple {1410#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:12,235 INFO L290 TraceCheckUtils]: 2: Hoare triple {1418#(<= ~counter~0 0)} assume true; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:12,235 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1418#(<= ~counter~0 0)} {1410#true} #92#return; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:12,236 INFO L272 TraceCheckUtils]: 4: Hoare triple {1418#(<= ~counter~0 0)} call #t~ret7 := main(); {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:12,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {1418#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1418#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:12,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {1418#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {1434#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,244 INFO L272 TraceCheckUtils]: 8: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,244 INFO L290 TraceCheckUtils]: 10: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,245 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #78#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,246 INFO L272 TraceCheckUtils]: 13: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,246 INFO L290 TraceCheckUtils]: 14: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,247 INFO L290 TraceCheckUtils]: 15: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,247 INFO L290 TraceCheckUtils]: 16: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,248 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #80#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,250 INFO L272 TraceCheckUtils]: 18: Hoare triple {1434#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {1434#(<= ~counter~0 1)} ~cond := #in~cond; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {1434#(<= ~counter~0 1)} assume !(0 == ~cond); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {1434#(<= ~counter~0 1)} assume true; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,253 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1434#(<= ~counter~0 1)} {1434#(<= ~counter~0 1)} #82#return; {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,265 INFO L290 TraceCheckUtils]: 23: Hoare triple {1434#(<= ~counter~0 1)} assume !(~r~0 >= ~d~0); {1434#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:12,267 INFO L290 TraceCheckUtils]: 24: Hoare triple {1434#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1489#(<= |main_#t~post6| 1)} is VALID [2022-04-08 13:12:12,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {1489#(<= |main_#t~post6| 1)} assume !(#t~post6 < 100);havoc #t~post6; {1411#false} is VALID [2022-04-08 13:12:12,267 INFO L272 TraceCheckUtils]: 26: Hoare triple {1411#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {1411#false} is VALID [2022-04-08 13:12:12,268 INFO L290 TraceCheckUtils]: 27: Hoare triple {1411#false} ~cond := #in~cond; {1411#false} is VALID [2022-04-08 13:12:12,268 INFO L290 TraceCheckUtils]: 28: Hoare triple {1411#false} assume 0 == ~cond; {1411#false} is VALID [2022-04-08 13:12:12,268 INFO L290 TraceCheckUtils]: 29: Hoare triple {1411#false} assume !false; {1411#false} is VALID [2022-04-08 13:12:12,268 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-08 13:12:12,268 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:12:12,268 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:12,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464317082] [2022-04-08 13:12:12,269 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:12,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [804644950] [2022-04-08 13:12:12,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [804644950] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:12,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:12,269 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:12,269 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:12,269 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1390827800] [2022-04-08 13:12:12,269 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1390827800] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:12,269 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:12,270 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:12,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313959066] [2022-04-08 13:12:12,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:12,270 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 13:12:12,270 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:12,271 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:12,287 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:12,287 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:12,287 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:12,288 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:12,288 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:12,288 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:12,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:12,388 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2022-04-08 13:12:12,388 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:12:12,388 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 13:12:12,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:12,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:12,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 13:12:12,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:12,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 59 transitions. [2022-04-08 13:12:12,394 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 59 transitions. [2022-04-08 13:12:12,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:12,436 INFO L225 Difference]: With dead ends: 70 [2022-04-08 13:12:12,436 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 13:12:12,437 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:12,439 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 3 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:12,439 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:12,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 13:12:12,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 62. [2022-04-08 13:12:12,481 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:12,482 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:12,482 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:12,483 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:12,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:12,487 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-08 13:12:12,487 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-08 13:12:12,487 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:12,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:12,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-08 13:12:12,489 INFO L87 Difference]: Start difference. First operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 63 states. [2022-04-08 13:12:12,491 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:12,491 INFO L93 Difference]: Finished difference Result 63 states and 73 transitions. [2022-04-08 13:12:12,491 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 73 transitions. [2022-04-08 13:12:12,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:12,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:12,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:12,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:12,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 40 states have internal predecessors, (45), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 13:12:12,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 72 transitions. [2022-04-08 13:12:12,494 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 72 transitions. Word has length 30 [2022-04-08 13:12:12,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:12,495 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 72 transitions. [2022-04-08 13:12:12,495 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 4 states have call successors, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:12,495 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 72 transitions. [2022-04-08 13:12:12,561 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-08 13:12:12,561 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 72 transitions. [2022-04-08 13:12:12,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-04-08 13:12:12,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:12,562 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:12,587 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-08 13:12:12,779 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-04-08 13:12:12,779 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:12,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 1 times [2022-04-08 13:12:12,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:12,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [570752978] [2022-04-08 13:12:12,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:12:12,780 INFO L85 PathProgramCache]: Analyzing trace with hash 216379368, now seen corresponding path program 2 times [2022-04-08 13:12:12,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:12,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144948248] [2022-04-08 13:12:12,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:12,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:12,793 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:12,793 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [824604729] [2022-04-08 13:12:12,793 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:12,793 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:12,793 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:12,794 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-08 13:12:12,798 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-08 13:12:12,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:12,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:12,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:12:12,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:12,853 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:12,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {1894#true} call ULTIMATE.init(); {1894#true} is VALID [2022-04-08 13:12:12,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {1894#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1894#true} is VALID [2022-04-08 13:12:12,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:12:12,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1894#true} {1894#true} #92#return; {1894#true} is VALID [2022-04-08 13:12:12,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {1894#true} call #t~ret7 := main(); {1894#true} is VALID [2022-04-08 13:12:12,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {1894#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:12,999 INFO L290 TraceCheckUtils]: 6: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:13,000 INFO L290 TraceCheckUtils]: 7: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post5 < 100);havoc #t~post5; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:13,000 INFO L272 TraceCheckUtils]: 8: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {1894#true} is VALID [2022-04-08 13:12:13,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-08 13:12:13,000 INFO L290 TraceCheckUtils]: 10: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-08 13:12:13,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:12:13,001 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #78#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:13,001 INFO L272 TraceCheckUtils]: 13: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {1894#true} is VALID [2022-04-08 13:12:13,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-08 13:12:13,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-08 13:12:13,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:12:13,002 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #80#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:13,002 INFO L272 TraceCheckUtils]: 18: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {1894#true} is VALID [2022-04-08 13:12:13,002 INFO L290 TraceCheckUtils]: 19: Hoare triple {1894#true} ~cond := #in~cond; {1894#true} is VALID [2022-04-08 13:12:13,002 INFO L290 TraceCheckUtils]: 20: Hoare triple {1894#true} assume !(0 == ~cond); {1894#true} is VALID [2022-04-08 13:12:13,002 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#true} assume true; {1894#true} is VALID [2022-04-08 13:12:13,003 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {1894#true} {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #82#return; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:13,003 INFO L290 TraceCheckUtils]: 23: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:13,004 INFO L290 TraceCheckUtils]: 24: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:13,004 INFO L290 TraceCheckUtils]: 25: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:13,005 INFO L272 TraceCheckUtils]: 26: Hoare triple {1914#(and (= main_~A~0 main_~r~0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:12:13,006 INFO L290 TraceCheckUtils]: 27: Hoare triple {1978#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1982#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:13,006 INFO L290 TraceCheckUtils]: 28: Hoare triple {1982#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1895#false} is VALID [2022-04-08 13:12:13,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {1895#false} assume !false; {1895#false} is VALID [2022-04-08 13:12:13,006 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-08 13:12:13,006 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:12:13,007 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:13,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144948248] [2022-04-08 13:12:13,007 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:13,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [824604729] [2022-04-08 13:12:13,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [824604729] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:13,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:13,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:13,007 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:13,007 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [570752978] [2022-04-08 13:12:13,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [570752978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:13,008 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:13,008 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:13,008 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1457217008] [2022-04-08 13:12:13,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:13,008 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 13:12:13,008 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:13,008 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:13,026 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:13,027 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:13,027 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:13,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:13,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:12:13,027 INFO L87 Difference]: Start difference. First operand 62 states and 72 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:13,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:13,234 INFO L93 Difference]: Finished difference Result 76 states and 91 transitions. [2022-04-08 13:12:13,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:12:13,235 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 30 [2022-04-08 13:12:13,235 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:13,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:13,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 13:12:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:13,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 55 transitions. [2022-04-08 13:12:13,237 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 55 transitions. [2022-04-08 13:12:13,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:13,284 INFO L225 Difference]: With dead ends: 76 [2022-04-08 13:12:13,284 INFO L226 Difference]: Without dead ends: 64 [2022-04-08 13:12:13,284 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:12:13,285 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 11 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:13,285 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 95 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:13,286 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-04-08 13:12:13,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 63. [2022-04-08 13:12:13,325 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:13,326 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:12:13,326 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:12:13,326 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:12:13,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:13,328 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 13:12:13,328 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 13:12:13,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:13,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:13,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-08 13:12:13,329 INFO L87 Difference]: Start difference. First operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 64 states. [2022-04-08 13:12:13,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:13,331 INFO L93 Difference]: Finished difference Result 64 states and 77 transitions. [2022-04-08 13:12:13,332 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 77 transitions. [2022-04-08 13:12:13,332 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:13,332 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:13,332 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:13,332 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:13,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 39 states have (on average 1.2307692307692308) internal successors, (48), 41 states have internal predecessors, (48), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:12:13,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 76 transitions. [2022-04-08 13:12:13,334 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 76 transitions. Word has length 30 [2022-04-08 13:12:13,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:13,335 INFO L478 AbstractCegarLoop]: Abstraction has 63 states and 76 transitions. [2022-04-08 13:12:13,335 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 4 states have internal predecessors, (14), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:13,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 63 states and 76 transitions. [2022-04-08 13:12:13,404 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-08 13:12:13,404 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 76 transitions. [2022-04-08 13:12:13,405 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-04-08 13:12:13,405 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:13,405 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:13,430 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-08 13:12:13,628 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:13,628 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:13,628 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:13,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 1 times [2022-04-08 13:12:13,629 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:13,629 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1169264615] [2022-04-08 13:12:17,782 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:12:17,782 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:12:17,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1255015940, now seen corresponding path program 2 times [2022-04-08 13:12:17,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:17,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [302539544] [2022-04-08 13:12:17,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:17,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:17,807 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:17,807 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [424488392] [2022-04-08 13:12:17,807 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:17,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:17,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:17,812 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-08 13:12:17,813 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-08 13:12:17,858 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:17,859 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:17,859 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:12:17,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:17,875 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:18,036 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-08 13:12:18,037 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:18,037 INFO L290 TraceCheckUtils]: 2: Hoare triple {2404#(<= ~counter~0 0)} assume true; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:18,038 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2404#(<= ~counter~0 0)} {2396#true} #92#return; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:18,038 INFO L272 TraceCheckUtils]: 4: Hoare triple {2404#(<= ~counter~0 0)} call #t~ret7 := main(); {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:18,038 INFO L290 TraceCheckUtils]: 5: Hoare triple {2404#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2404#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:18,039 INFO L290 TraceCheckUtils]: 6: Hoare triple {2404#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,039 INFO L290 TraceCheckUtils]: 7: Hoare triple {2420#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,040 INFO L272 TraceCheckUtils]: 8: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,042 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #78#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,043 INFO L272 TraceCheckUtils]: 13: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,044 INFO L290 TraceCheckUtils]: 15: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,045 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #80#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,045 INFO L272 TraceCheckUtils]: 18: Hoare triple {2420#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {2420#(<= ~counter~0 1)} ~cond := #in~cond; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {2420#(<= ~counter~0 1)} assume !(0 == ~cond); {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {2420#(<= ~counter~0 1)} assume true; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,047 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2420#(<= ~counter~0 1)} {2420#(<= ~counter~0 1)} #82#return; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,048 INFO L290 TraceCheckUtils]: 23: Hoare triple {2420#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2420#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:18,048 INFO L290 TraceCheckUtils]: 24: Hoare triple {2420#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2475#(<= |main_#t~post5| 1)} is VALID [2022-04-08 13:12:18,049 INFO L290 TraceCheckUtils]: 25: Hoare triple {2475#(<= |main_#t~post5| 1)} assume !(#t~post5 < 100);havoc #t~post5; {2397#false} is VALID [2022-04-08 13:12:18,049 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-08 13:12:18,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 100);havoc #t~post6; {2397#false} is VALID [2022-04-08 13:12:18,049 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2397#false} is VALID [2022-04-08 13:12:18,050 INFO L290 TraceCheckUtils]: 29: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-08 13:12:18,050 INFO L290 TraceCheckUtils]: 30: Hoare triple {2397#false} assume !(0 == ~cond); {2397#false} is VALID [2022-04-08 13:12:18,050 INFO L290 TraceCheckUtils]: 31: Hoare triple {2397#false} assume true; {2397#false} is VALID [2022-04-08 13:12:18,050 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2397#false} {2397#false} #88#return; {2397#false} is VALID [2022-04-08 13:12:18,050 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-08 13:12:18,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-08 13:12:18,050 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-08 13:12:18,050 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-08 13:12:18,050 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 18 proven. 2 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-04-08 13:12:18,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:12:18,264 INFO L290 TraceCheckUtils]: 36: Hoare triple {2397#false} assume !false; {2397#false} is VALID [2022-04-08 13:12:18,265 INFO L290 TraceCheckUtils]: 35: Hoare triple {2397#false} assume 0 == ~cond; {2397#false} is VALID [2022-04-08 13:12:18,265 INFO L290 TraceCheckUtils]: 34: Hoare triple {2397#false} ~cond := #in~cond; {2397#false} is VALID [2022-04-08 13:12:18,265 INFO L272 TraceCheckUtils]: 33: Hoare triple {2397#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {2397#false} is VALID [2022-04-08 13:12:18,265 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2396#true} {2397#false} #88#return; {2397#false} is VALID [2022-04-08 13:12:18,265 INFO L290 TraceCheckUtils]: 31: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:12:18,265 INFO L290 TraceCheckUtils]: 30: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:12:18,266 INFO L290 TraceCheckUtils]: 29: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:12:18,266 INFO L272 TraceCheckUtils]: 28: Hoare triple {2397#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {2396#true} is VALID [2022-04-08 13:12:18,266 INFO L290 TraceCheckUtils]: 27: Hoare triple {2397#false} assume !(#t~post6 < 100);havoc #t~post6; {2397#false} is VALID [2022-04-08 13:12:18,266 INFO L290 TraceCheckUtils]: 26: Hoare triple {2397#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2397#false} is VALID [2022-04-08 13:12:18,270 INFO L290 TraceCheckUtils]: 25: Hoare triple {2545#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {2397#false} is VALID [2022-04-08 13:12:18,270 INFO L290 TraceCheckUtils]: 24: Hoare triple {2549#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2545#(< |main_#t~post5| 100)} is VALID [2022-04-08 13:12:18,271 INFO L290 TraceCheckUtils]: 23: Hoare triple {2549#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {2549#(< ~counter~0 100)} is VALID [2022-04-08 13:12:18,272 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {2396#true} {2549#(< ~counter~0 100)} #82#return; {2549#(< ~counter~0 100)} is VALID [2022-04-08 13:12:18,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:12:18,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:12:18,272 INFO L290 TraceCheckUtils]: 19: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:12:18,272 INFO L272 TraceCheckUtils]: 18: Hoare triple {2549#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {2396#true} is VALID [2022-04-08 13:12:18,273 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {2396#true} {2549#(< ~counter~0 100)} #80#return; {2549#(< ~counter~0 100)} is VALID [2022-04-08 13:12:18,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:12:18,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:12:18,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:12:18,273 INFO L272 TraceCheckUtils]: 13: Hoare triple {2549#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {2396#true} is VALID [2022-04-08 13:12:18,274 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {2396#true} {2549#(< ~counter~0 100)} #78#return; {2549#(< ~counter~0 100)} is VALID [2022-04-08 13:12:18,274 INFO L290 TraceCheckUtils]: 11: Hoare triple {2396#true} assume true; {2396#true} is VALID [2022-04-08 13:12:18,274 INFO L290 TraceCheckUtils]: 10: Hoare triple {2396#true} assume !(0 == ~cond); {2396#true} is VALID [2022-04-08 13:12:18,274 INFO L290 TraceCheckUtils]: 9: Hoare triple {2396#true} ~cond := #in~cond; {2396#true} is VALID [2022-04-08 13:12:18,274 INFO L272 TraceCheckUtils]: 8: Hoare triple {2549#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {2396#true} is VALID [2022-04-08 13:12:18,274 INFO L290 TraceCheckUtils]: 7: Hoare triple {2549#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {2549#(< ~counter~0 100)} is VALID [2022-04-08 13:12:18,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {2604#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {2549#(< ~counter~0 100)} is VALID [2022-04-08 13:12:18,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {2604#(< ~counter~0 99)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {2604#(< ~counter~0 99)} is VALID [2022-04-08 13:12:18,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {2604#(< ~counter~0 99)} call #t~ret7 := main(); {2604#(< ~counter~0 99)} is VALID [2022-04-08 13:12:18,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2604#(< ~counter~0 99)} {2396#true} #92#return; {2604#(< ~counter~0 99)} is VALID [2022-04-08 13:12:18,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {2604#(< ~counter~0 99)} assume true; {2604#(< ~counter~0 99)} is VALID [2022-04-08 13:12:18,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {2396#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2604#(< ~counter~0 99)} is VALID [2022-04-08 13:12:18,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {2396#true} call ULTIMATE.init(); {2396#true} is VALID [2022-04-08 13:12:18,278 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 13:12:18,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [302539544] [2022-04-08 13:12:18,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:18,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424488392] [2022-04-08 13:12:18,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [424488392] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:12:18,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:12:18,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 13:12:18,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:18,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1169264615] [2022-04-08 13:12:18,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1169264615] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:18,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:18,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:18,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [524477827] [2022-04-08 13:12:18,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:18,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-08 13:12:18,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:18,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:12:18,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:18,306 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:18,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:18,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:18,306 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 13:12:18,307 INFO L87 Difference]: Start difference. First operand 63 states and 76 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:12:18,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:18,438 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-08 13:12:18,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:12:18,439 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 37 [2022-04-08 13:12:18,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:18,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:12:18,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-08 13:12:18,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:12:18,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 70 transitions. [2022-04-08 13:12:18,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 70 transitions. [2022-04-08 13:12:18,493 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-08 13:12:18,495 INFO L225 Difference]: With dead ends: 90 [2022-04-08 13:12:18,495 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 13:12:18,495 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-08 13:12:18,496 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 2 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:18,496 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 126 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:18,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 13:12:18,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-08 13:12:18,538 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:18,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:12:18,538 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:12:18,539 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:12:18,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:18,541 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 13:12:18,541 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 13:12:18,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:18,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:18,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-08 13:12:18,542 INFO L87 Difference]: Start difference. First operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 65 states. [2022-04-08 13:12:18,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:18,544 INFO L93 Difference]: Finished difference Result 65 states and 78 transitions. [2022-04-08 13:12:18,544 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 13:12:18,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:18,544 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:18,544 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:18,544 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:18,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 41 states have (on average 1.2195121951219512) internal successors, (50), 43 states have internal predecessors, (50), 15 states have call successors, (15), 9 states have call predecessors, (15), 8 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 13:12:18,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 78 transitions. [2022-04-08 13:12:18,546 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 78 transitions. Word has length 37 [2022-04-08 13:12:18,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:18,547 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 78 transitions. [2022-04-08 13:12:18,547 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 4 states have internal predecessors, (18), 4 states have call successors, (7), 4 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 13:12:18,547 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 78 transitions. [2022-04-08 13:12:18,624 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:18,624 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 78 transitions. [2022-04-08 13:12:18,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 13:12:18,625 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:18,625 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:18,650 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-08 13:12:18,839 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:18,839 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:18,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:18,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 1 times [2022-04-08 13:12:18,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:18,840 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1295855149] [2022-04-08 13:12:22,982 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:12:22,983 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:12:22,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1057559728, now seen corresponding path program 2 times [2022-04-08 13:12:22,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:22,983 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095885771] [2022-04-08 13:12:22,983 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:22,983 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:22,993 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:22,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [472491504] [2022-04-08 13:12:22,993 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:22,993 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:22,994 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:22,999 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-08 13:12:23,009 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-08 13:12:23,043 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:23,043 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:23,044 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 13:12:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:23,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:23,255 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-08 13:12:23,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-08 13:12:23,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,256 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-08 13:12:23,256 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-08 13:12:23,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:23,257 INFO L290 TraceCheckUtils]: 6: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:23,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:23,257 INFO L272 TraceCheckUtils]: 8: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,258 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:23,258 INFO L272 TraceCheckUtils]: 13: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,258 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,264 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:23,264 INFO L272 TraceCheckUtils]: 18: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,264 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,264 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,265 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,265 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:23,266 INFO L290 TraceCheckUtils]: 23: Hoare triple {3087#(and (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:12:23,266 INFO L290 TraceCheckUtils]: 24: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:12:23,267 INFO L290 TraceCheckUtils]: 25: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:12:23,267 INFO L272 TraceCheckUtils]: 26: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,268 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #78#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:12:23,268 INFO L272 TraceCheckUtils]: 31: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,268 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,268 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,269 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} #80#return; {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} is VALID [2022-04-08 13:12:23,270 INFO L272 TraceCheckUtils]: 36: Hoare triple {3142#(and (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:12:23,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:23,271 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-08 13:12:23,271 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-08 13:12:23,271 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 5 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 13:12:23,271 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:12:23,467 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#false} assume !false; {3068#false} is VALID [2022-04-08 13:12:23,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {3186#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3068#false} is VALID [2022-04-08 13:12:23,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3186#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:23,469 INFO L272 TraceCheckUtils]: 36: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3182#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:12:23,470 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,470 INFO L290 TraceCheckUtils]: 34: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,470 INFO L272 TraceCheckUtils]: 31: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,471 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,471 INFO L272 TraceCheckUtils]: 26: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 100);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,478 INFO L290 TraceCheckUtils]: 23: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,479 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #82#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,479 INFO L290 TraceCheckUtils]: 21: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,479 INFO L290 TraceCheckUtils]: 20: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,479 INFO L290 TraceCheckUtils]: 19: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,479 INFO L272 TraceCheckUtils]: 18: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,480 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #80#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,480 INFO L290 TraceCheckUtils]: 16: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,480 INFO L290 TraceCheckUtils]: 15: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,480 INFO L290 TraceCheckUtils]: 14: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,480 INFO L272 TraceCheckUtils]: 13: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,481 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3067#true} {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #78#return; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,481 INFO L290 TraceCheckUtils]: 11: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,481 INFO L290 TraceCheckUtils]: 10: Hoare triple {3067#true} assume !(0 == ~cond); {3067#true} is VALID [2022-04-08 13:12:23,481 INFO L290 TraceCheckUtils]: 9: Hoare triple {3067#true} ~cond := #in~cond; {3067#true} is VALID [2022-04-08 13:12:23,481 INFO L272 TraceCheckUtils]: 8: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3067#true} is VALID [2022-04-08 13:12:23,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post5 < 100);havoc #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,483 INFO L290 TraceCheckUtils]: 5: Hoare triple {3067#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3202#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:12:23,483 INFO L272 TraceCheckUtils]: 4: Hoare triple {3067#true} call #t~ret7 := main(); {3067#true} is VALID [2022-04-08 13:12:23,483 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3067#true} {3067#true} #92#return; {3067#true} is VALID [2022-04-08 13:12:23,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {3067#true} assume true; {3067#true} is VALID [2022-04-08 13:12:23,483 INFO L290 TraceCheckUtils]: 1: Hoare triple {3067#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3067#true} is VALID [2022-04-08 13:12:23,483 INFO L272 TraceCheckUtils]: 0: Hoare triple {3067#true} call ULTIMATE.init(); {3067#true} is VALID [2022-04-08 13:12:23,483 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 45 trivial. 0 not checked. [2022-04-08 13:12:23,484 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:23,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095885771] [2022-04-08 13:12:23,484 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:23,484 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [472491504] [2022-04-08 13:12:23,484 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [472491504] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 13:12:23,484 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 13:12:23,484 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 13:12:23,484 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:23,485 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1295855149] [2022-04-08 13:12:23,485 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1295855149] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:23,485 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:23,485 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:12:23,485 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [43455693] [2022-04-08 13:12:23,485 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:23,485 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-08 13:12:23,486 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:23,486 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-08 13:12:23,506 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-08 13:12:23,506 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:12:23,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:23,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:12:23,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 13:12:23,506 INFO L87 Difference]: Start difference. First operand 65 states and 78 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:23,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:23,733 INFO L93 Difference]: Finished difference Result 78 states and 95 transitions. [2022-04-08 13:12:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:12:23,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 40 [2022-04-08 13:12:23,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:23,734 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-08 13:12:23,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 13:12:23,739 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-08 13:12:23,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 13:12:23,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-08 13:12:23,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 53 edges. 53 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:23,791 INFO L225 Difference]: With dead ends: 78 [2022-04-08 13:12:23,791 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 13:12:23,792 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 72 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-04-08 13:12:23,792 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 11 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:23,792 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 103 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:12:23,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 13:12:23,847 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 73. [2022-04-08 13:12:23,847 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:23,848 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 13:12:23,848 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 13:12:23,848 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 13:12:23,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:23,851 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 13:12:23,851 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 13:12:23,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:23,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:23,852 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-08 13:12:23,852 INFO L87 Difference]: Start difference. First operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) Second operand 76 states. [2022-04-08 13:12:23,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:23,854 INFO L93 Difference]: Finished difference Result 76 states and 93 transitions. [2022-04-08 13:12:23,854 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 93 transitions. [2022-04-08 13:12:23,854 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:23,854 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:23,854 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:23,854 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:23,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 46 states have (on average 1.2173913043478262) internal successors, (56), 49 states have internal predecessors, (56), 17 states have call successors, (17), 10 states have call predecessors, (17), 9 states have return successors, (15), 13 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 13:12:23,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 88 transitions. [2022-04-08 13:12:23,856 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 88 transitions. Word has length 40 [2022-04-08 13:12:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:23,856 INFO L478 AbstractCegarLoop]: Abstraction has 73 states and 88 transitions. [2022-04-08 13:12:23,857 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (6), 2 states have call predecessors, (6), 1 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2022-04-08 13:12:23,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 73 states and 88 transitions. [2022-04-08 13:12:23,953 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:23,953 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 88 transitions. [2022-04-08 13:12:23,956 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-04-08 13:12:23,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:23,956 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:23,982 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 13:12:24,165 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:24,166 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:24,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:24,166 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 1 times [2022-04-08 13:12:24,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:24,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [87335238] [2022-04-08 13:12:28,300 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:12:28,300 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:12:28,300 INFO L85 PathProgramCache]: Analyzing trace with hash 529029787, now seen corresponding path program 2 times [2022-04-08 13:12:28,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:28,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [874582439] [2022-04-08 13:12:28,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:28,300 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:28,310 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:28,310 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1062720886] [2022-04-08 13:12:28,310 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:28,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:28,311 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:28,319 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-08 13:12:28,332 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-08 13:12:28,374 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:28,374 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:28,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 13:12:28,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:28,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:28,630 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-08 13:12:28,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:28,631 INFO L290 TraceCheckUtils]: 2: Hoare triple {3777#(<= ~counter~0 0)} assume true; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:28,631 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3777#(<= ~counter~0 0)} {3769#true} #92#return; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:28,632 INFO L272 TraceCheckUtils]: 4: Hoare triple {3777#(<= ~counter~0 0)} call #t~ret7 := main(); {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:28,632 INFO L290 TraceCheckUtils]: 5: Hoare triple {3777#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {3777#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:28,633 INFO L290 TraceCheckUtils]: 6: Hoare triple {3777#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {3793#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,636 INFO L272 TraceCheckUtils]: 8: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,636 INFO L290 TraceCheckUtils]: 10: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,637 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #78#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,638 INFO L272 TraceCheckUtils]: 13: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,638 INFO L290 TraceCheckUtils]: 14: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,640 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #80#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,640 INFO L272 TraceCheckUtils]: 18: Hoare triple {3793#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,641 INFO L290 TraceCheckUtils]: 19: Hoare triple {3793#(<= ~counter~0 1)} ~cond := #in~cond; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,641 INFO L290 TraceCheckUtils]: 20: Hoare triple {3793#(<= ~counter~0 1)} assume !(0 == ~cond); {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {3793#(<= ~counter~0 1)} assume true; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,642 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3793#(<= ~counter~0 1)} {3793#(<= ~counter~0 1)} #82#return; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,643 INFO L290 TraceCheckUtils]: 23: Hoare triple {3793#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {3793#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:28,643 INFO L290 TraceCheckUtils]: 24: Hoare triple {3793#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,644 INFO L290 TraceCheckUtils]: 25: Hoare triple {3848#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,644 INFO L272 TraceCheckUtils]: 26: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,645 INFO L290 TraceCheckUtils]: 27: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,645 INFO L290 TraceCheckUtils]: 28: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,645 INFO L290 TraceCheckUtils]: 29: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,646 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #78#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,647 INFO L272 TraceCheckUtils]: 31: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,647 INFO L290 TraceCheckUtils]: 32: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,647 INFO L290 TraceCheckUtils]: 33: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,648 INFO L290 TraceCheckUtils]: 34: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,648 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #80#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,649 INFO L272 TraceCheckUtils]: 36: Hoare triple {3848#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,649 INFO L290 TraceCheckUtils]: 37: Hoare triple {3848#(<= ~counter~0 2)} ~cond := #in~cond; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,650 INFO L290 TraceCheckUtils]: 38: Hoare triple {3848#(<= ~counter~0 2)} assume !(0 == ~cond); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,650 INFO L290 TraceCheckUtils]: 39: Hoare triple {3848#(<= ~counter~0 2)} assume true; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,655 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3848#(<= ~counter~0 2)} {3848#(<= ~counter~0 2)} #82#return; {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {3848#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {3848#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:28,656 INFO L290 TraceCheckUtils]: 42: Hoare triple {3848#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3903#(<= |main_#t~post6| 2)} is VALID [2022-04-08 13:12:28,656 INFO L290 TraceCheckUtils]: 43: Hoare triple {3903#(<= |main_#t~post6| 2)} assume !(#t~post6 < 100);havoc #t~post6; {3770#false} is VALID [2022-04-08 13:12:28,657 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3770#false} is VALID [2022-04-08 13:12:28,657 INFO L290 TraceCheckUtils]: 45: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-08 13:12:28,657 INFO L290 TraceCheckUtils]: 46: Hoare triple {3770#false} assume !(0 == ~cond); {3770#false} is VALID [2022-04-08 13:12:28,657 INFO L290 TraceCheckUtils]: 47: Hoare triple {3770#false} assume true; {3770#false} is VALID [2022-04-08 13:12:28,657 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3770#false} {3770#false} #88#return; {3770#false} is VALID [2022-04-08 13:12:28,657 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-08 13:12:28,657 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-08 13:12:28,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-08 13:12:28,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-08 13:12:28,658 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 36 proven. 42 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-08 13:12:28,658 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:12:28,910 INFO L290 TraceCheckUtils]: 52: Hoare triple {3770#false} assume !false; {3770#false} is VALID [2022-04-08 13:12:28,911 INFO L290 TraceCheckUtils]: 51: Hoare triple {3770#false} assume 0 == ~cond; {3770#false} is VALID [2022-04-08 13:12:28,911 INFO L290 TraceCheckUtils]: 50: Hoare triple {3770#false} ~cond := #in~cond; {3770#false} is VALID [2022-04-08 13:12:28,911 INFO L272 TraceCheckUtils]: 49: Hoare triple {3770#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {3770#false} is VALID [2022-04-08 13:12:28,911 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {3769#true} {3770#false} #88#return; {3770#false} is VALID [2022-04-08 13:12:28,911 INFO L290 TraceCheckUtils]: 47: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:12:28,911 INFO L290 TraceCheckUtils]: 46: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:12:28,911 INFO L290 TraceCheckUtils]: 45: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:12:28,912 INFO L272 TraceCheckUtils]: 44: Hoare triple {3770#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:12:28,912 INFO L290 TraceCheckUtils]: 43: Hoare triple {3961#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {3770#false} is VALID [2022-04-08 13:12:28,912 INFO L290 TraceCheckUtils]: 42: Hoare triple {3965#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3961#(< |main_#t~post6| 100)} is VALID [2022-04-08 13:12:28,913 INFO L290 TraceCheckUtils]: 41: Hoare triple {3965#(< ~counter~0 100)} assume !(~r~0 >= ~d~0); {3965#(< ~counter~0 100)} is VALID [2022-04-08 13:12:28,914 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {3769#true} {3965#(< ~counter~0 100)} #82#return; {3965#(< ~counter~0 100)} is VALID [2022-04-08 13:12:28,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:12:28,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:12:28,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:12:28,914 INFO L272 TraceCheckUtils]: 36: Hoare triple {3965#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:12:28,915 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {3769#true} {3965#(< ~counter~0 100)} #80#return; {3965#(< ~counter~0 100)} is VALID [2022-04-08 13:12:28,915 INFO L290 TraceCheckUtils]: 34: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:12:28,915 INFO L290 TraceCheckUtils]: 33: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:12:28,915 INFO L290 TraceCheckUtils]: 32: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:12:28,915 INFO L272 TraceCheckUtils]: 31: Hoare triple {3965#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:12:28,916 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3769#true} {3965#(< ~counter~0 100)} #78#return; {3965#(< ~counter~0 100)} is VALID [2022-04-08 13:12:28,916 INFO L290 TraceCheckUtils]: 29: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:12:28,916 INFO L290 TraceCheckUtils]: 28: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:12:28,916 INFO L290 TraceCheckUtils]: 27: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:12:28,916 INFO L272 TraceCheckUtils]: 26: Hoare triple {3965#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:12:28,916 INFO L290 TraceCheckUtils]: 25: Hoare triple {3965#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {3965#(< ~counter~0 100)} is VALID [2022-04-08 13:12:28,917 INFO L290 TraceCheckUtils]: 24: Hoare triple {4020#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {3965#(< ~counter~0 100)} is VALID [2022-04-08 13:12:28,917 INFO L290 TraceCheckUtils]: 23: Hoare triple {4020#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4020#(< ~counter~0 99)} is VALID [2022-04-08 13:12:28,918 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {3769#true} {4020#(< ~counter~0 99)} #82#return; {4020#(< ~counter~0 99)} is VALID [2022-04-08 13:12:28,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:12:28,918 INFO L290 TraceCheckUtils]: 20: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:12:28,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:12:28,918 INFO L272 TraceCheckUtils]: 18: Hoare triple {4020#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:12:28,919 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {3769#true} {4020#(< ~counter~0 99)} #80#return; {4020#(< ~counter~0 99)} is VALID [2022-04-08 13:12:28,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:12:28,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:12:28,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:12:28,919 INFO L272 TraceCheckUtils]: 13: Hoare triple {4020#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:12:28,920 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {3769#true} {4020#(< ~counter~0 99)} #78#return; {4020#(< ~counter~0 99)} is VALID [2022-04-08 13:12:28,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {3769#true} assume true; {3769#true} is VALID [2022-04-08 13:12:28,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {3769#true} assume !(0 == ~cond); {3769#true} is VALID [2022-04-08 13:12:28,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {3769#true} ~cond := #in~cond; {3769#true} is VALID [2022-04-08 13:12:28,920 INFO L272 TraceCheckUtils]: 8: Hoare triple {4020#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {3769#true} is VALID [2022-04-08 13:12:28,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {4020#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {4020#(< ~counter~0 99)} is VALID [2022-04-08 13:12:28,921 INFO L290 TraceCheckUtils]: 6: Hoare triple {4075#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4020#(< ~counter~0 99)} is VALID [2022-04-08 13:12:28,921 INFO L290 TraceCheckUtils]: 5: Hoare triple {4075#(< ~counter~0 98)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4075#(< ~counter~0 98)} is VALID [2022-04-08 13:12:28,922 INFO L272 TraceCheckUtils]: 4: Hoare triple {4075#(< ~counter~0 98)} call #t~ret7 := main(); {4075#(< ~counter~0 98)} is VALID [2022-04-08 13:12:28,922 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4075#(< ~counter~0 98)} {3769#true} #92#return; {4075#(< ~counter~0 98)} is VALID [2022-04-08 13:12:28,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {4075#(< ~counter~0 98)} assume true; {4075#(< ~counter~0 98)} is VALID [2022-04-08 13:12:28,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {3769#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4075#(< ~counter~0 98)} is VALID [2022-04-08 13:12:28,923 INFO L272 TraceCheckUtils]: 0: Hoare triple {3769#true} call ULTIMATE.init(); {3769#true} is VALID [2022-04-08 13:12:28,924 INFO L134 CoverageAnalysis]: Checked inductivity of 104 backedges. 14 proven. 6 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 13:12:28,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:28,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [874582439] [2022-04-08 13:12:28,924 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:28,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1062720886] [2022-04-08 13:12:28,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1062720886] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:12:28,924 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:12:28,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 13:12:28,924 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:28,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [87335238] [2022-04-08 13:12:28,924 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [87335238] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:28,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:28,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:28,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223359328] [2022-04-08 13:12:28,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:28,925 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-08 13:12:28,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:28,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:28,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:28,958 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:12:28,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:28,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:12:28,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:12:28,959 INFO L87 Difference]: Start difference. First operand 73 states and 88 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:29,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:29,170 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2022-04-08 13:12:29,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:12:29,170 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 53 [2022-04-08 13:12:29,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:29,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:29,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-08 13:12:29,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:29,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 73 transitions. [2022-04-08 13:12:29,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 73 transitions. [2022-04-08 13:12:29,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 73 edges. 73 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:29,228 INFO L225 Difference]: With dead ends: 104 [2022-04-08 13:12:29,228 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 13:12:29,228 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:12:29,229 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 4 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:29,229 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 155 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:29,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 13:12:29,311 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2022-04-08 13:12:29,311 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:29,311 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:12:29,314 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:12:29,314 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:12:29,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:29,317 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-08 13:12:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-08 13:12:29,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:29,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:29,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-08 13:12:29,320 INFO L87 Difference]: Start difference. First operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 92 states. [2022-04-08 13:12:29,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:29,322 INFO L93 Difference]: Finished difference Result 92 states and 108 transitions. [2022-04-08 13:12:29,322 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 108 transitions. [2022-04-08 13:12:29,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:29,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:29,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:29,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:29,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 58 states have (on average 1.1896551724137931) internal successors, (69), 61 states have internal predecessors, (69), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:12:29,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 107 transitions. [2022-04-08 13:12:29,328 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 107 transitions. Word has length 53 [2022-04-08 13:12:29,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:29,329 INFO L478 AbstractCegarLoop]: Abstraction has 91 states and 107 transitions. [2022-04-08 13:12:29,329 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 5 states have internal predecessors, (22), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:29,329 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 91 states and 107 transitions. [2022-04-08 13:12:29,438 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:29,438 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 107 transitions. [2022-04-08 13:12:29,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-08 13:12:29,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:29,440 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:29,464 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-08 13:12:29,640 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:29,640 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:29,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:29,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 3 times [2022-04-08 13:12:29,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:29,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1975260320] [2022-04-08 13:12:33,766 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:12:33,767 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:12:33,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1864650262, now seen corresponding path program 4 times [2022-04-08 13:12:33,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:33,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846563628] [2022-04-08 13:12:33,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:33,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:33,776 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:33,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [384928387] [2022-04-08 13:12:33,777 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:12:33,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:33,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:33,779 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-08 13:12:33,804 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-08 13:12:33,830 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:12:33,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:33,830 INFO L263 TraceCheckSpWp]: Trace formula consists of 163 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 13:12:33,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:33,846 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:34,103 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-08 13:12:34,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4678#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:34,104 INFO L290 TraceCheckUtils]: 2: Hoare triple {4678#(<= ~counter~0 0)} assume true; {4678#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:34,105 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4678#(<= ~counter~0 0)} {4670#true} #92#return; {4678#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:34,105 INFO L272 TraceCheckUtils]: 4: Hoare triple {4678#(<= ~counter~0 0)} call #t~ret7 := main(); {4678#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:34,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {4678#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4678#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:34,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {4678#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {4694#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,106 INFO L272 TraceCheckUtils]: 8: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,108 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #78#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,108 INFO L272 TraceCheckUtils]: 13: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,109 INFO L290 TraceCheckUtils]: 15: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,109 INFO L290 TraceCheckUtils]: 16: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,109 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #80#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,110 INFO L272 TraceCheckUtils]: 18: Hoare triple {4694#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {4694#(<= ~counter~0 1)} ~cond := #in~cond; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {4694#(<= ~counter~0 1)} assume !(0 == ~cond); {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {4694#(<= ~counter~0 1)} assume true; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,111 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4694#(<= ~counter~0 1)} {4694#(<= ~counter~0 1)} #82#return; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {4694#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4694#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:34,112 INFO L290 TraceCheckUtils]: 24: Hoare triple {4694#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,112 INFO L290 TraceCheckUtils]: 25: Hoare triple {4749#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,112 INFO L272 TraceCheckUtils]: 26: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,113 INFO L290 TraceCheckUtils]: 27: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,113 INFO L290 TraceCheckUtils]: 28: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,113 INFO L290 TraceCheckUtils]: 29: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,114 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #78#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,114 INFO L272 TraceCheckUtils]: 31: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,115 INFO L290 TraceCheckUtils]: 33: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,115 INFO L290 TraceCheckUtils]: 34: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,115 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #80#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,116 INFO L272 TraceCheckUtils]: 36: Hoare triple {4749#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,116 INFO L290 TraceCheckUtils]: 37: Hoare triple {4749#(<= ~counter~0 2)} ~cond := #in~cond; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,116 INFO L290 TraceCheckUtils]: 38: Hoare triple {4749#(<= ~counter~0 2)} assume !(0 == ~cond); {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,116 INFO L290 TraceCheckUtils]: 39: Hoare triple {4749#(<= ~counter~0 2)} assume true; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,117 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4749#(<= ~counter~0 2)} {4749#(<= ~counter~0 2)} #82#return; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,117 INFO L290 TraceCheckUtils]: 41: Hoare triple {4749#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4749#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:34,118 INFO L290 TraceCheckUtils]: 42: Hoare triple {4749#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4804#(<= |main_#t~post5| 2)} is VALID [2022-04-08 13:12:34,118 INFO L290 TraceCheckUtils]: 43: Hoare triple {4804#(<= |main_#t~post5| 2)} assume !(#t~post5 < 100);havoc #t~post5; {4671#false} is VALID [2022-04-08 13:12:34,118 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-08 13:12:34,118 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 100);havoc #t~post6; {4671#false} is VALID [2022-04-08 13:12:34,118 INFO L272 TraceCheckUtils]: 46: Hoare triple {4671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4671#false} is VALID [2022-04-08 13:12:34,118 INFO L290 TraceCheckUtils]: 47: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-08 13:12:34,118 INFO L290 TraceCheckUtils]: 48: Hoare triple {4671#false} assume !(0 == ~cond); {4671#false} is VALID [2022-04-08 13:12:34,118 INFO L290 TraceCheckUtils]: 49: Hoare triple {4671#false} assume true; {4671#false} is VALID [2022-04-08 13:12:34,118 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4671#false} {4671#false} #88#return; {4671#false} is VALID [2022-04-08 13:12:34,118 INFO L272 TraceCheckUtils]: 51: Hoare triple {4671#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4671#false} is VALID [2022-04-08 13:12:34,119 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-08 13:12:34,119 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-08 13:12:34,119 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-08 13:12:34,119 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 36 proven. 46 refuted. 0 times theorem prover too weak. 26 trivial. 0 not checked. [2022-04-08 13:12:34,119 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:12:34,368 INFO L290 TraceCheckUtils]: 54: Hoare triple {4671#false} assume !false; {4671#false} is VALID [2022-04-08 13:12:34,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {4671#false} assume 0 == ~cond; {4671#false} is VALID [2022-04-08 13:12:34,369 INFO L290 TraceCheckUtils]: 52: Hoare triple {4671#false} ~cond := #in~cond; {4671#false} is VALID [2022-04-08 13:12:34,369 INFO L272 TraceCheckUtils]: 51: Hoare triple {4671#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {4671#false} is VALID [2022-04-08 13:12:34,369 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4670#true} {4671#false} #88#return; {4671#false} is VALID [2022-04-08 13:12:34,369 INFO L290 TraceCheckUtils]: 49: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:12:34,369 INFO L290 TraceCheckUtils]: 48: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:12:34,369 INFO L290 TraceCheckUtils]: 47: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:12:34,369 INFO L272 TraceCheckUtils]: 46: Hoare triple {4671#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {4670#true} is VALID [2022-04-08 13:12:34,369 INFO L290 TraceCheckUtils]: 45: Hoare triple {4671#false} assume !(#t~post6 < 100);havoc #t~post6; {4671#false} is VALID [2022-04-08 13:12:34,369 INFO L290 TraceCheckUtils]: 44: Hoare triple {4671#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4671#false} is VALID [2022-04-08 13:12:34,370 INFO L290 TraceCheckUtils]: 43: Hoare triple {4874#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {4671#false} is VALID [2022-04-08 13:12:34,370 INFO L290 TraceCheckUtils]: 42: Hoare triple {4878#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4874#(< |main_#t~post5| 100)} is VALID [2022-04-08 13:12:34,371 INFO L290 TraceCheckUtils]: 41: Hoare triple {4878#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4878#(< ~counter~0 100)} is VALID [2022-04-08 13:12:34,371 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {4670#true} {4878#(< ~counter~0 100)} #82#return; {4878#(< ~counter~0 100)} is VALID [2022-04-08 13:12:34,371 INFO L290 TraceCheckUtils]: 39: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:12:34,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:12:34,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:12:34,372 INFO L272 TraceCheckUtils]: 36: Hoare triple {4878#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-08 13:12:34,372 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {4670#true} {4878#(< ~counter~0 100)} #80#return; {4878#(< ~counter~0 100)} is VALID [2022-04-08 13:12:34,372 INFO L290 TraceCheckUtils]: 34: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:12:34,373 INFO L290 TraceCheckUtils]: 33: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:12:34,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:12:34,373 INFO L272 TraceCheckUtils]: 31: Hoare triple {4878#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-08 13:12:34,373 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {4670#true} {4878#(< ~counter~0 100)} #78#return; {4878#(< ~counter~0 100)} is VALID [2022-04-08 13:12:34,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:12:34,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:12:34,374 INFO L290 TraceCheckUtils]: 27: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:12:34,374 INFO L272 TraceCheckUtils]: 26: Hoare triple {4878#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-08 13:12:34,374 INFO L290 TraceCheckUtils]: 25: Hoare triple {4878#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {4878#(< ~counter~0 100)} is VALID [2022-04-08 13:12:34,375 INFO L290 TraceCheckUtils]: 24: Hoare triple {4933#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4878#(< ~counter~0 100)} is VALID [2022-04-08 13:12:34,378 INFO L290 TraceCheckUtils]: 23: Hoare triple {4933#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {4933#(< ~counter~0 99)} is VALID [2022-04-08 13:12:34,378 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {4670#true} {4933#(< ~counter~0 99)} #82#return; {4933#(< ~counter~0 99)} is VALID [2022-04-08 13:12:34,378 INFO L290 TraceCheckUtils]: 21: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:12:34,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:12:34,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:12:34,381 INFO L272 TraceCheckUtils]: 18: Hoare triple {4933#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {4670#true} is VALID [2022-04-08 13:12:34,381 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {4670#true} {4933#(< ~counter~0 99)} #80#return; {4933#(< ~counter~0 99)} is VALID [2022-04-08 13:12:34,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:12:34,381 INFO L290 TraceCheckUtils]: 15: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:12:34,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:12:34,382 INFO L272 TraceCheckUtils]: 13: Hoare triple {4933#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {4670#true} is VALID [2022-04-08 13:12:34,382 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {4670#true} {4933#(< ~counter~0 99)} #78#return; {4933#(< ~counter~0 99)} is VALID [2022-04-08 13:12:34,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {4670#true} assume true; {4670#true} is VALID [2022-04-08 13:12:34,382 INFO L290 TraceCheckUtils]: 10: Hoare triple {4670#true} assume !(0 == ~cond); {4670#true} is VALID [2022-04-08 13:12:34,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {4670#true} ~cond := #in~cond; {4670#true} is VALID [2022-04-08 13:12:34,383 INFO L272 TraceCheckUtils]: 8: Hoare triple {4933#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {4670#true} is VALID [2022-04-08 13:12:34,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {4933#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {4933#(< ~counter~0 99)} is VALID [2022-04-08 13:12:34,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {4988#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {4933#(< ~counter~0 99)} is VALID [2022-04-08 13:12:34,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {4988#(< ~counter~0 98)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {4988#(< ~counter~0 98)} is VALID [2022-04-08 13:12:34,385 INFO L272 TraceCheckUtils]: 4: Hoare triple {4988#(< ~counter~0 98)} call #t~ret7 := main(); {4988#(< ~counter~0 98)} is VALID [2022-04-08 13:12:34,385 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4988#(< ~counter~0 98)} {4670#true} #92#return; {4988#(< ~counter~0 98)} is VALID [2022-04-08 13:12:34,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {4988#(< ~counter~0 98)} assume true; {4988#(< ~counter~0 98)} is VALID [2022-04-08 13:12:34,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {4670#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4988#(< ~counter~0 98)} is VALID [2022-04-08 13:12:34,386 INFO L272 TraceCheckUtils]: 0: Hoare triple {4670#true} call ULTIMATE.init(); {4670#true} is VALID [2022-04-08 13:12:34,387 INFO L134 CoverageAnalysis]: Checked inductivity of 108 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 13:12:34,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:34,387 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846563628] [2022-04-08 13:12:34,387 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:34,388 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [384928387] [2022-04-08 13:12:34,388 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [384928387] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:12:34,388 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:12:34,388 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 13:12:34,390 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:34,390 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1975260320] [2022-04-08 13:12:34,390 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1975260320] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:34,390 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:34,390 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 13:12:34,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864506559] [2022-04-08 13:12:34,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:34,392 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-08 13:12:34,392 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:34,392 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:34,424 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-08 13:12:34,425 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 13:12:34,425 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:34,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 13:12:34,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:12:34,425 INFO L87 Difference]: Start difference. First operand 91 states and 107 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:34,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:34,595 INFO L93 Difference]: Finished difference Result 126 states and 155 transitions. [2022-04-08 13:12:34,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:12:34,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) Word has length 55 [2022-04-08 13:12:34,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:34,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:34,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 13:12:34,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:34,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 13:12:34,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-08 13:12:34,663 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:34,665 INFO L225 Difference]: With dead ends: 126 [2022-04-08 13:12:34,665 INFO L226 Difference]: Without dead ends: 93 [2022-04-08 13:12:34,665 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 13:12:34,666 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 5 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 29 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 29 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:34,666 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 115 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 29 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:12:34,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-04-08 13:12:34,724 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2022-04-08 13:12:34,724 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:34,725 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:12:34,725 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:12:34,725 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:12:34,727 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:34,727 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-08 13:12:34,727 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-08 13:12:34,728 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:34,728 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:34,728 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-08 13:12:34,728 INFO L87 Difference]: Start difference. First operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) Second operand 93 states. [2022-04-08 13:12:34,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:34,730 INFO L93 Difference]: Finished difference Result 93 states and 109 transitions. [2022-04-08 13:12:34,730 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-08 13:12:34,731 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:34,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:34,731 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:34,731 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:34,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.1833333333333333) internal successors, (71), 63 states have internal predecessors, (71), 20 states have call successors, (20), 13 states have call predecessors, (20), 12 states have return successors, (18), 16 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 13:12:34,733 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 109 transitions. [2022-04-08 13:12:34,733 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 109 transitions. Word has length 55 [2022-04-08 13:12:34,734 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:34,734 INFO L478 AbstractCegarLoop]: Abstraction has 93 states and 109 transitions. [2022-04-08 13:12:34,734 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 states have internal predecessors, (24), 5 states have call successors, (10), 5 states have call predecessors, (10), 4 states have return successors, (8), 4 states have call predecessors, (8), 4 states have call successors, (8) [2022-04-08 13:12:34,734 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 93 states and 109 transitions. [2022-04-08 13:12:34,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:34,852 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 109 transitions. [2022-04-08 13:12:34,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 13:12:34,852 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:34,852 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:34,868 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-08 13:12:35,053 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:35,053 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:35,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:35,054 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 1 times [2022-04-08 13:12:35,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:35,054 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [648556637] [2022-04-08 13:12:39,167 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:12:39,167 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:12:39,167 INFO L85 PathProgramCache]: Analyzing trace with hash -43330764, now seen corresponding path program 2 times [2022-04-08 13:12:39,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:39,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [46922499] [2022-04-08 13:12:39,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:39,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:39,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:39,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1923290199] [2022-04-08 13:12:39,178 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:39,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:39,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:39,183 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-08 13:12:39,185 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-08 13:12:39,232 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:39,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:39,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 13:12:39,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:39,248 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:39,497 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-08 13:12:39,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5645#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:39,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {5645#(<= ~counter~0 0)} assume true; {5645#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:39,498 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5645#(<= ~counter~0 0)} {5637#true} #92#return; {5645#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:39,499 INFO L272 TraceCheckUtils]: 4: Hoare triple {5645#(<= ~counter~0 0)} call #t~ret7 := main(); {5645#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:39,499 INFO L290 TraceCheckUtils]: 5: Hoare triple {5645#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5645#(<= ~counter~0 0)} is VALID [2022-04-08 13:12:39,505 INFO L290 TraceCheckUtils]: 6: Hoare triple {5645#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {5661#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,506 INFO L272 TraceCheckUtils]: 8: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,506 INFO L290 TraceCheckUtils]: 9: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,507 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #78#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,507 INFO L272 TraceCheckUtils]: 13: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,508 INFO L290 TraceCheckUtils]: 16: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,509 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #80#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,509 INFO L272 TraceCheckUtils]: 18: Hoare triple {5661#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,509 INFO L290 TraceCheckUtils]: 19: Hoare triple {5661#(<= ~counter~0 1)} ~cond := #in~cond; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {5661#(<= ~counter~0 1)} assume !(0 == ~cond); {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,510 INFO L290 TraceCheckUtils]: 21: Hoare triple {5661#(<= ~counter~0 1)} assume true; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,510 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5661#(<= ~counter~0 1)} {5661#(<= ~counter~0 1)} #82#return; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {5661#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5661#(<= ~counter~0 1)} is VALID [2022-04-08 13:12:39,511 INFO L290 TraceCheckUtils]: 24: Hoare triple {5661#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,511 INFO L290 TraceCheckUtils]: 25: Hoare triple {5716#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,512 INFO L272 TraceCheckUtils]: 26: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,512 INFO L290 TraceCheckUtils]: 27: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,512 INFO L290 TraceCheckUtils]: 28: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,512 INFO L290 TraceCheckUtils]: 29: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,513 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #78#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,513 INFO L272 TraceCheckUtils]: 31: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,513 INFO L290 TraceCheckUtils]: 32: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,514 INFO L290 TraceCheckUtils]: 33: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,514 INFO L290 TraceCheckUtils]: 34: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,514 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #80#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,515 INFO L272 TraceCheckUtils]: 36: Hoare triple {5716#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {5716#(<= ~counter~0 2)} ~cond := #in~cond; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {5716#(<= ~counter~0 2)} assume !(0 == ~cond); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,516 INFO L290 TraceCheckUtils]: 39: Hoare triple {5716#(<= ~counter~0 2)} assume true; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,516 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5716#(<= ~counter~0 2)} {5716#(<= ~counter~0 2)} #82#return; {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,516 INFO L290 TraceCheckUtils]: 41: Hoare triple {5716#(<= ~counter~0 2)} assume !(~r~0 >= ~d~0); {5716#(<= ~counter~0 2)} is VALID [2022-04-08 13:12:39,517 INFO L290 TraceCheckUtils]: 42: Hoare triple {5716#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,517 INFO L290 TraceCheckUtils]: 43: Hoare triple {5771#(<= ~counter~0 3)} assume !!(#t~post6 < 100);havoc #t~post6; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,518 INFO L272 TraceCheckUtils]: 44: Hoare triple {5771#(<= ~counter~0 3)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,518 INFO L290 TraceCheckUtils]: 45: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,518 INFO L290 TraceCheckUtils]: 46: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,518 INFO L290 TraceCheckUtils]: 47: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,519 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #84#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,519 INFO L272 TraceCheckUtils]: 49: Hoare triple {5771#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {5771#(<= ~counter~0 3)} ~cond := #in~cond; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,520 INFO L290 TraceCheckUtils]: 51: Hoare triple {5771#(<= ~counter~0 3)} assume !(0 == ~cond); {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,520 INFO L290 TraceCheckUtils]: 52: Hoare triple {5771#(<= ~counter~0 3)} assume true; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,521 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5771#(<= ~counter~0 3)} {5771#(<= ~counter~0 3)} #86#return; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,521 INFO L290 TraceCheckUtils]: 54: Hoare triple {5771#(<= ~counter~0 3)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,522 INFO L290 TraceCheckUtils]: 55: Hoare triple {5771#(<= ~counter~0 3)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5771#(<= ~counter~0 3)} is VALID [2022-04-08 13:12:39,522 INFO L290 TraceCheckUtils]: 56: Hoare triple {5771#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5814#(<= |main_#t~post6| 3)} is VALID [2022-04-08 13:12:39,523 INFO L290 TraceCheckUtils]: 57: Hoare triple {5814#(<= |main_#t~post6| 3)} assume !(#t~post6 < 100);havoc #t~post6; {5638#false} is VALID [2022-04-08 13:12:39,523 INFO L272 TraceCheckUtils]: 58: Hoare triple {5638#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5638#false} is VALID [2022-04-08 13:12:39,523 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-08 13:12:39,523 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-08 13:12:39,523 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-08 13:12:39,523 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 92 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-08 13:12:39,523 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:12:39,855 INFO L290 TraceCheckUtils]: 61: Hoare triple {5638#false} assume !false; {5638#false} is VALID [2022-04-08 13:12:39,855 INFO L290 TraceCheckUtils]: 60: Hoare triple {5638#false} assume 0 == ~cond; {5638#false} is VALID [2022-04-08 13:12:39,855 INFO L290 TraceCheckUtils]: 59: Hoare triple {5638#false} ~cond := #in~cond; {5638#false} is VALID [2022-04-08 13:12:39,855 INFO L272 TraceCheckUtils]: 58: Hoare triple {5638#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {5638#false} is VALID [2022-04-08 13:12:39,856 INFO L290 TraceCheckUtils]: 57: Hoare triple {5842#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {5638#false} is VALID [2022-04-08 13:12:39,856 INFO L290 TraceCheckUtils]: 56: Hoare triple {5846#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5842#(< |main_#t~post6| 100)} is VALID [2022-04-08 13:12:39,856 INFO L290 TraceCheckUtils]: 55: Hoare triple {5846#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {5846#(< ~counter~0 100)} is VALID [2022-04-08 13:12:39,857 INFO L290 TraceCheckUtils]: 54: Hoare triple {5846#(< ~counter~0 100)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {5846#(< ~counter~0 100)} is VALID [2022-04-08 13:12:39,857 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {5637#true} {5846#(< ~counter~0 100)} #86#return; {5846#(< ~counter~0 100)} is VALID [2022-04-08 13:12:39,857 INFO L290 TraceCheckUtils]: 52: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:12:39,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:12:39,858 INFO L290 TraceCheckUtils]: 50: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:12:39,858 INFO L272 TraceCheckUtils]: 49: Hoare triple {5846#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-08 13:12:39,858 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {5637#true} {5846#(< ~counter~0 100)} #84#return; {5846#(< ~counter~0 100)} is VALID [2022-04-08 13:12:39,858 INFO L290 TraceCheckUtils]: 47: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:12:39,858 INFO L290 TraceCheckUtils]: 46: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:12:39,859 INFO L290 TraceCheckUtils]: 45: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:12:39,859 INFO L272 TraceCheckUtils]: 44: Hoare triple {5846#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {5637#true} is VALID [2022-04-08 13:12:39,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {5846#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {5846#(< ~counter~0 100)} is VALID [2022-04-08 13:12:39,860 INFO L290 TraceCheckUtils]: 42: Hoare triple {5889#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5846#(< ~counter~0 100)} is VALID [2022-04-08 13:12:39,860 INFO L290 TraceCheckUtils]: 41: Hoare triple {5889#(< ~counter~0 99)} assume !(~r~0 >= ~d~0); {5889#(< ~counter~0 99)} is VALID [2022-04-08 13:12:39,860 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {5637#true} {5889#(< ~counter~0 99)} #82#return; {5889#(< ~counter~0 99)} is VALID [2022-04-08 13:12:39,861 INFO L290 TraceCheckUtils]: 39: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:12:39,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:12:39,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:12:39,861 INFO L272 TraceCheckUtils]: 36: Hoare triple {5889#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-08 13:12:39,861 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {5637#true} {5889#(< ~counter~0 99)} #80#return; {5889#(< ~counter~0 99)} is VALID [2022-04-08 13:12:39,861 INFO L290 TraceCheckUtils]: 34: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:12:39,862 INFO L290 TraceCheckUtils]: 33: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:12:39,862 INFO L290 TraceCheckUtils]: 32: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:12:39,862 INFO L272 TraceCheckUtils]: 31: Hoare triple {5889#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-08 13:12:39,862 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {5637#true} {5889#(< ~counter~0 99)} #78#return; {5889#(< ~counter~0 99)} is VALID [2022-04-08 13:12:39,862 INFO L290 TraceCheckUtils]: 29: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:12:39,862 INFO L290 TraceCheckUtils]: 28: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:12:39,862 INFO L290 TraceCheckUtils]: 27: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:12:39,863 INFO L272 TraceCheckUtils]: 26: Hoare triple {5889#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-08 13:12:39,863 INFO L290 TraceCheckUtils]: 25: Hoare triple {5889#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {5889#(< ~counter~0 99)} is VALID [2022-04-08 13:12:39,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {5944#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5889#(< ~counter~0 99)} is VALID [2022-04-08 13:12:39,864 INFO L290 TraceCheckUtils]: 23: Hoare triple {5944#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {5944#(< ~counter~0 98)} is VALID [2022-04-08 13:12:39,864 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {5637#true} {5944#(< ~counter~0 98)} #82#return; {5944#(< ~counter~0 98)} is VALID [2022-04-08 13:12:39,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:12:39,864 INFO L290 TraceCheckUtils]: 20: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:12:39,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:12:39,865 INFO L272 TraceCheckUtils]: 18: Hoare triple {5944#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {5637#true} is VALID [2022-04-08 13:12:39,865 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {5637#true} {5944#(< ~counter~0 98)} #80#return; {5944#(< ~counter~0 98)} is VALID [2022-04-08 13:12:39,865 INFO L290 TraceCheckUtils]: 16: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:12:39,865 INFO L290 TraceCheckUtils]: 15: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:12:39,865 INFO L290 TraceCheckUtils]: 14: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:12:39,865 INFO L272 TraceCheckUtils]: 13: Hoare triple {5944#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {5637#true} is VALID [2022-04-08 13:12:39,866 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {5637#true} {5944#(< ~counter~0 98)} #78#return; {5944#(< ~counter~0 98)} is VALID [2022-04-08 13:12:39,866 INFO L290 TraceCheckUtils]: 11: Hoare triple {5637#true} assume true; {5637#true} is VALID [2022-04-08 13:12:39,866 INFO L290 TraceCheckUtils]: 10: Hoare triple {5637#true} assume !(0 == ~cond); {5637#true} is VALID [2022-04-08 13:12:39,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {5637#true} ~cond := #in~cond; {5637#true} is VALID [2022-04-08 13:12:39,866 INFO L272 TraceCheckUtils]: 8: Hoare triple {5944#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {5637#true} is VALID [2022-04-08 13:12:39,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {5944#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {5944#(< ~counter~0 98)} is VALID [2022-04-08 13:12:39,867 INFO L290 TraceCheckUtils]: 6: Hoare triple {5999#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {5944#(< ~counter~0 98)} is VALID [2022-04-08 13:12:39,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {5999#(< ~counter~0 97)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {5999#(< ~counter~0 97)} is VALID [2022-04-08 13:12:39,868 INFO L272 TraceCheckUtils]: 4: Hoare triple {5999#(< ~counter~0 97)} call #t~ret7 := main(); {5999#(< ~counter~0 97)} is VALID [2022-04-08 13:12:39,868 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5999#(< ~counter~0 97)} {5637#true} #92#return; {5999#(< ~counter~0 97)} is VALID [2022-04-08 13:12:39,868 INFO L290 TraceCheckUtils]: 2: Hoare triple {5999#(< ~counter~0 97)} assume true; {5999#(< ~counter~0 97)} is VALID [2022-04-08 13:12:39,869 INFO L290 TraceCheckUtils]: 1: Hoare triple {5637#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5999#(< ~counter~0 97)} is VALID [2022-04-08 13:12:39,869 INFO L272 TraceCheckUtils]: 0: Hoare triple {5637#true} call ULTIMATE.init(); {5637#true} is VALID [2022-04-08 13:12:39,869 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 16 proven. 8 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 13:12:39,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:39,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [46922499] [2022-04-08 13:12:39,870 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:39,870 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923290199] [2022-04-08 13:12:39,870 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923290199] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:12:39,870 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:12:39,870 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 13:12:39,871 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:39,871 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [648556637] [2022-04-08 13:12:39,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [648556637] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:39,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:39,871 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:12:39,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869588426] [2022-04-08 13:12:39,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:39,872 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-08 13:12:39,872 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:39,872 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:12:39,908 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-08 13:12:39,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 13:12:39,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:39,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 13:12:39,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 13:12:39,914 INFO L87 Difference]: Start difference. First operand 93 states and 109 transitions. Second operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:12:40,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:40,272 INFO L93 Difference]: Finished difference Result 145 states and 168 transitions. [2022-04-08 13:12:40,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:12:40,273 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 62 [2022-04-08 13:12:40,273 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:40,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:12:40,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 13:12:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:12:40,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-08 13:12:40,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-08 13:12:40,365 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-08 13:12:40,368 INFO L225 Difference]: With dead ends: 145 [2022-04-08 13:12:40,369 INFO L226 Difference]: Without dead ends: 130 [2022-04-08 13:12:40,369 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 113 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-08 13:12:40,370 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 23 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:40,370 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 190 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:12:40,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-04-08 13:12:40,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 127. [2022-04-08 13:12:40,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:40,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 13:12:40,492 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 13:12:40,492 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 13:12:40,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:40,496 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-08 13:12:40,496 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-08 13:12:40,497 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:40,497 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:40,497 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-08 13:12:40,497 INFO L87 Difference]: Start difference. First operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) Second operand 130 states. [2022-04-08 13:12:40,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:40,501 INFO L93 Difference]: Finished difference Result 130 states and 150 transitions. [2022-04-08 13:12:40,501 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 150 transitions. [2022-04-08 13:12:40,501 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:40,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:40,501 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:40,501 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:40,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 83 states have (on average 1.1686746987951808) internal successors, (97), 86 states have internal predecessors, (97), 27 states have call successors, (27), 18 states have call predecessors, (27), 16 states have return successors, (24), 22 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 13:12:40,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 148 transitions. [2022-04-08 13:12:40,505 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 148 transitions. Word has length 62 [2022-04-08 13:12:40,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:40,506 INFO L478 AbstractCegarLoop]: Abstraction has 127 states and 148 transitions. [2022-04-08 13:12:40,506 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.857142857142857) internal successors, (27), 6 states have internal predecessors, (27), 6 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:12:40,506 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 127 states and 148 transitions. [2022-04-08 13:12:40,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:40,647 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 148 transitions. [2022-04-08 13:12:40,647 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2022-04-08 13:12:40,647 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:40,647 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:40,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-08 13:12:40,848 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 13:12:40,848 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:40,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:40,849 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 1 times [2022-04-08 13:12:40,849 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:40,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [506630682] [2022-04-08 13:12:43,209 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:12:43,209 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:12:43,209 INFO L85 PathProgramCache]: Analyzing trace with hash -41602886, now seen corresponding path program 2 times [2022-04-08 13:12:43,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:43,209 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1871327367] [2022-04-08 13:12:43,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:43,209 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:43,218 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:43,219 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [839397548] [2022-04-08 13:12:43,219 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:12:43,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:43,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:43,224 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-08 13:12:43,229 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-08 13:12:43,271 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:12:43,271 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:43,272 INFO L263 TraceCheckSpWp]: Trace formula consists of 178 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 13:12:43,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:43,289 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:43,768 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-08 13:12:43,768 INFO L290 TraceCheckUtils]: 1: Hoare triple {6826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6826#true} is VALID [2022-04-08 13:12:43,768 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:43,768 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-08 13:12:43,768 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-08 13:12:43,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {6826#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:43,769 INFO L290 TraceCheckUtils]: 6: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:43,769 INFO L290 TraceCheckUtils]: 7: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:43,769 INFO L272 TraceCheckUtils]: 8: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:43,769 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:43,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:43,770 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:43,770 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:43,770 INFO L272 TraceCheckUtils]: 13: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:43,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:43,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:43,770 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:43,771 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:43,771 INFO L272 TraceCheckUtils]: 18: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:43,771 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:43,771 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:43,771 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:43,772 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6826#true} {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:43,772 INFO L290 TraceCheckUtils]: 23: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,772 INFO L290 TraceCheckUtils]: 24: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,773 INFO L290 TraceCheckUtils]: 25: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,773 INFO L272 TraceCheckUtils]: 26: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:43,773 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:43,773 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:43,773 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:43,774 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,774 INFO L272 TraceCheckUtils]: 31: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:43,774 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:43,774 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:43,774 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:43,775 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,775 INFO L272 TraceCheckUtils]: 36: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:43,775 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:43,775 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:43,775 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:43,776 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,776 INFO L290 TraceCheckUtils]: 41: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,777 INFO L290 TraceCheckUtils]: 42: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,777 INFO L290 TraceCheckUtils]: 43: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,777 INFO L272 TraceCheckUtils]: 44: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:43,777 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:43,777 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:43,777 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:43,778 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,778 INFO L272 TraceCheckUtils]: 49: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:43,778 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:43,778 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:43,778 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:43,779 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6826#true} {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:12:43,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {6901#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:12:43,781 INFO L290 TraceCheckUtils]: 55: Hoare triple {6846#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-08 13:12:43,781 INFO L290 TraceCheckUtils]: 56: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-08 13:12:43,782 INFO L290 TraceCheckUtils]: 57: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} is VALID [2022-04-08 13:12:43,783 INFO L272 TraceCheckUtils]: 58: Hoare triple {6998#(and (= (+ main_~A~0 (* (- 1) main_~r~0)) main_~B~0) (= main_~B~0 1) (= main_~q~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:12:43,783 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:43,783 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-08 13:12:43,784 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-08 13:12:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 13:12:43,784 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:12:44,966 INFO L290 TraceCheckUtils]: 61: Hoare triple {6827#false} assume !false; {6827#false} is VALID [2022-04-08 13:12:44,966 INFO L290 TraceCheckUtils]: 60: Hoare triple {7012#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6827#false} is VALID [2022-04-08 13:12:44,967 INFO L290 TraceCheckUtils]: 59: Hoare triple {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {7012#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:44,967 INFO L272 TraceCheckUtils]: 58: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {7008#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:12:44,968 INFO L290 TraceCheckUtils]: 57: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 100);havoc #t~post6; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:12:44,968 INFO L290 TraceCheckUtils]: 56: Hoare triple {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:12:44,989 INFO L290 TraceCheckUtils]: 55: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {7028#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:12:45,013 INFO L290 TraceCheckUtils]: 54: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:12:45,014 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,015 INFO L290 TraceCheckUtils]: 52: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:45,015 INFO L290 TraceCheckUtils]: 51: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:45,015 INFO L290 TraceCheckUtils]: 50: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:45,015 INFO L272 TraceCheckUtils]: 49: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:45,016 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,016 INFO L290 TraceCheckUtils]: 47: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:45,017 INFO L290 TraceCheckUtils]: 46: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:45,017 INFO L290 TraceCheckUtils]: 45: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:45,017 INFO L272 TraceCheckUtils]: 44: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:45,019 INFO L290 TraceCheckUtils]: 43: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 100);havoc #t~post6; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,023 INFO L290 TraceCheckUtils]: 42: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,025 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #82#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,025 INFO L290 TraceCheckUtils]: 39: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:45,025 INFO L290 TraceCheckUtils]: 38: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:45,025 INFO L290 TraceCheckUtils]: 37: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:45,026 INFO L272 TraceCheckUtils]: 36: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:45,026 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #80#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,026 INFO L290 TraceCheckUtils]: 34: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:45,026 INFO L290 TraceCheckUtils]: 33: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:45,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:45,027 INFO L272 TraceCheckUtils]: 31: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:45,027 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {6826#true} {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #78#return; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:45,028 INFO L290 TraceCheckUtils]: 28: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:45,028 INFO L290 TraceCheckUtils]: 27: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:45,028 INFO L272 TraceCheckUtils]: 26: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:45,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post5 < 100);havoc #t~post5; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,030 INFO L290 TraceCheckUtils]: 24: Hoare triple {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,038 INFO L290 TraceCheckUtils]: 23: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {7042#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:12:45,039 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #82#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:12:45,039 INFO L290 TraceCheckUtils]: 21: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:45,039 INFO L290 TraceCheckUtils]: 20: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:45,039 INFO L290 TraceCheckUtils]: 19: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:45,039 INFO L272 TraceCheckUtils]: 18: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:45,040 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #80#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:12:45,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:45,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:45,040 INFO L290 TraceCheckUtils]: 14: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:45,040 INFO L272 TraceCheckUtils]: 13: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:45,041 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {6826#true} {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #78#return; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:12:45,041 INFO L290 TraceCheckUtils]: 11: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:45,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {6826#true} assume !(0 == ~cond); {6826#true} is VALID [2022-04-08 13:12:45,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {6826#true} ~cond := #in~cond; {6826#true} is VALID [2022-04-08 13:12:45,041 INFO L272 TraceCheckUtils]: 8: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {6826#true} is VALID [2022-04-08 13:12:45,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:12:45,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:12:45,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {6826#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {7038#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:12:45,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {6826#true} call #t~ret7 := main(); {6826#true} is VALID [2022-04-08 13:12:45,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6826#true} {6826#true} #92#return; {6826#true} is VALID [2022-04-08 13:12:45,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {6826#true} assume true; {6826#true} is VALID [2022-04-08 13:12:45,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {6826#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6826#true} is VALID [2022-04-08 13:12:45,043 INFO L272 TraceCheckUtils]: 0: Hoare triple {6826#true} call ULTIMATE.init(); {6826#true} is VALID [2022-04-08 13:12:45,044 INFO L134 CoverageAnalysis]: Checked inductivity of 137 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 13:12:45,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:12:45,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1871327367] [2022-04-08 13:12:45,044 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:12:45,044 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [839397548] [2022-04-08 13:12:45,044 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [839397548] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:12:45,044 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:12:45,044 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 10 [2022-04-08 13:12:45,045 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:12:45,045 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [506630682] [2022-04-08 13:12:45,045 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [506630682] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:12:45,045 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:12:45,045 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:12:45,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1669972924] [2022-04-08 13:12:45,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:12:45,046 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-08 13:12:45,046 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:12:45,046 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:12:45,108 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-08 13:12:45,108 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 13:12:45,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:45,108 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 13:12:45,108 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:12:45,109 INFO L87 Difference]: Start difference. First operand 127 states and 148 transitions. Second operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:12:45,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:45,744 INFO L93 Difference]: Finished difference Result 181 states and 219 transitions. [2022-04-08 13:12:45,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 13:12:45,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) Word has length 62 [2022-04-08 13:12:45,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:12:45,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:12:45,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-08 13:12:45,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:12:45,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-04-08 13:12:45,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-04-08 13:12:45,847 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:45,849 INFO L225 Difference]: With dead ends: 181 [2022-04-08 13:12:45,850 INFO L226 Difference]: Without dead ends: 137 [2022-04-08 13:12:45,850 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 112 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 13:12:45,851 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 13 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 13:12:45,851 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 187 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 13:12:45,851 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-08 13:12:45,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 135. [2022-04-08 13:12:45,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:12:45,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 13:12:45,942 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 13:12:45,942 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 13:12:45,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:45,946 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-08 13:12:45,946 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-08 13:12:45,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:45,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:45,947 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-08 13:12:45,947 INFO L87 Difference]: Start difference. First operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) Second operand 137 states. [2022-04-08 13:12:45,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:12:45,950 INFO L93 Difference]: Finished difference Result 137 states and 159 transitions. [2022-04-08 13:12:45,950 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 159 transitions. [2022-04-08 13:12:45,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:12:45,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:12:45,951 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:12:45,951 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:12:45,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 89 states have (on average 1.1685393258426966) internal successors, (104), 92 states have internal predecessors, (104), 27 states have call successors, (27), 19 states have call predecessors, (27), 18 states have return successors, (25), 23 states have call predecessors, (25), 25 states have call successors, (25) [2022-04-08 13:12:45,954 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 156 transitions. [2022-04-08 13:12:45,954 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 156 transitions. Word has length 62 [2022-04-08 13:12:45,954 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:12:45,954 INFO L478 AbstractCegarLoop]: Abstraction has 135 states and 156 transitions. [2022-04-08 13:12:45,954 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.0) internal successors, (21), 6 states have internal predecessors, (21), 4 states have call successors, (11), 2 states have call predecessors, (11), 1 states have return successors, (9), 3 states have call predecessors, (9), 3 states have call successors, (9) [2022-04-08 13:12:45,954 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 135 states and 156 transitions. [2022-04-08 13:12:46,102 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:12:46,102 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 156 transitions. [2022-04-08 13:12:46,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-08 13:12:46,103 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:12:46,103 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:12:46,119 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2022-04-08 13:12:46,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 13:12:46,304 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:12:46,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:12:46,304 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 3 times [2022-04-08 13:12:46,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:12:46,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1184488684] [2022-04-08 13:12:50,422 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:12:50,422 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:12:50,422 INFO L85 PathProgramCache]: Analyzing trace with hash -378736343, now seen corresponding path program 4 times [2022-04-08 13:12:50,422 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:12:50,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136993629] [2022-04-08 13:12:50,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:12:50,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:12:50,435 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:12:50,435 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1913328171] [2022-04-08 13:12:50,435 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:12:50,435 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:12:50,435 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:12:50,448 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-08 13:12:50,456 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-08 13:12:50,501 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:12:50,501 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:12:50,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 13:12:50,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:12:50,529 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:12:52,889 INFO L272 TraceCheckUtils]: 0: Hoare triple {8115#true} call ULTIMATE.init(); {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L290 TraceCheckUtils]: 1: Hoare triple {8115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L290 TraceCheckUtils]: 2: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8115#true} {8115#true} #92#return; {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L272 TraceCheckUtils]: 4: Hoare triple {8115#true} call #t~ret7 := main(); {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L290 TraceCheckUtils]: 5: Hoare triple {8115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {8115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L290 TraceCheckUtils]: 7: Hoare triple {8115#true} assume !!(#t~post5 < 100);havoc #t~post5; {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L272 TraceCheckUtils]: 8: Hoare triple {8115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L290 TraceCheckUtils]: 9: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:12:52,890 INFO L290 TraceCheckUtils]: 10: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:12:52,891 INFO L290 TraceCheckUtils]: 11: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:12:52,891 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8115#true} {8115#true} #78#return; {8115#true} is VALID [2022-04-08 13:12:52,891 INFO L272 TraceCheckUtils]: 13: Hoare triple {8115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8115#true} is VALID [2022-04-08 13:12:52,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:52,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:52,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:52,893 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8115#true} #80#return; {8173#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:52,894 INFO L272 TraceCheckUtils]: 18: Hoare triple {8173#(= main_~A~0 main_~r~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-08 13:12:52,894 INFO L290 TraceCheckUtils]: 19: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:12:52,894 INFO L290 TraceCheckUtils]: 20: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:12:52,894 INFO L290 TraceCheckUtils]: 21: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:12:52,894 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {8115#true} {8173#(= main_~A~0 main_~r~0)} #82#return; {8173#(= main_~A~0 main_~r~0)} is VALID [2022-04-08 13:12:52,895 INFO L290 TraceCheckUtils]: 23: Hoare triple {8173#(= main_~A~0 main_~r~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 13:12:52,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 13:12:52,896 INFO L290 TraceCheckUtils]: 25: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} is VALID [2022-04-08 13:12:52,896 INFO L272 TraceCheckUtils]: 26: Hoare triple {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {8115#true} is VALID [2022-04-08 13:12:52,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:52,897 INFO L290 TraceCheckUtils]: 28: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:52,897 INFO L290 TraceCheckUtils]: 29: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:52,898 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8192#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0))} #78#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:52,898 INFO L272 TraceCheckUtils]: 31: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {8115#true} is VALID [2022-04-08 13:12:52,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:12:52,898 INFO L290 TraceCheckUtils]: 33: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:12:52,898 INFO L290 TraceCheckUtils]: 34: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:12:52,899 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8115#true} {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #80#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:52,899 INFO L272 TraceCheckUtils]: 36: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-08 13:12:52,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:12:52,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:12:52,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:12:52,900 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {8115#true} {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #82#return; {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:52,900 INFO L290 TraceCheckUtils]: 41: Hoare triple {8214#(and (= main_~A~0 main_~r~0) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !(~r~0 >= ~d~0); {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:52,901 INFO L290 TraceCheckUtils]: 42: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:52,902 INFO L290 TraceCheckUtils]: 43: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:52,902 INFO L272 TraceCheckUtils]: 44: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8115#true} is VALID [2022-04-08 13:12:52,902 INFO L290 TraceCheckUtils]: 45: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:12:52,902 INFO L290 TraceCheckUtils]: 46: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:12:52,902 INFO L290 TraceCheckUtils]: 47: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:12:52,902 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {8115#true} {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #84#return; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:52,903 INFO L272 TraceCheckUtils]: 49: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8115#true} is VALID [2022-04-08 13:12:52,903 INFO L290 TraceCheckUtils]: 50: Hoare triple {8115#true} ~cond := #in~cond; {8115#true} is VALID [2022-04-08 13:12:52,903 INFO L290 TraceCheckUtils]: 51: Hoare triple {8115#true} assume !(0 == ~cond); {8115#true} is VALID [2022-04-08 13:12:52,903 INFO L290 TraceCheckUtils]: 52: Hoare triple {8115#true} assume true; {8115#true} is VALID [2022-04-08 13:12:52,904 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {8115#true} {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} #86#return; {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} is VALID [2022-04-08 13:12:52,905 INFO L290 TraceCheckUtils]: 54: Hoare triple {8248#(and (= main_~A~0 main_~r~0) (not (<= main_~d~0 main_~r~0)) (<= (div main_~d~0 2) main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {8288#(and (= main_~A~0 main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0))} is VALID [2022-04-08 13:12:52,906 INFO L290 TraceCheckUtils]: 55: Hoare triple {8288#(and (= main_~A~0 main_~r~0) (< main_~d~0 (+ main_~r~0 1)) (< (div (+ (- 1) (* (- 1) main_~r~0)) (- 2)) (+ main_~d~0 1)) (= main_~q~0 0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-08 13:12:52,906 INFO L290 TraceCheckUtils]: 56: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-08 13:12:52,907 INFO L290 TraceCheckUtils]: 57: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} is VALID [2022-04-08 13:12:52,907 INFO L272 TraceCheckUtils]: 58: Hoare triple {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {8115#true} is VALID [2022-04-08 13:12:52,907 INFO L290 TraceCheckUtils]: 59: Hoare triple {8115#true} ~cond := #in~cond; {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:52,907 INFO L290 TraceCheckUtils]: 60: Hoare triple {8162#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:52,908 INFO L290 TraceCheckUtils]: 61: Hoare triple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:12:52,911 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {8166#(not (= |__VERIFIER_assert_#in~cond| 0))} {8292#(and (= main_~q~0 main_~p~0) (< (div (+ (- 1) (* (- 1) main_~A~0)) (- 2)) (+ main_~d~0 1)) (< main_~d~0 (+ main_~A~0 1)) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)))} #84#return; {8314#(exists ((aux_div_main_~A~0_41 Int) (aux_mod_main_~A~0_41 Int)) (and (< aux_div_main_~A~0_41 (+ main_~d~0 1)) (< (+ main_~d~0 aux_mod_main_~A~0_41) (* 2 aux_div_main_~A~0_41)) (= (+ (- 1) (* (- 1) main_~d~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41)) (+ (- 1) (* (- 1) main_~B~0 main_~p~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41))) (<= 0 aux_mod_main_~A~0_41) (< aux_mod_main_~A~0_41 2)))} is VALID [2022-04-08 13:12:52,912 INFO L272 TraceCheckUtils]: 63: Hoare triple {8314#(exists ((aux_div_main_~A~0_41 Int) (aux_mod_main_~A~0_41 Int)) (and (< aux_div_main_~A~0_41 (+ main_~d~0 1)) (< (+ main_~d~0 aux_mod_main_~A~0_41) (* 2 aux_div_main_~A~0_41)) (= (+ (- 1) (* (- 1) main_~d~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41)) (+ (- 1) (* (- 1) main_~B~0 main_~p~0) (* 2 aux_div_main_~A~0_41) (* (- 1) aux_mod_main_~A~0_41))) (<= 0 aux_mod_main_~A~0_41) (< aux_mod_main_~A~0_41 2)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:12:52,912 INFO L290 TraceCheckUtils]: 64: Hoare triple {8318#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8322#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:12:52,913 INFO L290 TraceCheckUtils]: 65: Hoare triple {8322#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8116#false} is VALID [2022-04-08 13:12:52,913 INFO L290 TraceCheckUtils]: 66: Hoare triple {8116#false} assume !false; {8116#false} is VALID [2022-04-08 13:12:52,913 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 48 proven. 34 refuted. 0 times theorem prover too weak. 90 trivial. 0 not checked. [2022-04-08 13:12:52,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:11,253 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 13:13:27,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:27,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136993629] [2022-04-08 13:13:27,433 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:27,433 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1913328171] [2022-04-08 13:13:27,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1913328171] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-08 13:13:27,434 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-08 13:13:27,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13] total 13 [2022-04-08 13:13:27,434 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:27,434 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1184488684] [2022-04-08 13:13:27,434 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1184488684] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:27,434 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:27,434 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 13:13:27,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1715205666] [2022-04-08 13:13:27,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:27,435 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-08 13:13:27,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:27,435 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:13:27,496 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:27,496 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 13:13:27,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:27,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 13:13:27,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=173, Unknown=0, NotChecked=0, Total=210 [2022-04-08 13:13:27,497 INFO L87 Difference]: Start difference. First operand 135 states and 156 transitions. Second operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:13:28,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:28,612 INFO L93 Difference]: Finished difference Result 188 states and 232 transitions. [2022-04-08 13:13:28,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 13:13:28,612 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) Word has length 67 [2022-04-08 13:13:28,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:28,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:13:28,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-08 13:13:28,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:13:28,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 122 transitions. [2022-04-08 13:13:28,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 122 transitions. [2022-04-08 13:13:28,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:28,737 INFO L225 Difference]: With dead ends: 188 [2022-04-08 13:13:28,737 INFO L226 Difference]: Without dead ends: 163 [2022-04-08 13:13:28,738 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=54, Invalid=252, Unknown=0, NotChecked=0, Total=306 [2022-04-08 13:13:28,738 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 50 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 273 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 363 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 273 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:28,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 214 Invalid, 363 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 273 Invalid, 0 Unknown, 56 Unchecked, 0.4s Time] [2022-04-08 13:13:28,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-04-08 13:13:28,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 157. [2022-04-08 13:13:28,906 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:28,907 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 13:13:28,907 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 13:13:28,907 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 13:13:28,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:28,911 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-08 13:13:28,912 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-08 13:13:28,912 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:28,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:28,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 163 states. [2022-04-08 13:13:28,913 INFO L87 Difference]: Start difference. First operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) Second operand 163 states. [2022-04-08 13:13:28,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:28,917 INFO L93 Difference]: Finished difference Result 163 states and 195 transitions. [2022-04-08 13:13:28,917 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 195 transitions. [2022-04-08 13:13:28,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:28,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:28,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:28,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:28,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.1862745098039216) internal successors, (121), 107 states have internal predecessors, (121), 34 states have call successors, (34), 21 states have call predecessors, (34), 20 states have return successors, (32), 28 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 13:13:28,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 187 transitions. [2022-04-08 13:13:28,922 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 187 transitions. Word has length 67 [2022-04-08 13:13:28,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:28,922 INFO L478 AbstractCegarLoop]: Abstraction has 157 states and 187 transitions. [2022-04-08 13:13:28,923 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.0) internal successors, (24), 9 states have internal predecessors, (24), 7 states have call successors, (12), 2 states have call predecessors, (12), 2 states have return successors, (10), 5 states have call predecessors, (10), 6 states have call successors, (10) [2022-04-08 13:13:28,923 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 157 states and 187 transitions. [2022-04-08 13:13:29,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:29,108 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 187 transitions. [2022-04-08 13:13:29,108 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 13:13:29,108 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:29,108 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:29,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-08 13:13:29,319 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2022-04-08 13:13:29,319 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:29,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:29,320 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 1 times [2022-04-08 13:13:29,320 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:29,320 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2012604943] [2022-04-08 13:13:32,887 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:32,887 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:32,887 INFO L85 PathProgramCache]: Analyzing trace with hash 73149133, now seen corresponding path program 2 times [2022-04-08 13:13:32,887 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:32,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [180905012] [2022-04-08 13:13:32,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:32,888 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:32,898 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:32,898 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [124290686] [2022-04-08 13:13:32,898 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:13:32,898 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:32,898 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:32,900 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-08 13:13:32,900 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-08 13:13:32,947 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:13:32,947 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:32,948 INFO L263 TraceCheckSpWp]: Trace formula consists of 198 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 13:13:32,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:32,962 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:33,680 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-08 13:13:33,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {9367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9367#true} is VALID [2022-04-08 13:13:33,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:33,681 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-08 13:13:33,681 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-08 13:13:33,681 INFO L290 TraceCheckUtils]: 5: Hoare triple {9367#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,682 INFO L290 TraceCheckUtils]: 7: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,682 INFO L272 TraceCheckUtils]: 8: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,682 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:33,682 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:33,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:33,683 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,683 INFO L272 TraceCheckUtils]: 13: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:33,684 INFO L290 TraceCheckUtils]: 15: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:33,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:33,684 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,684 INFO L272 TraceCheckUtils]: 18: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,685 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:33,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:33,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:33,685 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,686 INFO L290 TraceCheckUtils]: 23: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,686 INFO L290 TraceCheckUtils]: 24: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,686 INFO L290 TraceCheckUtils]: 25: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,686 INFO L272 TraceCheckUtils]: 26: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,686 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:33,687 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:33,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:33,687 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,687 INFO L272 TraceCheckUtils]: 31: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,687 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:33,687 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:33,687 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:33,688 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,688 INFO L272 TraceCheckUtils]: 36: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:33,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:33,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:33,689 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,689 INFO L290 TraceCheckUtils]: 41: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !(~r~0 >= ~d~0); {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,689 INFO L290 TraceCheckUtils]: 42: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,690 INFO L290 TraceCheckUtils]: 43: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,690 INFO L272 TraceCheckUtils]: 44: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,690 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:33,690 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:33,690 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:33,691 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #84#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,691 INFO L272 TraceCheckUtils]: 49: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,691 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:33,691 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:33,691 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:33,691 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #86#return; {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:13:33,692 INFO L290 TraceCheckUtils]: 54: Hoare triple {9444#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,692 INFO L290 TraceCheckUtils]: 55: Hoare triple {9387#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,693 INFO L290 TraceCheckUtils]: 56: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,693 INFO L290 TraceCheckUtils]: 57: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,693 INFO L272 TraceCheckUtils]: 58: Hoare triple {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,693 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:33,694 INFO L290 TraceCheckUtils]: 60: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:33,694 INFO L290 TraceCheckUtils]: 61: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:33,695 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9541#(and (<= main_~p~0 main_~q~0) (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) main_~d~0) main_~A~0)) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #84#return; {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,695 INFO L272 TraceCheckUtils]: 63: Hoare triple {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:33,696 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:33,696 INFO L290 TraceCheckUtils]: 65: Hoare triple {9415#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:33,697 INFO L290 TraceCheckUtils]: 66: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:33,697 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9563#(and (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #86#return; {9579#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} is VALID [2022-04-08 13:13:33,698 INFO L290 TraceCheckUtils]: 68: Hoare triple {9579#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~p~0 1))} assume !(1 != ~p~0); {9583#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} is VALID [2022-04-08 13:13:33,698 INFO L272 TraceCheckUtils]: 69: Hoare triple {9583#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1) (= (+ main_~d~0 main_~r~0) main_~A~0))} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:13:33,699 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:33,699 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-08 13:13:33,699 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-08 13:13:33,699 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 62 proven. 32 refuted. 0 times theorem prover too weak. 117 trivial. 0 not checked. [2022-04-08 13:13:33,699 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:45,017 INFO L290 TraceCheckUtils]: 72: Hoare triple {9368#false} assume !false; {9368#false} is VALID [2022-04-08 13:13:45,017 INFO L290 TraceCheckUtils]: 71: Hoare triple {9591#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {9368#false} is VALID [2022-04-08 13:13:45,018 INFO L290 TraceCheckUtils]: 70: Hoare triple {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {9591#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:13:45,019 INFO L272 TraceCheckUtils]: 69: Hoare triple {9607#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {9587#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:13:45,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {9611#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} assume !(1 != ~p~0); {9607#(= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:13:45,020 INFO L284 TraceCheckUtils]: 67: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} #86#return; {9611#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= main_~p~0 1)))} is VALID [2022-04-08 13:13:45,020 INFO L290 TraceCheckUtils]: 66: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:45,021 INFO L290 TraceCheckUtils]: 65: Hoare triple {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:45,021 INFO L290 TraceCheckUtils]: 64: Hoare triple {9367#true} ~cond := #in~cond; {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:13:45,021 INFO L272 TraceCheckUtils]: 63: Hoare triple {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,023 INFO L284 TraceCheckUtils]: 62: Hoare quadruple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} {9367#true} #84#return; {9615#(or (= (+ (* main_~d~0 main_~q~0) main_~r~0) main_~A~0) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (not (= main_~p~0 1)))} is VALID [2022-04-08 13:13:45,024 INFO L290 TraceCheckUtils]: 61: Hoare triple {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:45,024 INFO L290 TraceCheckUtils]: 60: Hoare triple {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {9419#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:13:45,025 INFO L290 TraceCheckUtils]: 59: Hoare triple {9367#true} ~cond := #in~cond; {9625#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:13:45,025 INFO L272 TraceCheckUtils]: 58: Hoare triple {9367#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {9367#true} assume !!(#t~post6 < 100);havoc #t~post6; {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {9367#true} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {9367#true} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {9367#true} {9367#true} #86#return; {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L272 TraceCheckUtils]: 49: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,025 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {9367#true} {9367#true} #84#return; {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L290 TraceCheckUtils]: 47: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L290 TraceCheckUtils]: 46: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L290 TraceCheckUtils]: 45: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L272 TraceCheckUtils]: 44: Hoare triple {9367#true} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L290 TraceCheckUtils]: 43: Hoare triple {9367#true} assume !!(#t~post6 < 100);havoc #t~post6; {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L290 TraceCheckUtils]: 42: Hoare triple {9367#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L290 TraceCheckUtils]: 41: Hoare triple {9367#true} assume !(~r~0 >= ~d~0); {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L290 TraceCheckUtils]: 39: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L290 TraceCheckUtils]: 38: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L290 TraceCheckUtils]: 37: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:45,026 INFO L272 TraceCheckUtils]: 36: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L290 TraceCheckUtils]: 34: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L290 TraceCheckUtils]: 33: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L290 TraceCheckUtils]: 32: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L272 TraceCheckUtils]: 31: Hoare triple {9367#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L290 TraceCheckUtils]: 28: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L272 TraceCheckUtils]: 26: Hoare triple {9367#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {9367#true} assume !!(#t~post5 < 100);havoc #t~post5; {9367#true} is VALID [2022-04-08 13:13:45,027 INFO L290 TraceCheckUtils]: 24: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L290 TraceCheckUtils]: 23: Hoare triple {9367#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {9367#true} {9367#true} #82#return; {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L272 TraceCheckUtils]: 18: Hoare triple {9367#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {9367#true} {9367#true} #80#return; {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L272 TraceCheckUtils]: 13: Hoare triple {9367#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,028 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {9367#true} {9367#true} #78#return; {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L290 TraceCheckUtils]: 11: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {9367#true} assume !(0 == ~cond); {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {9367#true} ~cond := #in~cond; {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L272 TraceCheckUtils]: 8: Hoare triple {9367#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L290 TraceCheckUtils]: 7: Hoare triple {9367#true} assume !!(#t~post5 < 100);havoc #t~post5; {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {9367#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {9367#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L272 TraceCheckUtils]: 4: Hoare triple {9367#true} call #t~ret7 := main(); {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9367#true} {9367#true} #92#return; {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {9367#true} assume true; {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {9367#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9367#true} is VALID [2022-04-08 13:13:45,029 INFO L272 TraceCheckUtils]: 0: Hoare triple {9367#true} call ULTIMATE.init(); {9367#true} is VALID [2022-04-08 13:13:45,030 INFO L134 CoverageAnalysis]: Checked inductivity of 211 backedges. 68 proven. 2 refuted. 0 times theorem prover too weak. 141 trivial. 0 not checked. [2022-04-08 13:13:45,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:45,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [180905012] [2022-04-08 13:13:45,030 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:45,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [124290686] [2022-04-08 13:13:45,030 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [124290686] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:45,030 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:45,030 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2022-04-08 13:13:45,031 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:45,031 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2012604943] [2022-04-08 13:13:45,031 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2012604943] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:45,031 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:45,031 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 13:13:45,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1430816230] [2022-04-08 13:13:45,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:45,032 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-08 13:13:45,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:45,032 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:45,083 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-08 13:13:45,083 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 13:13:45,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:45,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 13:13:45,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=55, Invalid=185, Unknown=0, NotChecked=0, Total=240 [2022-04-08 13:13:45,084 INFO L87 Difference]: Start difference. First operand 157 states and 187 transitions. Second operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:45,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:45,993 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-04-08 13:13:45,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 13:13:45,993 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-08 13:13:45,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:45,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:45,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 13:13:45,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:45,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 13:13:45,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-08 13:13:46,094 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-08 13:13:46,097 INFO L225 Difference]: With dead ends: 186 [2022-04-08 13:13:46,097 INFO L226 Difference]: Without dead ends: 129 [2022-04-08 13:13:46,097 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 129 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-04-08 13:13:46,098 INFO L913 BasicCegarLoop]: 32 mSDtfsCounter, 17 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 368 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:46,098 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 180 Invalid, 368 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-08 13:13:46,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-04-08 13:13:46,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-04-08 13:13:46,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:46,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 13:13:46,205 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 13:13:46,205 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 13:13:46,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:46,208 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-08 13:13:46,208 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-08 13:13:46,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:46,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:46,209 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 129 states. [2022-04-08 13:13:46,209 INFO L87 Difference]: Start difference. First operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 129 states. [2022-04-08 13:13:46,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:46,212 INFO L93 Difference]: Finished difference Result 129 states and 152 transitions. [2022-04-08 13:13:46,213 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-08 13:13:46,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:46,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:46,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:46,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:46,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 83 states have (on average 1.180722891566265) internal successors, (98), 87 states have internal predecessors, (98), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 13:13:46,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 152 transitions. [2022-04-08 13:13:46,216 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 152 transitions. Word has length 73 [2022-04-08 13:13:46,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:46,217 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 152 transitions. [2022-04-08 13:13:46,217 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 10 states have (on average 2.5) internal successors, (25), 9 states have internal predecessors, (25), 6 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:46,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 152 transitions. [2022-04-08 13:13:46,365 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:46,366 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 152 transitions. [2022-04-08 13:13:46,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-08 13:13:46,366 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:46,367 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 3, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:46,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-08 13:13:46,571 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 13:13:46,571 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:46,572 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:46,572 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 5 times [2022-04-08 13:13:46,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:46,572 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1489521035] [2022-04-08 13:13:50,657 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:50,657 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:50,657 INFO L85 PathProgramCache]: Analyzing trace with hash 469209008, now seen corresponding path program 6 times [2022-04-08 13:13:50,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:50,658 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278599498] [2022-04-08 13:13:50,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:50,658 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:50,670 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:50,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1170745650] [2022-04-08 13:13:50,671 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:13:50,671 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:50,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:50,674 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-08 13:13:50,675 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-08 13:13:50,720 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-08 13:13:50,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:50,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 13:13:50,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:50,735 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:51,037 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-08 13:13:51,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10720#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:51,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {10720#(<= ~counter~0 0)} assume true; {10720#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:51,039 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10720#(<= ~counter~0 0)} {10712#true} #92#return; {10720#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:51,039 INFO L272 TraceCheckUtils]: 4: Hoare triple {10720#(<= ~counter~0 0)} call #t~ret7 := main(); {10720#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:51,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {10720#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {10720#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:51,040 INFO L290 TraceCheckUtils]: 6: Hoare triple {10720#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {10736#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,041 INFO L272 TraceCheckUtils]: 8: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,041 INFO L290 TraceCheckUtils]: 9: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,041 INFO L290 TraceCheckUtils]: 10: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,042 INFO L290 TraceCheckUtils]: 11: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,042 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #78#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,043 INFO L272 TraceCheckUtils]: 13: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,043 INFO L290 TraceCheckUtils]: 14: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,043 INFO L290 TraceCheckUtils]: 16: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,044 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #80#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,044 INFO L272 TraceCheckUtils]: 18: Hoare triple {10736#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {10736#(<= ~counter~0 1)} ~cond := #in~cond; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,045 INFO L290 TraceCheckUtils]: 20: Hoare triple {10736#(<= ~counter~0 1)} assume !(0 == ~cond); {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,045 INFO L290 TraceCheckUtils]: 21: Hoare triple {10736#(<= ~counter~0 1)} assume true; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,046 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10736#(<= ~counter~0 1)} {10736#(<= ~counter~0 1)} #82#return; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,046 INFO L290 TraceCheckUtils]: 23: Hoare triple {10736#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10736#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:51,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {10736#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,047 INFO L290 TraceCheckUtils]: 25: Hoare triple {10791#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,048 INFO L272 TraceCheckUtils]: 26: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,048 INFO L290 TraceCheckUtils]: 27: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,048 INFO L290 TraceCheckUtils]: 28: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,048 INFO L290 TraceCheckUtils]: 29: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,049 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #78#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,049 INFO L272 TraceCheckUtils]: 31: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,050 INFO L290 TraceCheckUtils]: 32: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,050 INFO L290 TraceCheckUtils]: 33: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,050 INFO L290 TraceCheckUtils]: 34: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,051 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #80#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,051 INFO L272 TraceCheckUtils]: 36: Hoare triple {10791#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {10791#(<= ~counter~0 2)} ~cond := #in~cond; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {10791#(<= ~counter~0 2)} assume !(0 == ~cond); {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,052 INFO L290 TraceCheckUtils]: 39: Hoare triple {10791#(<= ~counter~0 2)} assume true; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,053 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10791#(<= ~counter~0 2)} {10791#(<= ~counter~0 2)} #82#return; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,053 INFO L290 TraceCheckUtils]: 41: Hoare triple {10791#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10791#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:51,054 INFO L290 TraceCheckUtils]: 42: Hoare triple {10791#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,054 INFO L290 TraceCheckUtils]: 43: Hoare triple {10846#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,054 INFO L272 TraceCheckUtils]: 44: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,055 INFO L290 TraceCheckUtils]: 45: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,055 INFO L290 TraceCheckUtils]: 46: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,055 INFO L290 TraceCheckUtils]: 47: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,056 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #78#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,056 INFO L272 TraceCheckUtils]: 49: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,056 INFO L290 TraceCheckUtils]: 50: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,058 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #80#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,058 INFO L272 TraceCheckUtils]: 54: Hoare triple {10846#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,058 INFO L290 TraceCheckUtils]: 55: Hoare triple {10846#(<= ~counter~0 3)} ~cond := #in~cond; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,059 INFO L290 TraceCheckUtils]: 56: Hoare triple {10846#(<= ~counter~0 3)} assume !(0 == ~cond); {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {10846#(<= ~counter~0 3)} assume true; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,059 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10846#(<= ~counter~0 3)} {10846#(<= ~counter~0 3)} #82#return; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,060 INFO L290 TraceCheckUtils]: 59: Hoare triple {10846#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10846#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:51,060 INFO L290 TraceCheckUtils]: 60: Hoare triple {10846#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10901#(<= |main_#t~post5| 3)} is VALID [2022-04-08 13:13:51,060 INFO L290 TraceCheckUtils]: 61: Hoare triple {10901#(<= |main_#t~post5| 3)} assume !(#t~post5 < 100);havoc #t~post5; {10713#false} is VALID [2022-04-08 13:13:51,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-08 13:13:51,061 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 100);havoc #t~post6; {10713#false} is VALID [2022-04-08 13:13:51,061 INFO L272 TraceCheckUtils]: 64: Hoare triple {10713#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10713#false} is VALID [2022-04-08 13:13:51,061 INFO L290 TraceCheckUtils]: 65: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-08 13:13:51,061 INFO L290 TraceCheckUtils]: 66: Hoare triple {10713#false} assume !(0 == ~cond); {10713#false} is VALID [2022-04-08 13:13:51,061 INFO L290 TraceCheckUtils]: 67: Hoare triple {10713#false} assume true; {10713#false} is VALID [2022-04-08 13:13:51,061 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10713#false} {10713#false} #88#return; {10713#false} is VALID [2022-04-08 13:13:51,062 INFO L272 TraceCheckUtils]: 69: Hoare triple {10713#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {10713#false} is VALID [2022-04-08 13:13:51,062 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-08 13:13:51,062 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-08 13:13:51,062 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-08 13:13:51,062 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 54 proven. 132 refuted. 0 times theorem prover too weak. 38 trivial. 0 not checked. [2022-04-08 13:13:51,062 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:51,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {10713#false} assume !false; {10713#false} is VALID [2022-04-08 13:13:51,347 INFO L290 TraceCheckUtils]: 71: Hoare triple {10713#false} assume 0 == ~cond; {10713#false} is VALID [2022-04-08 13:13:51,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {10713#false} ~cond := #in~cond; {10713#false} is VALID [2022-04-08 13:13:51,347 INFO L272 TraceCheckUtils]: 69: Hoare triple {10713#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {10713#false} is VALID [2022-04-08 13:13:51,347 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10712#true} {10713#false} #88#return; {10713#false} is VALID [2022-04-08 13:13:51,347 INFO L290 TraceCheckUtils]: 67: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,347 INFO L272 TraceCheckUtils]: 64: Hoare triple {10713#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,347 INFO L290 TraceCheckUtils]: 63: Hoare triple {10713#false} assume !(#t~post6 < 100);havoc #t~post6; {10713#false} is VALID [2022-04-08 13:13:51,347 INFO L290 TraceCheckUtils]: 62: Hoare triple {10713#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10713#false} is VALID [2022-04-08 13:13:51,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {10971#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {10713#false} is VALID [2022-04-08 13:13:51,348 INFO L290 TraceCheckUtils]: 60: Hoare triple {10975#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10971#(< |main_#t~post5| 100)} is VALID [2022-04-08 13:13:51,349 INFO L290 TraceCheckUtils]: 59: Hoare triple {10975#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {10975#(< ~counter~0 100)} is VALID [2022-04-08 13:13:51,349 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {10712#true} {10975#(< ~counter~0 100)} #82#return; {10975#(< ~counter~0 100)} is VALID [2022-04-08 13:13:51,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,350 INFO L290 TraceCheckUtils]: 56: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,350 INFO L290 TraceCheckUtils]: 55: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,350 INFO L272 TraceCheckUtils]: 54: Hoare triple {10975#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,350 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {10712#true} {10975#(< ~counter~0 100)} #80#return; {10975#(< ~counter~0 100)} is VALID [2022-04-08 13:13:51,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,351 INFO L290 TraceCheckUtils]: 51: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,351 INFO L290 TraceCheckUtils]: 50: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,351 INFO L272 TraceCheckUtils]: 49: Hoare triple {10975#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,351 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {10712#true} {10975#(< ~counter~0 100)} #78#return; {10975#(< ~counter~0 100)} is VALID [2022-04-08 13:13:51,351 INFO L290 TraceCheckUtils]: 47: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,351 INFO L290 TraceCheckUtils]: 46: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,352 INFO L290 TraceCheckUtils]: 45: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,352 INFO L272 TraceCheckUtils]: 44: Hoare triple {10975#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,353 INFO L290 TraceCheckUtils]: 43: Hoare triple {10975#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {10975#(< ~counter~0 100)} is VALID [2022-04-08 13:13:51,353 INFO L290 TraceCheckUtils]: 42: Hoare triple {11030#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {10975#(< ~counter~0 100)} is VALID [2022-04-08 13:13:51,354 INFO L290 TraceCheckUtils]: 41: Hoare triple {11030#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11030#(< ~counter~0 99)} is VALID [2022-04-08 13:13:51,354 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {10712#true} {11030#(< ~counter~0 99)} #82#return; {11030#(< ~counter~0 99)} is VALID [2022-04-08 13:13:51,355 INFO L290 TraceCheckUtils]: 39: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,355 INFO L290 TraceCheckUtils]: 37: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,355 INFO L272 TraceCheckUtils]: 36: Hoare triple {11030#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,355 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {10712#true} {11030#(< ~counter~0 99)} #80#return; {11030#(< ~counter~0 99)} is VALID [2022-04-08 13:13:51,355 INFO L290 TraceCheckUtils]: 34: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,356 INFO L290 TraceCheckUtils]: 33: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,356 INFO L290 TraceCheckUtils]: 32: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,356 INFO L272 TraceCheckUtils]: 31: Hoare triple {11030#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,356 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {10712#true} {11030#(< ~counter~0 99)} #78#return; {11030#(< ~counter~0 99)} is VALID [2022-04-08 13:13:51,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,356 INFO L290 TraceCheckUtils]: 27: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,357 INFO L272 TraceCheckUtils]: 26: Hoare triple {11030#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {11030#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {11030#(< ~counter~0 99)} is VALID [2022-04-08 13:13:51,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {11085#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11030#(< ~counter~0 99)} is VALID [2022-04-08 13:13:51,358 INFO L290 TraceCheckUtils]: 23: Hoare triple {11085#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {11085#(< ~counter~0 98)} is VALID [2022-04-08 13:13:51,358 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {10712#true} {11085#(< ~counter~0 98)} #82#return; {11085#(< ~counter~0 98)} is VALID [2022-04-08 13:13:51,359 INFO L290 TraceCheckUtils]: 21: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,359 INFO L290 TraceCheckUtils]: 20: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,359 INFO L290 TraceCheckUtils]: 19: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,359 INFO L272 TraceCheckUtils]: 18: Hoare triple {11085#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,359 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {10712#true} {11085#(< ~counter~0 98)} #80#return; {11085#(< ~counter~0 98)} is VALID [2022-04-08 13:13:51,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,360 INFO L290 TraceCheckUtils]: 15: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,360 INFO L290 TraceCheckUtils]: 14: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,360 INFO L272 TraceCheckUtils]: 13: Hoare triple {11085#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,360 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10712#true} {11085#(< ~counter~0 98)} #78#return; {11085#(< ~counter~0 98)} is VALID [2022-04-08 13:13:51,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {10712#true} assume true; {10712#true} is VALID [2022-04-08 13:13:51,360 INFO L290 TraceCheckUtils]: 10: Hoare triple {10712#true} assume !(0 == ~cond); {10712#true} is VALID [2022-04-08 13:13:51,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {10712#true} ~cond := #in~cond; {10712#true} is VALID [2022-04-08 13:13:51,361 INFO L272 TraceCheckUtils]: 8: Hoare triple {11085#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {10712#true} is VALID [2022-04-08 13:13:51,361 INFO L290 TraceCheckUtils]: 7: Hoare triple {11085#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {11085#(< ~counter~0 98)} is VALID [2022-04-08 13:13:51,361 INFO L290 TraceCheckUtils]: 6: Hoare triple {11140#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {11085#(< ~counter~0 98)} is VALID [2022-04-08 13:13:51,362 INFO L290 TraceCheckUtils]: 5: Hoare triple {11140#(< ~counter~0 97)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {11140#(< ~counter~0 97)} is VALID [2022-04-08 13:13:51,362 INFO L272 TraceCheckUtils]: 4: Hoare triple {11140#(< ~counter~0 97)} call #t~ret7 := main(); {11140#(< ~counter~0 97)} is VALID [2022-04-08 13:13:51,363 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11140#(< ~counter~0 97)} {10712#true} #92#return; {11140#(< ~counter~0 97)} is VALID [2022-04-08 13:13:51,363 INFO L290 TraceCheckUtils]: 2: Hoare triple {11140#(< ~counter~0 97)} assume true; {11140#(< ~counter~0 97)} is VALID [2022-04-08 13:13:51,363 INFO L290 TraceCheckUtils]: 1: Hoare triple {10712#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11140#(< ~counter~0 97)} is VALID [2022-04-08 13:13:51,364 INFO L272 TraceCheckUtils]: 0: Hoare triple {10712#true} call ULTIMATE.init(); {10712#true} is VALID [2022-04-08 13:13:51,364 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 20 proven. 24 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 13:13:51,364 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:51,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278599498] [2022-04-08 13:13:51,364 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:51,364 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1170745650] [2022-04-08 13:13:51,364 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1170745650] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:51,364 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:51,365 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 13:13:51,365 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:51,366 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1489521035] [2022-04-08 13:13:51,366 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1489521035] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:51,366 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:51,366 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:13:51,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296265399] [2022-04-08 13:13:51,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:51,366 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-08 13:13:51,368 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:51,368 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:51,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:51,416 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 13:13:51,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:51,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 13:13:51,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 13:13:51,417 INFO L87 Difference]: Start difference. First operand 129 states and 152 transitions. Second operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:51,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:51,700 INFO L93 Difference]: Finished difference Result 170 states and 207 transitions. [2022-04-08 13:13:51,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 13:13:51,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) Word has length 73 [2022-04-08 13:13:51,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:51,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:51,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-08 13:13:51,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:51,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 96 transitions. [2022-04-08 13:13:51,703 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 96 transitions. [2022-04-08 13:13:51,782 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:51,785 INFO L225 Difference]: With dead ends: 170 [2022-04-08 13:13:51,785 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 13:13:51,785 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 148 GetRequests, 135 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=83, Invalid=127, Unknown=0, NotChecked=0, Total=210 [2022-04-08 13:13:51,786 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 5 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:51,786 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 144 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:13:51,786 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 13:13:51,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-08 13:13:51,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:51,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 13:13:51,889 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 13:13:51,889 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 13:13:51,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:51,893 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-08 13:13:51,893 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-08 13:13:51,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:51,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:51,894 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-04-08 13:13:51,894 INFO L87 Difference]: Start difference. First operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 131 states. [2022-04-08 13:13:51,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:51,896 INFO L93 Difference]: Finished difference Result 131 states and 154 transitions. [2022-04-08 13:13:51,897 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-08 13:13:51,897 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:51,897 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:51,897 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:51,897 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:51,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 85 states have (on average 1.1764705882352942) internal successors, (100), 89 states have internal predecessors, (100), 28 states have call successors, (28), 18 states have call predecessors, (28), 17 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-08 13:13:51,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 154 transitions. [2022-04-08 13:13:51,900 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 154 transitions. Word has length 73 [2022-04-08 13:13:51,900 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:51,901 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 154 transitions. [2022-04-08 13:13:51,901 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.285714285714286) internal successors, (30), 6 states have internal predecessors, (30), 6 states have call successors, (13), 6 states have call predecessors, (13), 5 states have return successors, (11), 5 states have call predecessors, (11), 5 states have call successors, (11) [2022-04-08 13:13:51,901 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 154 transitions. [2022-04-08 13:13:52,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:52,057 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 154 transitions. [2022-04-08 13:13:52,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 13:13:52,058 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:52,058 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:52,074 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-04-08 13:13:52,258 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 13:13:52,259 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:52,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:52,260 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 3 times [2022-04-08 13:13:52,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:52,260 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [470193017] [2022-04-08 13:13:55,429 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:13:55,429 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:13:55,429 INFO L85 PathProgramCache]: Analyzing trace with hash 1997631578, now seen corresponding path program 4 times [2022-04-08 13:13:55,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:13:55,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100756392] [2022-04-08 13:13:55,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:13:55,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:13:55,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:13:55,439 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [430568917] [2022-04-08 13:13:55,439 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:13:55,439 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:13:55,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:13:55,444 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:13:55,445 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 13:13:55,497 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:13:55,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:13:55,498 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 13:13:55,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:13:55,512 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:13:55,823 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-08 13:13:55,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12039#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:55,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {12039#(<= ~counter~0 0)} assume true; {12039#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:55,824 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12039#(<= ~counter~0 0)} {12031#true} #92#return; {12039#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:55,824 INFO L272 TraceCheckUtils]: 4: Hoare triple {12039#(<= ~counter~0 0)} call #t~ret7 := main(); {12039#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:55,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {12039#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {12039#(<= ~counter~0 0)} is VALID [2022-04-08 13:13:55,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {12039#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {12055#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,826 INFO L272 TraceCheckUtils]: 8: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,828 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #78#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,828 INFO L272 TraceCheckUtils]: 13: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,828 INFO L290 TraceCheckUtils]: 14: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,830 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #80#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,830 INFO L272 TraceCheckUtils]: 18: Hoare triple {12055#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,831 INFO L290 TraceCheckUtils]: 19: Hoare triple {12055#(<= ~counter~0 1)} ~cond := #in~cond; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,831 INFO L290 TraceCheckUtils]: 20: Hoare triple {12055#(<= ~counter~0 1)} assume !(0 == ~cond); {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,831 INFO L290 TraceCheckUtils]: 21: Hoare triple {12055#(<= ~counter~0 1)} assume true; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,832 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12055#(<= ~counter~0 1)} {12055#(<= ~counter~0 1)} #82#return; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,832 INFO L290 TraceCheckUtils]: 23: Hoare triple {12055#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12055#(<= ~counter~0 1)} is VALID [2022-04-08 13:13:55,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {12055#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {12110#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,834 INFO L272 TraceCheckUtils]: 26: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,835 INFO L290 TraceCheckUtils]: 28: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,835 INFO L290 TraceCheckUtils]: 29: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,835 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #78#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,836 INFO L272 TraceCheckUtils]: 31: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,836 INFO L290 TraceCheckUtils]: 32: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,837 INFO L290 TraceCheckUtils]: 33: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,837 INFO L290 TraceCheckUtils]: 34: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,837 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #80#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,838 INFO L272 TraceCheckUtils]: 36: Hoare triple {12110#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,838 INFO L290 TraceCheckUtils]: 37: Hoare triple {12110#(<= ~counter~0 2)} ~cond := #in~cond; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,839 INFO L290 TraceCheckUtils]: 38: Hoare triple {12110#(<= ~counter~0 2)} assume !(0 == ~cond); {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,839 INFO L290 TraceCheckUtils]: 39: Hoare triple {12110#(<= ~counter~0 2)} assume true; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,840 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12110#(<= ~counter~0 2)} {12110#(<= ~counter~0 2)} #82#return; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,840 INFO L290 TraceCheckUtils]: 41: Hoare triple {12110#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12110#(<= ~counter~0 2)} is VALID [2022-04-08 13:13:55,841 INFO L290 TraceCheckUtils]: 42: Hoare triple {12110#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,841 INFO L290 TraceCheckUtils]: 43: Hoare triple {12165#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,841 INFO L272 TraceCheckUtils]: 44: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,842 INFO L290 TraceCheckUtils]: 45: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,842 INFO L290 TraceCheckUtils]: 46: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,843 INFO L290 TraceCheckUtils]: 47: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,843 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #78#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,844 INFO L272 TraceCheckUtils]: 49: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,844 INFO L290 TraceCheckUtils]: 50: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,844 INFO L290 TraceCheckUtils]: 51: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,844 INFO L290 TraceCheckUtils]: 52: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,845 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #80#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,845 INFO L272 TraceCheckUtils]: 54: Hoare triple {12165#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,846 INFO L290 TraceCheckUtils]: 55: Hoare triple {12165#(<= ~counter~0 3)} ~cond := #in~cond; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,846 INFO L290 TraceCheckUtils]: 56: Hoare triple {12165#(<= ~counter~0 3)} assume !(0 == ~cond); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,846 INFO L290 TraceCheckUtils]: 57: Hoare triple {12165#(<= ~counter~0 3)} assume true; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,847 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12165#(<= ~counter~0 3)} {12165#(<= ~counter~0 3)} #82#return; {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,847 INFO L290 TraceCheckUtils]: 59: Hoare triple {12165#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {12165#(<= ~counter~0 3)} is VALID [2022-04-08 13:13:55,848 INFO L290 TraceCheckUtils]: 60: Hoare triple {12165#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,848 INFO L290 TraceCheckUtils]: 61: Hoare triple {12220#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,849 INFO L272 TraceCheckUtils]: 62: Hoare triple {12220#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,849 INFO L290 TraceCheckUtils]: 63: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,849 INFO L290 TraceCheckUtils]: 64: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,850 INFO L290 TraceCheckUtils]: 65: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,850 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #84#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,851 INFO L272 TraceCheckUtils]: 67: Hoare triple {12220#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,851 INFO L290 TraceCheckUtils]: 68: Hoare triple {12220#(<= ~counter~0 4)} ~cond := #in~cond; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,851 INFO L290 TraceCheckUtils]: 69: Hoare triple {12220#(<= ~counter~0 4)} assume !(0 == ~cond); {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,852 INFO L290 TraceCheckUtils]: 70: Hoare triple {12220#(<= ~counter~0 4)} assume true; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,852 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12220#(<= ~counter~0 4)} {12220#(<= ~counter~0 4)} #86#return; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,853 INFO L290 TraceCheckUtils]: 72: Hoare triple {12220#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,853 INFO L290 TraceCheckUtils]: 73: Hoare triple {12220#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12220#(<= ~counter~0 4)} is VALID [2022-04-08 13:13:55,853 INFO L290 TraceCheckUtils]: 74: Hoare triple {12220#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12263#(<= |main_#t~post6| 4)} is VALID [2022-04-08 13:13:55,854 INFO L290 TraceCheckUtils]: 75: Hoare triple {12263#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {12032#false} is VALID [2022-04-08 13:13:55,854 INFO L272 TraceCheckUtils]: 76: Hoare triple {12032#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12032#false} is VALID [2022-04-08 13:13:55,854 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-08 13:13:55,854 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-08 13:13:55,854 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-08 13:13:55,854 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 200 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 13:13:55,855 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:13:56,230 INFO L290 TraceCheckUtils]: 79: Hoare triple {12032#false} assume !false; {12032#false} is VALID [2022-04-08 13:13:56,230 INFO L290 TraceCheckUtils]: 78: Hoare triple {12032#false} assume 0 == ~cond; {12032#false} is VALID [2022-04-08 13:13:56,230 INFO L290 TraceCheckUtils]: 77: Hoare triple {12032#false} ~cond := #in~cond; {12032#false} is VALID [2022-04-08 13:13:56,230 INFO L272 TraceCheckUtils]: 76: Hoare triple {12032#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {12032#false} is VALID [2022-04-08 13:13:56,231 INFO L290 TraceCheckUtils]: 75: Hoare triple {12291#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {12032#false} is VALID [2022-04-08 13:13:56,231 INFO L290 TraceCheckUtils]: 74: Hoare triple {12295#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12291#(< |main_#t~post6| 100)} is VALID [2022-04-08 13:13:56,231 INFO L290 TraceCheckUtils]: 73: Hoare triple {12295#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {12295#(< ~counter~0 100)} is VALID [2022-04-08 13:13:56,232 INFO L290 TraceCheckUtils]: 72: Hoare triple {12295#(< ~counter~0 100)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {12295#(< ~counter~0 100)} is VALID [2022-04-08 13:13:56,232 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {12031#true} {12295#(< ~counter~0 100)} #86#return; {12295#(< ~counter~0 100)} is VALID [2022-04-08 13:13:56,232 INFO L290 TraceCheckUtils]: 70: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,232 INFO L290 TraceCheckUtils]: 69: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,232 INFO L290 TraceCheckUtils]: 68: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,232 INFO L272 TraceCheckUtils]: 67: Hoare triple {12295#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,233 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {12031#true} {12295#(< ~counter~0 100)} #84#return; {12295#(< ~counter~0 100)} is VALID [2022-04-08 13:13:56,233 INFO L290 TraceCheckUtils]: 65: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,233 INFO L290 TraceCheckUtils]: 64: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,233 INFO L290 TraceCheckUtils]: 63: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,233 INFO L272 TraceCheckUtils]: 62: Hoare triple {12295#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,233 INFO L290 TraceCheckUtils]: 61: Hoare triple {12295#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {12295#(< ~counter~0 100)} is VALID [2022-04-08 13:13:56,234 INFO L290 TraceCheckUtils]: 60: Hoare triple {12338#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12295#(< ~counter~0 100)} is VALID [2022-04-08 13:13:56,234 INFO L290 TraceCheckUtils]: 59: Hoare triple {12338#(< ~counter~0 99)} assume !(~r~0 >= ~d~0); {12338#(< ~counter~0 99)} is VALID [2022-04-08 13:13:56,235 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {12031#true} {12338#(< ~counter~0 99)} #82#return; {12338#(< ~counter~0 99)} is VALID [2022-04-08 13:13:56,235 INFO L290 TraceCheckUtils]: 57: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,235 INFO L290 TraceCheckUtils]: 56: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,235 INFO L290 TraceCheckUtils]: 55: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,235 INFO L272 TraceCheckUtils]: 54: Hoare triple {12338#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,235 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {12031#true} {12338#(< ~counter~0 99)} #80#return; {12338#(< ~counter~0 99)} is VALID [2022-04-08 13:13:56,236 INFO L290 TraceCheckUtils]: 52: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,236 INFO L290 TraceCheckUtils]: 51: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,236 INFO L290 TraceCheckUtils]: 50: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,236 INFO L272 TraceCheckUtils]: 49: Hoare triple {12338#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,236 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {12031#true} {12338#(< ~counter~0 99)} #78#return; {12338#(< ~counter~0 99)} is VALID [2022-04-08 13:13:56,236 INFO L290 TraceCheckUtils]: 47: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,236 INFO L290 TraceCheckUtils]: 46: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,236 INFO L290 TraceCheckUtils]: 45: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,236 INFO L272 TraceCheckUtils]: 44: Hoare triple {12338#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,237 INFO L290 TraceCheckUtils]: 43: Hoare triple {12338#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {12338#(< ~counter~0 99)} is VALID [2022-04-08 13:13:56,237 INFO L290 TraceCheckUtils]: 42: Hoare triple {12393#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12338#(< ~counter~0 99)} is VALID [2022-04-08 13:13:56,237 INFO L290 TraceCheckUtils]: 41: Hoare triple {12393#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12393#(< ~counter~0 98)} is VALID [2022-04-08 13:13:56,238 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {12031#true} {12393#(< ~counter~0 98)} #82#return; {12393#(< ~counter~0 98)} is VALID [2022-04-08 13:13:56,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,238 INFO L290 TraceCheckUtils]: 37: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,238 INFO L272 TraceCheckUtils]: 36: Hoare triple {12393#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,238 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {12031#true} {12393#(< ~counter~0 98)} #80#return; {12393#(< ~counter~0 98)} is VALID [2022-04-08 13:13:56,238 INFO L290 TraceCheckUtils]: 34: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,239 INFO L290 TraceCheckUtils]: 32: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,239 INFO L272 TraceCheckUtils]: 31: Hoare triple {12393#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,247 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {12031#true} {12393#(< ~counter~0 98)} #78#return; {12393#(< ~counter~0 98)} is VALID [2022-04-08 13:13:56,248 INFO L290 TraceCheckUtils]: 29: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,248 INFO L290 TraceCheckUtils]: 28: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,248 INFO L290 TraceCheckUtils]: 27: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,248 INFO L272 TraceCheckUtils]: 26: Hoare triple {12393#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {12393#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {12393#(< ~counter~0 98)} is VALID [2022-04-08 13:13:56,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {12448#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12393#(< ~counter~0 98)} is VALID [2022-04-08 13:13:56,249 INFO L290 TraceCheckUtils]: 23: Hoare triple {12448#(< ~counter~0 97)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {12448#(< ~counter~0 97)} is VALID [2022-04-08 13:13:56,250 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {12031#true} {12448#(< ~counter~0 97)} #82#return; {12448#(< ~counter~0 97)} is VALID [2022-04-08 13:13:56,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,250 INFO L272 TraceCheckUtils]: 18: Hoare triple {12448#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,251 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {12031#true} {12448#(< ~counter~0 97)} #80#return; {12448#(< ~counter~0 97)} is VALID [2022-04-08 13:13:56,251 INFO L290 TraceCheckUtils]: 16: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,251 INFO L290 TraceCheckUtils]: 15: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,251 INFO L290 TraceCheckUtils]: 14: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,251 INFO L272 TraceCheckUtils]: 13: Hoare triple {12448#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,251 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {12031#true} {12448#(< ~counter~0 97)} #78#return; {12448#(< ~counter~0 97)} is VALID [2022-04-08 13:13:56,252 INFO L290 TraceCheckUtils]: 11: Hoare triple {12031#true} assume true; {12031#true} is VALID [2022-04-08 13:13:56,252 INFO L290 TraceCheckUtils]: 10: Hoare triple {12031#true} assume !(0 == ~cond); {12031#true} is VALID [2022-04-08 13:13:56,252 INFO L290 TraceCheckUtils]: 9: Hoare triple {12031#true} ~cond := #in~cond; {12031#true} is VALID [2022-04-08 13:13:56,252 INFO L272 TraceCheckUtils]: 8: Hoare triple {12448#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {12031#true} is VALID [2022-04-08 13:13:56,252 INFO L290 TraceCheckUtils]: 7: Hoare triple {12448#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {12448#(< ~counter~0 97)} is VALID [2022-04-08 13:13:56,252 INFO L290 TraceCheckUtils]: 6: Hoare triple {12503#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {12448#(< ~counter~0 97)} is VALID [2022-04-08 13:13:56,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {12503#(< ~counter~0 96)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {12503#(< ~counter~0 96)} is VALID [2022-04-08 13:13:56,253 INFO L272 TraceCheckUtils]: 4: Hoare triple {12503#(< ~counter~0 96)} call #t~ret7 := main(); {12503#(< ~counter~0 96)} is VALID [2022-04-08 13:13:56,253 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12503#(< ~counter~0 96)} {12031#true} #92#return; {12503#(< ~counter~0 96)} is VALID [2022-04-08 13:13:56,254 INFO L290 TraceCheckUtils]: 2: Hoare triple {12503#(< ~counter~0 96)} assume true; {12503#(< ~counter~0 96)} is VALID [2022-04-08 13:13:56,254 INFO L290 TraceCheckUtils]: 1: Hoare triple {12031#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12503#(< ~counter~0 96)} is VALID [2022-04-08 13:13:56,254 INFO L272 TraceCheckUtils]: 0: Hoare triple {12031#true} call ULTIMATE.init(); {12031#true} is VALID [2022-04-08 13:13:56,254 INFO L134 CoverageAnalysis]: Checked inductivity of 262 backedges. 22 proven. 20 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 13:13:56,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:13:56,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100756392] [2022-04-08 13:13:56,255 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:13:56,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [430568917] [2022-04-08 13:13:56,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [430568917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:13:56,255 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:13:56,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 13:13:56,255 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:13:56,255 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [470193017] [2022-04-08 13:13:56,255 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [470193017] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:13:56,255 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:13:56,255 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 13:13:56,256 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87249436] [2022-04-08 13:13:56,256 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:13:56,256 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 80 [2022-04-08 13:13:56,256 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:13:56,257 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 13:13:56,301 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:56,301 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 13:13:56,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:56,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 13:13:56,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 13:13:56,302 INFO L87 Difference]: Start difference. First operand 131 states and 154 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 13:13:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:56,742 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-04-08 13:13:56,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 13:13:56,742 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) Word has length 80 [2022-04-08 13:13:56,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:13:56,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 13:13:56,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-08 13:13:56,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 13:13:56,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-04-08 13:13:56,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2022-04-08 13:13:56,836 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:56,840 INFO L225 Difference]: With dead ends: 181 [2022-04-08 13:13:56,840 INFO L226 Difference]: Without dead ends: 166 [2022-04-08 13:13:56,840 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=81, Invalid=129, Unknown=0, NotChecked=0, Total=210 [2022-04-08 13:13:56,841 INFO L913 BasicCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 77 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 201 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 77 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:13:56,841 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 201 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 77 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:13:56,841 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-04-08 13:13:57,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 163. [2022-04-08 13:13:57,010 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:13:57,011 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 13:13:57,011 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 13:13:57,011 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 13:13:57,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:57,015 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-08 13:13:57,015 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-08 13:13:57,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:57,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:57,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 166 states. [2022-04-08 13:13:57,016 INFO L87 Difference]: Start difference. First operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) Second operand 166 states. [2022-04-08 13:13:57,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:13:57,020 INFO L93 Difference]: Finished difference Result 166 states and 192 transitions. [2022-04-08 13:13:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 192 transitions. [2022-04-08 13:13:57,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:13:57,020 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:13:57,020 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:13:57,020 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:13:57,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 106 states have (on average 1.1603773584905661) internal successors, (123), 110 states have internal predecessors, (123), 35 states have call successors, (35), 23 states have call predecessors, (35), 21 states have return successors, (32), 29 states have call predecessors, (32), 32 states have call successors, (32) [2022-04-08 13:13:57,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 190 transitions. [2022-04-08 13:13:57,024 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 190 transitions. Word has length 80 [2022-04-08 13:13:57,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:13:57,024 INFO L478 AbstractCegarLoop]: Abstraction has 163 states and 190 transitions. [2022-04-08 13:13:57,024 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 7 states have internal predecessors, (33), 7 states have call successors, (14), 7 states have call predecessors, (14), 5 states have return successors, (12), 5 states have call predecessors, (12), 5 states have call successors, (12) [2022-04-08 13:13:57,025 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 163 states and 190 transitions. [2022-04-08 13:13:57,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:13:57,285 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 190 transitions. [2022-04-08 13:13:57,286 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 81 [2022-04-08 13:13:57,286 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:13:57,286 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:13:57,313 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 13:13:57,486 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 13:13:57,487 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:13:57,487 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:13:57,487 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 5 times [2022-04-08 13:13:57,487 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:13:57,487 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [599685727] [2022-04-08 13:14:01,567 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:14:01,567 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:14:01,567 INFO L85 PathProgramCache]: Analyzing trace with hash 1999359456, now seen corresponding path program 6 times [2022-04-08 13:14:01,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:14:01,568 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1621749778] [2022-04-08 13:14:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:14:01,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:14:01,584 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:14:01,585 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [733701572] [2022-04-08 13:14:01,585 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:14:01,585 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:14:01,585 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:14:01,591 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:14:01,591 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 13:14:01,633 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 13:14:01,633 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:14:01,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 145 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 13:14:01,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:14:01,648 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:14:02,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-08 13:14:02,375 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13546#true} is VALID [2022-04-08 13:14:02,375 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,375 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-08 13:14:02,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-08 13:14:02,376 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,376 INFO L290 TraceCheckUtils]: 6: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,377 INFO L272 TraceCheckUtils]: 8: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,377 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,377 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,378 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,378 INFO L272 TraceCheckUtils]: 13: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,378 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,378 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,378 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,379 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,379 INFO L272 TraceCheckUtils]: 18: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,379 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,379 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,379 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,380 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,380 INFO L290 TraceCheckUtils]: 23: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,381 INFO L290 TraceCheckUtils]: 24: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,381 INFO L290 TraceCheckUtils]: 25: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,381 INFO L272 TraceCheckUtils]: 26: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,381 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,381 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,381 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,382 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,382 INFO L272 TraceCheckUtils]: 31: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,382 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,382 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,382 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,383 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,383 INFO L272 TraceCheckUtils]: 36: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,383 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,383 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,383 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,384 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13546#true} {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,385 INFO L290 TraceCheckUtils]: 41: Hoare triple {13566#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,385 INFO L290 TraceCheckUtils]: 42: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,386 INFO L290 TraceCheckUtils]: 43: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,386 INFO L272 TraceCheckUtils]: 44: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,386 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,386 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,386 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,387 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13546#true} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #78#return; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,387 INFO L272 TraceCheckUtils]: 49: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,387 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,387 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,387 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,388 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13546#true} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #80#return; {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,388 INFO L272 TraceCheckUtils]: 54: Hoare triple {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,388 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:14:02,388 INFO L290 TraceCheckUtils]: 56: Hoare triple {13718#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:14:02,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:14:02,389 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} {13675#(and (= main_~A~0 main_~r~0) (= (mod main_~d~0 2) 0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #82#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,390 INFO L290 TraceCheckUtils]: 59: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,390 INFO L290 TraceCheckUtils]: 60: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,391 INFO L290 TraceCheckUtils]: 61: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,391 INFO L272 TraceCheckUtils]: 62: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,391 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,391 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,391 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,392 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13546#true} {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #84#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,392 INFO L272 TraceCheckUtils]: 67: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:14:02,392 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:14:02,392 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:14:02,392 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:14:02,393 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13546#true} {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} #86#return; {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:14:02,394 INFO L290 TraceCheckUtils]: 72: Hoare triple {13729#(and (= (* main_~B~0 main_~p~0) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13772#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:14:02,395 INFO L290 TraceCheckUtils]: 73: Hoare triple {13772#(and (= (div (* main_~B~0 main_~p~0 2) 2) main_~d~0) (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-08 13:14:02,396 INFO L290 TraceCheckUtils]: 74: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-08 13:14:02,396 INFO L290 TraceCheckUtils]: 75: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} is VALID [2022-04-08 13:14:02,397 INFO L272 TraceCheckUtils]: 76: Hoare triple {13776#(and (= main_~B~0 1) (= main_~r~0 (+ (* (- 1) (div (* main_~B~0 main_~q~0 2) 2)) main_~A~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:14:02,397 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:14:02,398 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-08 13:14:02,398 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-08 13:14:02,398 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 57 proven. 10 refuted. 0 times theorem prover too weak. 196 trivial. 0 not checked. [2022-04-08 13:14:02,398 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:14:21,254 WARN L855 $PredicateComparison]: unable to prove that (or (let ((.cse4 (= (mod c_main_~p~0 2) 0)) (.cse8 (< c_main_~p~0 0)) (.cse9 (div c_main_~p~0 2))) (let ((.cse7 (< c_main_~d~0 0)) (.cse6 (= (mod c_main_~d~0 2) 0)) (.cse3 (* (+ c_main_~q~0 .cse9 1) c_main_~B~0)) (.cse5 (not .cse8)) (.cse0 (* (- 1) (div c_main_~d~0 2))) (.cse1 (* (+ c_main_~q~0 .cse9) c_main_~B~0)) (.cse2 (and (not .cse4) .cse8))) (and (or (and (or (= c_main_~A~0 (+ (- 1) c_main_~r~0 .cse0 .cse1)) .cse2) (or (= c_main_~A~0 (+ (- 1) .cse3 c_main_~r~0 .cse0)) .cse4 .cse5)) .cse6 (not .cse7)) (or (and .cse7 (not .cse6)) (and (or (= (+ .cse3 c_main_~r~0 .cse0) c_main_~A~0) .cse4 .cse5) (or (= c_main_~A~0 (+ c_main_~r~0 .cse0 .cse1)) .cse2)))))) (not (= (* c_main_~p~0 c_main_~B~0) c_main_~d~0))) is different from true [2022-04-08 13:15:29,243 INFO L290 TraceCheckUtils]: 79: Hoare triple {13547#false} assume !false; {13547#false} is VALID [2022-04-08 13:15:29,244 INFO L290 TraceCheckUtils]: 78: Hoare triple {13790#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {13547#false} is VALID [2022-04-08 13:15:29,244 INFO L290 TraceCheckUtils]: 77: Hoare triple {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {13790#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:15:29,245 INFO L272 TraceCheckUtils]: 76: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13786#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:15:29,245 INFO L290 TraceCheckUtils]: 75: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 100);havoc #t~post6; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,245 INFO L290 TraceCheckUtils]: 74: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,256 INFO L290 TraceCheckUtils]: 73: Hoare triple {13816#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,270 INFO L290 TraceCheckUtils]: 72: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {13816#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:15:29,271 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {13546#true} {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:15:29,271 INFO L290 TraceCheckUtils]: 70: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,271 INFO L290 TraceCheckUtils]: 69: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,271 INFO L290 TraceCheckUtils]: 68: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,271 INFO L272 TraceCheckUtils]: 67: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,272 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {13546#true} {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:15:29,272 INFO L290 TraceCheckUtils]: 65: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,272 INFO L290 TraceCheckUtils]: 64: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,272 INFO L290 TraceCheckUtils]: 63: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,272 INFO L272 TraceCheckUtils]: 62: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,273 INFO L290 TraceCheckUtils]: 61: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 100);havoc #t~post6; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:15:29,274 INFO L290 TraceCheckUtils]: 60: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:15:29,275 INFO L290 TraceCheckUtils]: 59: Hoare triple {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !(~r~0 >= ~d~0); {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:15:29,276 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #82#return; {13820#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:15:29,276 INFO L290 TraceCheckUtils]: 57: Hoare triple {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:15:29,276 INFO L290 TraceCheckUtils]: 56: Hoare triple {13873#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {13722#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:15:29,277 INFO L290 TraceCheckUtils]: 55: Hoare triple {13546#true} ~cond := #in~cond; {13873#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:15:29,277 INFO L272 TraceCheckUtils]: 54: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,277 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {13546#true} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #80#return; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:15:29,278 INFO L290 TraceCheckUtils]: 52: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,278 INFO L290 TraceCheckUtils]: 51: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,278 INFO L290 TraceCheckUtils]: 50: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,278 INFO L272 TraceCheckUtils]: 49: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,278 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {13546#true} {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #78#return; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:15:29,278 INFO L290 TraceCheckUtils]: 47: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,278 INFO L290 TraceCheckUtils]: 46: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,278 INFO L290 TraceCheckUtils]: 45: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,278 INFO L272 TraceCheckUtils]: 44: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,280 INFO L290 TraceCheckUtils]: 43: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post5 < 100);havoc #t~post5; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:15:29,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:15:29,286 INFO L290 TraceCheckUtils]: 41: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13863#(or (and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2)))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:15:29,286 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #82#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,286 INFO L290 TraceCheckUtils]: 39: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,286 INFO L290 TraceCheckUtils]: 38: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,286 INFO L290 TraceCheckUtils]: 37: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,287 INFO L272 TraceCheckUtils]: 36: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,287 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #80#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,287 INFO L290 TraceCheckUtils]: 34: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,287 INFO L290 TraceCheckUtils]: 33: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,287 INFO L290 TraceCheckUtils]: 32: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,287 INFO L272 TraceCheckUtils]: 31: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,288 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #78#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,288 INFO L290 TraceCheckUtils]: 27: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,288 INFO L272 TraceCheckUtils]: 26: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 100);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,289 INFO L290 TraceCheckUtils]: 23: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,290 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #82#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,290 INFO L290 TraceCheckUtils]: 20: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,290 INFO L290 TraceCheckUtils]: 19: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,290 INFO L272 TraceCheckUtils]: 18: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,290 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #80#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,290 INFO L272 TraceCheckUtils]: 13: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,291 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {13546#true} {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #78#return; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,291 INFO L290 TraceCheckUtils]: 11: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,291 INFO L290 TraceCheckUtils]: 10: Hoare triple {13546#true} assume !(0 == ~cond); {13546#true} is VALID [2022-04-08 13:15:29,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {13546#true} ~cond := #in~cond; {13546#true} is VALID [2022-04-08 13:15:29,291 INFO L272 TraceCheckUtils]: 8: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {13546#true} is VALID [2022-04-08 13:15:29,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post5 < 100);havoc #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,292 INFO L290 TraceCheckUtils]: 5: Hoare triple {13546#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {13806#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:15:29,292 INFO L272 TraceCheckUtils]: 4: Hoare triple {13546#true} call #t~ret7 := main(); {13546#true} is VALID [2022-04-08 13:15:29,292 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13546#true} {13546#true} #92#return; {13546#true} is VALID [2022-04-08 13:15:29,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {13546#true} assume true; {13546#true} is VALID [2022-04-08 13:15:29,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {13546#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13546#true} is VALID [2022-04-08 13:15:29,292 INFO L272 TraceCheckUtils]: 0: Hoare triple {13546#true} call ULTIMATE.init(); {13546#true} is VALID [2022-04-08 13:15:29,293 INFO L134 CoverageAnalysis]: Checked inductivity of 263 backedges. 45 proven. 12 refuted. 0 times theorem prover too weak. 196 trivial. 10 not checked. [2022-04-08 13:15:29,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:15:29,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1621749778] [2022-04-08 13:15:29,293 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:15:29,293 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733701572] [2022-04-08 13:15:29,293 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733701572] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:15:29,294 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:15:29,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 16 [2022-04-08 13:15:29,294 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:15:29,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [599685727] [2022-04-08 13:15:29,294 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [599685727] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:15:29,294 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:15:29,294 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 13:15:29,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888460313] [2022-04-08 13:15:29,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:15:29,295 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 80 [2022-04-08 13:15:29,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:15:29,295 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:15:29,334 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-08 13:15:29,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 13:15:29,335 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:29,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 13:15:29,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=162, Unknown=1, NotChecked=26, Total=240 [2022-04-08 13:15:29,335 INFO L87 Difference]: Start difference. First operand 163 states and 190 transitions. Second operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:15:30,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:30,049 INFO L93 Difference]: Finished difference Result 193 states and 224 transitions. [2022-04-08 13:15:30,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 13:15:30,049 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) Word has length 80 [2022-04-08 13:15:30,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:15:30,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:15:30,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 13:15:30,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (9), 4 states have call predecessors, (9), 4 states have call successors, (9) [2022-04-08 13:15:30,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 97 transitions. [2022-04-08 13:15:30,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 97 transitions. [2022-04-08 13:15:30,146 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-08 13:15:30,149 INFO L225 Difference]: With dead ends: 193 [2022-04-08 13:15:30,149 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 13:15:30,150 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=64, Invalid=211, Unknown=1, NotChecked=30, Total=306 [2022-04-08 13:15:30,150 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 45 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 13:15:30,150 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 116 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 13:15:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 13:15:30,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 169. [2022-04-08 13:15:30,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:15:30,304 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 13:15:30,305 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 13:15:30,305 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 13:15:30,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:30,309 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-08 13:15:30,309 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-08 13:15:30,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:30,309 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:30,309 INFO L74 IsIncluded]: Start isIncluded. First operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 173 states. [2022-04-08 13:15:30,310 INFO L87 Difference]: Start difference. First operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) Second operand 173 states. [2022-04-08 13:15:30,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:30,313 INFO L93 Difference]: Finished difference Result 173 states and 201 transitions. [2022-04-08 13:15:30,313 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 201 transitions. [2022-04-08 13:15:30,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:30,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:30,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:15:30,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:15:30,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 169 states, 111 states have (on average 1.1531531531531531) internal successors, (128), 115 states have internal predecessors, (128), 35 states have call successors, (35), 23 states have call predecessors, (35), 22 states have return successors, (33), 30 states have call predecessors, (33), 33 states have call successors, (33) [2022-04-08 13:15:30,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 169 states to 169 states and 196 transitions. [2022-04-08 13:15:30,318 INFO L78 Accepts]: Start accepts. Automaton has 169 states and 196 transitions. Word has length 80 [2022-04-08 13:15:30,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:15:30,319 INFO L478 AbstractCegarLoop]: Abstraction has 169 states and 196 transitions. [2022-04-08 13:15:30,319 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.272727272727273) internal successors, (25), 10 states have internal predecessors, (25), 5 states have call successors, (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-08 13:15:30,319 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 169 states and 196 transitions. [2022-04-08 13:15:30,539 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:30,539 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 196 transitions. [2022-04-08 13:15:30,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 13:15:30,540 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:15:30,540 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:15:30,563 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 13:15:30,754 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:15:30,755 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:15:30,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:15:30,755 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 3 times [2022-04-08 13:15:30,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:30,755 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1454422256] [2022-04-08 13:15:32,893 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:15:32,893 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:15:32,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1035991527, now seen corresponding path program 4 times [2022-04-08 13:15:32,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:15:32,893 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [827102684] [2022-04-08 13:15:32,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:15:32,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:15:32,904 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:15:32,904 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [174483741] [2022-04-08 13:15:32,904 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:15:32,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:15:32,904 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:15:32,906 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:15:32,906 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 13:15:32,952 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:15:32,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:15:32,953 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 8 conjunts are in the unsatisfiable core [2022-04-08 13:15:32,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:15:32,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:15:34,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L290 TraceCheckUtils]: 1: Hoare triple {15115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {15115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 100);havoc #t~post5; {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L272 TraceCheckUtils]: 8: Hoare triple {15115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L272 TraceCheckUtils]: 13: Hoare triple {15115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L272 TraceCheckUtils]: 18: Hoare triple {15115#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,663 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-08 13:15:34,664 INFO L290 TraceCheckUtils]: 23: Hoare triple {15115#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,665 INFO L290 TraceCheckUtils]: 24: Hoare triple {15189#(= (mod main_~p~0 2) 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,665 INFO L290 TraceCheckUtils]: 25: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post5 < 100);havoc #t~post5; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,665 INFO L272 TraceCheckUtils]: 26: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,665 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,665 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,665 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,666 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #78#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,666 INFO L272 TraceCheckUtils]: 31: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,666 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,666 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,666 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,667 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #80#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,667 INFO L272 TraceCheckUtils]: 36: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,667 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,667 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,667 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,667 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #82#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,669 INFO L290 TraceCheckUtils]: 41: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,669 INFO L290 TraceCheckUtils]: 42: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,669 INFO L290 TraceCheckUtils]: 43: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,669 INFO L272 TraceCheckUtils]: 44: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,670 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,670 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,670 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,670 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #78#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,670 INFO L272 TraceCheckUtils]: 49: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,670 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,670 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,671 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #80#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,671 INFO L272 TraceCheckUtils]: 54: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,671 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,671 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,671 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,672 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #82#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,672 INFO L290 TraceCheckUtils]: 59: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,673 INFO L290 TraceCheckUtils]: 60: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,673 INFO L290 TraceCheckUtils]: 61: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,673 INFO L272 TraceCheckUtils]: 62: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,673 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,673 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,673 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,674 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #84#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,674 INFO L272 TraceCheckUtils]: 67: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,674 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,674 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,674 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,675 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15115#true} {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} #86#return; {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:15:34,676 INFO L290 TraceCheckUtils]: 72: Hoare triple {15244#(and (= (mod (div (- main_~p~0) (- 2)) 2) 0) (= (mod main_~p~0 2) 0))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,676 INFO L290 TraceCheckUtils]: 73: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,677 INFO L290 TraceCheckUtils]: 74: Hoare triple {15189#(= (mod main_~p~0 2) 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,677 INFO L290 TraceCheckUtils]: 75: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !!(#t~post6 < 100);havoc #t~post6; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,677 INFO L272 TraceCheckUtils]: 76: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,677 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,677 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,677 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,678 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #84#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,678 INFO L272 TraceCheckUtils]: 81: Hoare triple {15189#(= (mod main_~p~0 2) 0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,678 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,678 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,678 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,679 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15115#true} {15189#(= (mod main_~p~0 2) 0)} #86#return; {15189#(= (mod main_~p~0 2) 0)} is VALID [2022-04-08 13:15:34,679 INFO L290 TraceCheckUtils]: 86: Hoare triple {15189#(= (mod main_~p~0 2) 0)} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-08 13:15:34,679 INFO L272 TraceCheckUtils]: 87: Hoare triple {15116#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15116#false} is VALID [2022-04-08 13:15:34,679 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-08 13:15:34,679 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-08 13:15:34,680 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-08 13:15:34,680 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 44 proven. 5 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 13:15:34,680 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:15:34,927 INFO L290 TraceCheckUtils]: 90: Hoare triple {15116#false} assume !false; {15116#false} is VALID [2022-04-08 13:15:34,927 INFO L290 TraceCheckUtils]: 89: Hoare triple {15116#false} assume 0 == ~cond; {15116#false} is VALID [2022-04-08 13:15:34,927 INFO L290 TraceCheckUtils]: 88: Hoare triple {15116#false} ~cond := #in~cond; {15116#false} is VALID [2022-04-08 13:15:34,927 INFO L272 TraceCheckUtils]: 87: Hoare triple {15116#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {15116#false} is VALID [2022-04-08 13:15:34,927 INFO L290 TraceCheckUtils]: 86: Hoare triple {15404#(not (= main_~p~0 1))} assume !(1 != ~p~0); {15116#false} is VALID [2022-04-08 13:15:34,928 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #86#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,928 INFO L290 TraceCheckUtils]: 84: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,928 INFO L290 TraceCheckUtils]: 83: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,928 INFO L290 TraceCheckUtils]: 82: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,928 INFO L272 TraceCheckUtils]: 81: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,928 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #84#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,929 INFO L290 TraceCheckUtils]: 79: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,929 INFO L290 TraceCheckUtils]: 78: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,929 INFO L290 TraceCheckUtils]: 77: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,929 INFO L272 TraceCheckUtils]: 76: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,929 INFO L290 TraceCheckUtils]: 75: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,929 INFO L290 TraceCheckUtils]: 74: Hoare triple {15404#(not (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,929 INFO L290 TraceCheckUtils]: 73: Hoare triple {15404#(not (= main_~p~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,930 INFO L290 TraceCheckUtils]: 72: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,931 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #86#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,931 INFO L290 TraceCheckUtils]: 70: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,931 INFO L290 TraceCheckUtils]: 69: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,931 INFO L290 TraceCheckUtils]: 68: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,931 INFO L272 TraceCheckUtils]: 67: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,931 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #84#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,931 INFO L290 TraceCheckUtils]: 65: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,932 INFO L290 TraceCheckUtils]: 64: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,932 INFO L290 TraceCheckUtils]: 63: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,932 INFO L272 TraceCheckUtils]: 62: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,932 INFO L290 TraceCheckUtils]: 61: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post6 < 100);havoc #t~post6; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,932 INFO L290 TraceCheckUtils]: 60: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,932 INFO L290 TraceCheckUtils]: 59: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !(~r~0 >= ~d~0); {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,933 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #82#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,933 INFO L290 TraceCheckUtils]: 57: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,933 INFO L290 TraceCheckUtils]: 56: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,933 INFO L290 TraceCheckUtils]: 55: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,933 INFO L272 TraceCheckUtils]: 54: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,933 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #80#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,933 INFO L290 TraceCheckUtils]: 52: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,934 INFO L272 TraceCheckUtils]: 49: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,934 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {15115#true} {15447#(not (= (div main_~p~0 2) 1))} #78#return; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,934 INFO L290 TraceCheckUtils]: 47: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,934 INFO L290 TraceCheckUtils]: 46: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,934 INFO L290 TraceCheckUtils]: 45: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,934 INFO L272 TraceCheckUtils]: 44: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,934 INFO L290 TraceCheckUtils]: 43: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} assume !!(#t~post5 < 100);havoc #t~post5; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,935 INFO L290 TraceCheckUtils]: 42: Hoare triple {15447#(not (= (div main_~p~0 2) 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,935 INFO L290 TraceCheckUtils]: 41: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15447#(not (= (div main_~p~0 2) 1))} is VALID [2022-04-08 13:15:34,936 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #82#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,936 INFO L290 TraceCheckUtils]: 39: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,936 INFO L290 TraceCheckUtils]: 38: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,936 INFO L290 TraceCheckUtils]: 37: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,936 INFO L272 TraceCheckUtils]: 36: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,936 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #80#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,936 INFO L290 TraceCheckUtils]: 34: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,936 INFO L290 TraceCheckUtils]: 33: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,937 INFO L272 TraceCheckUtils]: 31: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,937 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {15115#true} {15404#(not (= main_~p~0 1))} #78#return; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,937 INFO L290 TraceCheckUtils]: 29: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,937 INFO L290 TraceCheckUtils]: 28: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,937 INFO L290 TraceCheckUtils]: 27: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,937 INFO L272 TraceCheckUtils]: 26: Hoare triple {15404#(not (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {15404#(not (= main_~p~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,938 INFO L290 TraceCheckUtils]: 24: Hoare triple {15404#(not (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,938 INFO L290 TraceCheckUtils]: 23: Hoare triple {15115#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {15404#(not (= main_~p~0 1))} is VALID [2022-04-08 13:15:34,938 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {15115#true} {15115#true} #82#return; {15115#true} is VALID [2022-04-08 13:15:34,938 INFO L290 TraceCheckUtils]: 21: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,938 INFO L290 TraceCheckUtils]: 19: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,938 INFO L272 TraceCheckUtils]: 18: Hoare triple {15115#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,938 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {15115#true} {15115#true} #80#return; {15115#true} is VALID [2022-04-08 13:15:34,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L272 TraceCheckUtils]: 13: Hoare triple {15115#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {15115#true} {15115#true} #78#return; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L290 TraceCheckUtils]: 11: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L290 TraceCheckUtils]: 10: Hoare triple {15115#true} assume !(0 == ~cond); {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L290 TraceCheckUtils]: 9: Hoare triple {15115#true} ~cond := #in~cond; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L272 TraceCheckUtils]: 8: Hoare triple {15115#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L290 TraceCheckUtils]: 7: Hoare triple {15115#true} assume !!(#t~post5 < 100);havoc #t~post5; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L290 TraceCheckUtils]: 6: Hoare triple {15115#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L290 TraceCheckUtils]: 5: Hoare triple {15115#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L272 TraceCheckUtils]: 4: Hoare triple {15115#true} call #t~ret7 := main(); {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15115#true} {15115#true} #92#return; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L290 TraceCheckUtils]: 2: Hoare triple {15115#true} assume true; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L290 TraceCheckUtils]: 1: Hoare triple {15115#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15115#true} is VALID [2022-04-08 13:15:34,939 INFO L272 TraceCheckUtils]: 0: Hoare triple {15115#true} call ULTIMATE.init(); {15115#true} is VALID [2022-04-08 13:15:34,940 INFO L134 CoverageAnalysis]: Checked inductivity of 361 backedges. 38 proven. 11 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 13:15:34,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:15:34,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [827102684] [2022-04-08 13:15:34,940 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:15:34,940 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [174483741] [2022-04-08 13:15:34,940 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [174483741] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:15:34,940 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:15:34,940 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-04-08 13:15:34,941 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:15:34,941 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1454422256] [2022-04-08 13:15:34,941 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1454422256] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:15:34,941 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:15:34,941 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:15:34,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755737907] [2022-04-08 13:15:34,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:15:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2022-04-08 13:15:34,942 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:15:34,942 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 13:15:34,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:34,986 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 13:15:34,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:34,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 13:15:34,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:15:34,987 INFO L87 Difference]: Start difference. First operand 169 states and 196 transitions. Second operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 13:15:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:35,289 INFO L93 Difference]: Finished difference Result 197 states and 235 transitions. [2022-04-08 13:15:35,289 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 13:15:35,290 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) Word has length 91 [2022-04-08 13:15:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:15:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 13:15:35,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 13:15:35,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 13:15:35,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 87 transitions. [2022-04-08 13:15:35,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 87 transitions. [2022-04-08 13:15:35,378 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-08 13:15:35,382 INFO L225 Difference]: With dead ends: 197 [2022-04-08 13:15:35,382 INFO L226 Difference]: Without dead ends: 184 [2022-04-08 13:15:35,382 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 181 GetRequests, 175 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-04-08 13:15:35,383 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:15:35,384 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 99 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:15:35,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-04-08 13:15:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 180. [2022-04-08 13:15:35,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:15:35,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 13:15:35,576 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 13:15:35,576 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 13:15:35,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:35,580 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-08 13:15:35,580 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-08 13:15:35,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:35,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:35,581 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 184 states. [2022-04-08 13:15:35,582 INFO L87 Difference]: Start difference. First operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 184 states. [2022-04-08 13:15:35,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:35,585 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2022-04-08 13:15:35,586 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 220 transitions. [2022-04-08 13:15:35,586 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:35,586 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:35,586 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:15:35,586 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:15:35,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 118 states have (on average 1.1694915254237288) internal successors, (138), 122 states have internal predecessors, (138), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 13:15:35,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 214 transitions. [2022-04-08 13:15:35,595 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 214 transitions. Word has length 91 [2022-04-08 13:15:35,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:15:35,595 INFO L478 AbstractCegarLoop]: Abstraction has 180 states and 214 transitions. [2022-04-08 13:15:35,596 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.25) internal successors, (25), 4 states have internal predecessors, (25), 4 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 3 states have call predecessors, (14), 3 states have call successors, (14) [2022-04-08 13:15:35,596 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 180 states and 214 transitions. [2022-04-08 13:15:35,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:35,852 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 214 transitions. [2022-04-08 13:15:35,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-08 13:15:35,853 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:15:35,853 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 5, 4, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:15:35,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 13:15:36,069 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:15:36,069 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:15:36,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:15:36,070 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 7 times [2022-04-08 13:15:36,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:36,070 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2007353802] [2022-04-08 13:15:40,167 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:15:40,168 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:15:40,168 INFO L85 PathProgramCache]: Analyzing trace with hash 1432051402, now seen corresponding path program 8 times [2022-04-08 13:15:40,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:15:40,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45837299] [2022-04-08 13:15:40,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:15:40,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:15:40,178 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:15:40,179 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1619555753] [2022-04-08 13:15:40,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:15:40,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:15:40,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:15:40,184 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:15:40,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 13:15:40,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:15:40,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:15:40,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 13:15:40,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:15:40,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:15:40,573 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-08 13:15:40,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {16788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16796#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:40,574 INFO L290 TraceCheckUtils]: 2: Hoare triple {16796#(<= ~counter~0 0)} assume true; {16796#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:40,574 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16796#(<= ~counter~0 0)} {16788#true} #92#return; {16796#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:40,575 INFO L272 TraceCheckUtils]: 4: Hoare triple {16796#(<= ~counter~0 0)} call #t~ret7 := main(); {16796#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:40,575 INFO L290 TraceCheckUtils]: 5: Hoare triple {16796#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {16796#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:40,576 INFO L290 TraceCheckUtils]: 6: Hoare triple {16796#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,576 INFO L290 TraceCheckUtils]: 7: Hoare triple {16812#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,576 INFO L272 TraceCheckUtils]: 8: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,577 INFO L290 TraceCheckUtils]: 10: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,577 INFO L290 TraceCheckUtils]: 11: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,577 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #78#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,578 INFO L272 TraceCheckUtils]: 13: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,578 INFO L290 TraceCheckUtils]: 14: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,578 INFO L290 TraceCheckUtils]: 15: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,579 INFO L290 TraceCheckUtils]: 16: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,579 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #80#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,580 INFO L272 TraceCheckUtils]: 18: Hoare triple {16812#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,580 INFO L290 TraceCheckUtils]: 19: Hoare triple {16812#(<= ~counter~0 1)} ~cond := #in~cond; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,580 INFO L290 TraceCheckUtils]: 20: Hoare triple {16812#(<= ~counter~0 1)} assume !(0 == ~cond); {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,580 INFO L290 TraceCheckUtils]: 21: Hoare triple {16812#(<= ~counter~0 1)} assume true; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,581 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16812#(<= ~counter~0 1)} {16812#(<= ~counter~0 1)} #82#return; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {16812#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16812#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:40,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {16812#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,582 INFO L290 TraceCheckUtils]: 25: Hoare triple {16867#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,582 INFO L272 TraceCheckUtils]: 26: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,582 INFO L290 TraceCheckUtils]: 27: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,583 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #78#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,584 INFO L272 TraceCheckUtils]: 31: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,585 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #80#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,585 INFO L272 TraceCheckUtils]: 36: Hoare triple {16867#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {16867#(<= ~counter~0 2)} ~cond := #in~cond; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,586 INFO L290 TraceCheckUtils]: 38: Hoare triple {16867#(<= ~counter~0 2)} assume !(0 == ~cond); {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {16867#(<= ~counter~0 2)} assume true; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,586 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16867#(<= ~counter~0 2)} {16867#(<= ~counter~0 2)} #82#return; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,587 INFO L290 TraceCheckUtils]: 41: Hoare triple {16867#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16867#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:40,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {16867#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {16922#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,588 INFO L272 TraceCheckUtils]: 44: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,588 INFO L290 TraceCheckUtils]: 45: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,589 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #78#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,589 INFO L272 TraceCheckUtils]: 49: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,589 INFO L290 TraceCheckUtils]: 50: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,590 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #80#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,591 INFO L272 TraceCheckUtils]: 54: Hoare triple {16922#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {16922#(<= ~counter~0 3)} ~cond := #in~cond; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {16922#(<= ~counter~0 3)} assume !(0 == ~cond); {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {16922#(<= ~counter~0 3)} assume true; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,592 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16922#(<= ~counter~0 3)} {16922#(<= ~counter~0 3)} #82#return; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,592 INFO L290 TraceCheckUtils]: 59: Hoare triple {16922#(<= ~counter~0 3)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16922#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:40,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {16922#(<= ~counter~0 3)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {16977#(<= ~counter~0 4)} assume !!(#t~post5 < 100);havoc #t~post5; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,593 INFO L272 TraceCheckUtils]: 62: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,594 INFO L290 TraceCheckUtils]: 63: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,594 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #78#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,595 INFO L272 TraceCheckUtils]: 67: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,595 INFO L290 TraceCheckUtils]: 68: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,596 INFO L290 TraceCheckUtils]: 70: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,596 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #80#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,596 INFO L272 TraceCheckUtils]: 72: Hoare triple {16977#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {16977#(<= ~counter~0 4)} ~cond := #in~cond; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,597 INFO L290 TraceCheckUtils]: 74: Hoare triple {16977#(<= ~counter~0 4)} assume !(0 == ~cond); {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,597 INFO L290 TraceCheckUtils]: 75: Hoare triple {16977#(<= ~counter~0 4)} assume true; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,598 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16977#(<= ~counter~0 4)} {16977#(<= ~counter~0 4)} #82#return; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,598 INFO L290 TraceCheckUtils]: 77: Hoare triple {16977#(<= ~counter~0 4)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {16977#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:40,598 INFO L290 TraceCheckUtils]: 78: Hoare triple {16977#(<= ~counter~0 4)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17032#(<= |main_#t~post5| 4)} is VALID [2022-04-08 13:15:40,598 INFO L290 TraceCheckUtils]: 79: Hoare triple {17032#(<= |main_#t~post5| 4)} assume !(#t~post5 < 100);havoc #t~post5; {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 100);havoc #t~post6; {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L272 TraceCheckUtils]: 82: Hoare triple {16789#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L290 TraceCheckUtils]: 83: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L290 TraceCheckUtils]: 84: Hoare triple {16789#false} assume !(0 == ~cond); {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L290 TraceCheckUtils]: 85: Hoare triple {16789#false} assume true; {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16789#false} {16789#false} #88#return; {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L272 TraceCheckUtils]: 87: Hoare triple {16789#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-08 13:15:40,599 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 72 proven. 260 refuted. 0 times theorem prover too weak. 50 trivial. 0 not checked. [2022-04-08 13:15:40,599 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:15:40,936 INFO L290 TraceCheckUtils]: 90: Hoare triple {16789#false} assume !false; {16789#false} is VALID [2022-04-08 13:15:40,937 INFO L290 TraceCheckUtils]: 89: Hoare triple {16789#false} assume 0 == ~cond; {16789#false} is VALID [2022-04-08 13:15:40,937 INFO L290 TraceCheckUtils]: 88: Hoare triple {16789#false} ~cond := #in~cond; {16789#false} is VALID [2022-04-08 13:15:40,937 INFO L272 TraceCheckUtils]: 87: Hoare triple {16789#false} call __VERIFIER_assert((if ~B~0 == ~d~0 then 1 else 0)); {16789#false} is VALID [2022-04-08 13:15:40,937 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {16788#true} {16789#false} #88#return; {16789#false} is VALID [2022-04-08 13:15:40,937 INFO L290 TraceCheckUtils]: 85: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,937 INFO L290 TraceCheckUtils]: 84: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,937 INFO L290 TraceCheckUtils]: 83: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,937 INFO L272 TraceCheckUtils]: 82: Hoare triple {16789#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,937 INFO L290 TraceCheckUtils]: 81: Hoare triple {16789#false} assume !(#t~post6 < 100);havoc #t~post6; {16789#false} is VALID [2022-04-08 13:15:40,937 INFO L290 TraceCheckUtils]: 80: Hoare triple {16789#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16789#false} is VALID [2022-04-08 13:15:40,938 INFO L290 TraceCheckUtils]: 79: Hoare triple {17102#(< |main_#t~post5| 100)} assume !(#t~post5 < 100);havoc #t~post5; {16789#false} is VALID [2022-04-08 13:15:40,938 INFO L290 TraceCheckUtils]: 78: Hoare triple {17106#(< ~counter~0 100)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17102#(< |main_#t~post5| 100)} is VALID [2022-04-08 13:15:40,938 INFO L290 TraceCheckUtils]: 77: Hoare triple {17106#(< ~counter~0 100)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17106#(< ~counter~0 100)} is VALID [2022-04-08 13:15:40,939 INFO L284 TraceCheckUtils]: 76: Hoare quadruple {16788#true} {17106#(< ~counter~0 100)} #82#return; {17106#(< ~counter~0 100)} is VALID [2022-04-08 13:15:40,939 INFO L290 TraceCheckUtils]: 75: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,939 INFO L290 TraceCheckUtils]: 74: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,939 INFO L290 TraceCheckUtils]: 73: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,939 INFO L272 TraceCheckUtils]: 72: Hoare triple {17106#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,939 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {16788#true} {17106#(< ~counter~0 100)} #80#return; {17106#(< ~counter~0 100)} is VALID [2022-04-08 13:15:40,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,940 INFO L272 TraceCheckUtils]: 67: Hoare triple {17106#(< ~counter~0 100)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,940 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {16788#true} {17106#(< ~counter~0 100)} #78#return; {17106#(< ~counter~0 100)} is VALID [2022-04-08 13:15:40,940 INFO L290 TraceCheckUtils]: 65: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,940 INFO L290 TraceCheckUtils]: 64: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,940 INFO L290 TraceCheckUtils]: 63: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,940 INFO L272 TraceCheckUtils]: 62: Hoare triple {17106#(< ~counter~0 100)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,943 INFO L290 TraceCheckUtils]: 61: Hoare triple {17106#(< ~counter~0 100)} assume !!(#t~post5 < 100);havoc #t~post5; {17106#(< ~counter~0 100)} is VALID [2022-04-08 13:15:40,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {17161#(< ~counter~0 99)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17106#(< ~counter~0 100)} is VALID [2022-04-08 13:15:40,944 INFO L290 TraceCheckUtils]: 59: Hoare triple {17161#(< ~counter~0 99)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17161#(< ~counter~0 99)} is VALID [2022-04-08 13:15:40,944 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {16788#true} {17161#(< ~counter~0 99)} #82#return; {17161#(< ~counter~0 99)} is VALID [2022-04-08 13:15:40,944 INFO L290 TraceCheckUtils]: 57: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,944 INFO L290 TraceCheckUtils]: 56: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,944 INFO L290 TraceCheckUtils]: 55: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,945 INFO L272 TraceCheckUtils]: 54: Hoare triple {17161#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,945 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {16788#true} {17161#(< ~counter~0 99)} #80#return; {17161#(< ~counter~0 99)} is VALID [2022-04-08 13:15:40,945 INFO L290 TraceCheckUtils]: 52: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,945 INFO L290 TraceCheckUtils]: 51: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,945 INFO L290 TraceCheckUtils]: 50: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,945 INFO L272 TraceCheckUtils]: 49: Hoare triple {17161#(< ~counter~0 99)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,945 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {16788#true} {17161#(< ~counter~0 99)} #78#return; {17161#(< ~counter~0 99)} is VALID [2022-04-08 13:15:40,946 INFO L290 TraceCheckUtils]: 47: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,946 INFO L290 TraceCheckUtils]: 45: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,946 INFO L272 TraceCheckUtils]: 44: Hoare triple {17161#(< ~counter~0 99)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,946 INFO L290 TraceCheckUtils]: 43: Hoare triple {17161#(< ~counter~0 99)} assume !!(#t~post5 < 100);havoc #t~post5; {17161#(< ~counter~0 99)} is VALID [2022-04-08 13:15:40,946 INFO L290 TraceCheckUtils]: 42: Hoare triple {17216#(< ~counter~0 98)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17161#(< ~counter~0 99)} is VALID [2022-04-08 13:15:40,947 INFO L290 TraceCheckUtils]: 41: Hoare triple {17216#(< ~counter~0 98)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17216#(< ~counter~0 98)} is VALID [2022-04-08 13:15:40,947 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {16788#true} {17216#(< ~counter~0 98)} #82#return; {17216#(< ~counter~0 98)} is VALID [2022-04-08 13:15:40,947 INFO L290 TraceCheckUtils]: 39: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,947 INFO L290 TraceCheckUtils]: 38: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,947 INFO L290 TraceCheckUtils]: 37: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,947 INFO L272 TraceCheckUtils]: 36: Hoare triple {17216#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,948 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {16788#true} {17216#(< ~counter~0 98)} #80#return; {17216#(< ~counter~0 98)} is VALID [2022-04-08 13:15:40,948 INFO L290 TraceCheckUtils]: 34: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,948 INFO L290 TraceCheckUtils]: 33: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,948 INFO L290 TraceCheckUtils]: 32: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,948 INFO L272 TraceCheckUtils]: 31: Hoare triple {17216#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,948 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {16788#true} {17216#(< ~counter~0 98)} #78#return; {17216#(< ~counter~0 98)} is VALID [2022-04-08 13:15:40,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,948 INFO L290 TraceCheckUtils]: 28: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,949 INFO L290 TraceCheckUtils]: 27: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,949 INFO L272 TraceCheckUtils]: 26: Hoare triple {17216#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,949 INFO L290 TraceCheckUtils]: 25: Hoare triple {17216#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {17216#(< ~counter~0 98)} is VALID [2022-04-08 13:15:40,949 INFO L290 TraceCheckUtils]: 24: Hoare triple {17271#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17216#(< ~counter~0 98)} is VALID [2022-04-08 13:15:40,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {17271#(< ~counter~0 97)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {17271#(< ~counter~0 97)} is VALID [2022-04-08 13:15:40,950 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {16788#true} {17271#(< ~counter~0 97)} #82#return; {17271#(< ~counter~0 97)} is VALID [2022-04-08 13:15:40,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,950 INFO L290 TraceCheckUtils]: 20: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,950 INFO L272 TraceCheckUtils]: 18: Hoare triple {17271#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,951 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {16788#true} {17271#(< ~counter~0 97)} #80#return; {17271#(< ~counter~0 97)} is VALID [2022-04-08 13:15:40,951 INFO L290 TraceCheckUtils]: 16: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,951 INFO L290 TraceCheckUtils]: 15: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,951 INFO L290 TraceCheckUtils]: 14: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,951 INFO L272 TraceCheckUtils]: 13: Hoare triple {17271#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,951 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {16788#true} {17271#(< ~counter~0 97)} #78#return; {17271#(< ~counter~0 97)} is VALID [2022-04-08 13:15:40,951 INFO L290 TraceCheckUtils]: 11: Hoare triple {16788#true} assume true; {16788#true} is VALID [2022-04-08 13:15:40,951 INFO L290 TraceCheckUtils]: 10: Hoare triple {16788#true} assume !(0 == ~cond); {16788#true} is VALID [2022-04-08 13:15:40,951 INFO L290 TraceCheckUtils]: 9: Hoare triple {16788#true} ~cond := #in~cond; {16788#true} is VALID [2022-04-08 13:15:40,951 INFO L272 TraceCheckUtils]: 8: Hoare triple {17271#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {16788#true} is VALID [2022-04-08 13:15:40,952 INFO L290 TraceCheckUtils]: 7: Hoare triple {17271#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {17271#(< ~counter~0 97)} is VALID [2022-04-08 13:15:40,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {17326#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {17271#(< ~counter~0 97)} is VALID [2022-04-08 13:15:40,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {17326#(< ~counter~0 96)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {17326#(< ~counter~0 96)} is VALID [2022-04-08 13:15:40,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {17326#(< ~counter~0 96)} call #t~ret7 := main(); {17326#(< ~counter~0 96)} is VALID [2022-04-08 13:15:40,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17326#(< ~counter~0 96)} {16788#true} #92#return; {17326#(< ~counter~0 96)} is VALID [2022-04-08 13:15:40,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {17326#(< ~counter~0 96)} assume true; {17326#(< ~counter~0 96)} is VALID [2022-04-08 13:15:40,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {16788#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17326#(< ~counter~0 96)} is VALID [2022-04-08 13:15:40,954 INFO L272 TraceCheckUtils]: 0: Hoare triple {16788#true} call ULTIMATE.init(); {16788#true} is VALID [2022-04-08 13:15:40,954 INFO L134 CoverageAnalysis]: Checked inductivity of 382 backedges. 26 proven. 44 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 13:15:40,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:15:40,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45837299] [2022-04-08 13:15:40,954 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:15:40,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1619555753] [2022-04-08 13:15:40,954 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1619555753] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:15:40,954 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:15:40,954 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 13:15:40,955 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:15:40,955 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2007353802] [2022-04-08 13:15:40,955 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2007353802] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:15:40,955 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:15:40,955 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 13:15:40,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395251637] [2022-04-08 13:15:40,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:15:40,955 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-08 13:15:40,956 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:15:40,956 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:41,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:41,008 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 13:15:41,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:41,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 13:15:41,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 13:15:41,009 INFO L87 Difference]: Start difference. First operand 180 states and 214 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:41,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:41,369 INFO L93 Difference]: Finished difference Result 242 states and 300 transitions. [2022-04-08 13:15:41,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 13:15:41,369 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 91 [2022-04-08 13:15:41,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:15:41,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:41,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-08 13:15:41,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:41,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 117 transitions. [2022-04-08 13:15:41,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 117 transitions. [2022-04-08 13:15:41,472 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:41,475 INFO L225 Difference]: With dead ends: 242 [2022-04-08 13:15:41,476 INFO L226 Difference]: Without dead ends: 182 [2022-04-08 13:15:41,476 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 185 GetRequests, 169 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-08 13:15:41,478 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 11 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:15:41,479 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 195 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:15:41,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-08 13:15:41,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-08 13:15:41,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:15:41,685 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 13:15:41,686 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 13:15:41,686 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 13:15:41,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:41,690 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-08 13:15:41,690 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-08 13:15:41,691 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:41,691 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:41,691 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 182 states. [2022-04-08 13:15:41,691 INFO L87 Difference]: Start difference. First operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) Second operand 182 states. [2022-04-08 13:15:41,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:41,695 INFO L93 Difference]: Finished difference Result 182 states and 216 transitions. [2022-04-08 13:15:41,695 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-08 13:15:41,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:41,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:41,695 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:15:41,695 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:15:41,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 120 states have (on average 1.1666666666666667) internal successors, (140), 124 states have internal predecessors, (140), 39 states have call successors, (39), 23 states have call predecessors, (39), 22 states have return successors, (37), 34 states have call predecessors, (37), 37 states have call successors, (37) [2022-04-08 13:15:41,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 216 transitions. [2022-04-08 13:15:41,699 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 216 transitions. Word has length 91 [2022-04-08 13:15:41,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:15:41,700 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 216 transitions. [2022-04-08 13:15:41,700 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (16), 7 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:41,700 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 216 transitions. [2022-04-08 13:15:41,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:41,955 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 216 transitions. [2022-04-08 13:15:41,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 13:15:41,956 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:15:41,956 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:15:41,971 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-08 13:15:42,156 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:15:42,156 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:15:42,157 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:15:42,157 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 5 times [2022-04-08 13:15:42,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:42,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [857164919] [2022-04-08 13:15:43,443 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:15:43,443 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:15:43,443 INFO L85 PathProgramCache]: Analyzing trace with hash -614243194, now seen corresponding path program 6 times [2022-04-08 13:15:43,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:15:43,444 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [971545935] [2022-04-08 13:15:43,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:15:43,444 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:15:43,454 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:15:43,455 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1322994034] [2022-04-08 13:15:43,455 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:15:43,455 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:15:43,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:15:43,461 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:15:43,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 13:15:43,550 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 13:15:43,550 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:15:43,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 13:15:43,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:15:43,569 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:15:43,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-08 13:15:43,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {18567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {18575#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:43,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {18575#(<= ~counter~0 0)} assume true; {18575#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:43,919 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18575#(<= ~counter~0 0)} {18567#true} #92#return; {18575#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:43,919 INFO L272 TraceCheckUtils]: 4: Hoare triple {18575#(<= ~counter~0 0)} call #t~ret7 := main(); {18575#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:43,920 INFO L290 TraceCheckUtils]: 5: Hoare triple {18575#(<= ~counter~0 0)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {18575#(<= ~counter~0 0)} is VALID [2022-04-08 13:15:43,920 INFO L290 TraceCheckUtils]: 6: Hoare triple {18575#(<= ~counter~0 0)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,921 INFO L290 TraceCheckUtils]: 7: Hoare triple {18591#(<= ~counter~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,921 INFO L272 TraceCheckUtils]: 8: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,921 INFO L290 TraceCheckUtils]: 9: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,921 INFO L290 TraceCheckUtils]: 10: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,922 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #78#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,922 INFO L272 TraceCheckUtils]: 13: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,923 INFO L290 TraceCheckUtils]: 14: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,923 INFO L290 TraceCheckUtils]: 15: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,923 INFO L290 TraceCheckUtils]: 16: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,924 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #80#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,924 INFO L272 TraceCheckUtils]: 18: Hoare triple {18591#(<= ~counter~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {18591#(<= ~counter~0 1)} ~cond := #in~cond; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,925 INFO L290 TraceCheckUtils]: 20: Hoare triple {18591#(<= ~counter~0 1)} assume !(0 == ~cond); {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,925 INFO L290 TraceCheckUtils]: 21: Hoare triple {18591#(<= ~counter~0 1)} assume true; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,925 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18591#(<= ~counter~0 1)} {18591#(<= ~counter~0 1)} #82#return; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,925 INFO L290 TraceCheckUtils]: 23: Hoare triple {18591#(<= ~counter~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18591#(<= ~counter~0 1)} is VALID [2022-04-08 13:15:43,926 INFO L290 TraceCheckUtils]: 24: Hoare triple {18591#(<= ~counter~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,926 INFO L290 TraceCheckUtils]: 25: Hoare triple {18646#(<= ~counter~0 2)} assume !!(#t~post5 < 100);havoc #t~post5; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,927 INFO L272 TraceCheckUtils]: 26: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,927 INFO L290 TraceCheckUtils]: 27: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,927 INFO L290 TraceCheckUtils]: 28: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,927 INFO L290 TraceCheckUtils]: 29: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,928 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #78#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,928 INFO L272 TraceCheckUtils]: 31: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,928 INFO L290 TraceCheckUtils]: 32: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,929 INFO L290 TraceCheckUtils]: 34: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,929 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #80#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,930 INFO L272 TraceCheckUtils]: 36: Hoare triple {18646#(<= ~counter~0 2)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,930 INFO L290 TraceCheckUtils]: 37: Hoare triple {18646#(<= ~counter~0 2)} ~cond := #in~cond; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,930 INFO L290 TraceCheckUtils]: 38: Hoare triple {18646#(<= ~counter~0 2)} assume !(0 == ~cond); {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,930 INFO L290 TraceCheckUtils]: 39: Hoare triple {18646#(<= ~counter~0 2)} assume true; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,931 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18646#(<= ~counter~0 2)} {18646#(<= ~counter~0 2)} #82#return; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,931 INFO L290 TraceCheckUtils]: 41: Hoare triple {18646#(<= ~counter~0 2)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {18646#(<= ~counter~0 2)} is VALID [2022-04-08 13:15:43,932 INFO L290 TraceCheckUtils]: 42: Hoare triple {18646#(<= ~counter~0 2)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,932 INFO L290 TraceCheckUtils]: 43: Hoare triple {18701#(<= ~counter~0 3)} assume !!(#t~post5 < 100);havoc #t~post5; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,932 INFO L272 TraceCheckUtils]: 44: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,932 INFO L290 TraceCheckUtils]: 45: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,933 INFO L290 TraceCheckUtils]: 46: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,933 INFO L290 TraceCheckUtils]: 47: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,933 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #78#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,934 INFO L272 TraceCheckUtils]: 49: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,934 INFO L290 TraceCheckUtils]: 50: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,934 INFO L290 TraceCheckUtils]: 51: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,934 INFO L290 TraceCheckUtils]: 52: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,935 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #80#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,935 INFO L272 TraceCheckUtils]: 54: Hoare triple {18701#(<= ~counter~0 3)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,936 INFO L290 TraceCheckUtils]: 55: Hoare triple {18701#(<= ~counter~0 3)} ~cond := #in~cond; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,936 INFO L290 TraceCheckUtils]: 56: Hoare triple {18701#(<= ~counter~0 3)} assume !(0 == ~cond); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,936 INFO L290 TraceCheckUtils]: 57: Hoare triple {18701#(<= ~counter~0 3)} assume true; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,936 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18701#(<= ~counter~0 3)} {18701#(<= ~counter~0 3)} #82#return; {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,937 INFO L290 TraceCheckUtils]: 59: Hoare triple {18701#(<= ~counter~0 3)} assume !(~r~0 >= ~d~0); {18701#(<= ~counter~0 3)} is VALID [2022-04-08 13:15:43,937 INFO L290 TraceCheckUtils]: 60: Hoare triple {18701#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,937 INFO L290 TraceCheckUtils]: 61: Hoare triple {18756#(<= ~counter~0 4)} assume !!(#t~post6 < 100);havoc #t~post6; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,938 INFO L272 TraceCheckUtils]: 62: Hoare triple {18756#(<= ~counter~0 4)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,938 INFO L290 TraceCheckUtils]: 63: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,938 INFO L290 TraceCheckUtils]: 64: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,939 INFO L290 TraceCheckUtils]: 65: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,939 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #84#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,940 INFO L272 TraceCheckUtils]: 67: Hoare triple {18756#(<= ~counter~0 4)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,940 INFO L290 TraceCheckUtils]: 68: Hoare triple {18756#(<= ~counter~0 4)} ~cond := #in~cond; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,940 INFO L290 TraceCheckUtils]: 69: Hoare triple {18756#(<= ~counter~0 4)} assume !(0 == ~cond); {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,940 INFO L290 TraceCheckUtils]: 70: Hoare triple {18756#(<= ~counter~0 4)} assume true; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,941 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18756#(<= ~counter~0 4)} {18756#(<= ~counter~0 4)} #86#return; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {18756#(<= ~counter~0 4)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,942 INFO L290 TraceCheckUtils]: 73: Hoare triple {18756#(<= ~counter~0 4)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18756#(<= ~counter~0 4)} is VALID [2022-04-08 13:15:43,942 INFO L290 TraceCheckUtils]: 74: Hoare triple {18756#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,942 INFO L290 TraceCheckUtils]: 75: Hoare triple {18799#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,943 INFO L272 TraceCheckUtils]: 76: Hoare triple {18799#(<= ~counter~0 5)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,943 INFO L290 TraceCheckUtils]: 77: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,944 INFO L290 TraceCheckUtils]: 78: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,944 INFO L290 TraceCheckUtils]: 79: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,945 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #84#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,945 INFO L272 TraceCheckUtils]: 81: Hoare triple {18799#(<= ~counter~0 5)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,946 INFO L290 TraceCheckUtils]: 82: Hoare triple {18799#(<= ~counter~0 5)} ~cond := #in~cond; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,946 INFO L290 TraceCheckUtils]: 83: Hoare triple {18799#(<= ~counter~0 5)} assume !(0 == ~cond); {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,946 INFO L290 TraceCheckUtils]: 84: Hoare triple {18799#(<= ~counter~0 5)} assume true; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,947 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18799#(<= ~counter~0 5)} {18799#(<= ~counter~0 5)} #86#return; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,947 INFO L290 TraceCheckUtils]: 86: Hoare triple {18799#(<= ~counter~0 5)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,947 INFO L290 TraceCheckUtils]: 87: Hoare triple {18799#(<= ~counter~0 5)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18799#(<= ~counter~0 5)} is VALID [2022-04-08 13:15:43,948 INFO L290 TraceCheckUtils]: 88: Hoare triple {18799#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18842#(<= |main_#t~post6| 5)} is VALID [2022-04-08 13:15:43,948 INFO L290 TraceCheckUtils]: 89: Hoare triple {18842#(<= |main_#t~post6| 5)} assume !(#t~post6 < 100);havoc #t~post6; {18568#false} is VALID [2022-04-08 13:15:43,948 INFO L272 TraceCheckUtils]: 90: Hoare triple {18568#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18568#false} is VALID [2022-04-08 13:15:43,948 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-08 13:15:43,948 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-08 13:15:43,948 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-08 13:15:43,949 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 296 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-08 13:15:43,949 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:15:44,315 INFO L290 TraceCheckUtils]: 93: Hoare triple {18568#false} assume !false; {18568#false} is VALID [2022-04-08 13:15:44,315 INFO L290 TraceCheckUtils]: 92: Hoare triple {18568#false} assume 0 == ~cond; {18568#false} is VALID [2022-04-08 13:15:44,315 INFO L290 TraceCheckUtils]: 91: Hoare triple {18568#false} ~cond := #in~cond; {18568#false} is VALID [2022-04-08 13:15:44,315 INFO L272 TraceCheckUtils]: 90: Hoare triple {18568#false} call __VERIFIER_assert((if ~A~0 == ~d~0 * ~q~0 + ~r~0 then 1 else 0)); {18568#false} is VALID [2022-04-08 13:15:44,315 INFO L290 TraceCheckUtils]: 89: Hoare triple {18870#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {18568#false} is VALID [2022-04-08 13:15:44,315 INFO L290 TraceCheckUtils]: 88: Hoare triple {18874#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18870#(< |main_#t~post6| 100)} is VALID [2022-04-08 13:15:44,316 INFO L290 TraceCheckUtils]: 87: Hoare triple {18874#(< ~counter~0 100)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18874#(< ~counter~0 100)} is VALID [2022-04-08 13:15:44,316 INFO L290 TraceCheckUtils]: 86: Hoare triple {18874#(< ~counter~0 100)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18874#(< ~counter~0 100)} is VALID [2022-04-08 13:15:44,317 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {18567#true} {18874#(< ~counter~0 100)} #86#return; {18874#(< ~counter~0 100)} is VALID [2022-04-08 13:15:44,317 INFO L290 TraceCheckUtils]: 84: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,317 INFO L290 TraceCheckUtils]: 83: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,317 INFO L290 TraceCheckUtils]: 82: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,317 INFO L272 TraceCheckUtils]: 81: Hoare triple {18874#(< ~counter~0 100)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,317 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {18567#true} {18874#(< ~counter~0 100)} #84#return; {18874#(< ~counter~0 100)} is VALID [2022-04-08 13:15:44,317 INFO L290 TraceCheckUtils]: 79: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,317 INFO L290 TraceCheckUtils]: 78: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,317 INFO L290 TraceCheckUtils]: 77: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,317 INFO L272 TraceCheckUtils]: 76: Hoare triple {18874#(< ~counter~0 100)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,318 INFO L290 TraceCheckUtils]: 75: Hoare triple {18874#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {18874#(< ~counter~0 100)} is VALID [2022-04-08 13:15:44,318 INFO L290 TraceCheckUtils]: 74: Hoare triple {18917#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18874#(< ~counter~0 100)} is VALID [2022-04-08 13:15:44,319 INFO L290 TraceCheckUtils]: 73: Hoare triple {18917#(< ~counter~0 99)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {18917#(< ~counter~0 99)} is VALID [2022-04-08 13:15:44,319 INFO L290 TraceCheckUtils]: 72: Hoare triple {18917#(< ~counter~0 99)} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {18917#(< ~counter~0 99)} is VALID [2022-04-08 13:15:44,319 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18567#true} {18917#(< ~counter~0 99)} #86#return; {18917#(< ~counter~0 99)} is VALID [2022-04-08 13:15:44,319 INFO L290 TraceCheckUtils]: 70: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,320 INFO L290 TraceCheckUtils]: 69: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,320 INFO L290 TraceCheckUtils]: 68: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,320 INFO L272 TraceCheckUtils]: 67: Hoare triple {18917#(< ~counter~0 99)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,320 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {18567#true} {18917#(< ~counter~0 99)} #84#return; {18917#(< ~counter~0 99)} is VALID [2022-04-08 13:15:44,320 INFO L290 TraceCheckUtils]: 65: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,320 INFO L290 TraceCheckUtils]: 64: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,320 INFO L290 TraceCheckUtils]: 63: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,320 INFO L272 TraceCheckUtils]: 62: Hoare triple {18917#(< ~counter~0 99)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {18917#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {18917#(< ~counter~0 99)} is VALID [2022-04-08 13:15:44,321 INFO L290 TraceCheckUtils]: 60: Hoare triple {18960#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18917#(< ~counter~0 99)} is VALID [2022-04-08 13:15:44,321 INFO L290 TraceCheckUtils]: 59: Hoare triple {18960#(< ~counter~0 98)} assume !(~r~0 >= ~d~0); {18960#(< ~counter~0 98)} is VALID [2022-04-08 13:15:44,322 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {18567#true} {18960#(< ~counter~0 98)} #82#return; {18960#(< ~counter~0 98)} is VALID [2022-04-08 13:15:44,322 INFO L290 TraceCheckUtils]: 57: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,322 INFO L290 TraceCheckUtils]: 56: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,322 INFO L290 TraceCheckUtils]: 55: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,322 INFO L272 TraceCheckUtils]: 54: Hoare triple {18960#(< ~counter~0 98)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,322 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {18567#true} {18960#(< ~counter~0 98)} #80#return; {18960#(< ~counter~0 98)} is VALID [2022-04-08 13:15:44,322 INFO L290 TraceCheckUtils]: 52: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,322 INFO L290 TraceCheckUtils]: 51: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,323 INFO L290 TraceCheckUtils]: 50: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,323 INFO L272 TraceCheckUtils]: 49: Hoare triple {18960#(< ~counter~0 98)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,323 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {18567#true} {18960#(< ~counter~0 98)} #78#return; {18960#(< ~counter~0 98)} is VALID [2022-04-08 13:15:44,323 INFO L290 TraceCheckUtils]: 47: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,323 INFO L290 TraceCheckUtils]: 46: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,323 INFO L290 TraceCheckUtils]: 45: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,323 INFO L272 TraceCheckUtils]: 44: Hoare triple {18960#(< ~counter~0 98)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,323 INFO L290 TraceCheckUtils]: 43: Hoare triple {18960#(< ~counter~0 98)} assume !!(#t~post5 < 100);havoc #t~post5; {18960#(< ~counter~0 98)} is VALID [2022-04-08 13:15:44,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {19015#(< ~counter~0 97)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {18960#(< ~counter~0 98)} is VALID [2022-04-08 13:15:44,324 INFO L290 TraceCheckUtils]: 41: Hoare triple {19015#(< ~counter~0 97)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19015#(< ~counter~0 97)} is VALID [2022-04-08 13:15:44,325 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {18567#true} {19015#(< ~counter~0 97)} #82#return; {19015#(< ~counter~0 97)} is VALID [2022-04-08 13:15:44,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,325 INFO L290 TraceCheckUtils]: 38: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,325 INFO L290 TraceCheckUtils]: 37: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,325 INFO L272 TraceCheckUtils]: 36: Hoare triple {19015#(< ~counter~0 97)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,325 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {18567#true} {19015#(< ~counter~0 97)} #80#return; {19015#(< ~counter~0 97)} is VALID [2022-04-08 13:15:44,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,325 INFO L290 TraceCheckUtils]: 32: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,325 INFO L272 TraceCheckUtils]: 31: Hoare triple {19015#(< ~counter~0 97)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,326 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {18567#true} {19015#(< ~counter~0 97)} #78#return; {19015#(< ~counter~0 97)} is VALID [2022-04-08 13:15:44,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,326 INFO L290 TraceCheckUtils]: 28: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,326 INFO L290 TraceCheckUtils]: 27: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,326 INFO L272 TraceCheckUtils]: 26: Hoare triple {19015#(< ~counter~0 97)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,328 INFO L290 TraceCheckUtils]: 25: Hoare triple {19015#(< ~counter~0 97)} assume !!(#t~post5 < 100);havoc #t~post5; {19015#(< ~counter~0 97)} is VALID [2022-04-08 13:15:44,329 INFO L290 TraceCheckUtils]: 24: Hoare triple {19070#(< ~counter~0 96)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19015#(< ~counter~0 97)} is VALID [2022-04-08 13:15:44,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {19070#(< ~counter~0 96)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {19070#(< ~counter~0 96)} is VALID [2022-04-08 13:15:44,329 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {18567#true} {19070#(< ~counter~0 96)} #82#return; {19070#(< ~counter~0 96)} is VALID [2022-04-08 13:15:44,330 INFO L290 TraceCheckUtils]: 21: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,330 INFO L290 TraceCheckUtils]: 20: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,330 INFO L290 TraceCheckUtils]: 19: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,330 INFO L272 TraceCheckUtils]: 18: Hoare triple {19070#(< ~counter~0 96)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,330 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {18567#true} {19070#(< ~counter~0 96)} #80#return; {19070#(< ~counter~0 96)} is VALID [2022-04-08 13:15:44,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,330 INFO L290 TraceCheckUtils]: 15: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,330 INFO L272 TraceCheckUtils]: 13: Hoare triple {19070#(< ~counter~0 96)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,331 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {18567#true} {19070#(< ~counter~0 96)} #78#return; {19070#(< ~counter~0 96)} is VALID [2022-04-08 13:15:44,331 INFO L290 TraceCheckUtils]: 11: Hoare triple {18567#true} assume true; {18567#true} is VALID [2022-04-08 13:15:44,331 INFO L290 TraceCheckUtils]: 10: Hoare triple {18567#true} assume !(0 == ~cond); {18567#true} is VALID [2022-04-08 13:15:44,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {18567#true} ~cond := #in~cond; {18567#true} is VALID [2022-04-08 13:15:44,331 INFO L272 TraceCheckUtils]: 8: Hoare triple {19070#(< ~counter~0 96)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {18567#true} is VALID [2022-04-08 13:15:44,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {19070#(< ~counter~0 96)} assume !!(#t~post5 < 100);havoc #t~post5; {19070#(< ~counter~0 96)} is VALID [2022-04-08 13:15:44,332 INFO L290 TraceCheckUtils]: 6: Hoare triple {19125#(< ~counter~0 95)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {19070#(< ~counter~0 96)} is VALID [2022-04-08 13:15:44,332 INFO L290 TraceCheckUtils]: 5: Hoare triple {19125#(< ~counter~0 95)} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {19125#(< ~counter~0 95)} is VALID [2022-04-08 13:15:44,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {19125#(< ~counter~0 95)} call #t~ret7 := main(); {19125#(< ~counter~0 95)} is VALID [2022-04-08 13:15:44,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19125#(< ~counter~0 95)} {18567#true} #92#return; {19125#(< ~counter~0 95)} is VALID [2022-04-08 13:15:44,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {19125#(< ~counter~0 95)} assume true; {19125#(< ~counter~0 95)} is VALID [2022-04-08 13:15:44,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {18567#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19125#(< ~counter~0 95)} is VALID [2022-04-08 13:15:44,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {18567#true} call ULTIMATE.init(); {18567#true} is VALID [2022-04-08 13:15:44,333 INFO L134 CoverageAnalysis]: Checked inductivity of 366 backedges. 26 proven. 28 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 13:15:44,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:15:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [971545935] [2022-04-08 13:15:44,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:15:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1322994034] [2022-04-08 13:15:44,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1322994034] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:15:44,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:15:44,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 13:15:44,334 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:15:44,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [857164919] [2022-04-08 13:15:44,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [857164919] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:15:44,334 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:15:44,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 13:15:44,334 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1146450329] [2022-04-08 13:15:44,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:15:44,335 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2022-04-08 13:15:44,335 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:15:44,335 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:44,391 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-08 13:15:44,391 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 13:15:44,391 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:44,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 13:15:44,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 13:15:44,392 INFO L87 Difference]: Start difference. First operand 182 states and 216 transitions. Second operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:44,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:44,853 INFO L93 Difference]: Finished difference Result 240 states and 281 transitions. [2022-04-08 13:15:44,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-08 13:15:44,853 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) Word has length 94 [2022-04-08 13:15:44,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:15:44,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:44,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-08 13:15:44,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:44,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 128 transitions. [2022-04-08 13:15:44,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 128 transitions. [2022-04-08 13:15:44,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:44,973 INFO L225 Difference]: With dead ends: 240 [2022-04-08 13:15:44,973 INFO L226 Difference]: Without dead ends: 227 [2022-04-08 13:15:44,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 189 GetRequests, 173 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=186, Unknown=0, NotChecked=0, Total=306 [2022-04-08 13:15:44,974 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 37 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:15:44,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 180 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:15:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 227 states. [2022-04-08 13:15:45,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 227 to 226. [2022-04-08 13:15:45,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:15:45,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 13:15:45,175 INFO L74 IsIncluded]: Start isIncluded. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 13:15:45,175 INFO L87 Difference]: Start difference. First operand 227 states. Second operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 13:15:45,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:45,180 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-08 13:15:45,180 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-08 13:15:45,181 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:45,181 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:45,181 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 227 states. [2022-04-08 13:15:45,181 INFO L87 Difference]: Start difference. First operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) Second operand 227 states. [2022-04-08 13:15:45,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:15:45,186 INFO L93 Difference]: Finished difference Result 227 states and 264 transitions. [2022-04-08 13:15:45,186 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 264 transitions. [2022-04-08 13:15:45,186 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:15:45,187 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:15:45,187 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:15:45,187 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:15:45,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 151 states have (on average 1.1456953642384107) internal successors, (173), 155 states have internal predecessors, (173), 46 states have call successors, (46), 29 states have call predecessors, (46), 28 states have return successors, (44), 41 states have call predecessors, (44), 44 states have call successors, (44) [2022-04-08 13:15:45,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 263 transitions. [2022-04-08 13:15:45,193 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 263 transitions. Word has length 94 [2022-04-08 13:15:45,193 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:15:45,193 INFO L478 AbstractCegarLoop]: Abstraction has 226 states and 263 transitions. [2022-04-08 13:15:45,193 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.444444444444445) internal successors, (40), 8 states have internal predecessors, (40), 8 states have call successors, (16), 8 states have call predecessors, (16), 6 states have return successors, (14), 6 states have call predecessors, (14), 6 states have call successors, (14) [2022-04-08 13:15:45,194 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 226 states and 263 transitions. [2022-04-08 13:15:45,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 263 edges. 263 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:15:45,549 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 263 transitions. [2022-04-08 13:15:45,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2022-04-08 13:15:45,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:15:45,550 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:15:45,566 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 13:15:45,751 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:15:45,752 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:15:45,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:15:45,752 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 7 times [2022-04-08 13:15:45,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:15:45,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [390432286] [2022-04-08 13:15:49,637 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:15:49,637 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:15:49,637 INFO L85 PathProgramCache]: Analyzing trace with hash -612515316, now seen corresponding path program 8 times [2022-04-08 13:15:49,638 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:15:49,638 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035658981] [2022-04-08 13:15:49,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:15:49,638 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:15:49,647 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:15:49,648 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [896723912] [2022-04-08 13:15:49,648 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:15:49,648 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:15:49,648 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:15:49,655 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:15:49,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 13:15:49,715 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:15:49,715 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:15:49,716 INFO L263 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 13:15:49,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:15:49,731 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:15:50,365 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-08 13:15:50,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {20536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20536#true} is VALID [2022-04-08 13:15:50,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,366 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-08 13:15:50,366 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-08 13:15:50,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {20536#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:15:50,367 INFO L290 TraceCheckUtils]: 6: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:15:50,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:15:50,367 INFO L272 TraceCheckUtils]: 8: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,368 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #78#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:15:50,368 INFO L272 TraceCheckUtils]: 13: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,368 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,368 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,368 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #80#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:15:50,368 INFO L272 TraceCheckUtils]: 18: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,368 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,369 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20536#true} {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} #82#return; {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} is VALID [2022-04-08 13:15:50,369 INFO L290 TraceCheckUtils]: 23: Hoare triple {20556#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~B~0 main_~d~0) (= main_~p~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(#t~post5 < 100);havoc #t~post5; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,370 INFO L272 TraceCheckUtils]: 26: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,370 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,370 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,371 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #78#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,371 INFO L272 TraceCheckUtils]: 31: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,371 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,371 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,371 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,372 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #80#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,372 INFO L272 TraceCheckUtils]: 36: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,372 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,372 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,372 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,372 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20536#true} {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} #82#return; {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,373 INFO L290 TraceCheckUtils]: 41: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,373 INFO L290 TraceCheckUtils]: 42: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,374 INFO L290 TraceCheckUtils]: 43: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(#t~post5 < 100);havoc #t~post5; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,374 INFO L272 TraceCheckUtils]: 44: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,374 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,374 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,374 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #78#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,374 INFO L272 TraceCheckUtils]: 49: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,375 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,375 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,375 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,375 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #80#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,375 INFO L272 TraceCheckUtils]: 54: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,375 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,375 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,375 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,376 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #82#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,376 INFO L290 TraceCheckUtils]: 59: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !(~r~0 >= ~d~0); {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,377 INFO L290 TraceCheckUtils]: 60: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,379 INFO L290 TraceCheckUtils]: 61: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(#t~post6 < 100);havoc #t~post6; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,379 INFO L272 TraceCheckUtils]: 62: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,379 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,379 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,379 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,380 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #84#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,380 INFO L272 TraceCheckUtils]: 67: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,381 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20536#true} {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} #86#return; {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} is VALID [2022-04-08 13:15:50,381 INFO L290 TraceCheckUtils]: 72: Hoare triple {20666#(and (= main_~A~0 main_~r~0) (= main_~q~0 0) (= main_~B~0 1) (= main_~d~0 (* main_~B~0 4)) (= main_~p~0 4))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,382 INFO L290 TraceCheckUtils]: 73: Hoare triple {20611#(and (= main_~A~0 main_~r~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= main_~q~0 0) (= main_~B~0 1))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,382 INFO L290 TraceCheckUtils]: 74: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,382 INFO L290 TraceCheckUtils]: 75: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,382 INFO L272 TraceCheckUtils]: 76: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,382 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,383 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,383 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,383 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20536#true} {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #84#return; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,383 INFO L272 TraceCheckUtils]: 81: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:15:50,383 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:15:50,383 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:15:50,383 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:15:50,384 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {20536#true} {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} #86#return; {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,400 INFO L290 TraceCheckUtils]: 86: Hoare triple {20763#(and (= main_~q~0 main_~p~0) (= (* main_~B~0 2) main_~d~0) (= main_~p~0 2) (= (+ main_~d~0 main_~r~0) main_~A~0) (= main_~B~0 1))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (div (+ main_~A~0 (* (- 1) main_~r~0)) 2) main_~d~0) (= main_~B~0 1) (= (* main_~B~0 2) (+ main_~A~0 (* (- 1) main_~r~0))))} is VALID [2022-04-08 13:15:50,401 INFO L290 TraceCheckUtils]: 87: Hoare triple {20803#(and (= main_~p~0 (div main_~q~0 2)) (= main_~q~0 2) (= (div (+ main_~A~0 (* (- 1) main_~r~0)) 2) main_~d~0) (= main_~B~0 1) (= (* main_~B~0 2) (+ main_~A~0 (* (- 1) main_~r~0))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,402 INFO L290 TraceCheckUtils]: 88: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,402 INFO L290 TraceCheckUtils]: 89: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} assume !!(#t~post6 < 100);havoc #t~post6; {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} is VALID [2022-04-08 13:15:50,402 INFO L272 TraceCheckUtils]: 90: Hoare triple {20807#(and (= (div (* main_~B~0 2) 2) (+ (* (- 2) main_~B~0) main_~A~0 (* (- 1) main_~r~0))) (= (+ (- 2) main_~q~0) 1) (= main_~B~0 1))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:15:50,403 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:15:50,403 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-08 13:15:50,403 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-08 13:15:50,404 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 13:15:50,404 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:16:21,245 INFO L290 TraceCheckUtils]: 93: Hoare triple {20537#false} assume !false; {20537#false} is VALID [2022-04-08 13:16:21,245 INFO L290 TraceCheckUtils]: 92: Hoare triple {20821#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {20537#false} is VALID [2022-04-08 13:16:21,251 INFO L290 TraceCheckUtils]: 91: Hoare triple {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {20821#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:16:21,252 INFO L272 TraceCheckUtils]: 90: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20817#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:16:21,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} assume !!(#t~post6 < 100);havoc #t~post6; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:16:21,253 INFO L290 TraceCheckUtils]: 88: Hoare triple {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:16:21,266 INFO L290 TraceCheckUtils]: 87: Hoare triple {20847#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20837#(= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0)} is VALID [2022-04-08 13:16:21,286 INFO L290 TraceCheckUtils]: 86: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20847#(= main_~A~0 (+ (* (- 1) main_~d~0) main_~r~0 (* (+ main_~q~0 main_~p~0) main_~B~0)))} is VALID [2022-04-08 13:16:21,286 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {20536#true} {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #86#return; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:16:21,286 INFO L290 TraceCheckUtils]: 84: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,286 INFO L290 TraceCheckUtils]: 83: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,287 INFO L290 TraceCheckUtils]: 82: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,287 INFO L272 TraceCheckUtils]: 81: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,287 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {20536#true} {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #84#return; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:16:21,287 INFO L290 TraceCheckUtils]: 79: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,287 INFO L290 TraceCheckUtils]: 78: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,287 INFO L290 TraceCheckUtils]: 77: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,287 INFO L272 TraceCheckUtils]: 76: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,288 INFO L290 TraceCheckUtils]: 75: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} assume !!(#t~post6 < 100);havoc #t~post6; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:16:21,289 INFO L290 TraceCheckUtils]: 74: Hoare triple {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:16:21,313 INFO L290 TraceCheckUtils]: 73: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {20851#(and (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (= (+ (- 1) (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (not (< main_~p~0 0)) (= (+ (* (+ main_~q~0 (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0) (= (mod main_~p~0 2) 0)) (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= main_~A~0 (+ (* main_~B~0 (+ main_~q~0 (div main_~p~0 2))) main_~r~0 (* (- 1) (div main_~d~0 2))))))))} is VALID [2022-04-08 13:16:21,565 INFO L290 TraceCheckUtils]: 72: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-08 13:16:21,566 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #86#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,566 INFO L290 TraceCheckUtils]: 70: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,566 INFO L290 TraceCheckUtils]: 69: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,566 INFO L290 TraceCheckUtils]: 68: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,566 INFO L272 TraceCheckUtils]: 67: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,569 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #84#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,569 INFO L290 TraceCheckUtils]: 65: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,569 INFO L290 TraceCheckUtils]: 64: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,569 INFO L290 TraceCheckUtils]: 63: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,569 INFO L272 TraceCheckUtils]: 62: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,573 INFO L290 TraceCheckUtils]: 61: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(#t~post6 < 100);havoc #t~post6; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,577 INFO L290 TraceCheckUtils]: 60: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,580 INFO L290 TraceCheckUtils]: 59: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !(~r~0 >= ~d~0); {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,588 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #82#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,588 INFO L290 TraceCheckUtils]: 56: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,588 INFO L290 TraceCheckUtils]: 55: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,588 INFO L272 TraceCheckUtils]: 54: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,589 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #80#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,590 INFO L290 TraceCheckUtils]: 50: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,590 INFO L272 TraceCheckUtils]: 49: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,591 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {20536#true} {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #78#return; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,591 INFO L290 TraceCheckUtils]: 47: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,591 INFO L290 TraceCheckUtils]: 46: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,591 INFO L290 TraceCheckUtils]: 45: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,592 INFO L272 TraceCheckUtils]: 44: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,596 INFO L290 TraceCheckUtils]: 43: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} assume !!(#t~post5 < 100);havoc #t~post5; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,830 INFO L290 TraceCheckUtils]: 41: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20895#(and (or (and (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (and (or (= (+ (- 1) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2)))) (or (= 0 (mod (+ (div main_~d~0 2) 1) 2)) (and (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 2) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))) (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ (- 2) main_~r~0 (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))))))))) (or (and (or (and (or (= main_~A~0 (+ (- 2) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= (+ (- 2) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2))) main_~A~0))) (= 0 (mod (+ (div main_~d~0 2) 1) 2))) (or (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* (- 1) (div (+ (div main_~d~0 2) 1) 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))))) (not (= 0 (mod (+ (div main_~d~0 2) 1) 2))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0))) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))) (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1)))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= main_~A~0 (+ (* (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2)) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)))) (and (< (div main_~p~0 2) 0) (not (= (mod (div main_~p~0 2) 2) 0)))) (or (= (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 (div (div main_~p~0 2) 2) (div main_~p~0 2) 1))) main_~A~0) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))))))) (or (and (or (not (< (div main_~d~0 2) 0)) (= (mod (div main_~d~0 2) 2) 0) (and (or (= main_~A~0 (+ (- 1) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2)))) (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= main_~A~0 (+ (- 1) (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))))))) (or (and (< (div main_~d~0 2) 0) (not (= (mod (div main_~d~0 2) 2) 0))) (and (or (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= main_~A~0 (+ main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* main_~B~0 (+ main_~q~0 2 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2))) (* (- 1) (div main_~d~0 2))))) (or (not (= (mod (+ (div main_~p~0 2) 1) 2) 0)) (= (+ (* (+ main_~q~0 (div (+ (div main_~p~0 2) 1) 2) (div main_~p~0 2) 1) main_~B~0) main_~r~0 (* (- 1) (div (div main_~d~0 2) 2)) (* (- 1) (div main_~d~0 2))) main_~A~0))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))))} is VALID [2022-04-08 13:16:21,831 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #82#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-08 13:16:21,831 INFO L290 TraceCheckUtils]: 39: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,832 INFO L290 TraceCheckUtils]: 38: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,832 INFO L290 TraceCheckUtils]: 37: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,832 INFO L272 TraceCheckUtils]: 36: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,832 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #80#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-08 13:16:21,832 INFO L290 TraceCheckUtils]: 34: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,832 INFO L290 TraceCheckUtils]: 33: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,832 INFO L290 TraceCheckUtils]: 32: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,832 INFO L272 TraceCheckUtils]: 31: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,833 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {20536#true} {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #78#return; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-08 13:16:21,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,833 INFO L290 TraceCheckUtils]: 28: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,833 INFO L290 TraceCheckUtils]: 27: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,833 INFO L272 TraceCheckUtils]: 26: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,834 INFO L290 TraceCheckUtils]: 25: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} assume !!(#t~post5 < 100);havoc #t~post5; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-08 13:16:21,835 INFO L290 TraceCheckUtils]: 24: Hoare triple {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-08 13:16:21,861 INFO L290 TraceCheckUtils]: 23: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {20891#(and (or (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0) (and (or (= main_~A~0 (+ (- 1) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1)))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (= main_~A~0 (+ (- 1) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (= (+ (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2))) (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2))) main_~A~0)) (or (= (+ (* (- 1) main_~d~0) main_~r~0 (* (- 1) (div main_~d~0 2)) (* main_~B~0 (+ main_~q~0 main_~p~0 (div main_~p~0 2) 1))) main_~A~0) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)))))} is VALID [2022-04-08 13:16:21,862 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #82#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-08 13:16:21,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,862 INFO L272 TraceCheckUtils]: 18: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,862 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #80#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-08 13:16:21,862 INFO L290 TraceCheckUtils]: 16: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,862 INFO L290 TraceCheckUtils]: 15: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,862 INFO L290 TraceCheckUtils]: 14: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,863 INFO L272 TraceCheckUtils]: 13: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,863 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20536#true} {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #78#return; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-08 13:16:21,863 INFO L290 TraceCheckUtils]: 11: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,863 INFO L290 TraceCheckUtils]: 10: Hoare triple {20536#true} assume !(0 == ~cond); {20536#true} is VALID [2022-04-08 13:16:21,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {20536#true} ~cond := #in~cond; {20536#true} is VALID [2022-04-08 13:16:21,863 INFO L272 TraceCheckUtils]: 8: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {20536#true} is VALID [2022-04-08 13:16:21,864 INFO L290 TraceCheckUtils]: 7: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} assume !!(#t~post5 < 100);havoc #t~post5; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-08 13:16:21,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-08 13:16:21,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {20536#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {21043#(= (+ (* (* main_~B~0 main_~p~0) 3) (* main_~B~0 main_~q~0) main_~r~0) (+ main_~A~0 (* main_~d~0 3)))} is VALID [2022-04-08 13:16:21,864 INFO L272 TraceCheckUtils]: 4: Hoare triple {20536#true} call #t~ret7 := main(); {20536#true} is VALID [2022-04-08 13:16:21,865 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20536#true} {20536#true} #92#return; {20536#true} is VALID [2022-04-08 13:16:21,865 INFO L290 TraceCheckUtils]: 2: Hoare triple {20536#true} assume true; {20536#true} is VALID [2022-04-08 13:16:21,865 INFO L290 TraceCheckUtils]: 1: Hoare triple {20536#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20536#true} is VALID [2022-04-08 13:16:21,865 INFO L272 TraceCheckUtils]: 0: Hoare triple {20536#true} call ULTIMATE.init(); {20536#true} is VALID [2022-04-08 13:16:21,866 INFO L134 CoverageAnalysis]: Checked inductivity of 368 backedges. 26 proven. 30 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 13:16:21,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:16:21,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035658981] [2022-04-08 13:16:21,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:16:21,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [896723912] [2022-04-08 13:16:21,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [896723912] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:16:21,867 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:16:21,867 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 16 [2022-04-08 13:16:21,867 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:16:21,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [390432286] [2022-04-08 13:16:21,867 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [390432286] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:16:21,867 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:16:21,868 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 13:16:21,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83972566] [2022-04-08 13:16:21,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:16:21,868 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 94 [2022-04-08 13:16:21,868 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:16:21,868 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 13:16:21,934 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:16:21,935 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 13:16:21,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:21,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 13:16:21,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=179, Unknown=1, NotChecked=0, Total=240 [2022-04-08 13:16:21,935 INFO L87 Difference]: Start difference. First operand 226 states and 263 transitions. Second operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 13:16:23,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:23,418 INFO L93 Difference]: Finished difference Result 275 states and 329 transitions. [2022-04-08 13:16:23,419 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 13:16:23,419 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) Word has length 94 [2022-04-08 13:16:23,419 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:16:23,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 13:16:23,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-08 13:16:23,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 13:16:23,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 129 transitions. [2022-04-08 13:16:23,423 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 129 transitions. [2022-04-08 13:16:23,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:16:23,572 INFO L225 Difference]: With dead ends: 275 [2022-04-08 13:16:23,573 INFO L226 Difference]: Without dead ends: 240 [2022-04-08 13:16:23,573 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=64, Invalid=207, Unknown=1, NotChecked=0, Total=272 [2022-04-08 13:16:23,574 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 13 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 433 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 433 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-08 13:16:23,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 300 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 433 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-08 13:16:23,575 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 240 states. [2022-04-08 13:16:23,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 240 to 238. [2022-04-08 13:16:23,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:16:23,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-08 13:16:23,796 INFO L74 IsIncluded]: Start isIncluded. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-08 13:16:23,796 INFO L87 Difference]: Start difference. First operand 240 states. Second operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-08 13:16:23,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:23,802 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-08 13:16:23,802 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-08 13:16:23,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:23,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:23,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 240 states. [2022-04-08 13:16:23,803 INFO L87 Difference]: Start difference. First operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) Second operand 240 states. [2022-04-08 13:16:23,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:16:23,808 INFO L93 Difference]: Finished difference Result 240 states and 280 transitions. [2022-04-08 13:16:23,808 INFO L276 IsEmpty]: Start isEmpty. Operand 240 states and 280 transitions. [2022-04-08 13:16:23,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:16:23,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:16:23,809 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:16:23,809 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:16:23,809 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 238 states, 159 states have (on average 1.150943396226415) internal successors, (183), 163 states have internal predecessors, (183), 48 states have call successors, (48), 31 states have call predecessors, (48), 30 states have return successors, (46), 43 states have call predecessors, (46), 46 states have call successors, (46) [2022-04-08 13:16:23,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 238 states to 238 states and 277 transitions. [2022-04-08 13:16:23,814 INFO L78 Accepts]: Start accepts. Automaton has 238 states and 277 transitions. Word has length 94 [2022-04-08 13:16:23,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:16:23,815 INFO L478 AbstractCegarLoop]: Abstraction has 238 states and 277 transitions. [2022-04-08 13:16:23,815 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.8) internal successors, (28), 9 states have internal predecessors, (28), 6 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 5 states have call predecessors, (14), 5 states have call successors, (14) [2022-04-08 13:16:23,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 238 states and 277 transitions. [2022-04-08 13:16:24,197 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:16:24,197 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 277 transitions. [2022-04-08 13:16:24,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 13:16:24,198 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:16:24,198 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:16:24,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 13:16:24,399 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:16:24,399 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:16:24,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:16:24,399 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 9 times [2022-04-08 13:16:24,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:16:24,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1887436136] [2022-04-08 13:16:27,166 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:16:27,166 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:16:27,166 INFO L85 PathProgramCache]: Analyzing trace with hash 18113303, now seen corresponding path program 10 times [2022-04-08 13:16:27,166 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:16:27,166 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586752850] [2022-04-08 13:16:27,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:16:27,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:16:27,177 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:16:27,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [694845731] [2022-04-08 13:16:27,178 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 13:16:27,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:16:27,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:16:27,184 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:16:27,187 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 13:16:27,253 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 13:16:27,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:16:27,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 40 conjunts are in the unsatisfiable core [2022-04-08 13:16:27,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:16:27,280 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:20:10,979 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {22623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {22623#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 100);havoc #t~post5; {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L272 TraceCheckUtils]: 8: Hoare triple {22623#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L272 TraceCheckUtils]: 13: Hoare triple {22623#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:10,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:10,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:10,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:10,981 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-08 13:20:10,981 INFO L272 TraceCheckUtils]: 18: Hoare triple {22623#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:10,981 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:20:10,981 INFO L290 TraceCheckUtils]: 20: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:20:10,982 INFO L290 TraceCheckUtils]: 21: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:20:10,982 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22623#true} #82#return; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:20:11,229 INFO L290 TraceCheckUtils]: 23: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:11,230 INFO L290 TraceCheckUtils]: 24: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:11,230 INFO L290 TraceCheckUtils]: 25: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:11,231 INFO L272 TraceCheckUtils]: 26: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:11,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:11,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:11,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:11,231 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #78#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:11,231 INFO L272 TraceCheckUtils]: 31: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:11,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:11,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:11,231 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:11,232 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #80#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:11,232 INFO L272 TraceCheckUtils]: 36: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:11,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:11,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:11,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:11,233 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} #82#return; {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,235 WARN L290 TraceCheckUtils]: 41: Hoare triple {22700#(and (<= (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) main_~r~0) (= main_~d~0 (* (* main_~B~0 (div (- main_~p~0) (- 2))) 2)) (= (mod main_~p~0 2) 0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is UNKNOWN [2022-04-08 13:20:13,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(#t~post5 < 100);havoc #t~post5; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,236 INFO L272 TraceCheckUtils]: 44: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:13,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:13,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:13,237 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:13,237 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #78#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,237 INFO L272 TraceCheckUtils]: 49: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:13,237 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:13,237 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:13,237 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:13,238 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #80#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,238 INFO L272 TraceCheckUtils]: 54: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:13,238 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:13,238 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:13,238 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:13,239 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #82#return; {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,239 INFO L290 TraceCheckUtils]: 59: Hoare triple {22755#(and (<= (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) main_~r~0) (= (* (* (div (- (div (- main_~p~0) (- 2))) (- 2)) main_~B~0) 4) main_~d~0) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !(~r~0 >= ~d~0); {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,240 INFO L290 TraceCheckUtils]: 60: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,240 INFO L290 TraceCheckUtils]: 61: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(#t~post6 < 100);havoc #t~post6; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,240 INFO L272 TraceCheckUtils]: 62: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:13,240 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:13,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:13,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:13,241 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #84#return; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,241 INFO L272 TraceCheckUtils]: 67: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:13,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:20:13,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:20:13,242 INFO L290 TraceCheckUtils]: 70: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:20:13,242 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} #86#return; {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} is VALID [2022-04-08 13:20:13,655 INFO L290 TraceCheckUtils]: 72: Hoare triple {22810#(and (< main_~r~0 main_~d~0) (= main_~d~0 (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 4)) (= (mod (div (- main_~p~0) (- 2)) 2) 0) (<= (* (* (div (* (- 1) (div (* (- 1) main_~p~0) (- 2))) (- 2)) main_~B~0) 2) main_~r~0) (= (mod main_~p~0 2) 0))} assume !!(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); {22850#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (< main_~r~0 (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-08 13:20:13,657 INFO L290 TraceCheckUtils]: 73: Hoare triple {22850#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (<= (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) main_~r~0) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (< main_~r~0 (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-08 13:20:13,658 INFO L290 TraceCheckUtils]: 74: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-08 13:20:13,659 INFO L290 TraceCheckUtils]: 75: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} assume !!(#t~post6 < 100);havoc #t~post6; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-08 13:20:13,660 INFO L272 TraceCheckUtils]: 76: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:13,660 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:13,660 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:13,660 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:13,660 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} #84#return; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-08 13:20:13,660 INFO L272 TraceCheckUtils]: 81: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:13,661 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:20:13,661 INFO L290 TraceCheckUtils]: 83: Hoare triple {22685#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:20:13,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:20:13,662 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} #86#return; {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} is VALID [2022-04-08 13:20:14,497 INFO L290 TraceCheckUtils]: 86: Hoare triple {22854#(and (= (mod (div (* (- 2) main_~p~0) (- 2)) 2) 0) (exists ((aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= main_~p~0 (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* (div (* (- 1) main_~p~0) (- 2)) main_~B~0) 4)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ main_~p~0 2)))) (= main_~d~0 (* 2 (* main_~B~0 (div (* (- 1) (div (* (- 2) main_~p~0) (- 2))) (- 2))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-08 13:20:14,500 INFO L290 TraceCheckUtils]: 87: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-08 13:20:14,502 INFO L290 TraceCheckUtils]: 88: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-08 13:20:14,504 INFO L290 TraceCheckUtils]: 89: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} assume !!(#t~post6 < 100);havoc #t~post6; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-08 13:20:14,504 INFO L272 TraceCheckUtils]: 90: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:20:14,504 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:20:14,504 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:20:14,504 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:20:14,504 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} #84#return; {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} is VALID [2022-04-08 13:20:14,505 INFO L272 TraceCheckUtils]: 95: Hoare triple {22894#(and (exists ((aux_div_v_main_~p~0_144_37 Int) (aux_div_aux_div_v_main_~p~0_143_37_48 Int)) (and (<= (* main_~p~0 2) (* 2 aux_div_aux_div_v_main_~p~0_143_37_48)) (< (* 2 (* main_~B~0 aux_div_aux_div_v_main_~p~0_143_37_48)) (* (* aux_div_v_main_~p~0_144_37 main_~B~0) 4)) (<= (* main_~p~0 2) (* aux_div_v_main_~p~0_144_37 2)) (< (* 2 aux_div_aux_div_v_main_~p~0_143_37_48) (+ (* main_~p~0 2) 2)) (< (* aux_div_v_main_~p~0_144_37 2) (+ (* main_~p~0 2) 2)))) (= (* (div (* (- 2) main_~p~0) (- 2)) main_~B~0) main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:20:14,505 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:20:14,506 INFO L290 TraceCheckUtils]: 97: Hoare triple {22926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-08 13:20:14,506 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-08 13:20:14,506 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 99 proven. 53 refuted. 7 times theorem prover too weak. 265 trivial. 0 not checked. [2022-04-08 13:20:14,506 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:22:17,578 WARN L232 SmtUtils]: Spent 7.77s on a formula simplification that was a NOOP. DAG size: 89 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-04-08 13:24:13,086 INFO L290 TraceCheckUtils]: 98: Hoare triple {22624#false} assume !false; {22624#false} is VALID [2022-04-08 13:24:13,087 INFO L290 TraceCheckUtils]: 97: Hoare triple {22926#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {22624#false} is VALID [2022-04-08 13:24:13,087 INFO L290 TraceCheckUtils]: 96: Hoare triple {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {22926#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:24:13,088 INFO L272 TraceCheckUtils]: 95: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22922#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:24:13,088 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {22623#true} {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} #84#return; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:24:13,089 INFO L290 TraceCheckUtils]: 93: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,089 INFO L290 TraceCheckUtils]: 92: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,089 INFO L290 TraceCheckUtils]: 91: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,089 INFO L272 TraceCheckUtils]: 90: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,089 INFO L290 TraceCheckUtils]: 89: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume !!(#t~post6 < 100);havoc #t~post6; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:24:13,089 INFO L290 TraceCheckUtils]: 88: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:24:13,090 INFO L290 TraceCheckUtils]: 87: Hoare triple {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:24:13,122 INFO L290 TraceCheckUtils]: 86: Hoare triple {22969#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22696#(= (* main_~B~0 main_~p~0) main_~d~0)} is VALID [2022-04-08 13:24:13,135 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {22969#(and (or (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0)) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)))) (or (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0) (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0)) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1)))))))} is VALID [2022-04-08 13:24:13,136 INFO L290 TraceCheckUtils]: 84: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:24:13,136 INFO L290 TraceCheckUtils]: 83: Hoare triple {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:24:13,136 INFO L290 TraceCheckUtils]: 82: Hoare triple {22623#true} ~cond := #in~cond; {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:24:13,137 INFO L272 TraceCheckUtils]: 81: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,137 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {22623#true} {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:24:13,137 INFO L290 TraceCheckUtils]: 79: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,137 INFO L290 TraceCheckUtils]: 78: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,137 INFO L290 TraceCheckUtils]: 77: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,137 INFO L272 TraceCheckUtils]: 76: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,139 INFO L290 TraceCheckUtils]: 75: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:24:13,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:24:13,142 INFO L290 TraceCheckUtils]: 73: Hoare triple {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:24:13,355 INFO L290 TraceCheckUtils]: 72: Hoare triple {23014#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} assume !!(1 != ~p~0);~d~0 := (if ~d~0 < 0 && 0 != ~d~0 % 2 then 1 + ~d~0 / 2 else ~d~0 / 2);~p~0 := (if ~p~0 < 0 && 0 != ~p~0 % 2 then 1 + ~p~0 / 2 else ~p~0 / 2); {22973#(or (and (or (and (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1))) (not (< main_~d~0 0))) (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (not (< main_~p~0 0)) (= (mod main_~p~0 2) 0)) (or (< main_~p~0 0) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (or (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:24:13,390 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #86#return; {23014#(and (or (not (< main_~p~0 0)) (and (or (= (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0) (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2)) (and (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0) (not (= (mod (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 0)))) (or (= (+ (div (* main_~B~0 (+ (div main_~p~0 2) 1)) 2) 1) (* (+ (div (+ (div main_~p~0 2) 1) 2) 1) main_~B~0)) (not (< (+ main_~B~0 (* main_~B~0 (div main_~p~0 2))) 0)))) (and (or (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0)) (not (= (div main_~d~0 2) (* main_~B~0 (+ (div main_~p~0 2) 1))))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (+ (div main_~p~0 2) 1)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (= (mod (+ (div main_~p~0 2) 1) 2) 0) (= (mod main_~p~0 2) 0)) (or (and (or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (not (= (mod main_~d~0 2) 0)) (< main_~d~0 0))) (or (not (= (+ (div main_~d~0 2) 1) (* main_~B~0 (div main_~p~0 2)))) (not (< main_~d~0 0)) (= (mod main_~d~0 2) 0))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (and (not (= (mod main_~p~0 2) 0)) (< main_~p~0 0))))} is VALID [2022-04-08 13:24:13,390 INFO L290 TraceCheckUtils]: 70: Hoare triple {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:24:13,391 INFO L290 TraceCheckUtils]: 69: Hoare triple {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {22689#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:24:13,391 INFO L290 TraceCheckUtils]: 68: Hoare triple {22623#true} ~cond := #in~cond; {22983#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:24:13,391 INFO L272 TraceCheckUtils]: 67: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,391 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {22623#true} {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #84#return; {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:24:13,392 INFO L290 TraceCheckUtils]: 65: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,392 INFO L290 TraceCheckUtils]: 64: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,392 INFO L290 TraceCheckUtils]: 63: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,392 INFO L272 TraceCheckUtils]: 62: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,393 INFO L290 TraceCheckUtils]: 61: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} assume !!(#t~post6 < 100);havoc #t~post6; {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:24:13,394 INFO L290 TraceCheckUtils]: 60: Hoare triple {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:24:13,396 INFO L290 TraceCheckUtils]: 59: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !(~r~0 >= ~d~0); {23018#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)))} is VALID [2022-04-08 13:24:13,396 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {22623#true} {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #82#return; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-08 13:24:13,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,396 INFO L290 TraceCheckUtils]: 56: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,396 INFO L290 TraceCheckUtils]: 55: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,396 INFO L272 TraceCheckUtils]: 54: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,397 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {22623#true} {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #80#return; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-08 13:24:13,397 INFO L290 TraceCheckUtils]: 52: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,397 INFO L290 TraceCheckUtils]: 51: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,397 INFO L290 TraceCheckUtils]: 50: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,397 INFO L272 TraceCheckUtils]: 49: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,398 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {22623#true} {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #78#return; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-08 13:24:13,398 INFO L290 TraceCheckUtils]: 47: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,398 INFO L290 TraceCheckUtils]: 46: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,398 INFO L290 TraceCheckUtils]: 45: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,398 INFO L272 TraceCheckUtils]: 44: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,399 INFO L290 TraceCheckUtils]: 43: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} assume !!(#t~post5 < 100);havoc #t~post5; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-08 13:24:13,401 INFO L290 TraceCheckUtils]: 42: Hoare triple {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-08 13:24:13,440 INFO L290 TraceCheckUtils]: 41: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23055#(or (not (= (div main_~d~0 2) (* main_~B~0 (div main_~p~0 2)))) (and (or (and (or (not (< (* main_~B~0 (div main_~p~0 2)) 0)) (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1)))) (or (= (div (* main_~B~0 (div main_~p~0 2)) 2) (* main_~B~0 (+ (div (div main_~p~0 2) 2) 1))) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))) (= (mod (div main_~p~0 2) 2) 0) (not (< (div main_~p~0 2) 0))) (or (< (div main_~p~0 2) 0) (and (or (= (+ (div (* main_~B~0 (div main_~p~0 2)) 2) 1) (* main_~B~0 (div (div main_~p~0 2) 2))) (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0) (not (< (* main_~B~0 (div main_~p~0 2)) 0))) (or (= (* main_~B~0 (div (div main_~p~0 2) 2)) (div (* main_~B~0 (div main_~p~0 2)) 2)) (and (< (* main_~B~0 (div main_~p~0 2)) 0) (not (= (mod (* main_~B~0 (div main_~p~0 2)) 2) 0))))))) (not (= (* main_~B~0 main_~p~0) main_~d~0)) (<= main_~d~0 main_~r~0))} is VALID [2022-04-08 13:24:13,441 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {22623#true} {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #82#return; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-08 13:24:13,441 INFO L290 TraceCheckUtils]: 39: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,442 INFO L290 TraceCheckUtils]: 38: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,442 INFO L290 TraceCheckUtils]: 37: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,442 INFO L272 TraceCheckUtils]: 36: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,442 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {22623#true} {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #80#return; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-08 13:24:13,443 INFO L290 TraceCheckUtils]: 34: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,443 INFO L290 TraceCheckUtils]: 33: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,443 INFO L290 TraceCheckUtils]: 32: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,443 INFO L272 TraceCheckUtils]: 31: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,444 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {22623#true} {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #78#return; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-08 13:24:13,444 INFO L290 TraceCheckUtils]: 29: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,444 INFO L290 TraceCheckUtils]: 28: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,444 INFO L290 TraceCheckUtils]: 27: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,444 INFO L272 TraceCheckUtils]: 26: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,446 INFO L290 TraceCheckUtils]: 25: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} assume !!(#t~post5 < 100);havoc #t~post5; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-08 13:24:13,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-08 13:24:13,450 INFO L290 TraceCheckUtils]: 23: Hoare triple {22623#true} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {23110#(or (not (= (* (* main_~B~0 main_~p~0) 2) (* main_~d~0 2))) (and (or (< main_~p~0 0) (= (* (div (div (* main_~p~0 2) 2) 2) main_~B~0) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2))) (or (not (< main_~p~0 0)) (= (* main_~B~0 (+ (div (div (* main_~p~0 2) 2) 2) 1)) (div (* (div (* main_~p~0 2) 2) main_~B~0) 2)) (= (mod (div (* main_~p~0 2) 2) 2) 0))) (<= (* (* main_~B~0 main_~p~0) 2) main_~r~0) (< main_~r~0 main_~d~0))} is VALID [2022-04-08 13:24:13,450 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {22623#true} {22623#true} #82#return; {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L290 TraceCheckUtils]: 21: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L272 TraceCheckUtils]: 18: Hoare triple {22623#true} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {22623#true} {22623#true} #80#return; {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L290 TraceCheckUtils]: 16: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L290 TraceCheckUtils]: 15: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L272 TraceCheckUtils]: 13: Hoare triple {22623#true} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,450 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {22623#true} {22623#true} #78#return; {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L290 TraceCheckUtils]: 11: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L290 TraceCheckUtils]: 10: Hoare triple {22623#true} assume !(0 == ~cond); {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L290 TraceCheckUtils]: 9: Hoare triple {22623#true} ~cond := #in~cond; {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L272 TraceCheckUtils]: 8: Hoare triple {22623#true} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L290 TraceCheckUtils]: 7: Hoare triple {22623#true} assume !!(#t~post5 < 100);havoc #t~post5; {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {22623#true} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {22623#true} havoc ~A~0;havoc ~B~0;havoc ~r~0;havoc ~d~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;~B~0 := 1;~r~0 := ~A~0;~d~0 := ~B~0;~p~0 := 1;~q~0 := 0; {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L272 TraceCheckUtils]: 4: Hoare triple {22623#true} call #t~ret7 := main(); {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22623#true} {22623#true} #92#return; {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {22623#true} assume true; {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L290 TraceCheckUtils]: 1: Hoare triple {22623#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22623#true} is VALID [2022-04-08 13:24:13,451 INFO L272 TraceCheckUtils]: 0: Hoare triple {22623#true} call ULTIMATE.init(); {22623#true} is VALID [2022-04-08 13:24:13,452 INFO L134 CoverageAnalysis]: Checked inductivity of 424 backedges. 101 proven. 31 refuted. 0 times theorem prover too weak. 292 trivial. 0 not checked. [2022-04-08 13:24:13,452 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:24:13,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586752850] [2022-04-08 13:24:13,452 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:24:13,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [694845731] [2022-04-08 13:24:13,452 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [694845731] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:24:13,452 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:24:13,452 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 20 [2022-04-08 13:24:13,452 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:24:13,453 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1887436136] [2022-04-08 13:24:13,453 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1887436136] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:24:13,453 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:24:13,453 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 13:24:13,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [221842509] [2022-04-08 13:24:13,453 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:24:13,453 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-08 13:24:13,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:24:13,453 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:24:19,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 61 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 13:24:19,669 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 13:24:19,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:24:19,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 13:24:19,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=296, Unknown=5, NotChecked=0, Total=380 [2022-04-08 13:24:19,669 INFO L87 Difference]: Start difference. First operand 238 states and 277 transitions. Second operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:24:21,282 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:24:27,726 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-08 13:24:31,112 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-08 13:24:33,847 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:24:46,889 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.18s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:24:48,309 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:24:51,826 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-08 13:25:06,203 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-08 13:25:08,208 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-08 13:25:10,689 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:25:12,692 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-08 13:25:14,916 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-08 13:25:17,758 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-08 13:25:33,656 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:25:37,370 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-08 13:25:42,483 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-08 13:25:44,535 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-08 13:25:47,264 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 13:25:50,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:25:50,857 INFO L93 Difference]: Finished difference Result 271 states and 325 transitions. [2022-04-08 13:25:50,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 13:25:50,857 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) Word has length 99 [2022-04-08 13:25:50,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:25:50,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:25:50,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 108 transitions. [2022-04-08 13:25:50,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:25:50,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 108 transitions. [2022-04-08 13:25:50,861 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 108 transitions. [2022-04-08 13:26:02,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 106 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:02,467 INFO L225 Difference]: With dead ends: 271 [2022-04-08 13:26:02,467 INFO L226 Difference]: Without dead ends: 269 [2022-04-08 13:26:02,467 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 203 GetRequests, 178 SyntacticMatches, 3 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 65.8s TimeCoverageRelationStatistics Valid=113, Invalid=432, Unknown=7, NotChecked=0, Total=552 [2022-04-08 13:26:02,468 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 35 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 285 mSolverCounterSat, 15 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 41.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 464 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 285 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 153 IncrementalHoareTripleChecker+Unchecked, 41.5s IncrementalHoareTripleChecker+Time [2022-04-08 13:26:02,468 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 281 Invalid, 464 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 285 Invalid, 11 Unknown, 153 Unchecked, 41.5s Time] [2022-04-08 13:26:02,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 269 states. [2022-04-08 13:26:02,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 269 to 258. [2022-04-08 13:26:02,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:26:02,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 269 states. Second operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:26:02,832 INFO L74 IsIncluded]: Start isIncluded. First operand 269 states. Second operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:26:02,833 INFO L87 Difference]: Start difference. First operand 269 states. Second operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:26:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:02,838 INFO L93 Difference]: Finished difference Result 269 states and 323 transitions. [2022-04-08 13:26:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 323 transitions. [2022-04-08 13:26:02,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:02,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:02,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 269 states. [2022-04-08 13:26:02,840 INFO L87 Difference]: Start difference. First operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) Second operand 269 states. [2022-04-08 13:26:02,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:26:02,846 INFO L93 Difference]: Finished difference Result 269 states and 323 transitions. [2022-04-08 13:26:02,846 INFO L276 IsEmpty]: Start isEmpty. Operand 269 states and 323 transitions. [2022-04-08 13:26:02,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:26:02,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:26:02,847 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:26:02,847 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:26:02,847 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 171 states have (on average 1.1578947368421053) internal successors, (198), 177 states have internal predecessors, (198), 54 states have call successors, (54), 33 states have call predecessors, (54), 32 states have return successors, (52), 47 states have call predecessors, (52), 52 states have call successors, (52) [2022-04-08 13:26:02,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 304 transitions. [2022-04-08 13:26:02,853 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 304 transitions. Word has length 99 [2022-04-08 13:26:02,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:26:02,854 INFO L478 AbstractCegarLoop]: Abstraction has 258 states and 304 transitions. [2022-04-08 13:26:02,854 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.3846153846153846) internal successors, (31), 11 states have internal predecessors, (31), 6 states have call successors, (17), 2 states have call predecessors, (17), 2 states have return successors, (15), 7 states have call predecessors, (15), 6 states have call successors, (15) [2022-04-08 13:26:02,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 258 states and 304 transitions. [2022-04-08 13:26:03,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 304 edges. 304 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:26:03,421 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 304 transitions. [2022-04-08 13:26:03,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-08 13:26:03,424 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:26:03,424 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:26:03,451 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 13:26:03,638 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:03,639 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:26:03,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:26:03,639 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 5 times [2022-04-08 13:26:03,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:26:03,639 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [470960521] [2022-04-08 13:26:07,732 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:26:07,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:26:07,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1358295611, now seen corresponding path program 6 times [2022-04-08 13:26:07,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:26:07,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071930770] [2022-04-08 13:26:07,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:26:07,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:26:07,753 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:26:07,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [85941100] [2022-04-08 13:26:07,753 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 13:26:07,754 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:26:07,754 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:26:07,755 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 13:26:07,757 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 13:26:07,817 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 13:26:07,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:26:07,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 13:26:07,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:26:07,834 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:26:08,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {24842#true} call ULTIMATE.init(); {24842#true} is VALID [2022-04-08 13:26:08,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {24842#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(8, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24842#true} is VALID [2022-04-08 13:26:08,312 INFO L290 TraceCheckUtils]: 2: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,312 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24842#true} {24842#true} #92#return; {24842#true} is VALID [2022-04-08 13:26:08,312 INFO L272 TraceCheckUtils]: 4: Hoare triple {24842#true} call #t~ret7 := main(); {24842#true} is VALID [2022-04-08 13:26:08,312 INFO L290 TraceCheckUtils]: 5: Hoare triple {24842#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; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,312 INFO L290 TraceCheckUtils]: 6: Hoare triple {24862#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,313 INFO L290 TraceCheckUtils]: 7: Hoare triple {24862#(= main_~B~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,313 INFO L272 TraceCheckUtils]: 8: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,313 INFO L290 TraceCheckUtils]: 10: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,313 INFO L290 TraceCheckUtils]: 11: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,313 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #78#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,313 INFO L272 TraceCheckUtils]: 13: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,314 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #80#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,314 INFO L272 TraceCheckUtils]: 18: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,314 INFO L290 TraceCheckUtils]: 19: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,314 INFO L290 TraceCheckUtils]: 21: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,315 INFO L284 TraceCheckUtils]: 22: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #82#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,315 INFO L290 TraceCheckUtils]: 23: Hoare triple {24862#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,315 INFO L290 TraceCheckUtils]: 24: Hoare triple {24862#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,315 INFO L290 TraceCheckUtils]: 25: Hoare triple {24862#(= main_~B~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,315 INFO L272 TraceCheckUtils]: 26: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,315 INFO L290 TraceCheckUtils]: 27: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,316 INFO L290 TraceCheckUtils]: 28: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,316 INFO L290 TraceCheckUtils]: 29: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,316 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #78#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,316 INFO L272 TraceCheckUtils]: 31: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,316 INFO L290 TraceCheckUtils]: 32: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,316 INFO L290 TraceCheckUtils]: 33: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,317 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #80#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,317 INFO L272 TraceCheckUtils]: 36: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,317 INFO L290 TraceCheckUtils]: 37: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,317 INFO L290 TraceCheckUtils]: 38: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,317 INFO L290 TraceCheckUtils]: 39: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,317 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #82#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,317 INFO L290 TraceCheckUtils]: 41: Hoare triple {24862#(= main_~B~0 1)} assume !!(~r~0 >= ~d~0);~d~0 := 2 * ~d~0;~p~0 := 2 * ~p~0; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,318 INFO L290 TraceCheckUtils]: 42: Hoare triple {24862#(= main_~B~0 1)} #t~post5 := ~counter~0;~counter~0 := 1 + #t~post5; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,318 INFO L290 TraceCheckUtils]: 43: Hoare triple {24862#(= main_~B~0 1)} assume !!(#t~post5 < 100);havoc #t~post5; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,318 INFO L272 TraceCheckUtils]: 44: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if 0 == ~q~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,318 INFO L290 TraceCheckUtils]: 45: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,318 INFO L290 TraceCheckUtils]: 46: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,318 INFO L290 TraceCheckUtils]: 47: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,319 INFO L284 TraceCheckUtils]: 48: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #78#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,319 INFO L272 TraceCheckUtils]: 49: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~r~0 == ~A~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,319 INFO L290 TraceCheckUtils]: 50: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,319 INFO L290 TraceCheckUtils]: 51: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,319 INFO L290 TraceCheckUtils]: 52: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,319 INFO L284 TraceCheckUtils]: 53: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #80#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,319 INFO L272 TraceCheckUtils]: 54: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,319 INFO L290 TraceCheckUtils]: 55: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,319 INFO L290 TraceCheckUtils]: 56: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,319 INFO L290 TraceCheckUtils]: 57: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,320 INFO L284 TraceCheckUtils]: 58: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #82#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,320 INFO L290 TraceCheckUtils]: 59: Hoare triple {24862#(= main_~B~0 1)} assume !(~r~0 >= ~d~0); {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,320 INFO L290 TraceCheckUtils]: 60: Hoare triple {24862#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,321 INFO L290 TraceCheckUtils]: 61: Hoare triple {24862#(= main_~B~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,321 INFO L272 TraceCheckUtils]: 62: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,321 INFO L290 TraceCheckUtils]: 63: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,321 INFO L290 TraceCheckUtils]: 64: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,321 INFO L290 TraceCheckUtils]: 65: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,321 INFO L284 TraceCheckUtils]: 66: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #84#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,321 INFO L272 TraceCheckUtils]: 67: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,321 INFO L290 TraceCheckUtils]: 68: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,321 INFO L290 TraceCheckUtils]: 69: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,321 INFO L290 TraceCheckUtils]: 70: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,322 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #86#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,322 INFO L290 TraceCheckUtils]: 72: Hoare triple {24862#(= 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); {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,322 INFO L290 TraceCheckUtils]: 73: Hoare triple {24862#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,323 INFO L290 TraceCheckUtils]: 74: Hoare triple {24862#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,323 INFO L290 TraceCheckUtils]: 75: Hoare triple {24862#(= main_~B~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,323 INFO L272 TraceCheckUtils]: 76: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,323 INFO L290 TraceCheckUtils]: 77: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,323 INFO L290 TraceCheckUtils]: 78: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,323 INFO L290 TraceCheckUtils]: 79: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,324 INFO L284 TraceCheckUtils]: 80: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #84#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,324 INFO L272 TraceCheckUtils]: 81: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~d~0 == ~B~0 * ~p~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,324 INFO L290 TraceCheckUtils]: 82: Hoare triple {24842#true} ~cond := #in~cond; {24842#true} is VALID [2022-04-08 13:26:08,324 INFO L290 TraceCheckUtils]: 83: Hoare triple {24842#true} assume !(0 == ~cond); {24842#true} is VALID [2022-04-08 13:26:08,324 INFO L290 TraceCheckUtils]: 84: Hoare triple {24842#true} assume true; {24842#true} is VALID [2022-04-08 13:26:08,324 INFO L284 TraceCheckUtils]: 85: Hoare quadruple {24842#true} {24862#(= main_~B~0 1)} #86#return; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,324 INFO L290 TraceCheckUtils]: 86: Hoare triple {24862#(= 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); {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,325 INFO L290 TraceCheckUtils]: 87: Hoare triple {24862#(= main_~B~0 1)} assume ~r~0 >= ~d~0;~r~0 := ~r~0 - ~d~0;~q~0 := ~q~0 + ~p~0; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,325 INFO L290 TraceCheckUtils]: 88: Hoare triple {24862#(= main_~B~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,325 INFO L290 TraceCheckUtils]: 89: Hoare triple {24862#(= main_~B~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24862#(= main_~B~0 1)} is VALID [2022-04-08 13:26:08,325 INFO L272 TraceCheckUtils]: 90: Hoare triple {24862#(= main_~B~0 1)} call __VERIFIER_assert((if ~A~0 == ~q~0 * ~B~0 + ~r~0 then 1 else 0)); {24842#true} is VALID [2022-04-08 13:26:08,325 INFO L290 TraceCheckUtils]: 91: Hoare triple {24842#true} ~cond := #in~cond; {25121#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:26:08,326 INFO L290 TraceCheckUtils]: 92: Hoare triple {25121#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25125#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:26:08,326 INFO L290 TraceCheckUtils]: 93: Hoare triple {25125#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25125#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:26:08,327 INFO L284 TraceCheckUtils]: 94: Hoare quadruple {25125#(not (= |__VERIFIER_assert_#in~cond| 0))} {24862#(= main_~B~0 1)} #84#return; {25132#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} is VALID [2022-04-08 13:26:08,327 INFO L272 TraceCheckUtils]: 95: Hoare triple {25132#(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)); {24842#true} is VALID [2022-04-08 13:26:08,327 INFO L290 TraceCheckUtils]: 96: Hoare triple {24842#true} ~cond := #in~cond; {25121#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:26:08,327 INFO L290 TraceCheckUtils]: 97: Hoare triple {25121#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {25125#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:26:08,327 INFO L290 TraceCheckUtils]: 98: Hoare triple {25125#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {25125#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:26:08,329 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25125#(not (= |__VERIFIER_assert_#in~cond| 0))} {25132#(and (= main_~B~0 1) (= (+ (* main_~B~0 main_~q~0) main_~r~0) main_~A~0))} #86#return; {25148#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} is VALID [2022-04-08 13:26:08,329 INFO L290 TraceCheckUtils]: 100: Hoare triple {25148#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 main_~p~0))} assume !(1 != ~p~0); {25152#(and (= main_~A~0 (+ main_~q~0 main_~r~0)) (= main_~d~0 1))} is VALID [2022-04-08 13:26:08,330 INFO L272 TraceCheckUtils]: 101: Hoare triple {25152#(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)); {25156#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:26:08,330 INFO L290 TraceCheckUtils]: 102: Hoare triple {25156#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {25160#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:26:08,330 INFO L290 TraceCheckUtils]: 103: Hoare triple {25160#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {24843#false} is VALID [2022-04-08 13:26:08,330 INFO L290 TraceCheckUtils]: 104: Hoare triple {24843#false} assume !false; {24843#false} is VALID [2022-04-08 13:26:08,331 INFO L134 CoverageAnalysis]: Checked inductivity of 484 backedges. 108 proven. 4 refuted. 0 times theorem prover too weak. 372 trivial. 0 not checked. [2022-04-08 13:26:08,331 INFO L328 TraceCheckSpWp]: Computing backward predicates...