/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/prod4br-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 13:56:32,877 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 13:56:32,878 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 13:56:32,922 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 13:56:32,922 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 13:56:32,923 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 13:56:32,925 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 13:56:32,927 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 13:56:32,928 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 13:56:32,931 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 13:56:32,932 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 13:56:32,933 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 13:56:32,933 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 13:56:32,936 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 13:56:32,937 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 13:56:32,939 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 13:56:32,939 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 13:56:32,940 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 13:56:32,941 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 13:56:32,944 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 13:56:32,945 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 13:56:32,946 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 13:56:32,946 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 13:56:32,947 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 13:56:32,948 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 13:56:32,953 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 13:56:32,953 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 13:56:32,953 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 13:56:32,954 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 13:56:32,954 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 13:56:32,955 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 13:56:32,955 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 13:56:32,956 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 13:56:32,956 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 13:56:32,957 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 13:56:32,957 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 13:56:32,957 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 13:56:32,958 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 13:56:32,958 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 13:56:32,958 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 13:56:32,958 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 13:56:32,959 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 13:56:32,960 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:56:32,967 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 13:56:32,967 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 13:56:32,968 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 13:56:32,968 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 13:56:32,968 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 13:56:32,968 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 13:56:32,969 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 13:56:32,969 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 13:56:32,969 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 13:56:32,969 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 13:56:32,969 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 13:56:32,970 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 13:56:32,970 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 13:56:32,970 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 13:56:32,970 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 13:56:32,970 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:56:32,970 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 13:56:32,970 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 13:56:32,970 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 13:56:32,970 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 13:56:32,970 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 13:56:32,970 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 13:56:32,971 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:56:33,140 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 13:56:33,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 13:56:33,159 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 13:56:33,159 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 13:56:33,162 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 13:56:33,163 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2022-04-08 13:56:33,199 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86475829e/b579569403144b0fa0392209a70a5896/FLAGa327506c6 [2022-04-08 13:56:33,530 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 13:56:33,531 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/prod4br-ll_unwindbound20.c [2022-04-08 13:56:33,534 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86475829e/b579569403144b0fa0392209a70a5896/FLAGa327506c6 [2022-04-08 13:56:33,542 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86475829e/b579569403144b0fa0392209a70a5896 [2022-04-08 13:56:33,544 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 13:56:33,545 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 13:56:33,546 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 13:56:33,546 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 13:56:33,548 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 13:56:33,549 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,549 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a62af19 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33, skipping insertion in model container [2022-04-08 13:56:33,549 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,554 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 13:56:33,565 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 13:56:33,670 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/prod4br-ll_unwindbound20.c[524,537] [2022-04-08 13:56:33,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:56:33,693 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 13:56:33,704 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/prod4br-ll_unwindbound20.c[524,537] [2022-04-08 13:56:33,710 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 13:56:33,718 INFO L208 MainTranslator]: Completed translation [2022-04-08 13:56:33,718 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33 WrapperNode [2022-04-08 13:56:33,718 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 13:56:33,719 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 13:56:33,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 13:56:33,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 13:56:33,726 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,726 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,741 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,741 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,746 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,749 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,749 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,751 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 13:56:33,751 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 13:56:33,751 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 13:56:33,751 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 13:56:33,757 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33" (1/1) ... [2022-04-08 13:56:33,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 13:56:33,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:56:33,799 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:56:33,804 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:56:33,835 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 13:56:33,836 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 13:56:33,836 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 13:56:33,836 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 13:56:33,836 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 13:56:33,837 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 13:56:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 13:56:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 13:56:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 13:56:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 13:56:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 13:56:33,837 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 13:56:33,838 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 13:56:33,838 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 13:56:33,838 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 13:56:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 13:56:33,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 13:56:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 13:56:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 13:56:33,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 13:56:33,885 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 13:56:33,887 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 13:56:34,041 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 13:56:34,050 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 13:56:34,051 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 13:56:34,052 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:56:34 BoogieIcfgContainer [2022-04-08 13:56:34,052 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 13:56:34,053 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 13:56:34,053 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 13:56:34,069 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 13:56:34,069 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 01:56:33" (1/3) ... [2022-04-08 13:56:34,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7d8f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:56:34, skipping insertion in model container [2022-04-08 13:56:34,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 01:56:33" (2/3) ... [2022-04-08 13:56:34,070 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c7d8f94 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 01:56:34, skipping insertion in model container [2022-04-08 13:56:34,070 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 01:56:34" (3/3) ... [2022-04-08 13:56:34,071 INFO L111 eAbstractionObserver]: Analyzing ICFG prod4br-ll_unwindbound20.c [2022-04-08 13:56:34,074 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 13:56:34,074 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 13:56:34,101 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 13:56:34,110 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:56:34,110 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 13:56:34,124 INFO L276 IsEmpty]: Start isEmpty. Operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 13:56:34,129 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-04-08 13:56:34,129 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:56:34,129 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:56:34,130 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:56:34,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:56:34,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 1 times [2022-04-08 13:56:34,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:56:34,138 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [986227241] [2022-04-08 13:56:34,145 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:56:34,146 INFO L85 PathProgramCache]: Analyzing trace with hash 1717894843, now seen corresponding path program 2 times [2022-04-08 13:56:34,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:56:34,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018707695] [2022-04-08 13:56:34,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:56:34,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:56:34,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:56:34,250 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2022-04-08 13:56:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:56:34,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {44#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-08 13:56:34,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 13:56:34,271 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-08 13:56:34,271 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-04-08 13:56:34,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:56:34,284 INFO L290 TraceCheckUtils]: 0: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:56:34,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:56:34,286 INFO L290 TraceCheckUtils]: 2: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:56:34,286 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-08 13:56:34,288 INFO L272 TraceCheckUtils]: 0: Hoare triple {35#true} call ULTIMATE.init(); {44#(and (= ~counter~0 |old(~counter~0)|) (= |#NULL.offset| |old(#NULL.offset)|) (= |old(#NULL.base)| |#NULL.base|))} is VALID [2022-04-08 13:56:34,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {44#(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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {35#true} is VALID [2022-04-08 13:56:34,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {35#true} assume true; {35#true} is VALID [2022-04-08 13:56:34,289 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35#true} {35#true} #77#return; {35#true} is VALID [2022-04-08 13:56:34,289 INFO L272 TraceCheckUtils]: 4: Hoare triple {35#true} call #t~ret7 := main(); {35#true} is VALID [2022-04-08 13:56:34,290 INFO L290 TraceCheckUtils]: 5: Hoare triple {35#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {35#true} is VALID [2022-04-08 13:56:34,290 INFO L272 TraceCheckUtils]: 6: Hoare triple {35#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {35#true} is VALID [2022-04-08 13:56:34,290 INFO L290 TraceCheckUtils]: 7: Hoare triple {35#true} ~cond := #in~cond; {35#true} is VALID [2022-04-08 13:56:34,290 INFO L290 TraceCheckUtils]: 8: Hoare triple {35#true} assume 0 == ~cond;assume false; {36#false} is VALID [2022-04-08 13:56:34,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {36#false} assume true; {36#false} is VALID [2022-04-08 13:56:34,291 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36#false} {35#true} #69#return; {36#false} is VALID [2022-04-08 13:56:34,292 INFO L290 TraceCheckUtils]: 11: Hoare triple {36#false} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {36#false} is VALID [2022-04-08 13:56:34,292 INFO L290 TraceCheckUtils]: 12: Hoare triple {36#false} assume !true; {36#false} is VALID [2022-04-08 13:56:34,292 INFO L272 TraceCheckUtils]: 13: Hoare triple {36#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {36#false} is VALID [2022-04-08 13:56:34,293 INFO L290 TraceCheckUtils]: 14: Hoare triple {36#false} ~cond := #in~cond; {36#false} is VALID [2022-04-08 13:56:34,293 INFO L290 TraceCheckUtils]: 15: Hoare triple {36#false} assume 0 == ~cond; {36#false} is VALID [2022-04-08 13:56:34,293 INFO L290 TraceCheckUtils]: 16: Hoare triple {36#false} assume !false; {36#false} is VALID [2022-04-08 13:56:34,294 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:56:34,294 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:56:34,294 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018707695] [2022-04-08 13:56:34,295 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018707695] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:56:34,295 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:56:34,295 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:56:34,298 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:56:34,299 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [986227241] [2022-04-08 13:56:34,299 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [986227241] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:56:34,299 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:56:34,299 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-04-08 13:56:34,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1936130692] [2022-04-08 13:56:34,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:56:34,304 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 13:56:34,305 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:56:34,307 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:34,334 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:56:34,334 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-04-08 13:56:34,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:56:34,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-04-08 13:56:34,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 13:56:34,359 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.45) internal successors, (29), 21 states have internal predecessors, (29), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:34,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:56:34,530 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-04-08 13:56:34,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-04-08 13:56:34,531 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 17 [2022-04-08 13:56:34,535 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:56:34,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:34,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-08 13:56:34,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 77 transitions. [2022-04-08 13:56:34,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 3 states and 77 transitions. [2022-04-08 13:56:34,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:56:34,660 INFO L225 Difference]: With dead ends: 56 [2022-04-08 13:56:34,660 INFO L226 Difference]: Without dead ends: 28 [2022-04-08 13:56:34,662 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-04-08 13:56:34,665 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 10 mSDsluCounter, 4 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:56:34,665 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 40 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:56:34,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-04-08 13:56:34,690 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 27. [2022-04-08 13:56:34,691 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:56:34,693 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 13:56:34,695 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 13:56:34,695 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 13:56:34,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:56:34,702 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-08 13:56:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 13:56:34,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:56:34,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:56:34,704 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 13:56:34,704 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 28 states. [2022-04-08 13:56:34,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:56:34,709 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-04-08 13:56:34,709 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-04-08 13:56:34,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:56:34,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:56:34,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:56:34,713 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:56:34,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.3529411764705883) internal successors, (23), 18 states have internal predecessors, (23), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 13:56:34,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2022-04-08 13:56:34,718 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 17 [2022-04-08 13:56:34,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:56:34,719 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2022-04-08 13:56:34,720 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 2 states have internal predecessors, (11), 2 states have call successors, (4), 3 states have call predecessors, (4), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:34,720 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 33 transitions. [2022-04-08 13:56:34,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:56:34,760 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2022-04-08 13:56:34,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 13:56:34,761 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:56:34,761 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:56:34,761 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-04-08 13:56:34,762 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:56:34,763 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:56:34,763 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 1 times [2022-04-08 13:56:34,763 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:56:34,763 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [862992388] [2022-04-08 13:56:34,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:56:34,768 INFO L85 PathProgramCache]: Analyzing trace with hash 444281082, now seen corresponding path program 2 times [2022-04-08 13:56:34,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:56:34,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98621053] [2022-04-08 13:56:34,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:56:34,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:56:34,799 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:56:34,799 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [71784197] [2022-04-08 13:56:34,799 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:56:34,799 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:56:34,800 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:56:34,801 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:56:34,802 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:56:34,838 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 13:56:34,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:56:34,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 13:56:34,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:56:34,854 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:56:35,001 INFO L272 TraceCheckUtils]: 0: Hoare triple {269#true} call ULTIMATE.init(); {269#true} is VALID [2022-04-08 13:56:35,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {269#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,002 INFO L290 TraceCheckUtils]: 2: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,003 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {277#(<= ~counter~0 0)} {269#true} #77#return; {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,003 INFO L272 TraceCheckUtils]: 4: Hoare triple {277#(<= ~counter~0 0)} call #t~ret7 := main(); {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {277#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {277#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {277#(<= ~counter~0 0)} ~cond := #in~cond; {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {277#(<= ~counter~0 0)} assume !(0 == ~cond); {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,006 INFO L290 TraceCheckUtils]: 9: Hoare triple {277#(<= ~counter~0 0)} assume true; {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {277#(<= ~counter~0 0)} {277#(<= ~counter~0 0)} #69#return; {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {277#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {277#(<= ~counter~0 0)} is VALID [2022-04-08 13:56:35,007 INFO L290 TraceCheckUtils]: 12: Hoare triple {277#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {311#(<= |main_#t~post6| 0)} is VALID [2022-04-08 13:56:35,008 INFO L290 TraceCheckUtils]: 13: Hoare triple {311#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {270#false} is VALID [2022-04-08 13:56:35,008 INFO L272 TraceCheckUtils]: 14: Hoare triple {270#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {270#false} is VALID [2022-04-08 13:56:35,008 INFO L290 TraceCheckUtils]: 15: Hoare triple {270#false} ~cond := #in~cond; {270#false} is VALID [2022-04-08 13:56:35,008 INFO L290 TraceCheckUtils]: 16: Hoare triple {270#false} assume 0 == ~cond; {270#false} is VALID [2022-04-08 13:56:35,008 INFO L290 TraceCheckUtils]: 17: Hoare triple {270#false} assume !false; {270#false} is VALID [2022-04-08 13:56:35,009 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:56:35,009 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:56:35,009 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:56:35,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98621053] [2022-04-08 13:56:35,009 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:56:35,009 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [71784197] [2022-04-08 13:56:35,010 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [71784197] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:56:35,010 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:56:35,010 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:56:35,010 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:56:35,011 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [862992388] [2022-04-08 13:56:35,011 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [862992388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:56:35,011 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:56:35,011 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 13:56:35,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1783163672] [2022-04-08 13:56:35,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:56:35,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 13:56:35,012 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:56:35,012 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:56:35,025 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:56:35,025 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 13:56:35,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:56:35,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 13:56:35,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 13:56:35,026 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:56:35,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:56:35,091 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-08 13:56:35,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 13:56:35,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 18 [2022-04-08 13:56:35,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:56:35,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:56:35,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-08 13:56:35,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:56:35,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 44 transitions. [2022-04-08 13:56:35,097 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 44 transitions. [2022-04-08 13:56:35,130 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:56:35,131 INFO L225 Difference]: With dead ends: 37 [2022-04-08 13:56:35,131 INFO L226 Difference]: Without dead ends: 29 [2022-04-08 13:56:35,132 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 13:56:35,134 INFO L913 BasicCegarLoop]: 31 mSDtfsCounter, 0 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:56:35,138 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 81 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:56:35,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-04-08 13:56:35,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-04-08 13:56:35,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:56:35,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 13:56:35,157 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 13:56:35,158 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 13:56:35,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:56:35,160 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 13:56:35,160 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 13:56:35,161 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:56:35,161 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:56:35,163 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-08 13:56:35,163 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 29 states. [2022-04-08 13:56:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:56:35,166 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-04-08 13:56:35,166 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 13:56:35,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:56:35,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:56:35,167 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:56:35,167 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:56:35,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.3157894736842106) internal successors, (25), 20 states have internal predecessors, (25), 6 states have call successors, (6), 4 states have call predecessors, (6), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 13:56:35,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-04-08 13:56:35,173 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 18 [2022-04-08 13:56:35,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:56:35,173 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-04-08 13:56:35,174 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (4), 3 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-04-08 13:56:35,174 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 35 transitions. [2022-04-08 13:56:35,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:56:35,217 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-04-08 13:56:35,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-04-08 13:56:35,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:56:35,217 INFO L499 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:56:35,236 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:56:35,424 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:56:35,425 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:56:35,425 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:56:35,425 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 1 times [2022-04-08 13:56:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:56:35,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1246655706] [2022-04-08 13:56:35,426 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:56:35,426 INFO L85 PathProgramCache]: Analyzing trace with hash 446068542, now seen corresponding path program 2 times [2022-04-08 13:56:35,426 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:56:35,426 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295805330] [2022-04-08 13:56:35,426 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:56:35,427 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:56:35,439 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:56:35,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [803572028] [2022-04-08 13:56:35,440 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:56:35,440 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:56:35,440 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:56:35,441 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:56:35,467 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:56:35,487 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 13:56:35,487 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:56:35,488 INFO L263 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 13:56:35,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:56:35,497 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:56:35,629 INFO L272 TraceCheckUtils]: 0: Hoare triple {516#true} call ULTIMATE.init(); {516#true} is VALID [2022-04-08 13:56:35,629 INFO L290 TraceCheckUtils]: 1: Hoare triple {516#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {516#true} is VALID [2022-04-08 13:56:35,629 INFO L290 TraceCheckUtils]: 2: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-08 13:56:35,629 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {516#true} {516#true} #77#return; {516#true} is VALID [2022-04-08 13:56:35,630 INFO L272 TraceCheckUtils]: 4: Hoare triple {516#true} call #t~ret7 := main(); {516#true} is VALID [2022-04-08 13:56:35,630 INFO L290 TraceCheckUtils]: 5: Hoare triple {516#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {516#true} is VALID [2022-04-08 13:56:35,630 INFO L272 TraceCheckUtils]: 6: Hoare triple {516#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {516#true} is VALID [2022-04-08 13:56:35,630 INFO L290 TraceCheckUtils]: 7: Hoare triple {516#true} ~cond := #in~cond; {516#true} is VALID [2022-04-08 13:56:35,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {516#true} assume !(0 == ~cond); {516#true} is VALID [2022-04-08 13:56:35,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {516#true} assume true; {516#true} is VALID [2022-04-08 13:56:35,630 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {516#true} {516#true} #69#return; {516#true} is VALID [2022-04-08 13:56:35,631 INFO L290 TraceCheckUtils]: 11: Hoare triple {516#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:56:35,631 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:56:35,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:56:35,646 INFO L272 TraceCheckUtils]: 14: Hoare triple {554#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {564#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:56:35,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {564#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {568#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:56:35,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {568#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {517#false} is VALID [2022-04-08 13:56:35,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {517#false} assume !false; {517#false} is VALID [2022-04-08 13:56:35,647 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:56:35,647 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:56:35,647 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:56:35,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295805330] [2022-04-08 13:56:35,647 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:56:35,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [803572028] [2022-04-08 13:56:35,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [803572028] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:56:35,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:56:35,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:56:35,648 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:56:35,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1246655706] [2022-04-08 13:56:35,648 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1246655706] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:56:35,648 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:56:35,648 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:56:35,648 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126825700] [2022-04-08 13:56:35,648 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:56:35,649 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 13:56:35,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:56:35,649 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:35,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:56:35,662 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:56:35,662 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:56:35,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:56:35,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 13:56:35,663 INFO L87 Difference]: Start difference. First operand 29 states and 35 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:35,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:56:35,824 INFO L93 Difference]: Finished difference Result 42 states and 53 transitions. [2022-04-08 13:56:35,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:56:35,825 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 18 [2022-04-08 13:56:35,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:56:35,825 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 13:56:35,827 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:35,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 53 transitions. [2022-04-08 13:56:35,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 53 transitions. [2022-04-08 13:56:35,881 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:56:35,882 INFO L225 Difference]: With dead ends: 42 [2022-04-08 13:56:35,883 INFO L226 Difference]: Without dead ends: 40 [2022-04-08 13:56:35,883 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 14 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:56:35,884 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 9 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:56:35,884 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 83 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:56:35,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-04-08 13:56:35,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 34. [2022-04-08 13:56:35,899 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:56:35,900 INFO L82 GeneralOperation]: Start isEquivalent. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 13:56:35,900 INFO L74 IsIncluded]: Start isIncluded. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 13:56:35,900 INFO L87 Difference]: Start difference. First operand 40 states. Second operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 13:56:35,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:56:35,902 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-08 13:56:35,902 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-08 13:56:35,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:56:35,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:56:35,903 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-08 13:56:35,903 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Second operand 40 states. [2022-04-08 13:56:35,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:56:35,905 INFO L93 Difference]: Finished difference Result 40 states and 51 transitions. [2022-04-08 13:56:35,905 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-04-08 13:56:35,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:56:35,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:56:35,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:56:35,906 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:56:35,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.2727272727272727) internal successors, (28), 24 states have internal predecessors, (28), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 13:56:35,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2022-04-08 13:56:35,908 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 18 [2022-04-08 13:56:35,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:56:35,908 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2022-04-08 13:56:35,908 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, (4), 2 states have call predecessors, (4), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-04-08 13:56:35,909 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 40 transitions. [2022-04-08 13:56:35,943 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:56:35,944 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2022-04-08 13:56:35,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-04-08 13:56:35,944 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:56:35,944 INFO L499 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:56:35,971 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:56:36,159 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,SelfDestructingSolverStorable2 [2022-04-08 13:56:36,160 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:56:36,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:56:36,160 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 1 times [2022-04-08 13:56:36,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:56:36,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [604319540] [2022-04-08 13:56:36,161 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:56:36,161 INFO L85 PathProgramCache]: Analyzing trace with hash -1308579644, now seen corresponding path program 2 times [2022-04-08 13:56:36,161 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:56:36,161 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507792918] [2022-04-08 13:56:36,161 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:56:36,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:56:36,174 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:56:36,174 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477624533] [2022-04-08 13:56:36,174 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:56:36,174 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:56:36,174 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:56:36,175 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:56:36,176 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:56:36,207 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:56:36,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:56:36,207 INFO L263 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 13:56:36,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:56:36,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:56:46,636 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-08 13:56:46,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {808#true} is VALID [2022-04-08 13:56:46,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-08 13:56:46,638 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-08 13:56:46,638 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-08 13:56:46,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-08 13:56:46,638 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-08 13:56:46,639 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 13:56:46,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {834#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 13:56:46,639 INFO L290 TraceCheckUtils]: 9: Hoare triple {838#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {838#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 13:56:46,642 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {838#(not (= |assume_abort_if_not_#in~cond| 0))} {808#true} #69#return; {845#(<= 1 main_~y~0)} is VALID [2022-04-08 13:56:46,642 INFO L290 TraceCheckUtils]: 11: Hoare triple {845#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-08 13:56:46,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-08 13:56:46,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !!(#t~post6 < 20);havoc #t~post6; {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is VALID [2022-04-08 13:56:46,647 INFO L272 TraceCheckUtils]: 14: Hoare triple {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {808#true} is VALID [2022-04-08 13:56:46,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:56:46,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {862#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:56:46,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:56:48,665 WARN L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {849#(and (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} #71#return; {873#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} is UNKNOWN [2022-04-08 13:56:48,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {873#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~a~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (<= main_~y~0 main_~b~0) (<= 1 main_~y~0))} assume !(0 != ~a~0 && 0 != ~b~0); {877#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} is VALID [2022-04-08 13:56:48,667 INFO L272 TraceCheckUtils]: 20: Hoare triple {877#(and (= main_~q~0 (* main_~y~0 main_~x~0)) (<= 1 main_~y~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:56:48,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:56:48,668 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-08 13:56:48,668 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-08 13:56:48,668 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:56:48,668 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:57:02,629 INFO L290 TraceCheckUtils]: 23: Hoare triple {809#false} assume !false; {809#false} is VALID [2022-04-08 13:57:02,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {885#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {809#false} is VALID [2022-04-08 13:57:02,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {881#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {885#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:57:02,631 INFO L272 TraceCheckUtils]: 20: Hoare triple {901#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {881#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:57:02,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {905#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {901#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:57:02,633 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} {808#true} #71#return; {905#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-08 13:57:02,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {866#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:57:02,635 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {866#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:57:02,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {808#true} ~cond := #in~cond; {918#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:57:02,635 INFO L272 TraceCheckUtils]: 14: Hoare triple {808#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {808#true} is VALID [2022-04-08 13:57:02,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {808#true} assume !!(#t~post6 < 20);havoc #t~post6; {808#true} is VALID [2022-04-08 13:57:02,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {808#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {808#true} is VALID [2022-04-08 13:57:02,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {808#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {808#true} is VALID [2022-04-08 13:57:02,636 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {808#true} {808#true} #69#return; {808#true} is VALID [2022-04-08 13:57:02,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-08 13:57:02,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {808#true} assume !(0 == ~cond); {808#true} is VALID [2022-04-08 13:57:02,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {808#true} ~cond := #in~cond; {808#true} is VALID [2022-04-08 13:57:02,636 INFO L272 TraceCheckUtils]: 6: Hoare triple {808#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {808#true} is VALID [2022-04-08 13:57:02,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {808#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {808#true} is VALID [2022-04-08 13:57:02,639 INFO L272 TraceCheckUtils]: 4: Hoare triple {808#true} call #t~ret7 := main(); {808#true} is VALID [2022-04-08 13:57:02,639 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {808#true} {808#true} #77#return; {808#true} is VALID [2022-04-08 13:57:02,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {808#true} assume true; {808#true} is VALID [2022-04-08 13:57:02,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {808#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {808#true} is VALID [2022-04-08 13:57:02,639 INFO L272 TraceCheckUtils]: 0: Hoare triple {808#true} call ULTIMATE.init(); {808#true} is VALID [2022-04-08 13:57:02,639 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:57:02,639 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:57:02,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507792918] [2022-04-08 13:57:02,640 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:57:02,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477624533] [2022-04-08 13:57:02,640 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477624533] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:57:02,640 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:57:02,640 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 8] total 15 [2022-04-08 13:57:02,640 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:57:02,640 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [604319540] [2022-04-08 13:57:02,641 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [604319540] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:57:02,641 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:57:02,641 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 13:57:02,641 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455703743] [2022-04-08 13:57:02,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:57:02,644 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 13:57:02,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:57:02,644 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:57:04,667 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 23 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:57:04,667 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 13:57:04,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:57:04,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 13:57:04,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2022-04-08 13:57:04,668 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:57:11,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:57:11,162 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-04-08 13:57:11,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-08 13:57:11,162 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 24 [2022-04-08 13:57:11,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:57:11,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:57:11,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-08 13:57:11,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:57:11,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 60 transitions. [2022-04-08 13:57:11,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 60 transitions. [2022-04-08 13:57:13,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 59 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:57:13,218 INFO L225 Difference]: With dead ends: 50 [2022-04-08 13:57:13,218 INFO L226 Difference]: Without dead ends: 48 [2022-04-08 13:57:13,218 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=278, Unknown=0, NotChecked=0, Total=342 [2022-04-08 13:57:13,219 INFO L913 BasicCegarLoop]: 20 mSDtfsCounter, 36 mSDsluCounter, 110 mSDsCounter, 0 mSdLazyCounter, 204 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 204 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-08 13:57:13,219 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 130 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 204 Invalid, 0 Unknown, 0 Unchecked, 3.4s Time] [2022-04-08 13:57:13,219 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-04-08 13:57:13,259 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 45. [2022-04-08 13:57:13,259 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:57:13,259 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:57:13,260 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:57:13,260 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:57:13,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:57:13,263 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-08 13:57:13,263 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-08 13:57:13,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:57:13,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:57:13,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-08 13:57:13,264 INFO L87 Difference]: Start difference. First operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand 48 states. [2022-04-08 13:57:13,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:57:13,265 INFO L93 Difference]: Finished difference Result 48 states and 61 transitions. [2022-04-08 13:57:13,265 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 61 transitions. [2022-04-08 13:57:13,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:57:13,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:57:13,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:57:13,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:57:13,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 30 states have (on average 1.3333333333333333) internal successors, (40), 33 states have internal predecessors, (40), 9 states have call successors, (9), 6 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 13:57:13,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-04-08 13:57:13,267 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 24 [2022-04-08 13:57:13,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:57:13,267 INFO L478 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-04-08 13:57:13,267 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.4545454545454546) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:57:13,268 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 45 states and 56 transitions. [2022-04-08 13:57:15,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:57:15,322 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-04-08 13:57:15,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 13:57:15,323 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:57:15,323 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:57:15,343 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:57:15,523 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:57:15,526 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:57:15,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:57:15,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 1 times [2022-04-08 13:57:15,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:57:15,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1957268959] [2022-04-08 13:57:21,618 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:57:21,619 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:57:21,619 INFO L85 PathProgramCache]: Analyzing trace with hash 1797927234, now seen corresponding path program 2 times [2022-04-08 13:57:21,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:57:21,619 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612144711] [2022-04-08 13:57:21,619 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:57:21,619 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:57:21,632 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:57:21,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1206225442] [2022-04-08 13:57:21,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:57:21,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:57:21,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:57:21,633 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:57:21,636 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:57:21,674 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:57:21,674 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:57:21,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 13:57:21,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:57:21,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:57:21,831 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-08 13:57:21,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,832 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1268#(<= ~counter~0 0)} {1260#true} #77#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,833 INFO L272 TraceCheckUtils]: 4: Hoare triple {1268#(<= ~counter~0 0)} call #t~ret7 := main(); {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,834 INFO L272 TraceCheckUtils]: 6: Hoare triple {1268#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {1268#(<= ~counter~0 0)} ~cond := #in~cond; {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {1268#(<= ~counter~0 0)} assume !(0 == ~cond); {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {1268#(<= ~counter~0 0)} assume true; {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,837 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1268#(<= ~counter~0 0)} {1268#(<= ~counter~0 0)} #69#return; {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,838 INFO L290 TraceCheckUtils]: 11: Hoare triple {1268#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1268#(<= ~counter~0 0)} is VALID [2022-04-08 13:57:21,846 INFO L290 TraceCheckUtils]: 12: Hoare triple {1268#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-08 13:57:21,847 INFO L290 TraceCheckUtils]: 13: Hoare triple {1302#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1302#(<= ~counter~0 1)} is VALID [2022-04-08 13:57:21,848 INFO L272 TraceCheckUtils]: 14: Hoare triple {1302#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1302#(<= ~counter~0 1)} is VALID [2022-04-08 13:57:21,848 INFO L290 TraceCheckUtils]: 15: Hoare triple {1302#(<= ~counter~0 1)} ~cond := #in~cond; {1302#(<= ~counter~0 1)} is VALID [2022-04-08 13:57:21,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {1302#(<= ~counter~0 1)} assume !(0 == ~cond); {1302#(<= ~counter~0 1)} is VALID [2022-04-08 13:57:21,849 INFO L290 TraceCheckUtils]: 17: Hoare triple {1302#(<= ~counter~0 1)} assume true; {1302#(<= ~counter~0 1)} is VALID [2022-04-08 13:57:21,849 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1302#(<= ~counter~0 1)} {1302#(<= ~counter~0 1)} #71#return; {1302#(<= ~counter~0 1)} is VALID [2022-04-08 13:57:21,850 INFO L290 TraceCheckUtils]: 19: Hoare triple {1302#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {1302#(<= ~counter~0 1)} is VALID [2022-04-08 13:57:21,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {1302#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1302#(<= ~counter~0 1)} is VALID [2022-04-08 13:57:21,850 INFO L290 TraceCheckUtils]: 21: Hoare triple {1302#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1330#(<= |main_#t~post6| 1)} is VALID [2022-04-08 13:57:21,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {1330#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1261#false} is VALID [2022-04-08 13:57:21,851 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-08 13:57:21,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-08 13:57:21,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-08 13:57:21,851 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-08 13:57:21,851 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:57:21,852 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:57:21,992 INFO L290 TraceCheckUtils]: 26: Hoare triple {1261#false} assume !false; {1261#false} is VALID [2022-04-08 13:57:21,992 INFO L290 TraceCheckUtils]: 25: Hoare triple {1261#false} assume 0 == ~cond; {1261#false} is VALID [2022-04-08 13:57:21,992 INFO L290 TraceCheckUtils]: 24: Hoare triple {1261#false} ~cond := #in~cond; {1261#false} is VALID [2022-04-08 13:57:21,992 INFO L272 TraceCheckUtils]: 23: Hoare triple {1261#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {1261#false} is VALID [2022-04-08 13:57:21,992 INFO L290 TraceCheckUtils]: 22: Hoare triple {1358#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1261#false} is VALID [2022-04-08 13:57:21,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {1362#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1358#(< |main_#t~post6| 20)} is VALID [2022-04-08 13:57:21,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {1362#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1362#(< ~counter~0 20)} is VALID [2022-04-08 13:57:21,994 INFO L290 TraceCheckUtils]: 19: Hoare triple {1362#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {1362#(< ~counter~0 20)} is VALID [2022-04-08 13:57:21,994 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1260#true} {1362#(< ~counter~0 20)} #71#return; {1362#(< ~counter~0 20)} is VALID [2022-04-08 13:57:21,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-08 13:57:21,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-08 13:57:21,995 INFO L290 TraceCheckUtils]: 15: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-08 13:57:21,995 INFO L272 TraceCheckUtils]: 14: Hoare triple {1362#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1260#true} is VALID [2022-04-08 13:57:21,995 INFO L290 TraceCheckUtils]: 13: Hoare triple {1362#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {1362#(< ~counter~0 20)} is VALID [2022-04-08 13:57:21,996 INFO L290 TraceCheckUtils]: 12: Hoare triple {1390#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1362#(< ~counter~0 20)} is VALID [2022-04-08 13:57:21,996 INFO L290 TraceCheckUtils]: 11: Hoare triple {1390#(< ~counter~0 19)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1390#(< ~counter~0 19)} is VALID [2022-04-08 13:57:21,997 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1260#true} {1390#(< ~counter~0 19)} #69#return; {1390#(< ~counter~0 19)} is VALID [2022-04-08 13:57:21,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {1260#true} assume true; {1260#true} is VALID [2022-04-08 13:57:21,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {1260#true} assume !(0 == ~cond); {1260#true} is VALID [2022-04-08 13:57:21,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {1260#true} ~cond := #in~cond; {1260#true} is VALID [2022-04-08 13:57:21,997 INFO L272 TraceCheckUtils]: 6: Hoare triple {1390#(< ~counter~0 19)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1260#true} is VALID [2022-04-08 13:57:21,997 INFO L290 TraceCheckUtils]: 5: Hoare triple {1390#(< ~counter~0 19)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1390#(< ~counter~0 19)} is VALID [2022-04-08 13:57:21,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {1390#(< ~counter~0 19)} call #t~ret7 := main(); {1390#(< ~counter~0 19)} is VALID [2022-04-08 13:57:21,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1390#(< ~counter~0 19)} {1260#true} #77#return; {1390#(< ~counter~0 19)} is VALID [2022-04-08 13:57:21,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#(< ~counter~0 19)} assume true; {1390#(< ~counter~0 19)} is VALID [2022-04-08 13:57:21,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {1260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1390#(< ~counter~0 19)} is VALID [2022-04-08 13:57:21,999 INFO L272 TraceCheckUtils]: 0: Hoare triple {1260#true} call ULTIMATE.init(); {1260#true} is VALID [2022-04-08 13:57:21,999 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:57:22,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:57:22,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612144711] [2022-04-08 13:57:22,000 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:57:22,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1206225442] [2022-04-08 13:57:22,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1206225442] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:57:22,000 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:57:22,000 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 13:57:22,000 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:57:22,000 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1957268959] [2022-04-08 13:57:22,000 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1957268959] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:57:22,001 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:57:22,001 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:57:22,001 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1364174937] [2022-04-08 13:57:22,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:57:22,001 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-08 13:57:22,001 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:57:22,002 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 13:57:22,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:57:22,020 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:57:22,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:57:22,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:57:22,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 13:57:22,021 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 13:57:22,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:57:22,170 INFO L93 Difference]: Finished difference Result 73 states and 89 transitions. [2022-04-08 13:57:22,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 13:57:22,170 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 27 [2022-04-08 13:57:22,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:57:22,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 13:57:22,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-08 13:57:22,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 13:57:22,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 64 transitions. [2022-04-08 13:57:22,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 64 transitions. [2022-04-08 13:57:22,215 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:57:22,216 INFO L225 Difference]: With dead ends: 73 [2022-04-08 13:57:22,216 INFO L226 Difference]: Without dead ends: 63 [2022-04-08 13:57:22,217 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 47 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:57:22,217 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 17 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 13:57:22,217 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 108 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 13:57:22,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-04-08 13:57:22,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-04-08 13:57:22,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:57:22,277 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 13:57:22,277 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 13:57:22,277 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 13:57:22,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:57:22,279 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-08 13:57:22,279 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-08 13:57:22,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:57:22,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:57:22,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-08 13:57:22,280 INFO L87 Difference]: Start difference. First operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 63 states. [2022-04-08 13:57:22,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:57:22,281 INFO L93 Difference]: Finished difference Result 63 states and 77 transitions. [2022-04-08 13:57:22,282 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 77 transitions. [2022-04-08 13:57:22,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:57:22,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:57:22,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:57:22,282 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:57:22,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 43 states have (on average 1.3255813953488371) internal successors, (57), 45 states have internal predecessors, (57), 11 states have call successors, (11), 8 states have call predecessors, (11), 6 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 13:57:22,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 76 transitions. [2022-04-08 13:57:22,284 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 76 transitions. Word has length 27 [2022-04-08 13:57:22,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:57:22,284 INFO L478 AbstractCegarLoop]: Abstraction has 61 states and 76 transitions. [2022-04-08 13:57:22,284 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (5), 4 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2022-04-08 13:57:22,284 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 61 states and 76 transitions. [2022-04-08 13:57:24,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 75 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:57:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 76 transitions. [2022-04-08 13:57:24,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-04-08 13:57:24,357 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:57:24,357 INFO L499 BasicCegarLoop]: trace histogram [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:57:24,375 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:57:24,557 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:57:24,557 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:57:24,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:57:24,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 1 times [2022-04-08 13:57:24,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:57:24,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1311945090] [2022-04-08 13:57:30,616 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:57:30,616 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:57:30,617 INFO L85 PathProgramCache]: Analyzing trace with hash 1799714694, now seen corresponding path program 2 times [2022-04-08 13:57:30,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:57:30,617 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1699336089] [2022-04-08 13:57:30,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:57:30,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:57:30,627 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:57:30,627 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1763888679] [2022-04-08 13:57:30,627 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:57:30,627 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:57:30,628 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:57:30,628 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:57:30,629 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:57:30,664 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:57:30,665 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:57:30,665 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 28 conjunts are in the unsatisfiable core [2022-04-08 13:57:30,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:57:30,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:57:31,034 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-08 13:57:31,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1825#true} is VALID [2022-04-08 13:57:31,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-08 13:57:31,035 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #77#return; {1825#true} is VALID [2022-04-08 13:57:31,035 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret7 := main(); {1825#true} is VALID [2022-04-08 13:57:31,035 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1825#true} is VALID [2022-04-08 13:57:31,035 INFO L272 TraceCheckUtils]: 6: Hoare triple {1825#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1825#true} is VALID [2022-04-08 13:57:31,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#true} ~cond := #in~cond; {1825#true} is VALID [2022-04-08 13:57:31,035 INFO L290 TraceCheckUtils]: 8: Hoare triple {1825#true} assume !(0 == ~cond); {1825#true} is VALID [2022-04-08 13:57:31,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-08 13:57:31,036 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1825#true} {1825#true} #69#return; {1825#true} is VALID [2022-04-08 13:57:31,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:57:31,037 INFO L290 TraceCheckUtils]: 12: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:57:31,037 INFO L290 TraceCheckUtils]: 13: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:57:31,037 INFO L272 TraceCheckUtils]: 14: Hoare triple {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1825#true} is VALID [2022-04-08 13:57:31,039 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#true} ~cond := #in~cond; {1876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:57:31,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {1876#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:57:31,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:57:31,040 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} {1863#(and (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:57:31,041 INFO L290 TraceCheckUtils]: 19: Hoare triple {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:57:31,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {1887#(and (= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0)) (= main_~b~0 main_~y~0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 13:57:31,042 INFO L290 TraceCheckUtils]: 21: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 13:57:31,045 INFO L290 TraceCheckUtils]: 22: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} assume !!(#t~post6 < 20);havoc #t~post6; {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} is VALID [2022-04-08 13:57:31,049 INFO L272 TraceCheckUtils]: 23: Hoare triple {1894#(and (= (+ main_~q~0 (* main_~y~0 main_~x~0 1)) (* main_~y~0 main_~x~0)) (= (div main_~y~0 2) main_~b~0) (= (mod main_~y~0 2) 0) (= main_~p~0 4) (= (div main_~x~0 2) main_~a~0) (= (mod main_~x~0 2) 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:57:31,049 INFO L290 TraceCheckUtils]: 24: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:57:31,050 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-08 13:57:31,050 INFO L290 TraceCheckUtils]: 26: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-08 13:57:31,050 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:57:31,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:58:23,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {1826#false} assume !false; {1826#false} is VALID [2022-04-08 13:58:23,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {1908#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1826#false} is VALID [2022-04-08 13:58:23,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1908#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:58:23,529 INFO L272 TraceCheckUtils]: 23: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1904#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:58:23,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:58:23,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:58:23,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {1924#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:58:23,551 INFO L290 TraceCheckUtils]: 19: Hoare triple {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} assume !!(0 != ~a~0 && 0 != ~b~0); {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-08 13:58:23,556 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} {1825#true} #71#return; {1934#(or (not (= (mod main_~b~0 2) 0)) (= (+ (* (div main_~b~0 2) (* main_~p~0 4) (div main_~a~0 2)) main_~q~0) (* main_~y~0 main_~x~0)) (not (= (mod main_~a~0 2) 0)))} is VALID [2022-04-08 13:58:23,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:58:23,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {1950#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1880#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:58:23,560 INFO L290 TraceCheckUtils]: 15: Hoare triple {1825#true} ~cond := #in~cond; {1950#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:58:23,561 INFO L272 TraceCheckUtils]: 14: Hoare triple {1825#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {1825#true} is VALID [2022-04-08 13:58:23,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {1825#true} assume !!(#t~post6 < 20);havoc #t~post6; {1825#true} is VALID [2022-04-08 13:58:23,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {1825#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1825#true} is VALID [2022-04-08 13:58:23,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {1825#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {1825#true} is VALID [2022-04-08 13:58:23,561 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1825#true} {1825#true} #69#return; {1825#true} is VALID [2022-04-08 13:58:23,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-08 13:58:23,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {1825#true} assume !(0 == ~cond); {1825#true} is VALID [2022-04-08 13:58:23,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {1825#true} ~cond := #in~cond; {1825#true} is VALID [2022-04-08 13:58:23,561 INFO L272 TraceCheckUtils]: 6: Hoare triple {1825#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {1825#true} is VALID [2022-04-08 13:58:23,562 INFO L290 TraceCheckUtils]: 5: Hoare triple {1825#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {1825#true} is VALID [2022-04-08 13:58:23,562 INFO L272 TraceCheckUtils]: 4: Hoare triple {1825#true} call #t~ret7 := main(); {1825#true} is VALID [2022-04-08 13:58:23,562 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1825#true} {1825#true} #77#return; {1825#true} is VALID [2022-04-08 13:58:23,562 INFO L290 TraceCheckUtils]: 2: Hoare triple {1825#true} assume true; {1825#true} is VALID [2022-04-08 13:58:23,562 INFO L290 TraceCheckUtils]: 1: Hoare triple {1825#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {1825#true} is VALID [2022-04-08 13:58:23,562 INFO L272 TraceCheckUtils]: 0: Hoare triple {1825#true} call ULTIMATE.init(); {1825#true} is VALID [2022-04-08 13:58:23,562 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:58:23,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:58:23,562 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1699336089] [2022-04-08 13:58:23,562 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:58:23,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1763888679] [2022-04-08 13:58:23,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1763888679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:58:23,563 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:58:23,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 12 [2022-04-08 13:58:23,563 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:58:23,563 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1311945090] [2022-04-08 13:58:23,563 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1311945090] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:58:23,563 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:58:23,563 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 13:58:23,563 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [471529875] [2022-04-08 13:58:23,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:58:23,564 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 13:58:23,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:58:23,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:23,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:58:23,588 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 13:58:23,589 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:58:23,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 13:58:23,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2022-04-08 13:58:23,589 INFO L87 Difference]: Start difference. First operand 61 states and 76 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:24,232 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:58:24,232 INFO L93 Difference]: Finished difference Result 76 states and 96 transitions. [2022-04-08 13:58:24,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:58:24,232 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 27 [2022-04-08 13:58:24,233 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:58:24,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:24,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-08 13:58:24,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:24,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 68 transitions. [2022-04-08 13:58:24,235 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 68 transitions. [2022-04-08 13:58:24,292 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:58:24,293 INFO L225 Difference]: With dead ends: 76 [2022-04-08 13:58:24,293 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 13:58:24,293 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-04-08 13:58:24,294 INFO L913 BasicCegarLoop]: 25 mSDtfsCounter, 24 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 202 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 13:58:24,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 126 Invalid, 202 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 13:58:24,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 13:58:24,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 68. [2022-04-08 13:58:24,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:58:24,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:58:24,353 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:58:24,354 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:58:24,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:58:24,356 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-08 13:58:24,356 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-08 13:58:24,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:58:24,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:58:24,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-08 13:58:24,356 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-08 13:58:24,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:58:24,358 INFO L93 Difference]: Finished difference Result 74 states and 94 transitions. [2022-04-08 13:58:24,358 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 94 transitions. [2022-04-08 13:58:24,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:58:24,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:58:24,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:58:24,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:58:24,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2916666666666667) internal successors, (62), 51 states have internal predecessors, (62), 12 states have call successors, (12), 9 states have call predecessors, (12), 7 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:58:24,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-08 13:58:24,361 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 27 [2022-04-08 13:58:24,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:58:24,361 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-08 13:58:24,361 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 8 states have internal predecessors, (19), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:24,361 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-08 13:58:26,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:58:26,442 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-08 13:58:26,443 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 13:58:26,443 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:58:26,443 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:58:26,461 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:58:26,661 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:58:26,661 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:58:26,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:58:26,661 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 1 times [2022-04-08 13:58:26,661 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:58:26,661 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1798502341] [2022-04-08 13:58:26,662 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 13:58:26,662 INFO L85 PathProgramCache]: Analyzing trace with hash -1613968938, now seen corresponding path program 2 times [2022-04-08 13:58:26,662 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:58:26,662 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1733084778] [2022-04-08 13:58:26,662 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:58:26,662 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:58:26,673 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:58:26,674 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1480717978] [2022-04-08 13:58:26,674 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:58:26,674 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:58:26,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:58:26,678 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:58:26,679 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:58:26,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:58:26,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:58:26,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 13:58:26,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:58:26,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:58:26,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {2438#true} call ULTIMATE.init(); {2438#true} is VALID [2022-04-08 13:58:26,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {2438#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2438#true} is VALID [2022-04-08 13:58:26,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-08 13:58:26,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2438#true} {2438#true} #77#return; {2438#true} is VALID [2022-04-08 13:58:26,860 INFO L272 TraceCheckUtils]: 4: Hoare triple {2438#true} call #t~ret7 := main(); {2438#true} is VALID [2022-04-08 13:58:26,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {2438#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2438#true} is VALID [2022-04-08 13:58:26,861 INFO L272 TraceCheckUtils]: 6: Hoare triple {2438#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2438#true} is VALID [2022-04-08 13:58:26,861 INFO L290 TraceCheckUtils]: 7: Hoare triple {2438#true} ~cond := #in~cond; {2464#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 13:58:26,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {2464#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {2468#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 13:58:26,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {2468#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {2468#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 13:58:26,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2468#(not (= |assume_abort_if_not_#in~cond| 0))} {2438#true} #69#return; {2475#(<= 1 main_~y~0)} is VALID [2022-04-08 13:58:26,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {2475#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2479#(<= 1 main_~b~0)} is VALID [2022-04-08 13:58:26,863 INFO L290 TraceCheckUtils]: 12: Hoare triple {2479#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2479#(<= 1 main_~b~0)} is VALID [2022-04-08 13:58:26,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {2479#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {2479#(<= 1 main_~b~0)} is VALID [2022-04-08 13:58:26,863 INFO L272 TraceCheckUtils]: 14: Hoare triple {2479#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2438#true} is VALID [2022-04-08 13:58:26,863 INFO L290 TraceCheckUtils]: 15: Hoare triple {2438#true} ~cond := #in~cond; {2438#true} is VALID [2022-04-08 13:58:26,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {2438#true} assume !(0 == ~cond); {2438#true} is VALID [2022-04-08 13:58:26,863 INFO L290 TraceCheckUtils]: 17: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-08 13:58:26,864 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {2438#true} {2479#(<= 1 main_~b~0)} #71#return; {2479#(<= 1 main_~b~0)} is VALID [2022-04-08 13:58:26,864 INFO L290 TraceCheckUtils]: 19: Hoare triple {2479#(<= 1 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 13:58:26,864 INFO L272 TraceCheckUtils]: 20: Hoare triple {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {2438#true} is VALID [2022-04-08 13:58:26,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {2438#true} ~cond := #in~cond; {2438#true} is VALID [2022-04-08 13:58:26,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {2438#true} assume !(0 == ~cond); {2438#true} is VALID [2022-04-08 13:58:26,865 INFO L290 TraceCheckUtils]: 23: Hoare triple {2438#true} assume true; {2438#true} is VALID [2022-04-08 13:58:26,865 INFO L284 TraceCheckUtils]: 24: Hoare quadruple {2438#true} {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} #73#return; {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} is VALID [2022-04-08 13:58:26,866 INFO L272 TraceCheckUtils]: 25: Hoare triple {2504#(and (= main_~a~0 0) (<= 1 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:58:26,866 INFO L290 TraceCheckUtils]: 26: Hoare triple {2523#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {2527#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:58:26,866 INFO L290 TraceCheckUtils]: 27: Hoare triple {2527#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2439#false} is VALID [2022-04-08 13:58:26,866 INFO L290 TraceCheckUtils]: 28: Hoare triple {2439#false} assume !false; {2439#false} is VALID [2022-04-08 13:58:26,867 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:58:26,867 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:58:26,867 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:58:26,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1733084778] [2022-04-08 13:58:26,867 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:58:26,867 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1480717978] [2022-04-08 13:58:26,871 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1480717978] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:58:26,871 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:58:26,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 13:58:26,872 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:58:26,872 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1798502341] [2022-04-08 13:58:26,872 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1798502341] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:58:26,872 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:58:26,872 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 13:58:26,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [497864853] [2022-04-08 13:58:26,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:58:26,872 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-08 13:58:26,873 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:58:26,873 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:58:26,889 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:58:26,889 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 13:58:26,889 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:58:26,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 13:58:26,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-04-08 13:58:26,890 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:58:27,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:58:27,248 INFO L93 Difference]: Finished difference Result 85 states and 107 transitions. [2022-04-08 13:58:27,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-08 13:58:27,248 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 29 [2022-04-08 13:58:27,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:58:27,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:58:27,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-08 13:58:27,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:58:27,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 57 transitions. [2022-04-08 13:58:27,253 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 57 transitions. [2022-04-08 13:58:27,302 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:58:27,304 INFO L225 Difference]: With dead ends: 85 [2022-04-08 13:58:27,304 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 13:58:27,304 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=122, Unknown=0, NotChecked=0, Total=156 [2022-04-08 13:58:27,305 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 33 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:58:27,306 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 157 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 122 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:58:27,306 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 13:58:27,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 62. [2022-04-08 13:58:27,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:58:27,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 13:58:27,370 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 13:58:27,370 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 13:58:27,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:58:27,372 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-08 13:58:27,372 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-08 13:58:27,372 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:58:27,372 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:58:27,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-08 13:58:27,372 INFO L87 Difference]: Start difference. First operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-08 13:58:27,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:58:27,374 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-04-08 13:58:27,374 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 85 transitions. [2022-04-08 13:58:27,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:58:27,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:58:27,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:58:27,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:58:27,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 48 states have internal predecessors, (61), 11 states have call successors, (11), 6 states have call predecessors, (11), 5 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 13:58:27,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 80 transitions. [2022-04-08 13:58:27,376 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 80 transitions. Word has length 29 [2022-04-08 13:58:27,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:58:27,376 INFO L478 AbstractCegarLoop]: Abstraction has 62 states and 80 transitions. [2022-04-08 13:58:27,376 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.0) internal successors, (16), 7 states have internal predecessors, (16), 3 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:58:27,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 62 states and 80 transitions. [2022-04-08 13:58:29,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 79 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:58:29,460 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 80 transitions. [2022-04-08 13:58:29,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-04-08 13:58:29,463 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:58:29,463 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:58:29,481 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:58:29,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:58:29,667 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:58:29,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:58:29,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155568, now seen corresponding path program 1 times [2022-04-08 13:58:29,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:58:29,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [972787991] [2022-04-08 13:58:35,732 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:58:35,732 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:58:35,732 INFO L85 PathProgramCache]: Analyzing trace with hash -1357155568, now seen corresponding path program 2 times [2022-04-08 13:58:35,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:58:35,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85497682] [2022-04-08 13:58:35,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:58:35,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:58:35,742 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:58:35,742 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1959724085] [2022-04-08 13:58:35,742 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:58:35,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:58:35,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:58:35,743 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:58:35,744 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:58:35,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:58:35,788 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:58:35,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 24 conjunts are in the unsatisfiable core [2022-04-08 13:58:35,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:58:35,800 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:58:36,011 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-08 13:58:36,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2965#true} is VALID [2022-04-08 13:58:36,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-08 13:58:36,011 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #77#return; {2965#true} is VALID [2022-04-08 13:58:36,011 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret7 := main(); {2965#true} is VALID [2022-04-08 13:58:36,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2965#true} is VALID [2022-04-08 13:58:36,012 INFO L272 TraceCheckUtils]: 6: Hoare triple {2965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2965#true} is VALID [2022-04-08 13:58:36,012 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-08 13:58:36,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-08 13:58:36,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-08 13:58:36,012 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2965#true} {2965#true} #69#return; {2965#true} is VALID [2022-04-08 13:58:36,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:58:36,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:58:36,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:58:36,013 INFO L272 TraceCheckUtils]: 14: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2965#true} is VALID [2022-04-08 13:58:36,014 INFO L290 TraceCheckUtils]: 15: Hoare triple {2965#true} ~cond := #in~cond; {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:58:36,014 INFO L290 TraceCheckUtils]: 16: Hoare triple {3016#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:58:36,014 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:58:36,015 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:58:36,015 INFO L290 TraceCheckUtils]: 19: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:58:36,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:58:36,017 INFO L290 TraceCheckUtils]: 21: Hoare triple {3003#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-08 13:58:36,017 INFO L290 TraceCheckUtils]: 22: Hoare triple {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-08 13:58:36,018 INFO L290 TraceCheckUtils]: 23: Hoare triple {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} is VALID [2022-04-08 13:58:36,023 INFO L272 TraceCheckUtils]: 24: Hoare triple {3036#(and (= main_~b~0 main_~y~0) (= (+ main_~a~0 1) main_~x~0) (= 0 (+ main_~q~0 (* (- 1) main_~b~0 main_~p~0))) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:58:36,024 INFO L290 TraceCheckUtils]: 25: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:58:36,024 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2966#false} is VALID [2022-04-08 13:58:36,024 INFO L290 TraceCheckUtils]: 27: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-08 13:58:36,024 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:58:36,024 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:58:56,360 INFO L290 TraceCheckUtils]: 27: Hoare triple {2966#false} assume !false; {2966#false} is VALID [2022-04-08 13:58:56,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {3050#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {2966#false} is VALID [2022-04-08 13:58:56,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3050#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:58:56,362 INFO L272 TraceCheckUtils]: 24: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3046#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:58:56,362 INFO L290 TraceCheckUtils]: 23: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:58:56,363 INFO L290 TraceCheckUtils]: 22: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:58:56,369 INFO L290 TraceCheckUtils]: 21: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume 1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := ~a~0 - 1;~q~0 := ~q~0 + ~b~0 * ~p~0; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:58:56,369 INFO L290 TraceCheckUtils]: 20: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:58:56,370 INFO L290 TraceCheckUtils]: 19: Hoare triple {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:58:56,370 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} {2965#true} #71#return; {3066#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:58:56,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:58:56,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {3094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3020#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:58:56,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {2965#true} ~cond := #in~cond; {3094#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:58:56,371 INFO L272 TraceCheckUtils]: 14: Hoare triple {2965#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {2965#true} is VALID [2022-04-08 13:58:56,371 INFO L290 TraceCheckUtils]: 13: Hoare triple {2965#true} assume !!(#t~post6 < 20);havoc #t~post6; {2965#true} is VALID [2022-04-08 13:58:56,371 INFO L290 TraceCheckUtils]: 12: Hoare triple {2965#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L290 TraceCheckUtils]: 11: Hoare triple {2965#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2965#true} {2965#true} #69#return; {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L290 TraceCheckUtils]: 9: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L290 TraceCheckUtils]: 8: Hoare triple {2965#true} assume !(0 == ~cond); {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L290 TraceCheckUtils]: 7: Hoare triple {2965#true} ~cond := #in~cond; {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L272 TraceCheckUtils]: 6: Hoare triple {2965#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L290 TraceCheckUtils]: 5: Hoare triple {2965#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L272 TraceCheckUtils]: 4: Hoare triple {2965#true} call #t~ret7 := main(); {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2965#true} {2965#true} #77#return; {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L290 TraceCheckUtils]: 2: Hoare triple {2965#true} assume true; {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L290 TraceCheckUtils]: 1: Hoare triple {2965#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {2965#true} is VALID [2022-04-08 13:58:56,372 INFO L272 TraceCheckUtils]: 0: Hoare triple {2965#true} call ULTIMATE.init(); {2965#true} is VALID [2022-04-08 13:58:56,373 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:58:56,373 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:58:56,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85497682] [2022-04-08 13:58:56,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:58:56,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1959724085] [2022-04-08 13:58:56,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1959724085] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:58:56,373 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:58:56,373 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2022-04-08 13:58:56,373 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:58:56,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [972787991] [2022-04-08 13:58:56,373 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [972787991] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:58:56,374 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:58:56,374 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 13:58:56,374 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842800042] [2022-04-08 13:58:56,374 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:58:56,374 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-08 13:58:56,374 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:58:56,374 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:56,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:58:56,396 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 13:58:56,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:58:56,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 13:58:56,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:58:56,396 INFO L87 Difference]: Start difference. First operand 62 states and 80 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:56,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:58:56,825 INFO L93 Difference]: Finished difference Result 73 states and 94 transitions. [2022-04-08 13:58:56,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:58:56,826 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2022-04-08 13:58:56,826 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:58:56,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:56,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-08 13:58:56,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:56,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 60 transitions. [2022-04-08 13:58:56,828 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 60 transitions. [2022-04-08 13:58:56,883 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:58:56,884 INFO L225 Difference]: With dead ends: 73 [2022-04-08 13:58:56,884 INFO L226 Difference]: Without dead ends: 71 [2022-04-08 13:58:56,884 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-08 13:58:56,884 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-08 13:58:56,885 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 114 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-08 13:58:56,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2022-04-08 13:58:56,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 67. [2022-04-08 13:58:56,948 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:58:56,949 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:58:56,949 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:58:56,949 INFO L87 Difference]: Start difference. First operand 71 states. Second operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:58:56,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:58:56,951 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-04-08 13:58:56,951 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-04-08 13:58:56,952 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:58:56,952 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:58:56,952 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-08 13:58:56,952 INFO L87 Difference]: Start difference. First operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 71 states. [2022-04-08 13:58:56,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:58:56,954 INFO L93 Difference]: Finished difference Result 71 states and 92 transitions. [2022-04-08 13:58:56,954 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 92 transitions. [2022-04-08 13:58:56,954 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:58:56,954 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:58:56,954 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:58:56,954 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:58:56,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 48 states have (on average 1.3333333333333333) internal successors, (64), 52 states have internal predecessors, (64), 12 states have call successors, (12), 7 states have call predecessors, (12), 6 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 13:58:56,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 85 transitions. [2022-04-08 13:58:56,956 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 85 transitions. Word has length 28 [2022-04-08 13:58:56,956 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:58:56,956 INFO L478 AbstractCegarLoop]: Abstraction has 67 states and 85 transitions. [2022-04-08 13:58:56,957 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 states have internal predecessors, (20), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:58:56,957 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 67 states and 85 transitions. [2022-04-08 13:58:59,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 84 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:58:59,050 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 85 transitions. [2022-04-08 13:58:59,050 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 13:58:59,050 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:58:59,050 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:58:59,066 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 13:58:59,257 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:58:59,257 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:58:59,257 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:58:59,257 INFO L85 PathProgramCache]: Analyzing trace with hash -293334773, now seen corresponding path program 1 times [2022-04-08 13:58:59,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:58:59,258 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1951902860] [2022-04-08 13:59:04,773 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:59:04,773 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:59:04,773 INFO L85 PathProgramCache]: Analyzing trace with hash -293334773, now seen corresponding path program 2 times [2022-04-08 13:59:04,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:59:04,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1287949173] [2022-04-08 13:59:04,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:59:04,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:59:04,782 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:59:04,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1624307397] [2022-04-08 13:59:04,783 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:59:04,783 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:59:04,783 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:59:04,793 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:59:04,794 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:59:04,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:59:04,838 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:59:04,839 INFO L263 TraceCheckSpWp]: Trace formula consists of 112 conjuncts, 26 conjunts are in the unsatisfiable core [2022-04-08 13:59:04,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:59:04,859 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:59:05,086 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-08 13:59:05,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-08 13:59:05,087 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 13:59:05,087 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #77#return; {3568#true} is VALID [2022-04-08 13:59:05,087 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret7 := main(); {3568#true} is VALID [2022-04-08 13:59:05,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3568#true} is VALID [2022-04-08 13:59:05,087 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3568#true} is VALID [2022-04-08 13:59:05,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-08 13:59:05,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-08 13:59:05,087 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 13:59:05,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #69#return; {3568#true} is VALID [2022-04-08 13:59:05,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {3568#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,088 INFO L290 TraceCheckUtils]: 12: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,089 INFO L272 TraceCheckUtils]: 14: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3568#true} is VALID [2022-04-08 13:59:05,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {3568#true} ~cond := #in~cond; {3619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:59:05,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {3619#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:59:05,089 INFO L290 TraceCheckUtils]: 17: Hoare triple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:59:05,090 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,091 INFO L290 TraceCheckUtils]: 19: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {3606#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,094 INFO L290 TraceCheckUtils]: 24: Hoare triple {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:05,096 INFO L272 TraceCheckUtils]: 25: Hoare triple {3642#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (mod main_~a~0 2) 0) (= main_~a~0 main_~x~0) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0)) 0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:59:05,096 INFO L290 TraceCheckUtils]: 26: Hoare triple {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:59:05,097 INFO L290 TraceCheckUtils]: 27: Hoare triple {3656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3569#false} is VALID [2022-04-08 13:59:05,097 INFO L290 TraceCheckUtils]: 28: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-08 13:59:05,098 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:59:05,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:59:16,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-08 13:59:16,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {3656#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {3569#false} is VALID [2022-04-08 13:59:16,514 INFO L290 TraceCheckUtils]: 26: Hoare triple {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {3656#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:59:16,514 INFO L272 TraceCheckUtils]: 25: Hoare triple {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3652#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:59:16,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:16,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:16,531 INFO L290 TraceCheckUtils]: 22: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {3672#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:16,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-08 13:59:16,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-08 13:59:16,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} assume !!(0 != ~a~0 && 0 != ~b~0); {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-08 13:59:16,533 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} {3568#true} #71#return; {3682#(or (not (= (mod main_~a~0 2) 0)) (= (* main_~y~0 main_~x~0) (+ (* main_~a~0 main_~p~0) main_~q~0 (* main_~a~0 main_~p~0 (+ (- 1) main_~b~0)))))} is VALID [2022-04-08 13:59:16,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:59:16,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {3704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {3623#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:59:16,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {3568#true} ~cond := #in~cond; {3704#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 13:59:16,535 INFO L272 TraceCheckUtils]: 14: Hoare triple {3568#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L290 TraceCheckUtils]: 13: Hoare triple {3568#true} assume !!(#t~post6 < 20);havoc #t~post6; {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L290 TraceCheckUtils]: 12: Hoare triple {3568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L290 TraceCheckUtils]: 11: Hoare triple {3568#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #69#return; {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret7 := main(); {3568#true} is VALID [2022-04-08 13:59:16,535 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #77#return; {3568#true} is VALID [2022-04-08 13:59:16,536 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-08 13:59:16,536 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-08 13:59:16,536 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-08 13:59:16,536 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:59:16,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:59:16,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1287949173] [2022-04-08 13:59:16,536 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:59:16,536 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1624307397] [2022-04-08 13:59:16,536 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1624307397] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 13:59:16,536 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 13:59:16,536 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-04-08 13:59:16,537 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:59:16,537 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1951902860] [2022-04-08 13:59:16,537 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1951902860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:59:16,537 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:59:16,537 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 13:59:16,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635864523] [2022-04-08 13:59:16,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:59:16,538 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 13:59:16,538 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:59:16,538 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:59:16,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:59:16,560 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 13:59:16,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:59:16,560 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 13:59:16,560 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2022-04-08 13:59:16,561 INFO L87 Difference]: Start difference. First operand 67 states and 85 transitions. Second operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:59:17,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:59:17,353 INFO L93 Difference]: Finished difference Result 95 states and 125 transitions. [2022-04-08 13:59:17,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 13:59:17,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 29 [2022-04-08 13:59:17,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:59:17,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:59:17,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 13:59:17,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:59:17,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 84 transitions. [2022-04-08 13:59:17,356 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 84 transitions. [2022-04-08 13:59:17,438 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:59:17,440 INFO L225 Difference]: With dead ends: 95 [2022-04-08 13:59:17,440 INFO L226 Difference]: Without dead ends: 80 [2022-04-08 13:59:17,440 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-08 13:59:17,441 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-08 13:59:17,441 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 116 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-08 13:59:17,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-04-08 13:59:17,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2022-04-08 13:59:17,509 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:59:17,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 13:59:17,510 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 13:59:17,510 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 13:59:17,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:59:17,512 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 13:59:17,512 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 13:59:17,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:59:17,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:59:17,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-08 13:59:17,513 INFO L87 Difference]: Start difference. First operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 80 states. [2022-04-08 13:59:17,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:59:17,514 INFO L93 Difference]: Finished difference Result 80 states and 102 transitions. [2022-04-08 13:59:17,514 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 102 transitions. [2022-04-08 13:59:17,515 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:59:17,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:59:17,515 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:59:17,515 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:59:17,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 56 states have (on average 1.3214285714285714) internal successors, (74), 60 states have internal predecessors, (74), 13 states have call successors, (13), 8 states have call predecessors, (13), 7 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 13:59:17,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 97 transitions. [2022-04-08 13:59:17,519 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 97 transitions. Word has length 29 [2022-04-08 13:59:17,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:59:17,519 INFO L478 AbstractCegarLoop]: Abstraction has 77 states and 97 transitions. [2022-04-08 13:59:17,519 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.625) internal successors, (21), 7 states have internal predecessors, (21), 3 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-08 13:59:17,519 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 77 states and 97 transitions. [2022-04-08 13:59:19,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 96 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:59:19,631 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 97 transitions. [2022-04-08 13:59:19,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 13:59:19,631 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:59:19,631 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:59:19,649 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:59:19,831 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,SelfDestructingSolverStorable8 [2022-04-08 13:59:19,832 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:59:19,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:59:19,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1481672589, now seen corresponding path program 1 times [2022-04-08 13:59:19,832 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:59:19,832 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [370146385] [2022-04-08 13:59:25,089 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:59:25,089 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:59:25,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1481672589, now seen corresponding path program 2 times [2022-04-08 13:59:25,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:59:25,089 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [324177956] [2022-04-08 13:59:25,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:59:25,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:59:25,099 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:59:25,099 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [941580322] [2022-04-08 13:59:25,099 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:59:25,099 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:59:25,099 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:59:25,100 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:59:25,101 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:59:25,144 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:59:25,144 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:59:25,145 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 13:59:25,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:59:25,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:59:25,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4260#true} is VALID [2022-04-08 13:59:25,380 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4260#true} is VALID [2022-04-08 13:59:25,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-08 13:59:25,381 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #77#return; {4260#true} is VALID [2022-04-08 13:59:25,381 INFO L272 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret7 := main(); {4260#true} is VALID [2022-04-08 13:59:25,381 INFO L290 TraceCheckUtils]: 5: Hoare triple {4260#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4260#true} is VALID [2022-04-08 13:59:25,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {4260#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4260#true} is VALID [2022-04-08 13:59:25,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-08 13:59:25,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-08 13:59:25,381 INFO L290 TraceCheckUtils]: 9: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-08 13:59:25,381 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4260#true} {4260#true} #69#return; {4260#true} is VALID [2022-04-08 13:59:25,382 INFO L290 TraceCheckUtils]: 11: Hoare triple {4260#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,383 INFO L272 TraceCheckUtils]: 14: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4260#true} is VALID [2022-04-08 13:59:25,383 INFO L290 TraceCheckUtils]: 15: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-08 13:59:25,383 INFO L290 TraceCheckUtils]: 16: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-08 13:59:25,383 INFO L290 TraceCheckUtils]: 17: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-08 13:59:25,386 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4260#true} {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} #71#return; {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !!(0 != ~a~0 && 0 != ~b~0); {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,387 INFO L290 TraceCheckUtils]: 20: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,387 INFO L290 TraceCheckUtils]: 21: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {4298#(and (= main_~b~0 main_~y~0) (= main_~q~0 0) (= main_~a~0 main_~x~0) (= main_~p~0 1))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,388 INFO L290 TraceCheckUtils]: 23: Hoare triple {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,389 INFO L290 TraceCheckUtils]: 24: Hoare triple {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} is VALID [2022-04-08 13:59:25,392 INFO L272 TraceCheckUtils]: 25: Hoare triple {4332#(and (= main_~b~0 (+ (- 1) main_~y~0)) (= (+ main_~q~0 (* (- 1) main_~a~0 main_~p~0) (* (- 1) main_~b~0 main_~p~0) (* (- 1) main_~p~0)) 0) (= (+ (- 1) main_~x~0) main_~a~0) (= main_~p~0 1))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:59:25,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:59:25,392 INFO L290 TraceCheckUtils]: 27: Hoare triple {4346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4261#false} is VALID [2022-04-08 13:59:25,392 INFO L290 TraceCheckUtils]: 28: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2022-04-08 13:59:25,393 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 13:59:25,393 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 13:59:25,519 INFO L290 TraceCheckUtils]: 28: Hoare triple {4261#false} assume !false; {4261#false} is VALID [2022-04-08 13:59:25,519 INFO L290 TraceCheckUtils]: 27: Hoare triple {4346#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {4261#false} is VALID [2022-04-08 13:59:25,519 INFO L290 TraceCheckUtils]: 26: Hoare triple {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {4346#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:59:25,520 INFO L272 TraceCheckUtils]: 25: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4342#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:59:25,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,521 INFO L290 TraceCheckUtils]: 23: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(0 != ~a~0 && 0 != ~b~0); {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,526 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4260#true} {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #71#return; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,526 INFO L290 TraceCheckUtils]: 17: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-08 13:59:25,526 INFO L290 TraceCheckUtils]: 16: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-08 13:59:25,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-08 13:59:25,527 INFO L272 TraceCheckUtils]: 14: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4260#true} is VALID [2022-04-08 13:59:25,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} assume !!(#t~post6 < 20);havoc #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {4260#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4362#(= (+ main_~q~0 (* main_~b~0 main_~a~0 main_~p~0)) (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:25,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4260#true} {4260#true} #69#return; {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {4260#true} assume !(0 == ~cond); {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {4260#true} ~cond := #in~cond; {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L272 TraceCheckUtils]: 6: Hoare triple {4260#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L290 TraceCheckUtils]: 5: Hoare triple {4260#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L272 TraceCheckUtils]: 4: Hoare triple {4260#true} call #t~ret7 := main(); {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4260#true} {4260#true} #77#return; {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {4260#true} assume true; {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {4260#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4260#true} is VALID [2022-04-08 13:59:25,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {4260#true} call ULTIMATE.init(); {4260#true} is VALID [2022-04-08 13:59:25,529 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-04-08 13:59:25,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:59:25,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [324177956] [2022-04-08 13:59:25,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:59:25,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [941580322] [2022-04-08 13:59:25,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [941580322] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 13:59:25,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 13:59:25,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [6] total 7 [2022-04-08 13:59:25,529 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:59:25,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [370146385] [2022-04-08 13:59:25,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [370146385] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:59:25,529 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:59:25,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 13:59:25,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083554325] [2022-04-08 13:59:25,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:59:25,530 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2022-04-08 13:59:25,530 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:59:25,530 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:59:25,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:59:25,549 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 13:59:25,550 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:59:25,550 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 13:59:25,550 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-04-08 13:59:25,550 INFO L87 Difference]: Start difference. First operand 77 states and 97 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:59:25,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:59:25,814 INFO L93 Difference]: Finished difference Result 83 states and 102 transitions. [2022-04-08 13:59:25,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 13:59:25,814 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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 29 [2022-04-08 13:59:25,815 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:59:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:59:25,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 13:59:25,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:59:25,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 38 transitions. [2022-04-08 13:59:25,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 38 transitions. [2022-04-08 13:59:25,878 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:59:25,880 INFO L225 Difference]: With dead ends: 83 [2022-04-08 13:59:25,880 INFO L226 Difference]: Without dead ends: 81 [2022-04-08 13:59:25,880 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 50 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:59:25,880 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 7 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 48 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:59:25,881 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 72 Invalid, 48 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:59:25,881 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-04-08 13:59:25,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2022-04-08 13:59:25,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:59:25,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 13:59:25,961 INFO L74 IsIncluded]: Start isIncluded. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 13:59:25,961 INFO L87 Difference]: Start difference. First operand 81 states. Second operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 13:59:25,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:59:25,963 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 13:59:25,963 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 13:59:25,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:59:25,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:59:25,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 81 states. [2022-04-08 13:59:25,963 INFO L87 Difference]: Start difference. First operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) Second operand 81 states. [2022-04-08 13:59:25,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:59:25,964 INFO L93 Difference]: Finished difference Result 81 states and 100 transitions. [2022-04-08 13:59:25,964 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 13:59:25,965 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:59:25,965 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:59:25,965 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:59:25,965 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:59:25,965 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 59 states have (on average 1.305084745762712) internal successors, (77), 63 states have internal predecessors, (77), 13 states have call successors, (13), 9 states have call predecessors, (13), 8 states have return successors, (10), 8 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 13:59:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 100 transitions. [2022-04-08 13:59:25,966 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 100 transitions. Word has length 29 [2022-04-08 13:59:25,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:59:25,966 INFO L478 AbstractCegarLoop]: Abstraction has 81 states and 100 transitions. [2022-04-08 13:59:25,967 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 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:59:25,967 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 81 states and 100 transitions. [2022-04-08 13:59:28,278 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 99 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:59:28,278 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 100 transitions. [2022-04-08 13:59:28,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-04-08 13:59:28,278 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:59:28,278 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:59:28,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 13:59:28,487 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,SelfDestructingSolverStorable9 [2022-04-08 13:59:28,487 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:59:28,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:59:28,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 1 times [2022-04-08 13:59:28,488 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:59:28,488 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1099740414] [2022-04-08 13:59:34,538 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:59:34,539 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:59:34,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1680888588, now seen corresponding path program 2 times [2022-04-08 13:59:34,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:59:34,539 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1966441871] [2022-04-08 13:59:34,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:59:34,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:59:34,548 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:59:34,549 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2112687295] [2022-04-08 13:59:34,549 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:59:34,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:59:34,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:59:34,550 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:59:34,553 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:59:34,587 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:59:34,587 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:59:34,588 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 14 conjunts are in the unsatisfiable core [2022-04-08 13:59:34,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:59:34,597 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:59:34,918 INFO L272 TraceCheckUtils]: 0: Hoare triple {4932#true} call ULTIMATE.init(); {4932#true} is VALID [2022-04-08 13:59:34,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {4932#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {4932#true} is VALID [2022-04-08 13:59:34,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {4932#true} assume true; {4932#true} is VALID [2022-04-08 13:59:34,918 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4932#true} {4932#true} #77#return; {4932#true} is VALID [2022-04-08 13:59:34,918 INFO L272 TraceCheckUtils]: 4: Hoare triple {4932#true} call #t~ret7 := main(); {4932#true} is VALID [2022-04-08 13:59:34,918 INFO L290 TraceCheckUtils]: 5: Hoare triple {4932#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {4932#true} is VALID [2022-04-08 13:59:34,919 INFO L272 TraceCheckUtils]: 6: Hoare triple {4932#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {4932#true} is VALID [2022-04-08 13:59:34,919 INFO L290 TraceCheckUtils]: 7: Hoare triple {4932#true} ~cond := #in~cond; {4958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 13:59:34,919 INFO L290 TraceCheckUtils]: 8: Hoare triple {4958#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {4962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 13:59:34,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {4962#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {4962#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 13:59:34,920 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4962#(not (= |assume_abort_if_not_#in~cond| 0))} {4932#true} #69#return; {4969#(<= 1 main_~y~0)} is VALID [2022-04-08 13:59:34,920 INFO L290 TraceCheckUtils]: 11: Hoare triple {4969#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {4973#(<= 1 main_~b~0)} is VALID [2022-04-08 13:59:34,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {4973#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4973#(<= 1 main_~b~0)} is VALID [2022-04-08 13:59:34,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {4973#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {4973#(<= 1 main_~b~0)} is VALID [2022-04-08 13:59:34,921 INFO L272 TraceCheckUtils]: 14: Hoare triple {4973#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4932#true} is VALID [2022-04-08 13:59:34,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {4932#true} ~cond := #in~cond; {4932#true} is VALID [2022-04-08 13:59:34,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {4932#true} assume !(0 == ~cond); {4932#true} is VALID [2022-04-08 13:59:34,921 INFO L290 TraceCheckUtils]: 17: Hoare triple {4932#true} assume true; {4932#true} is VALID [2022-04-08 13:59:34,922 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {4932#true} {4973#(<= 1 main_~b~0)} #71#return; {4973#(<= 1 main_~b~0)} is VALID [2022-04-08 13:59:34,922 INFO L290 TraceCheckUtils]: 19: Hoare triple {4973#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-08 13:59:34,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-08 13:59:34,924 INFO L290 TraceCheckUtils]: 21: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-08 13:59:34,924 INFO L290 TraceCheckUtils]: 22: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !!(#t~post6 < 20);havoc #t~post6; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-08 13:59:34,924 INFO L272 TraceCheckUtils]: 23: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {4932#true} is VALID [2022-04-08 13:59:34,924 INFO L290 TraceCheckUtils]: 24: Hoare triple {4932#true} ~cond := #in~cond; {4932#true} is VALID [2022-04-08 13:59:34,934 INFO L290 TraceCheckUtils]: 25: Hoare triple {4932#true} assume !(0 == ~cond); {4932#true} is VALID [2022-04-08 13:59:34,934 INFO L290 TraceCheckUtils]: 26: Hoare triple {4932#true} assume true; {4932#true} is VALID [2022-04-08 13:59:34,936 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {4932#true} {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} #71#return; {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} is VALID [2022-04-08 13:59:34,936 INFO L290 TraceCheckUtils]: 28: Hoare triple {4998#(and (not (= main_~a~0 0)) (<= 1 main_~b~0))} assume !(0 != ~a~0 && 0 != ~b~0); {4933#false} is VALID [2022-04-08 13:59:34,936 INFO L272 TraceCheckUtils]: 29: Hoare triple {4933#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {4933#false} is VALID [2022-04-08 13:59:34,936 INFO L290 TraceCheckUtils]: 30: Hoare triple {4933#false} ~cond := #in~cond; {4933#false} is VALID [2022-04-08 13:59:34,936 INFO L290 TraceCheckUtils]: 31: Hoare triple {4933#false} assume 0 == ~cond; {4933#false} is VALID [2022-04-08 13:59:34,937 INFO L290 TraceCheckUtils]: 32: Hoare triple {4933#false} assume !false; {4933#false} is VALID [2022-04-08 13:59:34,937 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 13:59:34,937 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 13:59:34,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 13:59:34,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1966441871] [2022-04-08 13:59:34,937 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 13:59:34,937 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2112687295] [2022-04-08 13:59:34,937 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2112687295] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:59:34,937 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:59:34,937 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:59:34,937 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 13:59:34,938 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1099740414] [2022-04-08 13:59:34,938 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1099740414] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 13:59:34,938 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 13:59:34,938 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 13:59:34,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [292227916] [2022-04-08 13:59:34,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 13:59:34,941 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-08 13:59:34,941 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 13:59:34,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:59:34,960 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:59:34,960 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 13:59:34,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 13:59:34,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 13:59:34,961 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-04-08 13:59:34,961 INFO L87 Difference]: Start difference. First operand 81 states and 100 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:59:35,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:59:35,260 INFO L93 Difference]: Finished difference Result 97 states and 121 transitions. [2022-04-08 13:59:35,260 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-08 13:59:35,260 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 33 [2022-04-08 13:59:35,260 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 13:59:35,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:59:35,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 13:59:35,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:59:35,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 65 transitions. [2022-04-08 13:59:35,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 65 transitions. [2022-04-08 13:59:35,311 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 13:59:35,312 INFO L225 Difference]: With dead ends: 97 [2022-04-08 13:59:35,312 INFO L226 Difference]: Without dead ends: 90 [2022-04-08 13:59:35,313 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=64, Unknown=0, NotChecked=0, Total=90 [2022-04-08 13:59:35,313 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 30 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 13:59:35,313 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 115 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 13:59:35,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2022-04-08 13:59:35,387 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 85. [2022-04-08 13:59:35,387 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 13:59:35,387 INFO L82 GeneralOperation]: Start isEquivalent. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 13:59:35,388 INFO L74 IsIncluded]: Start isIncluded. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 13:59:35,388 INFO L87 Difference]: Start difference. First operand 90 states. Second operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 13:59:35,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:59:35,390 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-08 13:59:35,390 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-08 13:59:35,390 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:59:35,390 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:59:35,390 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 90 states. [2022-04-08 13:59:35,390 INFO L87 Difference]: Start difference. First operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) Second operand 90 states. [2022-04-08 13:59:35,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 13:59:35,392 INFO L93 Difference]: Finished difference Result 90 states and 114 transitions. [2022-04-08 13:59:35,392 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 114 transitions. [2022-04-08 13:59:35,392 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 13:59:35,392 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 13:59:35,392 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 13:59:35,392 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 13:59:35,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 66 states have internal predecessors, (81), 14 states have call successors, (14), 9 states have call predecessors, (14), 8 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 13:59:35,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 106 transitions. [2022-04-08 13:59:35,394 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 106 transitions. Word has length 33 [2022-04-08 13:59:35,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 13:59:35,395 INFO L478 AbstractCegarLoop]: Abstraction has 85 states and 106 transitions. [2022-04-08 13:59:35,395 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 6 states have internal predecessors, (20), 4 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-08 13:59:35,395 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 85 states and 106 transitions. [2022-04-08 13:59:37,693 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 105 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 13:59:37,693 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 106 transitions. [2022-04-08 13:59:37,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 13:59:37,694 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 13:59:37,694 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 13:59:37,713 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 13:59:37,896 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,SelfDestructingSolverStorable10 [2022-04-08 13:59:37,896 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 13:59:37,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 13:59:37,896 INFO L85 PathProgramCache]: Analyzing trace with hash 368374993, now seen corresponding path program 1 times [2022-04-08 13:59:37,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 13:59:37,897 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1377852850] [2022-04-08 13:59:43,948 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 13:59:43,948 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 13:59:43,948 INFO L85 PathProgramCache]: Analyzing trace with hash 368374993, now seen corresponding path program 2 times [2022-04-08 13:59:43,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 13:59:43,948 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [592216995] [2022-04-08 13:59:43,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 13:59:43,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 13:59:43,957 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 13:59:43,957 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1482355516] [2022-04-08 13:59:43,958 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 13:59:43,958 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 13:59:43,958 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 13:59:43,958 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:59:43,959 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:59:43,992 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 13:59:43,992 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 13:59:43,993 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 13:59:43,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 13:59:44,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 13:59:54,153 INFO L272 TraceCheckUtils]: 0: Hoare triple {5587#true} call ULTIMATE.init(); {5587#true} is VALID [2022-04-08 13:59:54,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {5587#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5587#true} is VALID [2022-04-08 13:59:54,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-08 13:59:54,153 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5587#true} {5587#true} #77#return; {5587#true} is VALID [2022-04-08 13:59:54,153 INFO L272 TraceCheckUtils]: 4: Hoare triple {5587#true} call #t~ret7 := main(); {5587#true} is VALID [2022-04-08 13:59:54,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {5587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L272 TraceCheckUtils]: 6: Hoare triple {5587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L290 TraceCheckUtils]: 9: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5587#true} {5587#true} #69#return; {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L290 TraceCheckUtils]: 11: Hoare triple {5587#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L290 TraceCheckUtils]: 12: Hoare triple {5587#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {5587#true} assume !!(#t~post6 < 20);havoc #t~post6; {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L272 TraceCheckUtils]: 14: Hoare triple {5587#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L290 TraceCheckUtils]: 15: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L290 TraceCheckUtils]: 16: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-08 13:59:54,154 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5587#true} {5587#true} #71#return; {5587#true} is VALID [2022-04-08 13:59:54,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {5587#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5649#(not (= main_~a~0 0))} is VALID [2022-04-08 13:59:54,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {5649#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5649#(not (= main_~a~0 0))} is VALID [2022-04-08 13:59:54,156 INFO L290 TraceCheckUtils]: 21: Hoare triple {5649#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5649#(not (= main_~a~0 0))} is VALID [2022-04-08 13:59:54,156 INFO L290 TraceCheckUtils]: 22: Hoare triple {5649#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5649#(not (= main_~a~0 0))} is VALID [2022-04-08 13:59:54,156 INFO L290 TraceCheckUtils]: 23: Hoare triple {5649#(not (= main_~a~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5649#(not (= main_~a~0 0))} is VALID [2022-04-08 13:59:54,156 INFO L290 TraceCheckUtils]: 24: Hoare triple {5649#(not (= main_~a~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {5649#(not (= main_~a~0 0))} is VALID [2022-04-08 13:59:54,157 INFO L272 TraceCheckUtils]: 25: Hoare triple {5649#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-08 13:59:54,157 INFO L290 TraceCheckUtils]: 26: Hoare triple {5587#true} ~cond := #in~cond; {5671#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:59:54,157 INFO L290 TraceCheckUtils]: 27: Hoare triple {5671#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:59:54,157 INFO L290 TraceCheckUtils]: 28: Hoare triple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 13:59:56,160 WARN L284 TraceCheckUtils]: 29: Hoare quadruple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} {5649#(not (= main_~a~0 0))} #71#return; {5682#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} is UNKNOWN [2022-04-08 13:59:56,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {5682#(and (or (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0))) (= (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) 0)) (not (= main_~a~0 0)))} assume !(0 != ~a~0 && 0 != ~b~0); {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-08 13:59:56,161 INFO L272 TraceCheckUtils]: 31: Hoare triple {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 13:59:56,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5694#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 13:59:56,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {5694#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5588#false} is VALID [2022-04-08 13:59:56,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {5588#false} assume !false; {5588#false} is VALID [2022-04-08 13:59:56,162 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 10 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-04-08 13:59:56,162 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:00:10,685 INFO L290 TraceCheckUtils]: 34: Hoare triple {5588#false} assume !false; {5588#false} is VALID [2022-04-08 14:00:10,685 INFO L290 TraceCheckUtils]: 33: Hoare triple {5694#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {5588#false} is VALID [2022-04-08 14:00:10,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {5694#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:00:10,686 INFO L272 TraceCheckUtils]: 31: Hoare triple {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {5690#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:00:10,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {5713#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {5686#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-08 14:00:10,688 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} {5587#true} #71#return; {5713#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-08 14:00:10,688 INFO L290 TraceCheckUtils]: 28: Hoare triple {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:00:10,689 INFO L290 TraceCheckUtils]: 27: Hoare triple {5726#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {5675#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:00:10,689 INFO L290 TraceCheckUtils]: 26: Hoare triple {5587#true} ~cond := #in~cond; {5726#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:00:10,689 INFO L272 TraceCheckUtils]: 25: Hoare triple {5587#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-08 14:00:10,689 INFO L290 TraceCheckUtils]: 24: Hoare triple {5587#true} assume !!(#t~post6 < 20);havoc #t~post6; {5587#true} is VALID [2022-04-08 14:00:10,689 INFO L290 TraceCheckUtils]: 23: Hoare triple {5587#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5587#true} is VALID [2022-04-08 14:00:10,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {5587#true} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {5587#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {5587#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 19: Hoare triple {5587#true} assume !!(0 != ~a~0 && 0 != ~b~0); {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {5587#true} {5587#true} #71#return; {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 15: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L272 TraceCheckUtils]: 14: Hoare triple {5587#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 13: Hoare triple {5587#true} assume !!(#t~post6 < 20);havoc #t~post6; {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 12: Hoare triple {5587#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 11: Hoare triple {5587#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5587#true} {5587#true} #69#return; {5587#true} is VALID [2022-04-08 14:00:10,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {5587#true} assume !(0 == ~cond); {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {5587#true} ~cond := #in~cond; {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {5587#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {5587#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L272 TraceCheckUtils]: 4: Hoare triple {5587#true} call #t~ret7 := main(); {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5587#true} {5587#true} #77#return; {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L290 TraceCheckUtils]: 2: Hoare triple {5587#true} assume true; {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L290 TraceCheckUtils]: 1: Hoare triple {5587#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L272 TraceCheckUtils]: 0: Hoare triple {5587#true} call ULTIMATE.init(); {5587#true} is VALID [2022-04-08 14:00:10,691 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:00:10,691 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:00:10,691 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [592216995] [2022-04-08 14:00:10,692 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:00:10,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1482355516] [2022-04-08 14:00:10,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1482355516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:00:10,692 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:00:10,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2022-04-08 14:00:10,692 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:00:10,692 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1377852850] [2022-04-08 14:00:10,692 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1377852850] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:00:10,692 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:00:10,692 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:00:10,692 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1887124662] [2022-04-08 14:00:10,692 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:00:10,693 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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 35 [2022-04-08 14:00:10,693 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:00:10,693 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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 14:00:12,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 34 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:00:12,716 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:00:12,716 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:00:12,717 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:00:12,717 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-04-08 14:00:12,717 INFO L87 Difference]: Start difference. First operand 85 states and 106 transitions. Second operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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 14:00:15,299 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 14:00:16,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:00:16,462 INFO L93 Difference]: Finished difference Result 103 states and 133 transitions. [2022-04-08 14:00:16,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:00:16,463 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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 35 [2022-04-08 14:00:16,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:00:16,463 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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 14:00:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-08 14:00:16,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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 14:00:16,464 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 56 transitions. [2022-04-08 14:00:16,464 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 56 transitions. [2022-04-08 14:00:18,507 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 55 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:00:18,508 INFO L225 Difference]: With dead ends: 103 [2022-04-08 14:00:18,508 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 14:00:18,509 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 59 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=137, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:00:18,509 INFO L913 BasicCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 8 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2022-04-08 14:00:18,509 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 125 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 147 Invalid, 1 Unknown, 0 Unchecked, 2.9s Time] [2022-04-08 14:00:18,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 14:00:18,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 94. [2022-04-08 14:00:18,588 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:00:18,588 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:00:18,588 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:00:18,588 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:00:18,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:00:18,590 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-08 14:00:18,590 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2022-04-08 14:00:18,590 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:00:18,590 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:00:18,590 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 101 states. [2022-04-08 14:00:18,591 INFO L87 Difference]: Start difference. First operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) Second operand 101 states. [2022-04-08 14:00:18,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:00:18,592 INFO L93 Difference]: Finished difference Result 101 states and 131 transitions. [2022-04-08 14:00:18,592 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 131 transitions. [2022-04-08 14:00:18,593 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:00:18,593 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:00:18,593 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:00:18,593 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:00:18,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 68 states have (on average 1.3088235294117647) internal successors, (89), 73 states have internal predecessors, (89), 16 states have call successors, (16), 10 states have call predecessors, (16), 9 states have return successors, (13), 10 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:00:18,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 118 transitions. [2022-04-08 14:00:18,594 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 118 transitions. Word has length 35 [2022-04-08 14:00:18,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:00:18,594 INFO L478 AbstractCegarLoop]: Abstraction has 94 states and 118 transitions. [2022-04-08 14:00:18,595 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.125) internal successors, (25), 7 states have internal predecessors, (25), 3 states have call successors, (6), 2 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 14:00:18,595 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 94 states and 118 transitions. [2022-04-08 14:00:24,911 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 115 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 14:00:24,912 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 118 transitions. [2022-04-08 14:00:24,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-08 14:00:24,912 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:00:24,912 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:00:24,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 14:00:25,119 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,SelfDestructingSolverStorable11 [2022-04-08 14:00:25,121 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:00:25,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:00:25,122 INFO L85 PathProgramCache]: Analyzing trace with hash -218431021, now seen corresponding path program 1 times [2022-04-08 14:00:25,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:00:25,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1179055378] [2022-04-08 14:00:31,171 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:00:31,171 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:00:31,171 INFO L85 PathProgramCache]: Analyzing trace with hash -218431021, now seen corresponding path program 2 times [2022-04-08 14:00:31,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:00:31,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1921628203] [2022-04-08 14:00:31,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:00:31,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:00:31,180 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:00:31,180 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1998297023] [2022-04-08 14:00:31,180 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:00:31,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:00:31,181 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:00:31,181 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 14:00:31,191 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 14:00:31,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:00:31,236 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:00:31,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:00:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:00:31,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:00:41,200 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-08 14:00:41,200 INFO L290 TraceCheckUtils]: 1: Hoare triple {6409#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6409#true} is VALID [2022-04-08 14:00:41,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-08 14:00:41,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #77#return; {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret7 := main(); {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {6409#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #69#return; {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {6409#true} assume !!(#t~post6 < 20);havoc #t~post6; {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L272 TraceCheckUtils]: 14: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-08 14:00:41,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6409#true} {6409#true} #71#return; {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} assume !!(#t~post6 < 20);havoc #t~post6; {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L272 TraceCheckUtils]: 25: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-08 14:00:41,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} ~cond := #in~cond; {6492#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:00:41,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {6492#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:00:41,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:00:43,206 WARN L284 TraceCheckUtils]: 29: Hoare quadruple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} {6409#true} #71#return; {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is UNKNOWN [2022-04-08 14:00:43,207 INFO L290 TraceCheckUtils]: 30: Hoare triple {6503#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (= (mod (+ (* main_~y~0 main_~x~0) (* (- 1) main_~q~0)) (* main_~b~0 main_~a~0)) 0) (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-08 14:00:43,207 INFO L272 TraceCheckUtils]: 31: Hoare triple {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:00:43,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:00:43,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {6515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-08 14:00:43,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-08 14:00:43,208 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:00:43,208 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:00:55,759 INFO L290 TraceCheckUtils]: 34: Hoare triple {6410#false} assume !false; {6410#false} is VALID [2022-04-08 14:00:55,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {6515#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {6410#false} is VALID [2022-04-08 14:00:55,760 INFO L290 TraceCheckUtils]: 32: Hoare triple {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {6515#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:00:55,760 INFO L272 TraceCheckUtils]: 31: Hoare triple {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {6511#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:00:55,761 INFO L290 TraceCheckUtils]: 30: Hoare triple {6534#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} assume !(0 != ~a~0 && 0 != ~b~0); {6507#(= main_~q~0 (* main_~y~0 main_~x~0))} is VALID [2022-04-08 14:00:55,763 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} {6409#true} #71#return; {6534#(or (= main_~q~0 (* main_~y~0 main_~x~0)) (and (not (= main_~b~0 0)) (not (= main_~a~0 0))))} is VALID [2022-04-08 14:00:55,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:00:55,763 INFO L290 TraceCheckUtils]: 27: Hoare triple {6547#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {6496#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-08 14:00:55,764 INFO L290 TraceCheckUtils]: 26: Hoare triple {6409#true} ~cond := #in~cond; {6547#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-08 14:00:55,764 INFO L272 TraceCheckUtils]: 25: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-08 14:00:55,764 INFO L290 TraceCheckUtils]: 24: Hoare triple {6409#true} assume !!(#t~post6 < 20);havoc #t~post6; {6409#true} is VALID [2022-04-08 14:00:55,764 INFO L290 TraceCheckUtils]: 23: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-08 14:00:55,764 INFO L290 TraceCheckUtils]: 22: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {6409#true} is VALID [2022-04-08 14:00:55,764 INFO L290 TraceCheckUtils]: 21: Hoare triple {6409#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-08 14:00:55,764 INFO L290 TraceCheckUtils]: 20: Hoare triple {6409#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {6409#true} is VALID [2022-04-08 14:00:55,764 INFO L290 TraceCheckUtils]: 19: Hoare triple {6409#true} assume !!(0 != ~a~0 && 0 != ~b~0); {6409#true} is VALID [2022-04-08 14:00:55,764 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {6409#true} {6409#true} #71#return; {6409#true} is VALID [2022-04-08 14:00:55,764 INFO L290 TraceCheckUtils]: 17: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L290 TraceCheckUtils]: 15: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L272 TraceCheckUtils]: 14: Hoare triple {6409#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {6409#true} assume !!(#t~post6 < 20);havoc #t~post6; {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {6409#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {6409#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6409#true} {6409#true} #69#return; {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {6409#true} assume !(0 == ~cond); {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {6409#true} ~cond := #in~cond; {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L272 TraceCheckUtils]: 6: Hoare triple {6409#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L290 TraceCheckUtils]: 5: Hoare triple {6409#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {6409#true} call #t~ret7 := main(); {6409#true} is VALID [2022-04-08 14:00:55,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6409#true} {6409#true} #77#return; {6409#true} is VALID [2022-04-08 14:00:55,766 INFO L290 TraceCheckUtils]: 2: Hoare triple {6409#true} assume true; {6409#true} is VALID [2022-04-08 14:00:55,766 INFO L290 TraceCheckUtils]: 1: Hoare triple {6409#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {6409#true} is VALID [2022-04-08 14:00:55,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {6409#true} call ULTIMATE.init(); {6409#true} is VALID [2022-04-08 14:00:55,766 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:00:55,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:00:55,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1921628203] [2022-04-08 14:00:55,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:00:55,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1998297023] [2022-04-08 14:00:55,766 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1998297023] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:00:55,766 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:00:55,766 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 14:00:55,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:00:55,767 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1179055378] [2022-04-08 14:00:55,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1179055378] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:00:55,767 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:00:55,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:00:55,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25104664] [2022-04-08 14:00:55,767 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:00:55,767 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-08 14:00:55,767 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:00:55,767 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:00:57,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 31 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:00:57,795 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:00:57,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:00:57,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:00:57,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:00:57,796 INFO L87 Difference]: Start difference. First operand 94 states and 118 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:01:00,412 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 14:01:05,677 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.70s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 14:01:05,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:05,829 INFO L93 Difference]: Finished difference Result 101 states and 125 transitions. [2022-04-08 14:01:05,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:01:05,829 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 35 [2022-04-08 14:01:05,829 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:01:05,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:01:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-08 14:01:05,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:01:05,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 44 transitions. [2022-04-08 14:01:05,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 44 transitions. [2022-04-08 14:01:07,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 43 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 14:01:07,869 INFO L225 Difference]: With dead ends: 101 [2022-04-08 14:01:07,869 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 14:01:07,869 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 60 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=95, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:01:07,870 INFO L913 BasicCegarLoop]: 22 mSDtfsCounter, 15 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 113 mSolverCounterSat, 3 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 113 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 4.4s IncrementalHoareTripleChecker+Time [2022-04-08 14:01:07,870 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 121 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 113 Invalid, 1 Unknown, 0 Unchecked, 4.4s Time] [2022-04-08 14:01:07,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 14:01:07,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 72. [2022-04-08 14:01:07,935 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:01:07,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:01:07,935 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:01:07,935 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:01:07,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:07,937 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-04-08 14:01:07,937 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-04-08 14:01:07,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:07,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:07,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 98 states. [2022-04-08 14:01:07,938 INFO L87 Difference]: Start difference. First operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) Second operand 98 states. [2022-04-08 14:01:07,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:07,939 INFO L93 Difference]: Finished difference Result 98 states and 121 transitions. [2022-04-08 14:01:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 121 transitions. [2022-04-08 14:01:07,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:07,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:07,940 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:01:07,940 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:01:07,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 52 states have (on average 1.2692307692307692) internal successors, (66), 55 states have internal predecessors, (66), 11 states have call successors, (11), 9 states have call predecessors, (11), 8 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:01:07,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 86 transitions. [2022-04-08 14:01:07,941 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 86 transitions. Word has length 35 [2022-04-08 14:01:07,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:01:07,941 INFO L478 AbstractCegarLoop]: Abstraction has 72 states and 86 transitions. [2022-04-08 14:01:07,941 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 6 states have internal predecessors, (23), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-08 14:01:07,941 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 72 states and 86 transitions. [2022-04-08 14:01:12,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 84 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 14:01:12,234 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 86 transitions. [2022-04-08 14:01:12,234 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-04-08 14:01:12,234 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:01:12,234 INFO L499 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:01:12,250 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 14:01:12,437 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,SelfDestructingSolverStorable12 [2022-04-08 14:01:12,437 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:01:12,437 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:01:12,437 INFO L85 PathProgramCache]: Analyzing trace with hash 604176890, now seen corresponding path program 3 times [2022-04-08 14:01:12,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:01:12,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [526105599] [2022-04-08 14:01:18,501 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:01:18,501 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:01:18,501 INFO L85 PathProgramCache]: Analyzing trace with hash 604176890, now seen corresponding path program 4 times [2022-04-08 14:01:18,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:01:18,502 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824739555] [2022-04-08 14:01:18,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:01:18,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:01:18,510 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:01:18,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1755720318] [2022-04-08 14:01:18,510 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:01:18,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:01:18,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:01:18,511 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 14:01:18,511 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 14:01:18,549 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:01:18,549 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:01:18,550 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 14:01:18,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:01:18,558 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:01:18,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {7174#true} call ULTIMATE.init(); {7174#true} is VALID [2022-04-08 14:01:18,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {7174#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {7182#(<= ~counter~0 0)} assume true; {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,698 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7182#(<= ~counter~0 0)} {7174#true} #77#return; {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,699 INFO L272 TraceCheckUtils]: 4: Hoare triple {7182#(<= ~counter~0 0)} call #t~ret7 := main(); {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {7182#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,699 INFO L272 TraceCheckUtils]: 6: Hoare triple {7182#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {7182#(<= ~counter~0 0)} ~cond := #in~cond; {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {7182#(<= ~counter~0 0)} assume !(0 == ~cond); {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#(<= ~counter~0 0)} assume true; {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,701 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7182#(<= ~counter~0 0)} {7182#(<= ~counter~0 0)} #69#return; {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {7182#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7182#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:18,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {7182#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7216#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:18,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {7216#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {7216#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:18,702 INFO L272 TraceCheckUtils]: 14: Hoare triple {7216#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7216#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:18,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {7216#(<= ~counter~0 1)} ~cond := #in~cond; {7216#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:18,703 INFO L290 TraceCheckUtils]: 16: Hoare triple {7216#(<= ~counter~0 1)} assume !(0 == ~cond); {7216#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:18,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {7216#(<= ~counter~0 1)} assume true; {7216#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:18,704 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7216#(<= ~counter~0 1)} {7216#(<= ~counter~0 1)} #71#return; {7216#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:18,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {7216#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {7216#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:18,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {7216#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7216#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:18,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {7216#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7244#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:18,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {7244#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {7244#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:18,705 INFO L272 TraceCheckUtils]: 23: Hoare triple {7244#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7244#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:18,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {7244#(<= ~counter~0 2)} ~cond := #in~cond; {7244#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:18,706 INFO L290 TraceCheckUtils]: 25: Hoare triple {7244#(<= ~counter~0 2)} assume !(0 == ~cond); {7244#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:18,706 INFO L290 TraceCheckUtils]: 26: Hoare triple {7244#(<= ~counter~0 2)} assume true; {7244#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:18,707 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7244#(<= ~counter~0 2)} {7244#(<= ~counter~0 2)} #71#return; {7244#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:18,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {7244#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {7244#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:18,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {7244#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7244#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:18,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {7244#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7272#(<= |main_#t~post6| 2)} is VALID [2022-04-08 14:01:18,708 INFO L290 TraceCheckUtils]: 31: Hoare triple {7272#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {7175#false} is VALID [2022-04-08 14:01:18,708 INFO L272 TraceCheckUtils]: 32: Hoare triple {7175#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7175#false} is VALID [2022-04-08 14:01:18,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {7175#false} ~cond := #in~cond; {7175#false} is VALID [2022-04-08 14:01:18,708 INFO L290 TraceCheckUtils]: 34: Hoare triple {7175#false} assume 0 == ~cond; {7175#false} is VALID [2022-04-08 14:01:18,708 INFO L290 TraceCheckUtils]: 35: Hoare triple {7175#false} assume !false; {7175#false} is VALID [2022-04-08 14:01:18,708 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:01:18,709 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:01:18,868 INFO L290 TraceCheckUtils]: 35: Hoare triple {7175#false} assume !false; {7175#false} is VALID [2022-04-08 14:01:18,868 INFO L290 TraceCheckUtils]: 34: Hoare triple {7175#false} assume 0 == ~cond; {7175#false} is VALID [2022-04-08 14:01:18,869 INFO L290 TraceCheckUtils]: 33: Hoare triple {7175#false} ~cond := #in~cond; {7175#false} is VALID [2022-04-08 14:01:18,869 INFO L272 TraceCheckUtils]: 32: Hoare triple {7175#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {7175#false} is VALID [2022-04-08 14:01:18,869 INFO L290 TraceCheckUtils]: 31: Hoare triple {7300#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {7175#false} is VALID [2022-04-08 14:01:18,869 INFO L290 TraceCheckUtils]: 30: Hoare triple {7304#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7300#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:01:18,869 INFO L290 TraceCheckUtils]: 29: Hoare triple {7304#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7304#(< ~counter~0 20)} is VALID [2022-04-08 14:01:18,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {7304#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {7304#(< ~counter~0 20)} is VALID [2022-04-08 14:01:18,870 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {7174#true} {7304#(< ~counter~0 20)} #71#return; {7304#(< ~counter~0 20)} is VALID [2022-04-08 14:01:18,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {7174#true} assume true; {7174#true} is VALID [2022-04-08 14:01:18,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {7174#true} assume !(0 == ~cond); {7174#true} is VALID [2022-04-08 14:01:18,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {7174#true} ~cond := #in~cond; {7174#true} is VALID [2022-04-08 14:01:18,871 INFO L272 TraceCheckUtils]: 23: Hoare triple {7304#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7174#true} is VALID [2022-04-08 14:01:18,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {7304#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {7304#(< ~counter~0 20)} is VALID [2022-04-08 14:01:18,871 INFO L290 TraceCheckUtils]: 21: Hoare triple {7332#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7304#(< ~counter~0 20)} is VALID [2022-04-08 14:01:18,872 INFO L290 TraceCheckUtils]: 20: Hoare triple {7332#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {7332#(< ~counter~0 19)} is VALID [2022-04-08 14:01:18,872 INFO L290 TraceCheckUtils]: 19: Hoare triple {7332#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {7332#(< ~counter~0 19)} is VALID [2022-04-08 14:01:18,872 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {7174#true} {7332#(< ~counter~0 19)} #71#return; {7332#(< ~counter~0 19)} is VALID [2022-04-08 14:01:18,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {7174#true} assume true; {7174#true} is VALID [2022-04-08 14:01:18,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {7174#true} assume !(0 == ~cond); {7174#true} is VALID [2022-04-08 14:01:18,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {7174#true} ~cond := #in~cond; {7174#true} is VALID [2022-04-08 14:01:18,873 INFO L272 TraceCheckUtils]: 14: Hoare triple {7332#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {7174#true} is VALID [2022-04-08 14:01:18,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {7332#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {7332#(< ~counter~0 19)} is VALID [2022-04-08 14:01:18,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {7360#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7332#(< ~counter~0 19)} is VALID [2022-04-08 14:01:18,874 INFO L290 TraceCheckUtils]: 11: Hoare triple {7360#(< ~counter~0 18)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {7360#(< ~counter~0 18)} is VALID [2022-04-08 14:01:18,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7174#true} {7360#(< ~counter~0 18)} #69#return; {7360#(< ~counter~0 18)} is VALID [2022-04-08 14:01:18,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {7174#true} assume true; {7174#true} is VALID [2022-04-08 14:01:18,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {7174#true} assume !(0 == ~cond); {7174#true} is VALID [2022-04-08 14:01:18,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {7174#true} ~cond := #in~cond; {7174#true} is VALID [2022-04-08 14:01:18,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {7360#(< ~counter~0 18)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {7174#true} is VALID [2022-04-08 14:01:18,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {7360#(< ~counter~0 18)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {7360#(< ~counter~0 18)} is VALID [2022-04-08 14:01:18,875 INFO L272 TraceCheckUtils]: 4: Hoare triple {7360#(< ~counter~0 18)} call #t~ret7 := main(); {7360#(< ~counter~0 18)} is VALID [2022-04-08 14:01:18,875 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7360#(< ~counter~0 18)} {7174#true} #77#return; {7360#(< ~counter~0 18)} is VALID [2022-04-08 14:01:18,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {7360#(< ~counter~0 18)} assume true; {7360#(< ~counter~0 18)} is VALID [2022-04-08 14:01:18,876 INFO L290 TraceCheckUtils]: 1: Hoare triple {7174#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {7360#(< ~counter~0 18)} is VALID [2022-04-08 14:01:18,876 INFO L272 TraceCheckUtils]: 0: Hoare triple {7174#true} call ULTIMATE.init(); {7174#true} is VALID [2022-04-08 14:01:18,876 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-08 14:01:18,876 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:01:18,876 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824739555] [2022-04-08 14:01:18,877 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:01:18,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1755720318] [2022-04-08 14:01:18,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1755720318] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:01:18,877 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:01:18,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 14:01:18,877 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:01:18,877 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [526105599] [2022-04-08 14:01:18,877 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [526105599] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:01:18,877 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:01:18,877 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:01:18,877 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623143871] [2022-04-08 14:01:18,877 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:01:18,878 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-08 14:01:18,878 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:01:18,878 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:01:18,900 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 14:01:18,900 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:01:18,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:01:18,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:01:18,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 14:01:18,901 INFO L87 Difference]: Start difference. First operand 72 states and 86 transitions. Second operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:01:19,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:19,100 INFO L93 Difference]: Finished difference Result 108 states and 129 transitions. [2022-04-08 14:01:19,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 14:01:19,100 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) Word has length 36 [2022-04-08 14:01:19,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:01:19,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:01:19,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-08 14:01:19,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:01:19,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 78 transitions. [2022-04-08 14:01:19,102 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 78 transitions. [2022-04-08 14:01:19,157 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 14:01:19,158 INFO L225 Difference]: With dead ends: 108 [2022-04-08 14:01:19,158 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 14:01:19,159 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 63 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 14:01:19,159 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 22 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:01:19,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 114 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:01:19,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 14:01:19,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 96. [2022-04-08 14:01:19,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:01:19,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:01:19,271 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:01:19,271 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:01:19,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:19,273 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-08 14:01:19,273 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-08 14:01:19,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:19,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:19,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 98 states. [2022-04-08 14:01:19,273 INFO L87 Difference]: Start difference. First operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Second operand 98 states. [2022-04-08 14:01:19,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:19,275 INFO L93 Difference]: Finished difference Result 98 states and 117 transitions. [2022-04-08 14:01:19,275 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 117 transitions. [2022-04-08 14:01:19,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:19,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:19,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:01:19,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:01:19,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.2816901408450705) internal successors, (91), 73 states have internal predecessors, (91), 14 states have call successors, (14), 12 states have call predecessors, (14), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:01:19,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 116 transitions. [2022-04-08 14:01:19,276 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 116 transitions. Word has length 36 [2022-04-08 14:01:19,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:01:19,277 INFO L478 AbstractCegarLoop]: Abstraction has 96 states and 116 transitions. [2022-04-08 14:01:19,277 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (6), 5 states have call predecessors, (6), 3 states have return successors, (4), 3 states have call predecessors, (4), 4 states have call successors, (4) [2022-04-08 14:01:19,277 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 96 states and 116 transitions. [2022-04-08 14:01:25,758 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 113 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 14:01:25,758 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 116 transitions. [2022-04-08 14:01:25,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 14:01:25,758 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:01:25,759 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:01:25,775 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 14:01:25,959 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,SelfDestructingSolverStorable13 [2022-04-08 14:01:25,959 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:01:25,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:01:25,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1524039145, now seen corresponding path program 1 times [2022-04-08 14:01:25,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:01:25,960 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [892739009] [2022-04-08 14:01:32,018 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:01:32,019 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:01:32,019 INFO L85 PathProgramCache]: Analyzing trace with hash 1524039145, now seen corresponding path program 2 times [2022-04-08 14:01:32,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:01:32,019 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [958699985] [2022-04-08 14:01:32,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:01:32,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:01:32,029 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:01:32,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1865482435] [2022-04-08 14:01:32,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:01:32,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:01:32,029 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:01:32,030 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 14:01:32,031 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 14:01:32,067 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:01:32,067 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:01:32,068 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 14:01:32,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:01:32,075 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:01:32,189 INFO L272 TraceCheckUtils]: 0: Hoare triple {8007#true} call ULTIMATE.init(); {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {8007#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L290 TraceCheckUtils]: 2: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8007#true} {8007#true} #77#return; {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L272 TraceCheckUtils]: 4: Hoare triple {8007#true} call #t~ret7 := main(); {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {8007#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L272 TraceCheckUtils]: 6: Hoare triple {8007#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L290 TraceCheckUtils]: 7: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L290 TraceCheckUtils]: 8: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L290 TraceCheckUtils]: 9: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-08 14:01:32,189 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8007#true} {8007#true} #69#return; {8007#true} is VALID [2022-04-08 14:01:32,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {8007#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8007#true} is VALID [2022-04-08 14:01:32,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {8007#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8007#true} is VALID [2022-04-08 14:01:32,190 INFO L290 TraceCheckUtils]: 13: Hoare triple {8007#true} assume !!(#t~post6 < 20);havoc #t~post6; {8007#true} is VALID [2022-04-08 14:01:32,190 INFO L272 TraceCheckUtils]: 14: Hoare triple {8007#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8007#true} is VALID [2022-04-08 14:01:32,190 INFO L290 TraceCheckUtils]: 15: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-08 14:01:32,190 INFO L290 TraceCheckUtils]: 16: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-08 14:01:32,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-08 14:01:32,190 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8007#true} {8007#true} #71#return; {8007#true} is VALID [2022-04-08 14:01:32,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {8007#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8069#(not (= main_~a~0 0))} is VALID [2022-04-08 14:01:32,191 INFO L290 TraceCheckUtils]: 20: Hoare triple {8069#(not (= main_~a~0 0))} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8069#(not (= main_~a~0 0))} is VALID [2022-04-08 14:01:32,191 INFO L290 TraceCheckUtils]: 21: Hoare triple {8069#(not (= main_~a~0 0))} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8069#(not (= main_~a~0 0))} is VALID [2022-04-08 14:01:32,191 INFO L290 TraceCheckUtils]: 22: Hoare triple {8069#(not (= main_~a~0 0))} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~b~0 := ~b~0 - 1;~q~0 := ~q~0 + ~a~0 * ~p~0; {8069#(not (= main_~a~0 0))} is VALID [2022-04-08 14:01:32,192 INFO L290 TraceCheckUtils]: 23: Hoare triple {8069#(not (= main_~a~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8069#(not (= main_~a~0 0))} is VALID [2022-04-08 14:01:32,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {8069#(not (= main_~a~0 0))} assume !!(#t~post6 < 20);havoc #t~post6; {8069#(not (= main_~a~0 0))} is VALID [2022-04-08 14:01:32,192 INFO L272 TraceCheckUtils]: 25: Hoare triple {8069#(not (= main_~a~0 0))} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8007#true} is VALID [2022-04-08 14:01:32,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-08 14:01:32,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-08 14:01:32,192 INFO L290 TraceCheckUtils]: 28: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-08 14:01:32,193 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8007#true} {8069#(not (= main_~a~0 0))} #71#return; {8069#(not (= main_~a~0 0))} is VALID [2022-04-08 14:01:32,193 INFO L290 TraceCheckUtils]: 30: Hoare triple {8069#(not (= main_~a~0 0))} assume !(0 != ~a~0 && 0 != ~b~0); {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-08 14:01:32,193 INFO L272 TraceCheckUtils]: 31: Hoare triple {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8007#true} is VALID [2022-04-08 14:01:32,193 INFO L290 TraceCheckUtils]: 32: Hoare triple {8007#true} ~cond := #in~cond; {8007#true} is VALID [2022-04-08 14:01:32,193 INFO L290 TraceCheckUtils]: 33: Hoare triple {8007#true} assume !(0 == ~cond); {8007#true} is VALID [2022-04-08 14:01:32,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {8007#true} assume true; {8007#true} is VALID [2022-04-08 14:01:32,194 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8007#true} {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} #73#return; {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} is VALID [2022-04-08 14:01:32,195 INFO L272 TraceCheckUtils]: 36: Hoare triple {8103#(and (= main_~b~0 0) (not (= main_~a~0 0)))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {8122#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:01:32,195 INFO L290 TraceCheckUtils]: 37: Hoare triple {8122#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8126#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:01:32,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {8126#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8008#false} is VALID [2022-04-08 14:01:32,195 INFO L290 TraceCheckUtils]: 39: Hoare triple {8008#false} assume !false; {8008#false} is VALID [2022-04-08 14:01:32,196 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:01:32,196 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 14:01:32,196 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:01:32,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [958699985] [2022-04-08 14:01:32,196 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:01:32,196 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865482435] [2022-04-08 14:01:32,196 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865482435] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:01:32,196 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:01:32,196 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:01:32,197 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:01:32,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [892739009] [2022-04-08 14:01:32,197 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [892739009] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:01:32,197 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:01:32,197 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 14:01:32,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310763370] [2022-04-08 14:01:32,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:01:32,197 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-04-08 14:01:32,197 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:01:32,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:01:32,223 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:01:32,223 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 14:01:32,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:01:32,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 14:01:32,224 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-04-08 14:01:32,224 INFO L87 Difference]: Start difference. First operand 96 states and 116 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:01:32,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:32,482 INFO L93 Difference]: Finished difference Result 126 states and 154 transitions. [2022-04-08 14:01:32,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 14:01:32,482 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) Word has length 40 [2022-04-08 14:01:32,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:01:32,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:01:32,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-08 14:01:32,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:01:32,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 51 transitions. [2022-04-08 14:01:32,484 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 51 transitions. [2022-04-08 14:01:32,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:01:32,520 INFO L225 Difference]: With dead ends: 126 [2022-04-08 14:01:32,520 INFO L226 Difference]: Without dead ends: 114 [2022-04-08 14:01:32,520 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2022-04-08 14:01:32,521 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:01:32,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 114 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:01:32,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2022-04-08 14:01:32,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2022-04-08 14:01:32,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:01:32,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 114 states. Second operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:01:32,622 INFO L74 IsIncluded]: Start isIncluded. First operand 114 states. Second operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:01:32,623 INFO L87 Difference]: Start difference. First operand 114 states. Second operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:01:32,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:32,624 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-04-08 14:01:32,624 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2022-04-08 14:01:32,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:32,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:32,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 114 states. [2022-04-08 14:01:32,625 INFO L87 Difference]: Start difference. First operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Second operand 114 states. [2022-04-08 14:01:32,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:32,626 INFO L93 Difference]: Finished difference Result 114 states and 139 transitions. [2022-04-08 14:01:32,627 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 139 transitions. [2022-04-08 14:01:32,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:32,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:32,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:01:32,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:01:32,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 76 states have (on average 1.263157894736842) internal successors, (96), 78 states have internal predecessors, (96), 15 states have call successors, (15), 12 states have call predecessors, (15), 10 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:01:32,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-04-08 14:01:32,629 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 40 [2022-04-08 14:01:32,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:01:32,629 INFO L478 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-04-08 14:01:32,629 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 3 states have call successors, (7), 2 states have call predecessors, (7), 1 states have return successors, (5), 3 states have call predecessors, (5), 3 states have call successors, (5) [2022-04-08 14:01:32,629 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 102 states and 123 transitions. [2022-04-08 14:01:41,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 119 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 14:01:41,094 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-04-08 14:01:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-04-08 14:01:41,095 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:01:41,095 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:01:41,110 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 14:01:41,304 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:01:41,305 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:01:41,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:01:41,305 INFO L85 PathProgramCache]: Analyzing trace with hash -470105561, now seen corresponding path program 1 times [2022-04-08 14:01:41,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:01:41,305 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [808366594] [2022-04-08 14:01:47,359 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:01:47,359 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:01:47,359 INFO L85 PathProgramCache]: Analyzing trace with hash -470105561, now seen corresponding path program 2 times [2022-04-08 14:01:47,359 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:01:47,360 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477356056] [2022-04-08 14:01:47,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:01:47,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:01:47,382 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:01:47,382 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1859808691] [2022-04-08 14:01:47,382 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:01:47,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:01:47,382 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:01:47,387 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 14:01:47,388 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 14:01:47,421 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:01:47,422 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:01:47,422 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:01:47,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:01:47,431 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:01:47,649 WARN L907 QuantifierPusher]: no eliminatee completely removed, nonetheless the elimination was considered successful [2022-04-08 14:01:47,679 INFO L272 TraceCheckUtils]: 0: Hoare triple {8818#true} call ULTIMATE.init(); {8818#true} is VALID [2022-04-08 14:01:47,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {8818#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8818#true} is VALID [2022-04-08 14:01:47,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-08 14:01:47,679 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8818#true} {8818#true} #77#return; {8818#true} is VALID [2022-04-08 14:01:47,679 INFO L272 TraceCheckUtils]: 4: Hoare triple {8818#true} call #t~ret7 := main(); {8818#true} is VALID [2022-04-08 14:01:47,679 INFO L290 TraceCheckUtils]: 5: Hoare triple {8818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8818#true} is VALID [2022-04-08 14:01:47,679 INFO L272 TraceCheckUtils]: 6: Hoare triple {8818#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8818#true} is VALID [2022-04-08 14:01:47,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {8818#true} ~cond := #in~cond; {8844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-08 14:01:47,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {8844#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {8848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:01:47,680 INFO L290 TraceCheckUtils]: 9: Hoare triple {8848#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {8848#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-08 14:01:47,681 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8848#(not (= |assume_abort_if_not_#in~cond| 0))} {8818#true} #69#return; {8855#(<= 1 main_~y~0)} is VALID [2022-04-08 14:01:47,681 INFO L290 TraceCheckUtils]: 11: Hoare triple {8855#(<= 1 main_~y~0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8859#(<= 1 main_~b~0)} is VALID [2022-04-08 14:01:47,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {8859#(<= 1 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8859#(<= 1 main_~b~0)} is VALID [2022-04-08 14:01:47,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {8859#(<= 1 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {8859#(<= 1 main_~b~0)} is VALID [2022-04-08 14:01:47,682 INFO L272 TraceCheckUtils]: 14: Hoare triple {8859#(<= 1 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-08 14:01:47,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-08 14:01:47,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-08 14:01:47,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-08 14:01:47,682 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8818#true} {8859#(<= 1 main_~b~0)} #71#return; {8859#(<= 1 main_~b~0)} is VALID [2022-04-08 14:01:47,683 INFO L290 TraceCheckUtils]: 19: Hoare triple {8859#(<= 1 main_~b~0)} assume !!(0 != ~a~0 && 0 != ~b~0); {8859#(<= 1 main_~b~0)} is VALID [2022-04-08 14:01:47,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {8859#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8859#(<= 1 main_~b~0)} is VALID [2022-04-08 14:01:47,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {8859#(<= 1 main_~b~0)} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8859#(<= 1 main_~b~0)} is VALID [2022-04-08 14:01:47,684 INFO L290 TraceCheckUtils]: 22: Hoare triple {8859#(<= 1 main_~b~0)} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8893#(<= 0 main_~b~0)} is VALID [2022-04-08 14:01:47,684 INFO L290 TraceCheckUtils]: 23: Hoare triple {8893#(<= 0 main_~b~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8893#(<= 0 main_~b~0)} is VALID [2022-04-08 14:01:47,684 INFO L290 TraceCheckUtils]: 24: Hoare triple {8893#(<= 0 main_~b~0)} assume !!(#t~post6 < 20);havoc #t~post6; {8893#(<= 0 main_~b~0)} is VALID [2022-04-08 14:01:47,684 INFO L272 TraceCheckUtils]: 25: Hoare triple {8893#(<= 0 main_~b~0)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-08 14:01:47,685 INFO L290 TraceCheckUtils]: 26: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-08 14:01:47,685 INFO L290 TraceCheckUtils]: 27: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-08 14:01:47,685 INFO L290 TraceCheckUtils]: 28: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-08 14:01:47,685 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8818#true} {8893#(<= 0 main_~b~0)} #71#return; {8893#(<= 0 main_~b~0)} is VALID [2022-04-08 14:01:47,685 INFO L290 TraceCheckUtils]: 30: Hoare triple {8893#(<= 0 main_~b~0)} assume !(0 != ~a~0 && 0 != ~b~0); {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 14:01:47,686 INFO L272 TraceCheckUtils]: 31: Hoare triple {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-08 14:01:47,686 INFO L290 TraceCheckUtils]: 32: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-08 14:01:47,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-08 14:01:47,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-08 14:01:47,686 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8818#true} {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} #73#return; {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} is VALID [2022-04-08 14:01:47,688 INFO L272 TraceCheckUtils]: 36: Hoare triple {8918#(and (or (= main_~a~0 0) (= main_~b~0 0)) (<= 0 main_~b~0))} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:01:47,688 INFO L290 TraceCheckUtils]: 37: Hoare triple {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:01:47,688 INFO L290 TraceCheckUtils]: 38: Hoare triple {8941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8819#false} is VALID [2022-04-08 14:01:47,688 INFO L290 TraceCheckUtils]: 39: Hoare triple {8819#false} assume !false; {8819#false} is VALID [2022-04-08 14:01:47,688 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:01:47,689 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:01:47,869 INFO L290 TraceCheckUtils]: 39: Hoare triple {8819#false} assume !false; {8819#false} is VALID [2022-04-08 14:01:47,869 INFO L290 TraceCheckUtils]: 38: Hoare triple {8941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {8819#false} is VALID [2022-04-08 14:01:47,869 INFO L290 TraceCheckUtils]: 37: Hoare triple {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {8941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 14:01:47,870 INFO L272 TraceCheckUtils]: 36: Hoare triple {8957#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if 0 == ~a~0 * ~b~0 then 1 else 0)); {8937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-08 14:01:47,870 INFO L284 TraceCheckUtils]: 35: Hoare quadruple {8818#true} {8957#(= (* main_~b~0 main_~a~0) 0)} #73#return; {8957#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-08 14:01:47,870 INFO L290 TraceCheckUtils]: 34: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-08 14:01:47,871 INFO L290 TraceCheckUtils]: 33: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-08 14:01:47,871 INFO L290 TraceCheckUtils]: 32: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-08 14:01:47,871 INFO L272 TraceCheckUtils]: 31: Hoare triple {8957#(= (* main_~b~0 main_~a~0) 0)} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-08 14:01:47,872 INFO L290 TraceCheckUtils]: 30: Hoare triple {8818#true} assume !(0 != ~a~0 && 0 != ~b~0); {8957#(= (* main_~b~0 main_~a~0) 0)} is VALID [2022-04-08 14:01:47,872 INFO L284 TraceCheckUtils]: 29: Hoare quadruple {8818#true} {8818#true} #71#return; {8818#true} is VALID [2022-04-08 14:01:47,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-08 14:01:47,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-08 14:01:47,872 INFO L290 TraceCheckUtils]: 26: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-08 14:01:47,872 INFO L272 TraceCheckUtils]: 25: Hoare triple {8818#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 24: Hoare triple {8818#true} assume !!(#t~post6 < 20);havoc #t~post6; {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 23: Hoare triple {8818#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 22: Hoare triple {8818#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 1 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2));~a~0 := ~a~0 - 1;~b~0 := ~b~0 - 1;~q~0 := ~q~0 + (1 + (~a~0 + ~b~0)) * ~p~0; {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 21: Hoare triple {8818#true} assume !(1 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 20: Hoare triple {8818#true} assume !(0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2)); {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 19: Hoare triple {8818#true} assume !!(0 != ~a~0 && 0 != ~b~0); {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {8818#true} {8818#true} #71#return; {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 17: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 16: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 15: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L272 TraceCheckUtils]: 14: Hoare triple {8818#true} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 13: Hoare triple {8818#true} assume !!(#t~post6 < 20);havoc #t~post6; {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 12: Hoare triple {8818#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8818#true} is VALID [2022-04-08 14:01:47,873 INFO L290 TraceCheckUtils]: 11: Hoare triple {8818#true} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8818#true} {8818#true} #69#return; {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L290 TraceCheckUtils]: 9: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L290 TraceCheckUtils]: 8: Hoare triple {8818#true} assume !(0 == ~cond); {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L290 TraceCheckUtils]: 7: Hoare triple {8818#true} ~cond := #in~cond; {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L272 TraceCheckUtils]: 6: Hoare triple {8818#true} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L290 TraceCheckUtils]: 5: Hoare triple {8818#true} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L272 TraceCheckUtils]: 4: Hoare triple {8818#true} call #t~ret7 := main(); {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8818#true} {8818#true} #77#return; {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {8818#true} assume true; {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {8818#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L272 TraceCheckUtils]: 0: Hoare triple {8818#true} call ULTIMATE.init(); {8818#true} is VALID [2022-04-08 14:01:47,874 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-08 14:01:47,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:01:47,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477356056] [2022-04-08 14:01:47,875 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:01:47,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859808691] [2022-04-08 14:01:47,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859808691] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-08 14:01:47,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-08 14:01:47,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10] total 11 [2022-04-08 14:01:47,875 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:01:47,875 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [808366594] [2022-04-08 14:01:47,875 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [808366594] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:01:47,875 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:01:47,875 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 14:01:47,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1901364669] [2022-04-08 14:01:47,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:01:47,876 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 14:01:47,876 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:01:47,876 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 14:01:47,909 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 14:01:47,910 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 14:01:47,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:01:47,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 14:01:47,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-04-08 14:01:47,910 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 14:01:48,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:48,270 INFO L93 Difference]: Finished difference Result 109 states and 129 transitions. [2022-04-08 14:01:48,270 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 14:01:48,271 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 14:01:48,271 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:01:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 14:01:48,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:01:48,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 14:01:48,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 41 transitions. [2022-04-08 14:01:48,272 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 41 transitions. [2022-04-08 14:01:48,306 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 14:01:48,307 INFO L225 Difference]: With dead ends: 109 [2022-04-08 14:01:48,308 INFO L226 Difference]: Without dead ends: 89 [2022-04-08 14:01:48,308 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 69 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:01:48,308 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 5 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:01:48,308 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 117 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:01:48,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-04-08 14:01:48,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 65. [2022-04-08 14:01:48,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:01:48,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:01:48,394 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:01:48,395 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:01:48,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:48,396 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2022-04-08 14:01:48,396 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-04-08 14:01:48,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:48,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:48,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 89 states. [2022-04-08 14:01:48,397 INFO L87 Difference]: Start difference. First operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 89 states. [2022-04-08 14:01:48,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:48,398 INFO L93 Difference]: Finished difference Result 89 states and 108 transitions. [2022-04-08 14:01:48,399 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 108 transitions. [2022-04-08 14:01:48,399 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:48,399 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:48,399 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:01:48,399 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:01:48,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 48 states have (on average 1.25) internal successors, (60), 49 states have internal predecessors, (60), 9 states have call successors, (9), 8 states have call predecessors, (9), 7 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:01:48,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-04-08 14:01:48,400 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 40 [2022-04-08 14:01:48,400 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:01:48,400 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-04-08 14:01:48,400 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 14:01:48,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 76 transitions. [2022-04-08 14:01:52,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 74 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 14:01:52,790 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-04-08 14:01:52,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-04-08 14:01:52,790 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:01:52,791 INFO L499 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:01:52,807 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 14:01:52,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 14:01:52,991 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:01:52,991 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:01:52,992 INFO L85 PathProgramCache]: Analyzing trace with hash 517832770, now seen corresponding path program 5 times [2022-04-08 14:01:52,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:01:52,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [513817224] [2022-04-08 14:01:59,039 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:01:59,040 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:01:59,040 INFO L85 PathProgramCache]: Analyzing trace with hash 517832770, now seen corresponding path program 6 times [2022-04-08 14:01:59,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:01:59,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2034761757] [2022-04-08 14:01:59,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:01:59,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:01:59,048 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:01:59,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1667125534] [2022-04-08 14:01:59,049 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:01:59,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:01:59,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:01:59,050 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 14:01:59,050 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 14:01:59,093 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 14:01:59,093 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:01:59,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 14:01:59,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:01:59,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:01:59,294 INFO L272 TraceCheckUtils]: 0: Hoare triple {9596#true} call ULTIMATE.init(); {9596#true} is VALID [2022-04-08 14:01:59,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {9596#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {9604#(<= ~counter~0 0)} assume true; {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,295 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9604#(<= ~counter~0 0)} {9596#true} #77#return; {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,296 INFO L272 TraceCheckUtils]: 4: Hoare triple {9604#(<= ~counter~0 0)} call #t~ret7 := main(); {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,296 INFO L290 TraceCheckUtils]: 5: Hoare triple {9604#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,296 INFO L272 TraceCheckUtils]: 6: Hoare triple {9604#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,297 INFO L290 TraceCheckUtils]: 7: Hoare triple {9604#(<= ~counter~0 0)} ~cond := #in~cond; {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {9604#(<= ~counter~0 0)} assume !(0 == ~cond); {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {9604#(<= ~counter~0 0)} assume true; {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,298 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9604#(<= ~counter~0 0)} {9604#(<= ~counter~0 0)} #69#return; {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {9604#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9604#(<= ~counter~0 0)} is VALID [2022-04-08 14:01:59,298 INFO L290 TraceCheckUtils]: 12: Hoare triple {9604#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9638#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:59,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {9638#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {9638#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:59,299 INFO L272 TraceCheckUtils]: 14: Hoare triple {9638#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9638#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:59,299 INFO L290 TraceCheckUtils]: 15: Hoare triple {9638#(<= ~counter~0 1)} ~cond := #in~cond; {9638#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:59,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {9638#(<= ~counter~0 1)} assume !(0 == ~cond); {9638#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:59,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {9638#(<= ~counter~0 1)} assume true; {9638#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:59,300 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9638#(<= ~counter~0 1)} {9638#(<= ~counter~0 1)} #71#return; {9638#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:59,301 INFO L290 TraceCheckUtils]: 19: Hoare triple {9638#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {9638#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:59,301 INFO L290 TraceCheckUtils]: 20: Hoare triple {9638#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9638#(<= ~counter~0 1)} is VALID [2022-04-08 14:01:59,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {9638#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9666#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:59,302 INFO L290 TraceCheckUtils]: 22: Hoare triple {9666#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {9666#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:59,302 INFO L272 TraceCheckUtils]: 23: Hoare triple {9666#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9666#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:59,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {9666#(<= ~counter~0 2)} ~cond := #in~cond; {9666#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:59,303 INFO L290 TraceCheckUtils]: 25: Hoare triple {9666#(<= ~counter~0 2)} assume !(0 == ~cond); {9666#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:59,303 INFO L290 TraceCheckUtils]: 26: Hoare triple {9666#(<= ~counter~0 2)} assume true; {9666#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:59,304 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9666#(<= ~counter~0 2)} {9666#(<= ~counter~0 2)} #71#return; {9666#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:59,304 INFO L290 TraceCheckUtils]: 28: Hoare triple {9666#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {9666#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:59,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {9666#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9666#(<= ~counter~0 2)} is VALID [2022-04-08 14:01:59,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {9666#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9694#(<= ~counter~0 3)} is VALID [2022-04-08 14:01:59,305 INFO L290 TraceCheckUtils]: 31: Hoare triple {9694#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {9694#(<= ~counter~0 3)} is VALID [2022-04-08 14:01:59,305 INFO L272 TraceCheckUtils]: 32: Hoare triple {9694#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9694#(<= ~counter~0 3)} is VALID [2022-04-08 14:01:59,306 INFO L290 TraceCheckUtils]: 33: Hoare triple {9694#(<= ~counter~0 3)} ~cond := #in~cond; {9694#(<= ~counter~0 3)} is VALID [2022-04-08 14:01:59,306 INFO L290 TraceCheckUtils]: 34: Hoare triple {9694#(<= ~counter~0 3)} assume !(0 == ~cond); {9694#(<= ~counter~0 3)} is VALID [2022-04-08 14:01:59,306 INFO L290 TraceCheckUtils]: 35: Hoare triple {9694#(<= ~counter~0 3)} assume true; {9694#(<= ~counter~0 3)} is VALID [2022-04-08 14:01:59,307 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9694#(<= ~counter~0 3)} {9694#(<= ~counter~0 3)} #71#return; {9694#(<= ~counter~0 3)} is VALID [2022-04-08 14:01:59,307 INFO L290 TraceCheckUtils]: 37: Hoare triple {9694#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {9694#(<= ~counter~0 3)} is VALID [2022-04-08 14:01:59,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {9694#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9694#(<= ~counter~0 3)} is VALID [2022-04-08 14:01:59,307 INFO L290 TraceCheckUtils]: 39: Hoare triple {9694#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9722#(<= |main_#t~post6| 3)} is VALID [2022-04-08 14:01:59,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {9722#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {9597#false} is VALID [2022-04-08 14:01:59,308 INFO L272 TraceCheckUtils]: 41: Hoare triple {9597#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9597#false} is VALID [2022-04-08 14:01:59,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {9597#false} ~cond := #in~cond; {9597#false} is VALID [2022-04-08 14:01:59,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {9597#false} assume 0 == ~cond; {9597#false} is VALID [2022-04-08 14:01:59,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {9597#false} assume !false; {9597#false} is VALID [2022-04-08 14:01:59,308 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:01:59,308 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:01:59,513 INFO L290 TraceCheckUtils]: 44: Hoare triple {9597#false} assume !false; {9597#false} is VALID [2022-04-08 14:01:59,513 INFO L290 TraceCheckUtils]: 43: Hoare triple {9597#false} assume 0 == ~cond; {9597#false} is VALID [2022-04-08 14:01:59,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {9597#false} ~cond := #in~cond; {9597#false} is VALID [2022-04-08 14:01:59,513 INFO L272 TraceCheckUtils]: 41: Hoare triple {9597#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {9597#false} is VALID [2022-04-08 14:01:59,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {9750#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {9597#false} is VALID [2022-04-08 14:01:59,514 INFO L290 TraceCheckUtils]: 39: Hoare triple {9754#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9750#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:01:59,519 INFO L290 TraceCheckUtils]: 38: Hoare triple {9754#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9754#(< ~counter~0 20)} is VALID [2022-04-08 14:01:59,519 INFO L290 TraceCheckUtils]: 37: Hoare triple {9754#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {9754#(< ~counter~0 20)} is VALID [2022-04-08 14:01:59,520 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {9596#true} {9754#(< ~counter~0 20)} #71#return; {9754#(< ~counter~0 20)} is VALID [2022-04-08 14:01:59,520 INFO L290 TraceCheckUtils]: 35: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-08 14:01:59,520 INFO L290 TraceCheckUtils]: 34: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-08 14:01:59,520 INFO L290 TraceCheckUtils]: 33: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-08 14:01:59,520 INFO L272 TraceCheckUtils]: 32: Hoare triple {9754#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-08 14:01:59,521 INFO L290 TraceCheckUtils]: 31: Hoare triple {9754#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {9754#(< ~counter~0 20)} is VALID [2022-04-08 14:01:59,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {9782#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9754#(< ~counter~0 20)} is VALID [2022-04-08 14:01:59,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {9782#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9782#(< ~counter~0 19)} is VALID [2022-04-08 14:01:59,522 INFO L290 TraceCheckUtils]: 28: Hoare triple {9782#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {9782#(< ~counter~0 19)} is VALID [2022-04-08 14:01:59,522 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {9596#true} {9782#(< ~counter~0 19)} #71#return; {9782#(< ~counter~0 19)} is VALID [2022-04-08 14:01:59,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-08 14:01:59,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-08 14:01:59,522 INFO L290 TraceCheckUtils]: 24: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-08 14:01:59,523 INFO L272 TraceCheckUtils]: 23: Hoare triple {9782#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-08 14:01:59,523 INFO L290 TraceCheckUtils]: 22: Hoare triple {9782#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {9782#(< ~counter~0 19)} is VALID [2022-04-08 14:01:59,523 INFO L290 TraceCheckUtils]: 21: Hoare triple {9810#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9782#(< ~counter~0 19)} is VALID [2022-04-08 14:01:59,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {9810#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {9810#(< ~counter~0 18)} is VALID [2022-04-08 14:01:59,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {9810#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {9810#(< ~counter~0 18)} is VALID [2022-04-08 14:01:59,524 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {9596#true} {9810#(< ~counter~0 18)} #71#return; {9810#(< ~counter~0 18)} is VALID [2022-04-08 14:01:59,525 INFO L290 TraceCheckUtils]: 17: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-08 14:01:59,525 INFO L290 TraceCheckUtils]: 16: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-08 14:01:59,525 INFO L290 TraceCheckUtils]: 15: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-08 14:01:59,525 INFO L272 TraceCheckUtils]: 14: Hoare triple {9810#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {9596#true} is VALID [2022-04-08 14:01:59,525 INFO L290 TraceCheckUtils]: 13: Hoare triple {9810#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {9810#(< ~counter~0 18)} is VALID [2022-04-08 14:01:59,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {9838#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9810#(< ~counter~0 18)} is VALID [2022-04-08 14:01:59,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {9838#(< ~counter~0 17)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {9838#(< ~counter~0 17)} is VALID [2022-04-08 14:01:59,526 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9596#true} {9838#(< ~counter~0 17)} #69#return; {9838#(< ~counter~0 17)} is VALID [2022-04-08 14:01:59,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {9596#true} assume true; {9596#true} is VALID [2022-04-08 14:01:59,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {9596#true} assume !(0 == ~cond); {9596#true} is VALID [2022-04-08 14:01:59,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {9596#true} ~cond := #in~cond; {9596#true} is VALID [2022-04-08 14:01:59,526 INFO L272 TraceCheckUtils]: 6: Hoare triple {9838#(< ~counter~0 17)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {9596#true} is VALID [2022-04-08 14:01:59,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {9838#(< ~counter~0 17)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {9838#(< ~counter~0 17)} is VALID [2022-04-08 14:01:59,527 INFO L272 TraceCheckUtils]: 4: Hoare triple {9838#(< ~counter~0 17)} call #t~ret7 := main(); {9838#(< ~counter~0 17)} is VALID [2022-04-08 14:01:59,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9838#(< ~counter~0 17)} {9596#true} #77#return; {9838#(< ~counter~0 17)} is VALID [2022-04-08 14:01:59,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {9838#(< ~counter~0 17)} assume true; {9838#(< ~counter~0 17)} is VALID [2022-04-08 14:01:59,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {9596#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {9838#(< ~counter~0 17)} is VALID [2022-04-08 14:01:59,528 INFO L272 TraceCheckUtils]: 0: Hoare triple {9596#true} call ULTIMATE.init(); {9596#true} is VALID [2022-04-08 14:01:59,528 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-04-08 14:01:59,529 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:01:59,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2034761757] [2022-04-08 14:01:59,529 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:01:59,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1667125534] [2022-04-08 14:01:59,529 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1667125534] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:01:59,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:01:59,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 14:01:59,530 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:01:59,530 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [513817224] [2022-04-08 14:01:59,530 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [513817224] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:01:59,530 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:01:59,530 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 14:01:59,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972301995] [2022-04-08 14:01:59,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:01:59,531 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-08 14:01:59,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:01:59,531 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:01:59,563 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 14:01:59,563 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 14:01:59,564 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:01:59,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 14:01:59,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 14:01:59,564 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:01:59,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:59,789 INFO L93 Difference]: Finished difference Result 84 states and 99 transitions. [2022-04-08 14:01:59,789 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 14:01:59,789 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) Word has length 45 [2022-04-08 14:01:59,789 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:01:59,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:01:59,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-08 14:01:59,790 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:01:59,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 85 transitions. [2022-04-08 14:01:59,791 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 85 transitions. [2022-04-08 14:01:59,861 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:01:59,862 INFO L225 Difference]: With dead ends: 84 [2022-04-08 14:01:59,862 INFO L226 Difference]: Without dead ends: 76 [2022-04-08 14:01:59,862 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 79 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 14:01:59,863 INFO L913 BasicCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:01:59,863 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 138 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:01:59,863 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2022-04-08 14:01:59,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2022-04-08 14:01:59,955 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:01:59,956 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states. Second operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:01:59,956 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states. Second operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:01:59,956 INFO L87 Difference]: Start difference. First operand 76 states. Second operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:01:59,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:59,957 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-04-08 14:01:59,957 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-08 14:01:59,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:59,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:59,957 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-08 14:01:59,958 INFO L87 Difference]: Start difference. First operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 76 states. [2022-04-08 14:01:59,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:01:59,958 INFO L93 Difference]: Finished difference Result 76 states and 90 transitions. [2022-04-08 14:01:59,959 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-08 14:01:59,959 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:01:59,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:01:59,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:01:59,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:01:59,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 57 states have (on average 1.263157894736842) internal successors, (72), 58 states have internal predecessors, (72), 10 states have call successors, (10), 9 states have call predecessors, (10), 8 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:01:59,962 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 90 transitions. [2022-04-08 14:01:59,962 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 90 transitions. Word has length 45 [2022-04-08 14:01:59,963 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:01:59,963 INFO L478 AbstractCegarLoop]: Abstraction has 76 states and 90 transitions. [2022-04-08 14:01:59,963 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 4 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-08 14:01:59,963 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 76 states and 90 transitions. [2022-04-08 14:02:06,499 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 87 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-08 14:02:06,499 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 90 transitions. [2022-04-08 14:02:06,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-04-08 14:02:06,500 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:02:06,500 INFO L499 BasicCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:02:06,515 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 14:02:06,700 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 14:02:06,701 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:02:06,701 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:02:06,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1818717446, now seen corresponding path program 7 times [2022-04-08 14:02:06,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:02:06,701 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [988807577] [2022-04-08 14:02:12,747 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:02:12,747 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:02:12,747 INFO L85 PathProgramCache]: Analyzing trace with hash -1818717446, now seen corresponding path program 8 times [2022-04-08 14:02:12,747 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:02:12,748 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564388355] [2022-04-08 14:02:12,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:02:12,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:02:12,757 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:02:12,757 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503060546] [2022-04-08 14:02:12,757 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:02:12,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:02:12,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:02:12,774 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 14:02:12,775 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 14:02:12,817 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:02:12,817 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:02:12,818 INFO L263 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 14:02:12,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:02:12,828 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:02:13,075 INFO L272 TraceCheckUtils]: 0: Hoare triple {10355#true} call ULTIMATE.init(); {10355#true} is VALID [2022-04-08 14:02:13,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {10355#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {10363#(<= ~counter~0 0)} assume true; {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,077 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10363#(<= ~counter~0 0)} {10355#true} #77#return; {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,077 INFO L272 TraceCheckUtils]: 4: Hoare triple {10363#(<= ~counter~0 0)} call #t~ret7 := main(); {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {10363#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,077 INFO L272 TraceCheckUtils]: 6: Hoare triple {10363#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {10363#(<= ~counter~0 0)} ~cond := #in~cond; {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,078 INFO L290 TraceCheckUtils]: 8: Hoare triple {10363#(<= ~counter~0 0)} assume !(0 == ~cond); {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,078 INFO L290 TraceCheckUtils]: 9: Hoare triple {10363#(<= ~counter~0 0)} assume true; {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,079 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10363#(<= ~counter~0 0)} {10363#(<= ~counter~0 0)} #69#return; {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {10363#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {10363#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:13,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {10363#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10397#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:13,080 INFO L290 TraceCheckUtils]: 13: Hoare triple {10397#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {10397#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:13,080 INFO L272 TraceCheckUtils]: 14: Hoare triple {10397#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10397#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:13,080 INFO L290 TraceCheckUtils]: 15: Hoare triple {10397#(<= ~counter~0 1)} ~cond := #in~cond; {10397#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:13,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {10397#(<= ~counter~0 1)} assume !(0 == ~cond); {10397#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:13,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {10397#(<= ~counter~0 1)} assume true; {10397#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:13,082 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10397#(<= ~counter~0 1)} {10397#(<= ~counter~0 1)} #71#return; {10397#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:13,082 INFO L290 TraceCheckUtils]: 19: Hoare triple {10397#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {10397#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:13,082 INFO L290 TraceCheckUtils]: 20: Hoare triple {10397#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10397#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:13,083 INFO L290 TraceCheckUtils]: 21: Hoare triple {10397#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10425#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:13,083 INFO L290 TraceCheckUtils]: 22: Hoare triple {10425#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {10425#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:13,083 INFO L272 TraceCheckUtils]: 23: Hoare triple {10425#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10425#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:13,084 INFO L290 TraceCheckUtils]: 24: Hoare triple {10425#(<= ~counter~0 2)} ~cond := #in~cond; {10425#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:13,084 INFO L290 TraceCheckUtils]: 25: Hoare triple {10425#(<= ~counter~0 2)} assume !(0 == ~cond); {10425#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:13,084 INFO L290 TraceCheckUtils]: 26: Hoare triple {10425#(<= ~counter~0 2)} assume true; {10425#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:13,085 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10425#(<= ~counter~0 2)} {10425#(<= ~counter~0 2)} #71#return; {10425#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:13,085 INFO L290 TraceCheckUtils]: 28: Hoare triple {10425#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {10425#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:13,085 INFO L290 TraceCheckUtils]: 29: Hoare triple {10425#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10425#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:13,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {10425#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10453#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:13,086 INFO L290 TraceCheckUtils]: 31: Hoare triple {10453#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {10453#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:13,086 INFO L272 TraceCheckUtils]: 32: Hoare triple {10453#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10453#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:13,087 INFO L290 TraceCheckUtils]: 33: Hoare triple {10453#(<= ~counter~0 3)} ~cond := #in~cond; {10453#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:13,087 INFO L290 TraceCheckUtils]: 34: Hoare triple {10453#(<= ~counter~0 3)} assume !(0 == ~cond); {10453#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:13,087 INFO L290 TraceCheckUtils]: 35: Hoare triple {10453#(<= ~counter~0 3)} assume true; {10453#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:13,088 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10453#(<= ~counter~0 3)} {10453#(<= ~counter~0 3)} #71#return; {10453#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:13,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {10453#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {10453#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:13,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {10453#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10453#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:13,089 INFO L290 TraceCheckUtils]: 39: Hoare triple {10453#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10481#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:13,089 INFO L290 TraceCheckUtils]: 40: Hoare triple {10481#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {10481#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:13,090 INFO L272 TraceCheckUtils]: 41: Hoare triple {10481#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10481#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:13,090 INFO L290 TraceCheckUtils]: 42: Hoare triple {10481#(<= ~counter~0 4)} ~cond := #in~cond; {10481#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:13,090 INFO L290 TraceCheckUtils]: 43: Hoare triple {10481#(<= ~counter~0 4)} assume !(0 == ~cond); {10481#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:13,090 INFO L290 TraceCheckUtils]: 44: Hoare triple {10481#(<= ~counter~0 4)} assume true; {10481#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:13,091 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10481#(<= ~counter~0 4)} {10481#(<= ~counter~0 4)} #71#return; {10481#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:13,091 INFO L290 TraceCheckUtils]: 46: Hoare triple {10481#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {10481#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:13,091 INFO L290 TraceCheckUtils]: 47: Hoare triple {10481#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10481#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:13,092 INFO L290 TraceCheckUtils]: 48: Hoare triple {10481#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10509#(<= |main_#t~post6| 4)} is VALID [2022-04-08 14:02:13,092 INFO L290 TraceCheckUtils]: 49: Hoare triple {10509#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {10356#false} is VALID [2022-04-08 14:02:13,092 INFO L272 TraceCheckUtils]: 50: Hoare triple {10356#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {10356#false} is VALID [2022-04-08 14:02:13,092 INFO L290 TraceCheckUtils]: 51: Hoare triple {10356#false} ~cond := #in~cond; {10356#false} is VALID [2022-04-08 14:02:13,092 INFO L290 TraceCheckUtils]: 52: Hoare triple {10356#false} assume 0 == ~cond; {10356#false} is VALID [2022-04-08 14:02:13,092 INFO L290 TraceCheckUtils]: 53: Hoare triple {10356#false} assume !false; {10356#false} is VALID [2022-04-08 14:02:13,093 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:02:13,093 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:02:13,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {10356#false} assume !false; {10356#false} is VALID [2022-04-08 14:02:13,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {10356#false} assume 0 == ~cond; {10356#false} is VALID [2022-04-08 14:02:13,335 INFO L290 TraceCheckUtils]: 51: Hoare triple {10356#false} ~cond := #in~cond; {10356#false} is VALID [2022-04-08 14:02:13,335 INFO L272 TraceCheckUtils]: 50: Hoare triple {10356#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {10356#false} is VALID [2022-04-08 14:02:13,335 INFO L290 TraceCheckUtils]: 49: Hoare triple {10537#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {10356#false} is VALID [2022-04-08 14:02:13,335 INFO L290 TraceCheckUtils]: 48: Hoare triple {10541#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10537#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:02:13,336 INFO L290 TraceCheckUtils]: 47: Hoare triple {10541#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10541#(< ~counter~0 20)} is VALID [2022-04-08 14:02:13,336 INFO L290 TraceCheckUtils]: 46: Hoare triple {10541#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {10541#(< ~counter~0 20)} is VALID [2022-04-08 14:02:13,336 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {10355#true} {10541#(< ~counter~0 20)} #71#return; {10541#(< ~counter~0 20)} is VALID [2022-04-08 14:02:13,336 INFO L290 TraceCheckUtils]: 44: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-08 14:02:13,337 INFO L290 TraceCheckUtils]: 43: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-08 14:02:13,337 INFO L290 TraceCheckUtils]: 42: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-08 14:02:13,337 INFO L272 TraceCheckUtils]: 41: Hoare triple {10541#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-08 14:02:13,337 INFO L290 TraceCheckUtils]: 40: Hoare triple {10541#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {10541#(< ~counter~0 20)} is VALID [2022-04-08 14:02:13,337 INFO L290 TraceCheckUtils]: 39: Hoare triple {10569#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10541#(< ~counter~0 20)} is VALID [2022-04-08 14:02:13,338 INFO L290 TraceCheckUtils]: 38: Hoare triple {10569#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10569#(< ~counter~0 19)} is VALID [2022-04-08 14:02:13,338 INFO L290 TraceCheckUtils]: 37: Hoare triple {10569#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {10569#(< ~counter~0 19)} is VALID [2022-04-08 14:02:13,338 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {10355#true} {10569#(< ~counter~0 19)} #71#return; {10569#(< ~counter~0 19)} is VALID [2022-04-08 14:02:13,339 INFO L290 TraceCheckUtils]: 35: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-08 14:02:13,339 INFO L290 TraceCheckUtils]: 34: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-08 14:02:13,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-08 14:02:13,339 INFO L272 TraceCheckUtils]: 32: Hoare triple {10569#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-08 14:02:13,339 INFO L290 TraceCheckUtils]: 31: Hoare triple {10569#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {10569#(< ~counter~0 19)} is VALID [2022-04-08 14:02:13,340 INFO L290 TraceCheckUtils]: 30: Hoare triple {10597#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10569#(< ~counter~0 19)} is VALID [2022-04-08 14:02:13,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {10597#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10597#(< ~counter~0 18)} is VALID [2022-04-08 14:02:13,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {10597#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {10597#(< ~counter~0 18)} is VALID [2022-04-08 14:02:13,341 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {10355#true} {10597#(< ~counter~0 18)} #71#return; {10597#(< ~counter~0 18)} is VALID [2022-04-08 14:02:13,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-08 14:02:13,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-08 14:02:13,341 INFO L290 TraceCheckUtils]: 24: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-08 14:02:13,341 INFO L272 TraceCheckUtils]: 23: Hoare triple {10597#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-08 14:02:13,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {10597#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {10597#(< ~counter~0 18)} is VALID [2022-04-08 14:02:13,342 INFO L290 TraceCheckUtils]: 21: Hoare triple {10625#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10597#(< ~counter~0 18)} is VALID [2022-04-08 14:02:13,342 INFO L290 TraceCheckUtils]: 20: Hoare triple {10625#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {10625#(< ~counter~0 17)} is VALID [2022-04-08 14:02:13,342 INFO L290 TraceCheckUtils]: 19: Hoare triple {10625#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {10625#(< ~counter~0 17)} is VALID [2022-04-08 14:02:13,343 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {10355#true} {10625#(< ~counter~0 17)} #71#return; {10625#(< ~counter~0 17)} is VALID [2022-04-08 14:02:13,343 INFO L290 TraceCheckUtils]: 17: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-08 14:02:13,343 INFO L290 TraceCheckUtils]: 16: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-08 14:02:13,343 INFO L290 TraceCheckUtils]: 15: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-08 14:02:13,343 INFO L272 TraceCheckUtils]: 14: Hoare triple {10625#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {10355#true} is VALID [2022-04-08 14:02:13,343 INFO L290 TraceCheckUtils]: 13: Hoare triple {10625#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {10625#(< ~counter~0 17)} is VALID [2022-04-08 14:02:13,344 INFO L290 TraceCheckUtils]: 12: Hoare triple {10653#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10625#(< ~counter~0 17)} is VALID [2022-04-08 14:02:13,344 INFO L290 TraceCheckUtils]: 11: Hoare triple {10653#(< ~counter~0 16)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {10653#(< ~counter~0 16)} is VALID [2022-04-08 14:02:13,344 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10355#true} {10653#(< ~counter~0 16)} #69#return; {10653#(< ~counter~0 16)} is VALID [2022-04-08 14:02:13,344 INFO L290 TraceCheckUtils]: 9: Hoare triple {10355#true} assume true; {10355#true} is VALID [2022-04-08 14:02:13,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {10355#true} assume !(0 == ~cond); {10355#true} is VALID [2022-04-08 14:02:13,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {10355#true} ~cond := #in~cond; {10355#true} is VALID [2022-04-08 14:02:13,345 INFO L272 TraceCheckUtils]: 6: Hoare triple {10653#(< ~counter~0 16)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {10355#true} is VALID [2022-04-08 14:02:13,345 INFO L290 TraceCheckUtils]: 5: Hoare triple {10653#(< ~counter~0 16)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {10653#(< ~counter~0 16)} is VALID [2022-04-08 14:02:13,345 INFO L272 TraceCheckUtils]: 4: Hoare triple {10653#(< ~counter~0 16)} call #t~ret7 := main(); {10653#(< ~counter~0 16)} is VALID [2022-04-08 14:02:13,345 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10653#(< ~counter~0 16)} {10355#true} #77#return; {10653#(< ~counter~0 16)} is VALID [2022-04-08 14:02:13,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {10653#(< ~counter~0 16)} assume true; {10653#(< ~counter~0 16)} is VALID [2022-04-08 14:02:13,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {10355#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {10653#(< ~counter~0 16)} is VALID [2022-04-08 14:02:13,346 INFO L272 TraceCheckUtils]: 0: Hoare triple {10355#true} call ULTIMATE.init(); {10355#true} is VALID [2022-04-08 14:02:13,346 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-04-08 14:02:13,346 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:02:13,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564388355] [2022-04-08 14:02:13,347 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:02:13,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503060546] [2022-04-08 14:02:13,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503060546] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:02:13,347 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:02:13,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 14:02:13,347 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:02:13,347 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [988807577] [2022-04-08 14:02:13,347 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [988807577] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:02:13,347 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:02:13,347 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 14:02:13,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749878587] [2022-04-08 14:02:13,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:02:13,348 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-04-08 14:02:13,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:02:13,348 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:02:13,383 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 14:02:13,383 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 14:02:13,383 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:02:13,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 14:02:13,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 14:02:13,383 INFO L87 Difference]: Start difference. First operand 76 states and 90 transitions. Second operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:02:13,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:02:13,674 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-04-08 14:02:13,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 14:02:13,675 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2022-04-08 14:02:13,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:02:13,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:02:13,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-04-08 14:02:13,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:02:13,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 99 transitions. [2022-04-08 14:02:13,677 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 99 transitions. [2022-04-08 14:02:13,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:02:13,756 INFO L225 Difference]: With dead ends: 95 [2022-04-08 14:02:13,756 INFO L226 Difference]: Without dead ends: 87 [2022-04-08 14:02:13,757 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 95 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 14:02:13,757 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 53 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:02:13,757 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 134 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:02:13,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-04-08 14:02:13,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-04-08 14:02:13,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:02:13,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:02:13,890 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:02:13,890 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:02:13,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:02:13,891 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-08 14:02:13,891 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-08 14:02:13,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:02:13,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:02:13,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 87 states. [2022-04-08 14:02:13,892 INFO L87 Difference]: Start difference. First operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 87 states. [2022-04-08 14:02:13,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:02:13,893 INFO L93 Difference]: Finished difference Result 87 states and 104 transitions. [2022-04-08 14:02:13,893 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-08 14:02:13,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:02:13,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:02:13,893 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:02:13,893 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:02:13,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 66 states have (on average 1.2727272727272727) internal successors, (84), 67 states have internal predecessors, (84), 11 states have call successors, (11), 10 states have call predecessors, (11), 9 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:02:13,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 104 transitions. [2022-04-08 14:02:13,894 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 104 transitions. Word has length 54 [2022-04-08 14:02:13,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:02:13,894 INFO L478 AbstractCegarLoop]: Abstraction has 87 states and 104 transitions. [2022-04-08 14:02:13,894 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 5 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-08 14:02:13,895 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 87 states and 104 transitions. [2022-04-08 14:02:22,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 100 inductive. 0 not inductive. 4 times theorem prover too weak to decide inductivity. [2022-04-08 14:02:22,554 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 104 transitions. [2022-04-08 14:02:22,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-08 14:02:22,554 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:02:22,554 INFO L499 BasicCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:02:22,572 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 14:02:22,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-08 14:02:22,767 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:02:22,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:02:22,768 INFO L85 PathProgramCache]: Analyzing trace with hash -323774, now seen corresponding path program 9 times [2022-04-08 14:02:22,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:02:22,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1692259717] [2022-04-08 14:02:28,817 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:02:28,818 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:02:28,818 INFO L85 PathProgramCache]: Analyzing trace with hash -323774, now seen corresponding path program 10 times [2022-04-08 14:02:28,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:02:28,818 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887449149] [2022-04-08 14:02:28,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:02:28,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:02:28,828 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:02:28,828 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [117609628] [2022-04-08 14:02:28,828 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:02:28,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:02:28,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:02:28,829 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 14:02:28,830 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 14:02:28,922 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:02:28,922 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:02:28,923 INFO L263 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 14:02:28,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:02:28,935 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:02:29,190 INFO L272 TraceCheckUtils]: 0: Hoare triple {11238#true} call ULTIMATE.init(); {11238#true} is VALID [2022-04-08 14:02:29,191 INFO L290 TraceCheckUtils]: 1: Hoare triple {11238#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,191 INFO L290 TraceCheckUtils]: 2: Hoare triple {11246#(<= ~counter~0 0)} assume true; {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,192 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11246#(<= ~counter~0 0)} {11238#true} #77#return; {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,192 INFO L272 TraceCheckUtils]: 4: Hoare triple {11246#(<= ~counter~0 0)} call #t~ret7 := main(); {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {11246#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,193 INFO L272 TraceCheckUtils]: 6: Hoare triple {11246#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {11246#(<= ~counter~0 0)} ~cond := #in~cond; {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {11246#(<= ~counter~0 0)} assume !(0 == ~cond); {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {11246#(<= ~counter~0 0)} assume true; {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,194 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11246#(<= ~counter~0 0)} {11246#(<= ~counter~0 0)} #69#return; {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,194 INFO L290 TraceCheckUtils]: 11: Hoare triple {11246#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11246#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:29,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {11246#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11280#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:29,195 INFO L290 TraceCheckUtils]: 13: Hoare triple {11280#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {11280#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:29,195 INFO L272 TraceCheckUtils]: 14: Hoare triple {11280#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11280#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:29,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {11280#(<= ~counter~0 1)} ~cond := #in~cond; {11280#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:29,196 INFO L290 TraceCheckUtils]: 16: Hoare triple {11280#(<= ~counter~0 1)} assume !(0 == ~cond); {11280#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:29,196 INFO L290 TraceCheckUtils]: 17: Hoare triple {11280#(<= ~counter~0 1)} assume true; {11280#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:29,196 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11280#(<= ~counter~0 1)} {11280#(<= ~counter~0 1)} #71#return; {11280#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:29,197 INFO L290 TraceCheckUtils]: 19: Hoare triple {11280#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {11280#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:29,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {11280#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11280#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:29,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {11280#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11308#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:29,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {11308#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {11308#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:29,198 INFO L272 TraceCheckUtils]: 23: Hoare triple {11308#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11308#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:29,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {11308#(<= ~counter~0 2)} ~cond := #in~cond; {11308#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:29,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {11308#(<= ~counter~0 2)} assume !(0 == ~cond); {11308#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:29,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {11308#(<= ~counter~0 2)} assume true; {11308#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:29,199 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11308#(<= ~counter~0 2)} {11308#(<= ~counter~0 2)} #71#return; {11308#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:29,200 INFO L290 TraceCheckUtils]: 28: Hoare triple {11308#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {11308#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:29,200 INFO L290 TraceCheckUtils]: 29: Hoare triple {11308#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11308#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:29,200 INFO L290 TraceCheckUtils]: 30: Hoare triple {11308#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11336#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:29,201 INFO L290 TraceCheckUtils]: 31: Hoare triple {11336#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {11336#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:29,201 INFO L272 TraceCheckUtils]: 32: Hoare triple {11336#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11336#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:29,201 INFO L290 TraceCheckUtils]: 33: Hoare triple {11336#(<= ~counter~0 3)} ~cond := #in~cond; {11336#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:29,202 INFO L290 TraceCheckUtils]: 34: Hoare triple {11336#(<= ~counter~0 3)} assume !(0 == ~cond); {11336#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:29,202 INFO L290 TraceCheckUtils]: 35: Hoare triple {11336#(<= ~counter~0 3)} assume true; {11336#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:29,202 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11336#(<= ~counter~0 3)} {11336#(<= ~counter~0 3)} #71#return; {11336#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:29,203 INFO L290 TraceCheckUtils]: 37: Hoare triple {11336#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {11336#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:29,203 INFO L290 TraceCheckUtils]: 38: Hoare triple {11336#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11336#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:29,203 INFO L290 TraceCheckUtils]: 39: Hoare triple {11336#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11364#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:29,203 INFO L290 TraceCheckUtils]: 40: Hoare triple {11364#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {11364#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:29,204 INFO L272 TraceCheckUtils]: 41: Hoare triple {11364#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11364#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:29,204 INFO L290 TraceCheckUtils]: 42: Hoare triple {11364#(<= ~counter~0 4)} ~cond := #in~cond; {11364#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:29,204 INFO L290 TraceCheckUtils]: 43: Hoare triple {11364#(<= ~counter~0 4)} assume !(0 == ~cond); {11364#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:29,205 INFO L290 TraceCheckUtils]: 44: Hoare triple {11364#(<= ~counter~0 4)} assume true; {11364#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:29,205 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11364#(<= ~counter~0 4)} {11364#(<= ~counter~0 4)} #71#return; {11364#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:29,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {11364#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {11364#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:29,206 INFO L290 TraceCheckUtils]: 47: Hoare triple {11364#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11364#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:29,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {11364#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11392#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:29,206 INFO L290 TraceCheckUtils]: 49: Hoare triple {11392#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {11392#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:29,207 INFO L272 TraceCheckUtils]: 50: Hoare triple {11392#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11392#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:29,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {11392#(<= ~counter~0 5)} ~cond := #in~cond; {11392#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:29,207 INFO L290 TraceCheckUtils]: 52: Hoare triple {11392#(<= ~counter~0 5)} assume !(0 == ~cond); {11392#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:29,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {11392#(<= ~counter~0 5)} assume true; {11392#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:29,208 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11392#(<= ~counter~0 5)} {11392#(<= ~counter~0 5)} #71#return; {11392#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:29,208 INFO L290 TraceCheckUtils]: 55: Hoare triple {11392#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {11392#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:29,209 INFO L290 TraceCheckUtils]: 56: Hoare triple {11392#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11392#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:29,209 INFO L290 TraceCheckUtils]: 57: Hoare triple {11392#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11420#(<= |main_#t~post6| 5)} is VALID [2022-04-08 14:02:29,209 INFO L290 TraceCheckUtils]: 58: Hoare triple {11420#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {11239#false} is VALID [2022-04-08 14:02:29,209 INFO L272 TraceCheckUtils]: 59: Hoare triple {11239#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11239#false} is VALID [2022-04-08 14:02:29,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {11239#false} ~cond := #in~cond; {11239#false} is VALID [2022-04-08 14:02:29,210 INFO L290 TraceCheckUtils]: 61: Hoare triple {11239#false} assume 0 == ~cond; {11239#false} is VALID [2022-04-08 14:02:29,210 INFO L290 TraceCheckUtils]: 62: Hoare triple {11239#false} assume !false; {11239#false} is VALID [2022-04-08 14:02:29,210 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:02:29,210 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:02:29,490 INFO L290 TraceCheckUtils]: 62: Hoare triple {11239#false} assume !false; {11239#false} is VALID [2022-04-08 14:02:29,490 INFO L290 TraceCheckUtils]: 61: Hoare triple {11239#false} assume 0 == ~cond; {11239#false} is VALID [2022-04-08 14:02:29,490 INFO L290 TraceCheckUtils]: 60: Hoare triple {11239#false} ~cond := #in~cond; {11239#false} is VALID [2022-04-08 14:02:29,490 INFO L272 TraceCheckUtils]: 59: Hoare triple {11239#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {11239#false} is VALID [2022-04-08 14:02:29,490 INFO L290 TraceCheckUtils]: 58: Hoare triple {11448#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {11239#false} is VALID [2022-04-08 14:02:29,490 INFO L290 TraceCheckUtils]: 57: Hoare triple {11452#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11448#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:02:29,491 INFO L290 TraceCheckUtils]: 56: Hoare triple {11452#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11452#(< ~counter~0 20)} is VALID [2022-04-08 14:02:29,491 INFO L290 TraceCheckUtils]: 55: Hoare triple {11452#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {11452#(< ~counter~0 20)} is VALID [2022-04-08 14:02:29,492 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {11238#true} {11452#(< ~counter~0 20)} #71#return; {11452#(< ~counter~0 20)} is VALID [2022-04-08 14:02:29,492 INFO L290 TraceCheckUtils]: 53: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-08 14:02:29,492 INFO L290 TraceCheckUtils]: 52: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-08 14:02:29,492 INFO L290 TraceCheckUtils]: 51: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-08 14:02:29,492 INFO L272 TraceCheckUtils]: 50: Hoare triple {11452#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-08 14:02:29,492 INFO L290 TraceCheckUtils]: 49: Hoare triple {11452#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {11452#(< ~counter~0 20)} is VALID [2022-04-08 14:02:29,493 INFO L290 TraceCheckUtils]: 48: Hoare triple {11480#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11452#(< ~counter~0 20)} is VALID [2022-04-08 14:02:29,493 INFO L290 TraceCheckUtils]: 47: Hoare triple {11480#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11480#(< ~counter~0 19)} is VALID [2022-04-08 14:02:29,493 INFO L290 TraceCheckUtils]: 46: Hoare triple {11480#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {11480#(< ~counter~0 19)} is VALID [2022-04-08 14:02:29,494 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {11238#true} {11480#(< ~counter~0 19)} #71#return; {11480#(< ~counter~0 19)} is VALID [2022-04-08 14:02:29,494 INFO L290 TraceCheckUtils]: 44: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-08 14:02:29,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-08 14:02:29,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-08 14:02:29,494 INFO L272 TraceCheckUtils]: 41: Hoare triple {11480#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-08 14:02:29,494 INFO L290 TraceCheckUtils]: 40: Hoare triple {11480#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {11480#(< ~counter~0 19)} is VALID [2022-04-08 14:02:29,495 INFO L290 TraceCheckUtils]: 39: Hoare triple {11508#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11480#(< ~counter~0 19)} is VALID [2022-04-08 14:02:29,495 INFO L290 TraceCheckUtils]: 38: Hoare triple {11508#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11508#(< ~counter~0 18)} is VALID [2022-04-08 14:02:29,495 INFO L290 TraceCheckUtils]: 37: Hoare triple {11508#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {11508#(< ~counter~0 18)} is VALID [2022-04-08 14:02:29,496 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {11238#true} {11508#(< ~counter~0 18)} #71#return; {11508#(< ~counter~0 18)} is VALID [2022-04-08 14:02:29,496 INFO L290 TraceCheckUtils]: 35: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-08 14:02:29,496 INFO L290 TraceCheckUtils]: 34: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-08 14:02:29,496 INFO L290 TraceCheckUtils]: 33: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-08 14:02:29,496 INFO L272 TraceCheckUtils]: 32: Hoare triple {11508#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-08 14:02:29,496 INFO L290 TraceCheckUtils]: 31: Hoare triple {11508#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {11508#(< ~counter~0 18)} is VALID [2022-04-08 14:02:29,497 INFO L290 TraceCheckUtils]: 30: Hoare triple {11536#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11508#(< ~counter~0 18)} is VALID [2022-04-08 14:02:29,497 INFO L290 TraceCheckUtils]: 29: Hoare triple {11536#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11536#(< ~counter~0 17)} is VALID [2022-04-08 14:02:29,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {11536#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {11536#(< ~counter~0 17)} is VALID [2022-04-08 14:02:29,498 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {11238#true} {11536#(< ~counter~0 17)} #71#return; {11536#(< ~counter~0 17)} is VALID [2022-04-08 14:02:29,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-08 14:02:29,498 INFO L290 TraceCheckUtils]: 25: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-08 14:02:29,498 INFO L290 TraceCheckUtils]: 24: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-08 14:02:29,498 INFO L272 TraceCheckUtils]: 23: Hoare triple {11536#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-08 14:02:29,498 INFO L290 TraceCheckUtils]: 22: Hoare triple {11536#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {11536#(< ~counter~0 17)} is VALID [2022-04-08 14:02:29,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {11564#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11536#(< ~counter~0 17)} is VALID [2022-04-08 14:02:29,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {11564#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {11564#(< ~counter~0 16)} is VALID [2022-04-08 14:02:29,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {11564#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {11564#(< ~counter~0 16)} is VALID [2022-04-08 14:02:29,500 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {11238#true} {11564#(< ~counter~0 16)} #71#return; {11564#(< ~counter~0 16)} is VALID [2022-04-08 14:02:29,500 INFO L290 TraceCheckUtils]: 17: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-08 14:02:29,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-08 14:02:29,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-08 14:02:29,500 INFO L272 TraceCheckUtils]: 14: Hoare triple {11564#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {11238#true} is VALID [2022-04-08 14:02:29,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {11564#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {11564#(< ~counter~0 16)} is VALID [2022-04-08 14:02:29,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {11592#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11564#(< ~counter~0 16)} is VALID [2022-04-08 14:02:29,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {11592#(< ~counter~0 15)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {11592#(< ~counter~0 15)} is VALID [2022-04-08 14:02:29,501 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11238#true} {11592#(< ~counter~0 15)} #69#return; {11592#(< ~counter~0 15)} is VALID [2022-04-08 14:02:29,501 INFO L290 TraceCheckUtils]: 9: Hoare triple {11238#true} assume true; {11238#true} is VALID [2022-04-08 14:02:29,501 INFO L290 TraceCheckUtils]: 8: Hoare triple {11238#true} assume !(0 == ~cond); {11238#true} is VALID [2022-04-08 14:02:29,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {11238#true} ~cond := #in~cond; {11238#true} is VALID [2022-04-08 14:02:29,502 INFO L272 TraceCheckUtils]: 6: Hoare triple {11592#(< ~counter~0 15)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {11238#true} is VALID [2022-04-08 14:02:29,502 INFO L290 TraceCheckUtils]: 5: Hoare triple {11592#(< ~counter~0 15)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {11592#(< ~counter~0 15)} is VALID [2022-04-08 14:02:29,502 INFO L272 TraceCheckUtils]: 4: Hoare triple {11592#(< ~counter~0 15)} call #t~ret7 := main(); {11592#(< ~counter~0 15)} is VALID [2022-04-08 14:02:29,502 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11592#(< ~counter~0 15)} {11238#true} #77#return; {11592#(< ~counter~0 15)} is VALID [2022-04-08 14:02:29,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {11592#(< ~counter~0 15)} assume true; {11592#(< ~counter~0 15)} is VALID [2022-04-08 14:02:29,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {11238#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {11592#(< ~counter~0 15)} is VALID [2022-04-08 14:02:29,503 INFO L272 TraceCheckUtils]: 0: Hoare triple {11238#true} call ULTIMATE.init(); {11238#true} is VALID [2022-04-08 14:02:29,503 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 10 proven. 60 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2022-04-08 14:02:29,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:02:29,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887449149] [2022-04-08 14:02:29,504 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:02:29,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [117609628] [2022-04-08 14:02:29,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [117609628] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:02:29,504 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:02:29,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 14:02:29,504 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:02:29,504 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1692259717] [2022-04-08 14:02:29,504 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1692259717] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:02:29,504 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:02:29,504 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 14:02:29,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [345414343] [2022-04-08 14:02:29,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:02:29,505 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 63 [2022-04-08 14:02:29,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:02:29,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:02:29,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:02:29,547 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 14:02:29,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:02:29,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 14:02:29,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 14:02:29,548 INFO L87 Difference]: Start difference. First operand 87 states and 104 transitions. Second operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:02:29,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:02:29,856 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2022-04-08 14:02:29,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 14:02:29,856 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) Word has length 63 [2022-04-08 14:02:29,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:02:29,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:02:29,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-04-08 14:02:29,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:02:29,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 113 transitions. [2022-04-08 14:02:29,860 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 113 transitions. [2022-04-08 14:02:29,949 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 14:02:29,950 INFO L225 Difference]: With dead ends: 106 [2022-04-08 14:02:29,950 INFO L226 Difference]: Without dead ends: 98 [2022-04-08 14:02:29,950 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 130 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=171, Invalid=249, Unknown=0, NotChecked=0, Total=420 [2022-04-08 14:02:29,951 INFO L913 BasicCegarLoop]: 35 mSDtfsCounter, 84 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:02:29,951 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 138 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:02:29,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-08 14:02:30,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2022-04-08 14:02:30,089 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:02:30,089 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:02:30,089 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:02:30,089 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:02:30,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:02:30,091 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-04-08 14:02:30,091 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-04-08 14:02:30,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:02:30,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:02:30,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 98 states. [2022-04-08 14:02:30,091 INFO L87 Difference]: Start difference. First operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 98 states. [2022-04-08 14:02:30,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:02:30,092 INFO L93 Difference]: Finished difference Result 98 states and 118 transitions. [2022-04-08 14:02:30,092 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-04-08 14:02:30,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:02:30,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:02:30,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:02:30,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:02:30,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.28) internal successors, (96), 76 states have internal predecessors, (96), 12 states have call successors, (12), 11 states have call predecessors, (12), 10 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:02:30,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 118 transitions. [2022-04-08 14:02:30,094 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 118 transitions. Word has length 63 [2022-04-08 14:02:30,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:02:30,094 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 118 transitions. [2022-04-08 14:02:30,095 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 6 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-08 14:02:30,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 118 transitions. [2022-04-08 14:02:40,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 113 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-08 14:02:40,931 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 118 transitions. [2022-04-08 14:02:40,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2022-04-08 14:02:40,932 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:02:40,932 INFO L499 BasicCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:02:40,950 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 14:02:41,147 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:02:41,147 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:02:41,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:02:41,148 INFO L85 PathProgramCache]: Analyzing trace with hash -1454644230, now seen corresponding path program 11 times [2022-04-08 14:02:41,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:02:41,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1763810877] [2022-04-08 14:02:47,194 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:02:47,194 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:02:47,194 INFO L85 PathProgramCache]: Analyzing trace with hash -1454644230, now seen corresponding path program 12 times [2022-04-08 14:02:47,194 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:02:47,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2017316512] [2022-04-08 14:02:47,194 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:02:47,195 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:02:47,207 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:02:47,207 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2039543340] [2022-04-08 14:02:47,207 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:02:47,207 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:02:47,207 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:02:47,208 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 14:02:47,208 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 14:02:47,266 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 14:02:47,266 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:02:47,267 INFO L263 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 14:02:47,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:02:47,281 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:02:47,572 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-08 14:02:47,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,573 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#(<= ~counter~0 0)} {12245#true} #77#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,574 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#(<= ~counter~0 0)} call #t~ret7 := main(); {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,574 INFO L272 TraceCheckUtils]: 6: Hoare triple {12253#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,575 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#(<= ~counter~0 0)} ~cond := #in~cond; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#(<= ~counter~0 0)} assume !(0 == ~cond); {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12253#(<= ~counter~0 0)} {12253#(<= ~counter~0 0)} #69#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,576 INFO L290 TraceCheckUtils]: 11: Hoare triple {12253#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 14:02:47,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {12253#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12287#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:47,577 INFO L290 TraceCheckUtils]: 13: Hoare triple {12287#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {12287#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:47,577 INFO L272 TraceCheckUtils]: 14: Hoare triple {12287#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12287#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:47,577 INFO L290 TraceCheckUtils]: 15: Hoare triple {12287#(<= ~counter~0 1)} ~cond := #in~cond; {12287#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:47,578 INFO L290 TraceCheckUtils]: 16: Hoare triple {12287#(<= ~counter~0 1)} assume !(0 == ~cond); {12287#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:47,578 INFO L290 TraceCheckUtils]: 17: Hoare triple {12287#(<= ~counter~0 1)} assume true; {12287#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:47,579 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12287#(<= ~counter~0 1)} {12287#(<= ~counter~0 1)} #71#return; {12287#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:47,579 INFO L290 TraceCheckUtils]: 19: Hoare triple {12287#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {12287#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:47,579 INFO L290 TraceCheckUtils]: 20: Hoare triple {12287#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12287#(<= ~counter~0 1)} is VALID [2022-04-08 14:02:47,579 INFO L290 TraceCheckUtils]: 21: Hoare triple {12287#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12315#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:47,580 INFO L290 TraceCheckUtils]: 22: Hoare triple {12315#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {12315#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:47,580 INFO L272 TraceCheckUtils]: 23: Hoare triple {12315#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12315#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:47,581 INFO L290 TraceCheckUtils]: 24: Hoare triple {12315#(<= ~counter~0 2)} ~cond := #in~cond; {12315#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:47,581 INFO L290 TraceCheckUtils]: 25: Hoare triple {12315#(<= ~counter~0 2)} assume !(0 == ~cond); {12315#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:47,581 INFO L290 TraceCheckUtils]: 26: Hoare triple {12315#(<= ~counter~0 2)} assume true; {12315#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:47,582 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12315#(<= ~counter~0 2)} {12315#(<= ~counter~0 2)} #71#return; {12315#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:47,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {12315#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {12315#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:47,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {12315#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12315#(<= ~counter~0 2)} is VALID [2022-04-08 14:02:47,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {12315#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12343#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:47,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {12343#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {12343#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:47,583 INFO L272 TraceCheckUtils]: 32: Hoare triple {12343#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12343#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:47,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {12343#(<= ~counter~0 3)} ~cond := #in~cond; {12343#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:47,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {12343#(<= ~counter~0 3)} assume !(0 == ~cond); {12343#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:47,584 INFO L290 TraceCheckUtils]: 35: Hoare triple {12343#(<= ~counter~0 3)} assume true; {12343#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:47,585 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12343#(<= ~counter~0 3)} {12343#(<= ~counter~0 3)} #71#return; {12343#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:47,585 INFO L290 TraceCheckUtils]: 37: Hoare triple {12343#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {12343#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:47,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {12343#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12343#(<= ~counter~0 3)} is VALID [2022-04-08 14:02:47,586 INFO L290 TraceCheckUtils]: 39: Hoare triple {12343#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12371#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:47,586 INFO L290 TraceCheckUtils]: 40: Hoare triple {12371#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {12371#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:47,586 INFO L272 TraceCheckUtils]: 41: Hoare triple {12371#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12371#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:47,587 INFO L290 TraceCheckUtils]: 42: Hoare triple {12371#(<= ~counter~0 4)} ~cond := #in~cond; {12371#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:47,587 INFO L290 TraceCheckUtils]: 43: Hoare triple {12371#(<= ~counter~0 4)} assume !(0 == ~cond); {12371#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:47,587 INFO L290 TraceCheckUtils]: 44: Hoare triple {12371#(<= ~counter~0 4)} assume true; {12371#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:47,588 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12371#(<= ~counter~0 4)} {12371#(<= ~counter~0 4)} #71#return; {12371#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:47,588 INFO L290 TraceCheckUtils]: 46: Hoare triple {12371#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {12371#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:47,588 INFO L290 TraceCheckUtils]: 47: Hoare triple {12371#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12371#(<= ~counter~0 4)} is VALID [2022-04-08 14:02:47,589 INFO L290 TraceCheckUtils]: 48: Hoare triple {12371#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12399#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:47,589 INFO L290 TraceCheckUtils]: 49: Hoare triple {12399#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {12399#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:47,589 INFO L272 TraceCheckUtils]: 50: Hoare triple {12399#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12399#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:47,590 INFO L290 TraceCheckUtils]: 51: Hoare triple {12399#(<= ~counter~0 5)} ~cond := #in~cond; {12399#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:47,590 INFO L290 TraceCheckUtils]: 52: Hoare triple {12399#(<= ~counter~0 5)} assume !(0 == ~cond); {12399#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:47,590 INFO L290 TraceCheckUtils]: 53: Hoare triple {12399#(<= ~counter~0 5)} assume true; {12399#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:47,591 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12399#(<= ~counter~0 5)} {12399#(<= ~counter~0 5)} #71#return; {12399#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:47,591 INFO L290 TraceCheckUtils]: 55: Hoare triple {12399#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {12399#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:47,591 INFO L290 TraceCheckUtils]: 56: Hoare triple {12399#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12399#(<= ~counter~0 5)} is VALID [2022-04-08 14:02:47,592 INFO L290 TraceCheckUtils]: 57: Hoare triple {12399#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12427#(<= ~counter~0 6)} is VALID [2022-04-08 14:02:47,592 INFO L290 TraceCheckUtils]: 58: Hoare triple {12427#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {12427#(<= ~counter~0 6)} is VALID [2022-04-08 14:02:47,592 INFO L272 TraceCheckUtils]: 59: Hoare triple {12427#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12427#(<= ~counter~0 6)} is VALID [2022-04-08 14:02:47,593 INFO L290 TraceCheckUtils]: 60: Hoare triple {12427#(<= ~counter~0 6)} ~cond := #in~cond; {12427#(<= ~counter~0 6)} is VALID [2022-04-08 14:02:47,593 INFO L290 TraceCheckUtils]: 61: Hoare triple {12427#(<= ~counter~0 6)} assume !(0 == ~cond); {12427#(<= ~counter~0 6)} is VALID [2022-04-08 14:02:47,593 INFO L290 TraceCheckUtils]: 62: Hoare triple {12427#(<= ~counter~0 6)} assume true; {12427#(<= ~counter~0 6)} is VALID [2022-04-08 14:02:47,594 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12427#(<= ~counter~0 6)} {12427#(<= ~counter~0 6)} #71#return; {12427#(<= ~counter~0 6)} is VALID [2022-04-08 14:02:47,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {12427#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {12427#(<= ~counter~0 6)} is VALID [2022-04-08 14:02:47,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {12427#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12427#(<= ~counter~0 6)} is VALID [2022-04-08 14:02:47,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {12427#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12455#(<= |main_#t~post6| 6)} is VALID [2022-04-08 14:02:47,595 INFO L290 TraceCheckUtils]: 67: Hoare triple {12455#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {12246#false} is VALID [2022-04-08 14:02:47,595 INFO L272 TraceCheckUtils]: 68: Hoare triple {12246#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12246#false} is VALID [2022-04-08 14:02:47,595 INFO L290 TraceCheckUtils]: 69: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-08 14:02:47,595 INFO L290 TraceCheckUtils]: 70: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-08 14:02:47,595 INFO L290 TraceCheckUtils]: 71: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-08 14:02:47,595 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 12 proven. 147 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:02:47,596 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:02:47,935 INFO L290 TraceCheckUtils]: 71: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-08 14:02:47,936 INFO L290 TraceCheckUtils]: 70: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-08 14:02:47,936 INFO L290 TraceCheckUtils]: 69: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-08 14:02:47,936 INFO L272 TraceCheckUtils]: 68: Hoare triple {12246#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {12246#false} is VALID [2022-04-08 14:02:47,936 INFO L290 TraceCheckUtils]: 67: Hoare triple {12483#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {12246#false} is VALID [2022-04-08 14:02:47,936 INFO L290 TraceCheckUtils]: 66: Hoare triple {12487#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12483#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:02:47,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {12487#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12487#(< ~counter~0 20)} is VALID [2022-04-08 14:02:47,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {12487#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {12487#(< ~counter~0 20)} is VALID [2022-04-08 14:02:47,937 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12245#true} {12487#(< ~counter~0 20)} #71#return; {12487#(< ~counter~0 20)} is VALID [2022-04-08 14:02:47,937 INFO L290 TraceCheckUtils]: 62: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 14:02:47,938 INFO L290 TraceCheckUtils]: 61: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 14:02:47,938 INFO L290 TraceCheckUtils]: 60: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 14:02:47,938 INFO L272 TraceCheckUtils]: 59: Hoare triple {12487#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-08 14:02:47,938 INFO L290 TraceCheckUtils]: 58: Hoare triple {12487#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {12487#(< ~counter~0 20)} is VALID [2022-04-08 14:02:47,938 INFO L290 TraceCheckUtils]: 57: Hoare triple {12515#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12487#(< ~counter~0 20)} is VALID [2022-04-08 14:02:47,939 INFO L290 TraceCheckUtils]: 56: Hoare triple {12515#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12515#(< ~counter~0 19)} is VALID [2022-04-08 14:02:47,939 INFO L290 TraceCheckUtils]: 55: Hoare triple {12515#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {12515#(< ~counter~0 19)} is VALID [2022-04-08 14:02:47,940 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {12245#true} {12515#(< ~counter~0 19)} #71#return; {12515#(< ~counter~0 19)} is VALID [2022-04-08 14:02:47,940 INFO L290 TraceCheckUtils]: 53: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 14:02:47,940 INFO L290 TraceCheckUtils]: 52: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 14:02:47,940 INFO L290 TraceCheckUtils]: 51: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 14:02:47,940 INFO L272 TraceCheckUtils]: 50: Hoare triple {12515#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-08 14:02:47,940 INFO L290 TraceCheckUtils]: 49: Hoare triple {12515#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {12515#(< ~counter~0 19)} is VALID [2022-04-08 14:02:47,941 INFO L290 TraceCheckUtils]: 48: Hoare triple {12543#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12515#(< ~counter~0 19)} is VALID [2022-04-08 14:02:47,941 INFO L290 TraceCheckUtils]: 47: Hoare triple {12543#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12543#(< ~counter~0 18)} is VALID [2022-04-08 14:02:47,941 INFO L290 TraceCheckUtils]: 46: Hoare triple {12543#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {12543#(< ~counter~0 18)} is VALID [2022-04-08 14:02:47,942 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {12245#true} {12543#(< ~counter~0 18)} #71#return; {12543#(< ~counter~0 18)} is VALID [2022-04-08 14:02:47,942 INFO L290 TraceCheckUtils]: 44: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 14:02:47,942 INFO L290 TraceCheckUtils]: 43: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 14:02:47,942 INFO L290 TraceCheckUtils]: 42: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 14:02:47,942 INFO L272 TraceCheckUtils]: 41: Hoare triple {12543#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-08 14:02:47,942 INFO L290 TraceCheckUtils]: 40: Hoare triple {12543#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {12543#(< ~counter~0 18)} is VALID [2022-04-08 14:02:47,943 INFO L290 TraceCheckUtils]: 39: Hoare triple {12571#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12543#(< ~counter~0 18)} is VALID [2022-04-08 14:02:47,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {12571#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12571#(< ~counter~0 17)} is VALID [2022-04-08 14:02:47,943 INFO L290 TraceCheckUtils]: 37: Hoare triple {12571#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {12571#(< ~counter~0 17)} is VALID [2022-04-08 14:02:47,944 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {12245#true} {12571#(< ~counter~0 17)} #71#return; {12571#(< ~counter~0 17)} is VALID [2022-04-08 14:02:47,944 INFO L290 TraceCheckUtils]: 35: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 14:02:47,944 INFO L290 TraceCheckUtils]: 34: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 14:02:47,944 INFO L290 TraceCheckUtils]: 33: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 14:02:47,944 INFO L272 TraceCheckUtils]: 32: Hoare triple {12571#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-08 14:02:47,944 INFO L290 TraceCheckUtils]: 31: Hoare triple {12571#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {12571#(< ~counter~0 17)} is VALID [2022-04-08 14:02:47,945 INFO L290 TraceCheckUtils]: 30: Hoare triple {12599#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12571#(< ~counter~0 17)} is VALID [2022-04-08 14:02:47,945 INFO L290 TraceCheckUtils]: 29: Hoare triple {12599#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12599#(< ~counter~0 16)} is VALID [2022-04-08 14:02:47,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {12599#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {12599#(< ~counter~0 16)} is VALID [2022-04-08 14:02:47,946 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {12245#true} {12599#(< ~counter~0 16)} #71#return; {12599#(< ~counter~0 16)} is VALID [2022-04-08 14:02:47,946 INFO L290 TraceCheckUtils]: 26: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 14:02:47,946 INFO L290 TraceCheckUtils]: 25: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 14:02:47,946 INFO L290 TraceCheckUtils]: 24: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 14:02:47,946 INFO L272 TraceCheckUtils]: 23: Hoare triple {12599#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-08 14:02:47,946 INFO L290 TraceCheckUtils]: 22: Hoare triple {12599#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {12599#(< ~counter~0 16)} is VALID [2022-04-08 14:02:47,947 INFO L290 TraceCheckUtils]: 21: Hoare triple {12627#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12599#(< ~counter~0 16)} is VALID [2022-04-08 14:02:47,947 INFO L290 TraceCheckUtils]: 20: Hoare triple {12627#(< ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {12627#(< ~counter~0 15)} is VALID [2022-04-08 14:02:47,947 INFO L290 TraceCheckUtils]: 19: Hoare triple {12627#(< ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {12627#(< ~counter~0 15)} is VALID [2022-04-08 14:02:47,948 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {12245#true} {12627#(< ~counter~0 15)} #71#return; {12627#(< ~counter~0 15)} is VALID [2022-04-08 14:02:47,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 14:02:47,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 14:02:47,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 14:02:47,948 INFO L272 TraceCheckUtils]: 14: Hoare triple {12627#(< ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {12245#true} is VALID [2022-04-08 14:02:47,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {12627#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {12627#(< ~counter~0 15)} is VALID [2022-04-08 14:02:47,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {12655#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12627#(< ~counter~0 15)} is VALID [2022-04-08 14:02:47,949 INFO L290 TraceCheckUtils]: 11: Hoare triple {12655#(< ~counter~0 14)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {12655#(< ~counter~0 14)} is VALID [2022-04-08 14:02:47,949 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12245#true} {12655#(< ~counter~0 14)} #69#return; {12655#(< ~counter~0 14)} is VALID [2022-04-08 14:02:47,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 14:02:47,950 INFO L290 TraceCheckUtils]: 8: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 14:02:47,950 INFO L290 TraceCheckUtils]: 7: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 14:02:47,950 INFO L272 TraceCheckUtils]: 6: Hoare triple {12655#(< ~counter~0 14)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {12245#true} is VALID [2022-04-08 14:02:47,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {12655#(< ~counter~0 14)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {12655#(< ~counter~0 14)} is VALID [2022-04-08 14:02:47,950 INFO L272 TraceCheckUtils]: 4: Hoare triple {12655#(< ~counter~0 14)} call #t~ret7 := main(); {12655#(< ~counter~0 14)} is VALID [2022-04-08 14:02:47,950 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12655#(< ~counter~0 14)} {12245#true} #77#return; {12655#(< ~counter~0 14)} is VALID [2022-04-08 14:02:47,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {12655#(< ~counter~0 14)} assume true; {12655#(< ~counter~0 14)} is VALID [2022-04-08 14:02:47,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12655#(< ~counter~0 14)} is VALID [2022-04-08 14:02:47,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-08 14:02:47,951 INFO L134 CoverageAnalysis]: Checked inductivity of 159 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 60 trivial. 0 not checked. [2022-04-08 14:02:47,952 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:02:47,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2017316512] [2022-04-08 14:02:47,952 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:02:47,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039543340] [2022-04-08 14:02:47,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039543340] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:02:47,952 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:02:47,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 14:02:47,952 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:02:47,952 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1763810877] [2022-04-08 14:02:47,952 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1763810877] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:02:47,952 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:02:47,952 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 14:02:47,952 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099155514] [2022-04-08 14:02:47,953 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:02:47,953 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 72 [2022-04-08 14:02:47,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:02:47,953 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:02:48,013 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 14:02:48,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 14:02:48,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:02:48,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 14:02:48,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 14:02:48,014 INFO L87 Difference]: Start difference. First operand 98 states and 118 transitions. Second operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:02:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:02:48,347 INFO L93 Difference]: Finished difference Result 117 states and 141 transitions. [2022-04-08 14:02:48,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 14:02:48,348 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) Word has length 72 [2022-04-08 14:02:48,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:02:48,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:02:48,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2022-04-08 14:02:48,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:02:48,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 127 transitions. [2022-04-08 14:02:48,351 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 127 transitions. [2022-04-08 14:02:48,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:02:48,452 INFO L225 Difference]: With dead ends: 117 [2022-04-08 14:02:48,452 INFO L226 Difference]: Without dead ends: 109 [2022-04-08 14:02:48,452 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:02:48,452 INFO L913 BasicCegarLoop]: 36 mSDtfsCounter, 62 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:02:48,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 158 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:02:48,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2022-04-08 14:02:48,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2022-04-08 14:02:48,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:02:48,608 INFO L82 GeneralOperation]: Start isEquivalent. First operand 109 states. Second operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:02:48,609 INFO L74 IsIncluded]: Start isIncluded. First operand 109 states. Second operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:02:48,609 INFO L87 Difference]: Start difference. First operand 109 states. Second operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:02:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:02:48,610 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-04-08 14:02:48,610 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-04-08 14:02:48,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:02:48,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:02:48,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 109 states. [2022-04-08 14:02:48,611 INFO L87 Difference]: Start difference. First operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 109 states. [2022-04-08 14:02:48,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:02:48,612 INFO L93 Difference]: Finished difference Result 109 states and 132 transitions. [2022-04-08 14:02:48,612 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-04-08 14:02:48,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:02:48,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:02:48,612 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:02:48,612 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:02:48,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 84 states have (on average 1.2857142857142858) internal successors, (108), 85 states have internal predecessors, (108), 13 states have call successors, (13), 12 states have call predecessors, (13), 11 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:02:48,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 132 transitions. [2022-04-08 14:02:48,613 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 132 transitions. Word has length 72 [2022-04-08 14:02:48,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:02:48,614 INFO L478 AbstractCegarLoop]: Abstraction has 109 states and 132 transitions. [2022-04-08 14:02:48,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 7 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-08 14:02:48,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 109 states and 132 transitions. [2022-04-08 14:03:01,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 126 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-04-08 14:03:01,640 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 132 transitions. [2022-04-08 14:03:01,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-08 14:03:01,640 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:03:01,640 INFO L499 BasicCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:03:01,657 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-08 14:03:01,841 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:03:01,841 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:03:01,842 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:03:01,842 INFO L85 PathProgramCache]: Analyzing trace with hash -529342910, now seen corresponding path program 13 times [2022-04-08 14:03:01,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:03:01,842 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1371232929] [2022-04-08 14:03:07,895 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:03:07,895 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:03:07,895 INFO L85 PathProgramCache]: Analyzing trace with hash -529342910, now seen corresponding path program 14 times [2022-04-08 14:03:07,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:03:07,895 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [770121676] [2022-04-08 14:03:07,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:03:07,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:03:07,912 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:03:07,912 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1592539162] [2022-04-08 14:03:07,912 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:03:07,912 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:03:07,912 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:03:07,913 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 14:03:07,914 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 14:03:07,970 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:03:07,970 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:03:07,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 14:03:07,985 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:03:07,986 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:03:08,328 INFO L272 TraceCheckUtils]: 0: Hoare triple {13376#true} call ULTIMATE.init(); {13376#true} is VALID [2022-04-08 14:03:08,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {13376#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {13384#(<= ~counter~0 0)} assume true; {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,329 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13384#(<= ~counter~0 0)} {13376#true} #77#return; {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,329 INFO L272 TraceCheckUtils]: 4: Hoare triple {13384#(<= ~counter~0 0)} call #t~ret7 := main(); {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {13384#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,330 INFO L272 TraceCheckUtils]: 6: Hoare triple {13384#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {13384#(<= ~counter~0 0)} ~cond := #in~cond; {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {13384#(<= ~counter~0 0)} assume !(0 == ~cond); {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {13384#(<= ~counter~0 0)} assume true; {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,331 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13384#(<= ~counter~0 0)} {13384#(<= ~counter~0 0)} #69#return; {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {13384#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {13384#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:08,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {13384#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13418#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:08,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {13418#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {13418#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:08,333 INFO L272 TraceCheckUtils]: 14: Hoare triple {13418#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13418#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:08,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {13418#(<= ~counter~0 1)} ~cond := #in~cond; {13418#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:08,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {13418#(<= ~counter~0 1)} assume !(0 == ~cond); {13418#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:08,334 INFO L290 TraceCheckUtils]: 17: Hoare triple {13418#(<= ~counter~0 1)} assume true; {13418#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:08,334 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13418#(<= ~counter~0 1)} {13418#(<= ~counter~0 1)} #71#return; {13418#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:08,334 INFO L290 TraceCheckUtils]: 19: Hoare triple {13418#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {13418#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:08,335 INFO L290 TraceCheckUtils]: 20: Hoare triple {13418#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13418#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:08,335 INFO L290 TraceCheckUtils]: 21: Hoare triple {13418#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13446#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:08,335 INFO L290 TraceCheckUtils]: 22: Hoare triple {13446#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {13446#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:08,336 INFO L272 TraceCheckUtils]: 23: Hoare triple {13446#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13446#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:08,336 INFO L290 TraceCheckUtils]: 24: Hoare triple {13446#(<= ~counter~0 2)} ~cond := #in~cond; {13446#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:08,336 INFO L290 TraceCheckUtils]: 25: Hoare triple {13446#(<= ~counter~0 2)} assume !(0 == ~cond); {13446#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:08,337 INFO L290 TraceCheckUtils]: 26: Hoare triple {13446#(<= ~counter~0 2)} assume true; {13446#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:08,337 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13446#(<= ~counter~0 2)} {13446#(<= ~counter~0 2)} #71#return; {13446#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:08,338 INFO L290 TraceCheckUtils]: 28: Hoare triple {13446#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {13446#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:08,338 INFO L290 TraceCheckUtils]: 29: Hoare triple {13446#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13446#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:08,338 INFO L290 TraceCheckUtils]: 30: Hoare triple {13446#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13474#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:08,338 INFO L290 TraceCheckUtils]: 31: Hoare triple {13474#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {13474#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:08,339 INFO L272 TraceCheckUtils]: 32: Hoare triple {13474#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13474#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:08,339 INFO L290 TraceCheckUtils]: 33: Hoare triple {13474#(<= ~counter~0 3)} ~cond := #in~cond; {13474#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:08,340 INFO L290 TraceCheckUtils]: 34: Hoare triple {13474#(<= ~counter~0 3)} assume !(0 == ~cond); {13474#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:08,340 INFO L290 TraceCheckUtils]: 35: Hoare triple {13474#(<= ~counter~0 3)} assume true; {13474#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:08,340 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13474#(<= ~counter~0 3)} {13474#(<= ~counter~0 3)} #71#return; {13474#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:08,341 INFO L290 TraceCheckUtils]: 37: Hoare triple {13474#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {13474#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:08,341 INFO L290 TraceCheckUtils]: 38: Hoare triple {13474#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13474#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:08,341 INFO L290 TraceCheckUtils]: 39: Hoare triple {13474#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13502#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:08,342 INFO L290 TraceCheckUtils]: 40: Hoare triple {13502#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {13502#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:08,342 INFO L272 TraceCheckUtils]: 41: Hoare triple {13502#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13502#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:08,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {13502#(<= ~counter~0 4)} ~cond := #in~cond; {13502#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:08,343 INFO L290 TraceCheckUtils]: 43: Hoare triple {13502#(<= ~counter~0 4)} assume !(0 == ~cond); {13502#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:08,343 INFO L290 TraceCheckUtils]: 44: Hoare triple {13502#(<= ~counter~0 4)} assume true; {13502#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:08,343 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13502#(<= ~counter~0 4)} {13502#(<= ~counter~0 4)} #71#return; {13502#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:08,344 INFO L290 TraceCheckUtils]: 46: Hoare triple {13502#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {13502#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:08,344 INFO L290 TraceCheckUtils]: 47: Hoare triple {13502#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13502#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:08,344 INFO L290 TraceCheckUtils]: 48: Hoare triple {13502#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13530#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:08,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {13530#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {13530#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:08,345 INFO L272 TraceCheckUtils]: 50: Hoare triple {13530#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13530#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:08,345 INFO L290 TraceCheckUtils]: 51: Hoare triple {13530#(<= ~counter~0 5)} ~cond := #in~cond; {13530#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:08,346 INFO L290 TraceCheckUtils]: 52: Hoare triple {13530#(<= ~counter~0 5)} assume !(0 == ~cond); {13530#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:08,346 INFO L290 TraceCheckUtils]: 53: Hoare triple {13530#(<= ~counter~0 5)} assume true; {13530#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:08,347 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13530#(<= ~counter~0 5)} {13530#(<= ~counter~0 5)} #71#return; {13530#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:08,347 INFO L290 TraceCheckUtils]: 55: Hoare triple {13530#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {13530#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:08,347 INFO L290 TraceCheckUtils]: 56: Hoare triple {13530#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13530#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:08,347 INFO L290 TraceCheckUtils]: 57: Hoare triple {13530#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13558#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:08,348 INFO L290 TraceCheckUtils]: 58: Hoare triple {13558#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {13558#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:08,348 INFO L272 TraceCheckUtils]: 59: Hoare triple {13558#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13558#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:08,349 INFO L290 TraceCheckUtils]: 60: Hoare triple {13558#(<= ~counter~0 6)} ~cond := #in~cond; {13558#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:08,349 INFO L290 TraceCheckUtils]: 61: Hoare triple {13558#(<= ~counter~0 6)} assume !(0 == ~cond); {13558#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:08,349 INFO L290 TraceCheckUtils]: 62: Hoare triple {13558#(<= ~counter~0 6)} assume true; {13558#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:08,350 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13558#(<= ~counter~0 6)} {13558#(<= ~counter~0 6)} #71#return; {13558#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:08,350 INFO L290 TraceCheckUtils]: 64: Hoare triple {13558#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {13558#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:08,350 INFO L290 TraceCheckUtils]: 65: Hoare triple {13558#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13558#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:08,351 INFO L290 TraceCheckUtils]: 66: Hoare triple {13558#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13586#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:08,351 INFO L290 TraceCheckUtils]: 67: Hoare triple {13586#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {13586#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:08,351 INFO L272 TraceCheckUtils]: 68: Hoare triple {13586#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13586#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:08,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {13586#(<= ~counter~0 7)} ~cond := #in~cond; {13586#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:08,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {13586#(<= ~counter~0 7)} assume !(0 == ~cond); {13586#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:08,352 INFO L290 TraceCheckUtils]: 71: Hoare triple {13586#(<= ~counter~0 7)} assume true; {13586#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:08,353 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13586#(<= ~counter~0 7)} {13586#(<= ~counter~0 7)} #71#return; {13586#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:08,353 INFO L290 TraceCheckUtils]: 73: Hoare triple {13586#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {13586#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:08,353 INFO L290 TraceCheckUtils]: 74: Hoare triple {13586#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13586#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:08,354 INFO L290 TraceCheckUtils]: 75: Hoare triple {13586#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13614#(<= |main_#t~post6| 7)} is VALID [2022-04-08 14:03:08,354 INFO L290 TraceCheckUtils]: 76: Hoare triple {13614#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {13377#false} is VALID [2022-04-08 14:03:08,354 INFO L272 TraceCheckUtils]: 77: Hoare triple {13377#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {13377#false} is VALID [2022-04-08 14:03:08,354 INFO L290 TraceCheckUtils]: 78: Hoare triple {13377#false} ~cond := #in~cond; {13377#false} is VALID [2022-04-08 14:03:08,354 INFO L290 TraceCheckUtils]: 79: Hoare triple {13377#false} assume 0 == ~cond; {13377#false} is VALID [2022-04-08 14:03:08,354 INFO L290 TraceCheckUtils]: 80: Hoare triple {13377#false} assume !false; {13377#false} is VALID [2022-04-08 14:03:08,354 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 14 proven. 203 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:03:08,355 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:03:08,759 INFO L290 TraceCheckUtils]: 80: Hoare triple {13377#false} assume !false; {13377#false} is VALID [2022-04-08 14:03:08,759 INFO L290 TraceCheckUtils]: 79: Hoare triple {13377#false} assume 0 == ~cond; {13377#false} is VALID [2022-04-08 14:03:08,759 INFO L290 TraceCheckUtils]: 78: Hoare triple {13377#false} ~cond := #in~cond; {13377#false} is VALID [2022-04-08 14:03:08,759 INFO L272 TraceCheckUtils]: 77: Hoare triple {13377#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {13377#false} is VALID [2022-04-08 14:03:08,759 INFO L290 TraceCheckUtils]: 76: Hoare triple {13642#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {13377#false} is VALID [2022-04-08 14:03:08,760 INFO L290 TraceCheckUtils]: 75: Hoare triple {13646#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13642#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:03:08,760 INFO L290 TraceCheckUtils]: 74: Hoare triple {13646#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13646#(< ~counter~0 20)} is VALID [2022-04-08 14:03:08,760 INFO L290 TraceCheckUtils]: 73: Hoare triple {13646#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {13646#(< ~counter~0 20)} is VALID [2022-04-08 14:03:08,761 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {13376#true} {13646#(< ~counter~0 20)} #71#return; {13646#(< ~counter~0 20)} is VALID [2022-04-08 14:03:08,761 INFO L290 TraceCheckUtils]: 71: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-08 14:03:08,761 INFO L290 TraceCheckUtils]: 70: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-08 14:03:08,761 INFO L290 TraceCheckUtils]: 69: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-08 14:03:08,761 INFO L272 TraceCheckUtils]: 68: Hoare triple {13646#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-08 14:03:08,774 INFO L290 TraceCheckUtils]: 67: Hoare triple {13646#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {13646#(< ~counter~0 20)} is VALID [2022-04-08 14:03:08,775 INFO L290 TraceCheckUtils]: 66: Hoare triple {13674#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13646#(< ~counter~0 20)} is VALID [2022-04-08 14:03:08,775 INFO L290 TraceCheckUtils]: 65: Hoare triple {13674#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13674#(< ~counter~0 19)} is VALID [2022-04-08 14:03:08,776 INFO L290 TraceCheckUtils]: 64: Hoare triple {13674#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {13674#(< ~counter~0 19)} is VALID [2022-04-08 14:03:08,776 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13376#true} {13674#(< ~counter~0 19)} #71#return; {13674#(< ~counter~0 19)} is VALID [2022-04-08 14:03:08,776 INFO L290 TraceCheckUtils]: 62: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-08 14:03:08,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-08 14:03:08,777 INFO L290 TraceCheckUtils]: 60: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-08 14:03:08,777 INFO L272 TraceCheckUtils]: 59: Hoare triple {13674#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-08 14:03:08,777 INFO L290 TraceCheckUtils]: 58: Hoare triple {13674#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {13674#(< ~counter~0 19)} is VALID [2022-04-08 14:03:08,777 INFO L290 TraceCheckUtils]: 57: Hoare triple {13702#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13674#(< ~counter~0 19)} is VALID [2022-04-08 14:03:08,778 INFO L290 TraceCheckUtils]: 56: Hoare triple {13702#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13702#(< ~counter~0 18)} is VALID [2022-04-08 14:03:08,778 INFO L290 TraceCheckUtils]: 55: Hoare triple {13702#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {13702#(< ~counter~0 18)} is VALID [2022-04-08 14:03:08,778 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {13376#true} {13702#(< ~counter~0 18)} #71#return; {13702#(< ~counter~0 18)} is VALID [2022-04-08 14:03:08,778 INFO L290 TraceCheckUtils]: 53: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-08 14:03:08,779 INFO L290 TraceCheckUtils]: 52: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-08 14:03:08,779 INFO L290 TraceCheckUtils]: 51: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-08 14:03:08,779 INFO L272 TraceCheckUtils]: 50: Hoare triple {13702#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-08 14:03:08,779 INFO L290 TraceCheckUtils]: 49: Hoare triple {13702#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {13702#(< ~counter~0 18)} is VALID [2022-04-08 14:03:08,779 INFO L290 TraceCheckUtils]: 48: Hoare triple {13730#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13702#(< ~counter~0 18)} is VALID [2022-04-08 14:03:08,780 INFO L290 TraceCheckUtils]: 47: Hoare triple {13730#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13730#(< ~counter~0 17)} is VALID [2022-04-08 14:03:08,780 INFO L290 TraceCheckUtils]: 46: Hoare triple {13730#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {13730#(< ~counter~0 17)} is VALID [2022-04-08 14:03:08,780 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {13376#true} {13730#(< ~counter~0 17)} #71#return; {13730#(< ~counter~0 17)} is VALID [2022-04-08 14:03:08,781 INFO L290 TraceCheckUtils]: 44: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-08 14:03:08,781 INFO L290 TraceCheckUtils]: 43: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-08 14:03:08,781 INFO L290 TraceCheckUtils]: 42: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-08 14:03:08,781 INFO L272 TraceCheckUtils]: 41: Hoare triple {13730#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-08 14:03:08,781 INFO L290 TraceCheckUtils]: 40: Hoare triple {13730#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {13730#(< ~counter~0 17)} is VALID [2022-04-08 14:03:08,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {13758#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13730#(< ~counter~0 17)} is VALID [2022-04-08 14:03:08,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {13758#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13758#(< ~counter~0 16)} is VALID [2022-04-08 14:03:08,782 INFO L290 TraceCheckUtils]: 37: Hoare triple {13758#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {13758#(< ~counter~0 16)} is VALID [2022-04-08 14:03:08,783 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {13376#true} {13758#(< ~counter~0 16)} #71#return; {13758#(< ~counter~0 16)} is VALID [2022-04-08 14:03:08,783 INFO L290 TraceCheckUtils]: 35: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-08 14:03:08,783 INFO L290 TraceCheckUtils]: 34: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-08 14:03:08,783 INFO L290 TraceCheckUtils]: 33: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-08 14:03:08,783 INFO L272 TraceCheckUtils]: 32: Hoare triple {13758#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-08 14:03:08,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {13758#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {13758#(< ~counter~0 16)} is VALID [2022-04-08 14:03:08,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {13786#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13758#(< ~counter~0 16)} is VALID [2022-04-08 14:03:08,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {13786#(< ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13786#(< ~counter~0 15)} is VALID [2022-04-08 14:03:08,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {13786#(< ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {13786#(< ~counter~0 15)} is VALID [2022-04-08 14:03:08,785 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {13376#true} {13786#(< ~counter~0 15)} #71#return; {13786#(< ~counter~0 15)} is VALID [2022-04-08 14:03:08,785 INFO L290 TraceCheckUtils]: 26: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-08 14:03:08,785 INFO L290 TraceCheckUtils]: 25: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-08 14:03:08,785 INFO L290 TraceCheckUtils]: 24: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-08 14:03:08,785 INFO L272 TraceCheckUtils]: 23: Hoare triple {13786#(< ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-08 14:03:08,787 INFO L290 TraceCheckUtils]: 22: Hoare triple {13786#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {13786#(< ~counter~0 15)} is VALID [2022-04-08 14:03:08,787 INFO L290 TraceCheckUtils]: 21: Hoare triple {13814#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13786#(< ~counter~0 15)} is VALID [2022-04-08 14:03:08,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {13814#(< ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {13814#(< ~counter~0 14)} is VALID [2022-04-08 14:03:08,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {13814#(< ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {13814#(< ~counter~0 14)} is VALID [2022-04-08 14:03:08,789 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {13376#true} {13814#(< ~counter~0 14)} #71#return; {13814#(< ~counter~0 14)} is VALID [2022-04-08 14:03:08,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-08 14:03:08,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-08 14:03:08,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-08 14:03:08,789 INFO L272 TraceCheckUtils]: 14: Hoare triple {13814#(< ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {13376#true} is VALID [2022-04-08 14:03:08,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {13814#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {13814#(< ~counter~0 14)} is VALID [2022-04-08 14:03:08,790 INFO L290 TraceCheckUtils]: 12: Hoare triple {13842#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13814#(< ~counter~0 14)} is VALID [2022-04-08 14:03:08,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {13842#(< ~counter~0 13)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {13842#(< ~counter~0 13)} is VALID [2022-04-08 14:03:08,790 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13376#true} {13842#(< ~counter~0 13)} #69#return; {13842#(< ~counter~0 13)} is VALID [2022-04-08 14:03:08,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {13376#true} assume true; {13376#true} is VALID [2022-04-08 14:03:08,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {13376#true} assume !(0 == ~cond); {13376#true} is VALID [2022-04-08 14:03:08,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {13376#true} ~cond := #in~cond; {13376#true} is VALID [2022-04-08 14:03:08,791 INFO L272 TraceCheckUtils]: 6: Hoare triple {13842#(< ~counter~0 13)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {13376#true} is VALID [2022-04-08 14:03:08,791 INFO L290 TraceCheckUtils]: 5: Hoare triple {13842#(< ~counter~0 13)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {13842#(< ~counter~0 13)} is VALID [2022-04-08 14:03:08,791 INFO L272 TraceCheckUtils]: 4: Hoare triple {13842#(< ~counter~0 13)} call #t~ret7 := main(); {13842#(< ~counter~0 13)} is VALID [2022-04-08 14:03:08,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13842#(< ~counter~0 13)} {13376#true} #77#return; {13842#(< ~counter~0 13)} is VALID [2022-04-08 14:03:08,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {13842#(< ~counter~0 13)} assume true; {13842#(< ~counter~0 13)} is VALID [2022-04-08 14:03:08,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {13376#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {13842#(< ~counter~0 13)} is VALID [2022-04-08 14:03:08,792 INFO L272 TraceCheckUtils]: 0: Hoare triple {13376#true} call ULTIMATE.init(); {13376#true} is VALID [2022-04-08 14:03:08,793 INFO L134 CoverageAnalysis]: Checked inductivity of 217 backedges. 14 proven. 119 refuted. 0 times theorem prover too weak. 84 trivial. 0 not checked. [2022-04-08 14:03:08,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:03:08,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [770121676] [2022-04-08 14:03:08,793 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:03:08,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1592539162] [2022-04-08 14:03:08,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1592539162] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:03:08,793 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:03:08,793 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 14:03:08,793 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:03:08,793 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1371232929] [2022-04-08 14:03:08,793 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1371232929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:03:08,794 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:03:08,794 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 14:03:08,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1833585344] [2022-04-08 14:03:08,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:03:08,794 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 81 [2022-04-08 14:03:08,794 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:03:08,794 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:03:08,859 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 14:03:08,859 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 14:03:08,859 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:03:08,860 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 14:03:08,860 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 14:03:08,860 INFO L87 Difference]: Start difference. First operand 109 states and 132 transitions. Second operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:03:09,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:03:09,290 INFO L93 Difference]: Finished difference Result 128 states and 155 transitions. [2022-04-08 14:03:09,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 14:03:09,290 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) Word has length 81 [2022-04-08 14:03:09,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:03:09,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:03:09,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 141 transitions. [2022-04-08 14:03:09,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:03:09,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 141 transitions. [2022-04-08 14:03:09,294 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 141 transitions. [2022-04-08 14:03:09,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:03:09,400 INFO L225 Difference]: With dead ends: 128 [2022-04-08 14:03:09,400 INFO L226 Difference]: Without dead ends: 120 [2022-04-08 14:03:09,401 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-08 14:03:09,401 INFO L913 BasicCegarLoop]: 37 mSDtfsCounter, 67 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:03:09,401 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 186 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:03:09,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-04-08 14:03:09,593 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2022-04-08 14:03:09,594 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:03:09,594 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:03:09,594 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:03:09,594 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:03:09,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:03:09,596 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-08 14:03:09,596 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-08 14:03:09,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:03:09,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:03:09,596 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-08 14:03:09,596 INFO L87 Difference]: Start difference. First operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 120 states. [2022-04-08 14:03:09,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:03:09,598 INFO L93 Difference]: Finished difference Result 120 states and 146 transitions. [2022-04-08 14:03:09,598 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-08 14:03:09,598 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:03:09,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:03:09,598 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:03:09,598 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:03:09,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 94 states have internal predecessors, (120), 14 states have call successors, (14), 13 states have call predecessors, (14), 12 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:03:09,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 146 transitions. [2022-04-08 14:03:09,600 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 146 transitions. Word has length 81 [2022-04-08 14:03:09,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:03:09,600 INFO L478 AbstractCegarLoop]: Abstraction has 120 states and 146 transitions. [2022-04-08 14:03:09,600 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 8 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-08 14:03:09,600 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 120 states and 146 transitions. [2022-04-08 14:03:24,780 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 139 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-04-08 14:03:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 146 transitions. [2022-04-08 14:03:24,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2022-04-08 14:03:24,781 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:03:24,781 INFO L499 BasicCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:03:24,797 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 14:03:24,989 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2022-04-08 14:03:24,989 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:03:24,990 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:03:24,990 INFO L85 PathProgramCache]: Analyzing trace with hash -1054018310, now seen corresponding path program 15 times [2022-04-08 14:03:24,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:03:24,990 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [366989665] [2022-04-08 14:03:31,038 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:03:31,038 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:03:31,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1054018310, now seen corresponding path program 16 times [2022-04-08 14:03:31,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:03:31,038 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1787061382] [2022-04-08 14:03:31,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:03:31,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:03:31,051 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:03:31,051 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [928297601] [2022-04-08 14:03:31,051 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:03:31,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:03:31,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:03:31,052 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:03:31,067 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 14:03:31,138 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:03:31,138 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:03:31,139 INFO L263 TraceCheckSpWp]: Trace formula consists of 294 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 14:03:31,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:03:31,155 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:03:31,537 INFO L272 TraceCheckUtils]: 0: Hoare triple {14631#true} call ULTIMATE.init(); {14631#true} is VALID [2022-04-08 14:03:31,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {14631#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {14639#(<= ~counter~0 0)} assume true; {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,538 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14639#(<= ~counter~0 0)} {14631#true} #77#return; {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,538 INFO L272 TraceCheckUtils]: 4: Hoare triple {14639#(<= ~counter~0 0)} call #t~ret7 := main(); {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,538 INFO L290 TraceCheckUtils]: 5: Hoare triple {14639#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,539 INFO L272 TraceCheckUtils]: 6: Hoare triple {14639#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,539 INFO L290 TraceCheckUtils]: 7: Hoare triple {14639#(<= ~counter~0 0)} ~cond := #in~cond; {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,539 INFO L290 TraceCheckUtils]: 8: Hoare triple {14639#(<= ~counter~0 0)} assume !(0 == ~cond); {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {14639#(<= ~counter~0 0)} assume true; {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14639#(<= ~counter~0 0)} {14639#(<= ~counter~0 0)} #69#return; {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,540 INFO L290 TraceCheckUtils]: 11: Hoare triple {14639#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {14639#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:31,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {14639#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14673#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:31,541 INFO L290 TraceCheckUtils]: 13: Hoare triple {14673#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {14673#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:31,542 INFO L272 TraceCheckUtils]: 14: Hoare triple {14673#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14673#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:31,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {14673#(<= ~counter~0 1)} ~cond := #in~cond; {14673#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:31,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {14673#(<= ~counter~0 1)} assume !(0 == ~cond); {14673#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:31,542 INFO L290 TraceCheckUtils]: 17: Hoare triple {14673#(<= ~counter~0 1)} assume true; {14673#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:31,543 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14673#(<= ~counter~0 1)} {14673#(<= ~counter~0 1)} #71#return; {14673#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:31,543 INFO L290 TraceCheckUtils]: 19: Hoare triple {14673#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {14673#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:31,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {14673#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14673#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:31,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {14673#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14701#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:31,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {14701#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {14701#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:31,545 INFO L272 TraceCheckUtils]: 23: Hoare triple {14701#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14701#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:31,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {14701#(<= ~counter~0 2)} ~cond := #in~cond; {14701#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:31,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {14701#(<= ~counter~0 2)} assume !(0 == ~cond); {14701#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:31,545 INFO L290 TraceCheckUtils]: 26: Hoare triple {14701#(<= ~counter~0 2)} assume true; {14701#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:31,546 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14701#(<= ~counter~0 2)} {14701#(<= ~counter~0 2)} #71#return; {14701#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:31,546 INFO L290 TraceCheckUtils]: 28: Hoare triple {14701#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {14701#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:31,546 INFO L290 TraceCheckUtils]: 29: Hoare triple {14701#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14701#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:31,547 INFO L290 TraceCheckUtils]: 30: Hoare triple {14701#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14729#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:31,547 INFO L290 TraceCheckUtils]: 31: Hoare triple {14729#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {14729#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:31,548 INFO L272 TraceCheckUtils]: 32: Hoare triple {14729#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14729#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:31,548 INFO L290 TraceCheckUtils]: 33: Hoare triple {14729#(<= ~counter~0 3)} ~cond := #in~cond; {14729#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:31,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {14729#(<= ~counter~0 3)} assume !(0 == ~cond); {14729#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:31,548 INFO L290 TraceCheckUtils]: 35: Hoare triple {14729#(<= ~counter~0 3)} assume true; {14729#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:31,549 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14729#(<= ~counter~0 3)} {14729#(<= ~counter~0 3)} #71#return; {14729#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:31,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {14729#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {14729#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:31,550 INFO L290 TraceCheckUtils]: 38: Hoare triple {14729#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14729#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:31,550 INFO L290 TraceCheckUtils]: 39: Hoare triple {14729#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14757#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:31,550 INFO L290 TraceCheckUtils]: 40: Hoare triple {14757#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {14757#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:31,551 INFO L272 TraceCheckUtils]: 41: Hoare triple {14757#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14757#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:31,551 INFO L290 TraceCheckUtils]: 42: Hoare triple {14757#(<= ~counter~0 4)} ~cond := #in~cond; {14757#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:31,551 INFO L290 TraceCheckUtils]: 43: Hoare triple {14757#(<= ~counter~0 4)} assume !(0 == ~cond); {14757#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:31,552 INFO L290 TraceCheckUtils]: 44: Hoare triple {14757#(<= ~counter~0 4)} assume true; {14757#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:31,552 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14757#(<= ~counter~0 4)} {14757#(<= ~counter~0 4)} #71#return; {14757#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:31,552 INFO L290 TraceCheckUtils]: 46: Hoare triple {14757#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {14757#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:31,553 INFO L290 TraceCheckUtils]: 47: Hoare triple {14757#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14757#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:31,553 INFO L290 TraceCheckUtils]: 48: Hoare triple {14757#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14785#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:31,553 INFO L290 TraceCheckUtils]: 49: Hoare triple {14785#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {14785#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:31,554 INFO L272 TraceCheckUtils]: 50: Hoare triple {14785#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14785#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:31,554 INFO L290 TraceCheckUtils]: 51: Hoare triple {14785#(<= ~counter~0 5)} ~cond := #in~cond; {14785#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:31,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {14785#(<= ~counter~0 5)} assume !(0 == ~cond); {14785#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:31,555 INFO L290 TraceCheckUtils]: 53: Hoare triple {14785#(<= ~counter~0 5)} assume true; {14785#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:31,555 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14785#(<= ~counter~0 5)} {14785#(<= ~counter~0 5)} #71#return; {14785#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:31,556 INFO L290 TraceCheckUtils]: 55: Hoare triple {14785#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {14785#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:31,556 INFO L290 TraceCheckUtils]: 56: Hoare triple {14785#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14785#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:31,556 INFO L290 TraceCheckUtils]: 57: Hoare triple {14785#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14813#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:31,556 INFO L290 TraceCheckUtils]: 58: Hoare triple {14813#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {14813#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:31,557 INFO L272 TraceCheckUtils]: 59: Hoare triple {14813#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14813#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:31,557 INFO L290 TraceCheckUtils]: 60: Hoare triple {14813#(<= ~counter~0 6)} ~cond := #in~cond; {14813#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:31,558 INFO L290 TraceCheckUtils]: 61: Hoare triple {14813#(<= ~counter~0 6)} assume !(0 == ~cond); {14813#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:31,558 INFO L290 TraceCheckUtils]: 62: Hoare triple {14813#(<= ~counter~0 6)} assume true; {14813#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:31,558 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14813#(<= ~counter~0 6)} {14813#(<= ~counter~0 6)} #71#return; {14813#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:31,559 INFO L290 TraceCheckUtils]: 64: Hoare triple {14813#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {14813#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:31,559 INFO L290 TraceCheckUtils]: 65: Hoare triple {14813#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14813#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:31,559 INFO L290 TraceCheckUtils]: 66: Hoare triple {14813#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14841#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:31,560 INFO L290 TraceCheckUtils]: 67: Hoare triple {14841#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {14841#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:31,560 INFO L272 TraceCheckUtils]: 68: Hoare triple {14841#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14841#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:31,560 INFO L290 TraceCheckUtils]: 69: Hoare triple {14841#(<= ~counter~0 7)} ~cond := #in~cond; {14841#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:31,561 INFO L290 TraceCheckUtils]: 70: Hoare triple {14841#(<= ~counter~0 7)} assume !(0 == ~cond); {14841#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:31,561 INFO L290 TraceCheckUtils]: 71: Hoare triple {14841#(<= ~counter~0 7)} assume true; {14841#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:31,561 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14841#(<= ~counter~0 7)} {14841#(<= ~counter~0 7)} #71#return; {14841#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:31,562 INFO L290 TraceCheckUtils]: 73: Hoare triple {14841#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {14841#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:31,562 INFO L290 TraceCheckUtils]: 74: Hoare triple {14841#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14841#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:31,562 INFO L290 TraceCheckUtils]: 75: Hoare triple {14841#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14869#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:31,563 INFO L290 TraceCheckUtils]: 76: Hoare triple {14869#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {14869#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:31,563 INFO L272 TraceCheckUtils]: 77: Hoare triple {14869#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14869#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:31,563 INFO L290 TraceCheckUtils]: 78: Hoare triple {14869#(<= ~counter~0 8)} ~cond := #in~cond; {14869#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:31,564 INFO L290 TraceCheckUtils]: 79: Hoare triple {14869#(<= ~counter~0 8)} assume !(0 == ~cond); {14869#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:31,564 INFO L290 TraceCheckUtils]: 80: Hoare triple {14869#(<= ~counter~0 8)} assume true; {14869#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:31,565 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14869#(<= ~counter~0 8)} {14869#(<= ~counter~0 8)} #71#return; {14869#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:31,565 INFO L290 TraceCheckUtils]: 82: Hoare triple {14869#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {14869#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:31,565 INFO L290 TraceCheckUtils]: 83: Hoare triple {14869#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14869#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:31,565 INFO L290 TraceCheckUtils]: 84: Hoare triple {14869#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14897#(<= |main_#t~post6| 8)} is VALID [2022-04-08 14:03:31,566 INFO L290 TraceCheckUtils]: 85: Hoare triple {14897#(<= |main_#t~post6| 8)} assume !(#t~post6 < 20);havoc #t~post6; {14632#false} is VALID [2022-04-08 14:03:31,566 INFO L272 TraceCheckUtils]: 86: Hoare triple {14632#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {14632#false} is VALID [2022-04-08 14:03:31,566 INFO L290 TraceCheckUtils]: 87: Hoare triple {14632#false} ~cond := #in~cond; {14632#false} is VALID [2022-04-08 14:03:31,566 INFO L290 TraceCheckUtils]: 88: Hoare triple {14632#false} assume 0 == ~cond; {14632#false} is VALID [2022-04-08 14:03:31,566 INFO L290 TraceCheckUtils]: 89: Hoare triple {14632#false} assume !false; {14632#false} is VALID [2022-04-08 14:03:31,566 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 16 proven. 268 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:03:31,566 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:03:32,031 INFO L290 TraceCheckUtils]: 89: Hoare triple {14632#false} assume !false; {14632#false} is VALID [2022-04-08 14:03:32,031 INFO L290 TraceCheckUtils]: 88: Hoare triple {14632#false} assume 0 == ~cond; {14632#false} is VALID [2022-04-08 14:03:32,031 INFO L290 TraceCheckUtils]: 87: Hoare triple {14632#false} ~cond := #in~cond; {14632#false} is VALID [2022-04-08 14:03:32,031 INFO L272 TraceCheckUtils]: 86: Hoare triple {14632#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {14632#false} is VALID [2022-04-08 14:03:32,032 INFO L290 TraceCheckUtils]: 85: Hoare triple {14925#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {14632#false} is VALID [2022-04-08 14:03:32,032 INFO L290 TraceCheckUtils]: 84: Hoare triple {14929#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14925#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:03:32,032 INFO L290 TraceCheckUtils]: 83: Hoare triple {14929#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14929#(< ~counter~0 20)} is VALID [2022-04-08 14:03:32,033 INFO L290 TraceCheckUtils]: 82: Hoare triple {14929#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {14929#(< ~counter~0 20)} is VALID [2022-04-08 14:03:32,033 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {14631#true} {14929#(< ~counter~0 20)} #71#return; {14929#(< ~counter~0 20)} is VALID [2022-04-08 14:03:32,033 INFO L290 TraceCheckUtils]: 80: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-08 14:03:32,033 INFO L290 TraceCheckUtils]: 79: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-08 14:03:32,033 INFO L290 TraceCheckUtils]: 78: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-08 14:03:32,033 INFO L272 TraceCheckUtils]: 77: Hoare triple {14929#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-08 14:03:32,034 INFO L290 TraceCheckUtils]: 76: Hoare triple {14929#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {14929#(< ~counter~0 20)} is VALID [2022-04-08 14:03:32,034 INFO L290 TraceCheckUtils]: 75: Hoare triple {14957#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14929#(< ~counter~0 20)} is VALID [2022-04-08 14:03:32,035 INFO L290 TraceCheckUtils]: 74: Hoare triple {14957#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14957#(< ~counter~0 19)} is VALID [2022-04-08 14:03:32,035 INFO L290 TraceCheckUtils]: 73: Hoare triple {14957#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {14957#(< ~counter~0 19)} is VALID [2022-04-08 14:03:32,035 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {14631#true} {14957#(< ~counter~0 19)} #71#return; {14957#(< ~counter~0 19)} is VALID [2022-04-08 14:03:32,035 INFO L290 TraceCheckUtils]: 71: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-08 14:03:32,036 INFO L290 TraceCheckUtils]: 70: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-08 14:03:32,036 INFO L290 TraceCheckUtils]: 69: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-08 14:03:32,036 INFO L272 TraceCheckUtils]: 68: Hoare triple {14957#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-08 14:03:32,036 INFO L290 TraceCheckUtils]: 67: Hoare triple {14957#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {14957#(< ~counter~0 19)} is VALID [2022-04-08 14:03:32,036 INFO L290 TraceCheckUtils]: 66: Hoare triple {14985#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14957#(< ~counter~0 19)} is VALID [2022-04-08 14:03:32,037 INFO L290 TraceCheckUtils]: 65: Hoare triple {14985#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {14985#(< ~counter~0 18)} is VALID [2022-04-08 14:03:32,037 INFO L290 TraceCheckUtils]: 64: Hoare triple {14985#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {14985#(< ~counter~0 18)} is VALID [2022-04-08 14:03:32,037 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14631#true} {14985#(< ~counter~0 18)} #71#return; {14985#(< ~counter~0 18)} is VALID [2022-04-08 14:03:32,037 INFO L290 TraceCheckUtils]: 62: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-08 14:03:32,038 INFO L290 TraceCheckUtils]: 61: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-08 14:03:32,038 INFO L290 TraceCheckUtils]: 60: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-08 14:03:32,038 INFO L272 TraceCheckUtils]: 59: Hoare triple {14985#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-08 14:03:32,038 INFO L290 TraceCheckUtils]: 58: Hoare triple {14985#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {14985#(< ~counter~0 18)} is VALID [2022-04-08 14:03:32,038 INFO L290 TraceCheckUtils]: 57: Hoare triple {15013#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14985#(< ~counter~0 18)} is VALID [2022-04-08 14:03:32,039 INFO L290 TraceCheckUtils]: 56: Hoare triple {15013#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15013#(< ~counter~0 17)} is VALID [2022-04-08 14:03:32,039 INFO L290 TraceCheckUtils]: 55: Hoare triple {15013#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {15013#(< ~counter~0 17)} is VALID [2022-04-08 14:03:32,039 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {14631#true} {15013#(< ~counter~0 17)} #71#return; {15013#(< ~counter~0 17)} is VALID [2022-04-08 14:03:32,039 INFO L290 TraceCheckUtils]: 53: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-08 14:03:32,040 INFO L290 TraceCheckUtils]: 52: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-08 14:03:32,040 INFO L290 TraceCheckUtils]: 51: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-08 14:03:32,040 INFO L272 TraceCheckUtils]: 50: Hoare triple {15013#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-08 14:03:32,040 INFO L290 TraceCheckUtils]: 49: Hoare triple {15013#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {15013#(< ~counter~0 17)} is VALID [2022-04-08 14:03:32,040 INFO L290 TraceCheckUtils]: 48: Hoare triple {15041#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15013#(< ~counter~0 17)} is VALID [2022-04-08 14:03:32,041 INFO L290 TraceCheckUtils]: 47: Hoare triple {15041#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15041#(< ~counter~0 16)} is VALID [2022-04-08 14:03:32,041 INFO L290 TraceCheckUtils]: 46: Hoare triple {15041#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {15041#(< ~counter~0 16)} is VALID [2022-04-08 14:03:32,041 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {14631#true} {15041#(< ~counter~0 16)} #71#return; {15041#(< ~counter~0 16)} is VALID [2022-04-08 14:03:32,041 INFO L290 TraceCheckUtils]: 44: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-08 14:03:32,042 INFO L290 TraceCheckUtils]: 43: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-08 14:03:32,042 INFO L290 TraceCheckUtils]: 42: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-08 14:03:32,042 INFO L272 TraceCheckUtils]: 41: Hoare triple {15041#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-08 14:03:32,042 INFO L290 TraceCheckUtils]: 40: Hoare triple {15041#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {15041#(< ~counter~0 16)} is VALID [2022-04-08 14:03:32,042 INFO L290 TraceCheckUtils]: 39: Hoare triple {15069#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15041#(< ~counter~0 16)} is VALID [2022-04-08 14:03:32,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {15069#(< ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15069#(< ~counter~0 15)} is VALID [2022-04-08 14:03:32,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {15069#(< ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {15069#(< ~counter~0 15)} is VALID [2022-04-08 14:03:32,043 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {14631#true} {15069#(< ~counter~0 15)} #71#return; {15069#(< ~counter~0 15)} is VALID [2022-04-08 14:03:32,044 INFO L290 TraceCheckUtils]: 35: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-08 14:03:32,044 INFO L290 TraceCheckUtils]: 34: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-08 14:03:32,044 INFO L290 TraceCheckUtils]: 33: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-08 14:03:32,044 INFO L272 TraceCheckUtils]: 32: Hoare triple {15069#(< ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-08 14:03:32,044 INFO L290 TraceCheckUtils]: 31: Hoare triple {15069#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {15069#(< ~counter~0 15)} is VALID [2022-04-08 14:03:32,044 INFO L290 TraceCheckUtils]: 30: Hoare triple {15097#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15069#(< ~counter~0 15)} is VALID [2022-04-08 14:03:32,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {15097#(< ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15097#(< ~counter~0 14)} is VALID [2022-04-08 14:03:32,045 INFO L290 TraceCheckUtils]: 28: Hoare triple {15097#(< ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {15097#(< ~counter~0 14)} is VALID [2022-04-08 14:03:32,045 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {14631#true} {15097#(< ~counter~0 14)} #71#return; {15097#(< ~counter~0 14)} is VALID [2022-04-08 14:03:32,046 INFO L290 TraceCheckUtils]: 26: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-08 14:03:32,046 INFO L290 TraceCheckUtils]: 25: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-08 14:03:32,046 INFO L290 TraceCheckUtils]: 24: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-08 14:03:32,046 INFO L272 TraceCheckUtils]: 23: Hoare triple {15097#(< ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-08 14:03:32,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {15097#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {15097#(< ~counter~0 14)} is VALID [2022-04-08 14:03:32,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {15125#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15097#(< ~counter~0 14)} is VALID [2022-04-08 14:03:32,047 INFO L290 TraceCheckUtils]: 20: Hoare triple {15125#(< ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {15125#(< ~counter~0 13)} is VALID [2022-04-08 14:03:32,047 INFO L290 TraceCheckUtils]: 19: Hoare triple {15125#(< ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {15125#(< ~counter~0 13)} is VALID [2022-04-08 14:03:32,048 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {14631#true} {15125#(< ~counter~0 13)} #71#return; {15125#(< ~counter~0 13)} is VALID [2022-04-08 14:03:32,048 INFO L290 TraceCheckUtils]: 17: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-08 14:03:32,048 INFO L290 TraceCheckUtils]: 16: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-08 14:03:32,048 INFO L290 TraceCheckUtils]: 15: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-08 14:03:32,048 INFO L272 TraceCheckUtils]: 14: Hoare triple {15125#(< ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {14631#true} is VALID [2022-04-08 14:03:32,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {15125#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {15125#(< ~counter~0 13)} is VALID [2022-04-08 14:03:32,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {15153#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15125#(< ~counter~0 13)} is VALID [2022-04-08 14:03:32,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {15153#(< ~counter~0 12)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {15153#(< ~counter~0 12)} is VALID [2022-04-08 14:03:32,049 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14631#true} {15153#(< ~counter~0 12)} #69#return; {15153#(< ~counter~0 12)} is VALID [2022-04-08 14:03:32,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {14631#true} assume true; {14631#true} is VALID [2022-04-08 14:03:32,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {14631#true} assume !(0 == ~cond); {14631#true} is VALID [2022-04-08 14:03:32,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {14631#true} ~cond := #in~cond; {14631#true} is VALID [2022-04-08 14:03:32,049 INFO L272 TraceCheckUtils]: 6: Hoare triple {15153#(< ~counter~0 12)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {14631#true} is VALID [2022-04-08 14:03:32,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {15153#(< ~counter~0 12)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {15153#(< ~counter~0 12)} is VALID [2022-04-08 14:03:32,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {15153#(< ~counter~0 12)} call #t~ret7 := main(); {15153#(< ~counter~0 12)} is VALID [2022-04-08 14:03:32,050 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15153#(< ~counter~0 12)} {14631#true} #77#return; {15153#(< ~counter~0 12)} is VALID [2022-04-08 14:03:32,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {15153#(< ~counter~0 12)} assume true; {15153#(< ~counter~0 12)} is VALID [2022-04-08 14:03:32,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {14631#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {15153#(< ~counter~0 12)} is VALID [2022-04-08 14:03:32,051 INFO L272 TraceCheckUtils]: 0: Hoare triple {14631#true} call ULTIMATE.init(); {14631#true} is VALID [2022-04-08 14:03:32,051 INFO L134 CoverageAnalysis]: Checked inductivity of 284 backedges. 16 proven. 156 refuted. 0 times theorem prover too weak. 112 trivial. 0 not checked. [2022-04-08 14:03:32,052 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:03:32,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1787061382] [2022-04-08 14:03:32,052 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:03:32,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [928297601] [2022-04-08 14:03:32,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [928297601] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:03:32,052 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:03:32,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 14:03:32,052 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:03:32,052 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [366989665] [2022-04-08 14:03:32,052 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [366989665] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:03:32,052 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:03:32,052 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 14:03:32,052 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011894301] [2022-04-08 14:03:32,052 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:03:32,053 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 90 [2022-04-08 14:03:32,053 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:03:32,053 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:03:32,111 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:03:32,111 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 14:03:32,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:03:32,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 14:03:32,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 14:03:32,112 INFO L87 Difference]: Start difference. First operand 120 states and 146 transitions. Second operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:03:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:03:32,596 INFO L93 Difference]: Finished difference Result 139 states and 169 transitions. [2022-04-08 14:03:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 14:03:32,596 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Word has length 90 [2022-04-08 14:03:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:03:32,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:03:32,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 155 transitions. [2022-04-08 14:03:32,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:03:32,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 155 transitions. [2022-04-08 14:03:32,599 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 155 transitions. [2022-04-08 14:03:32,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:03:32,722 INFO L225 Difference]: With dead ends: 139 [2022-04-08 14:03:32,722 INFO L226 Difference]: Without dead ends: 131 [2022-04-08 14:03:32,723 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 187 GetRequests, 159 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=363, Invalid=507, Unknown=0, NotChecked=0, Total=870 [2022-04-08 14:03:32,723 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 78 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 48 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 48 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-08 14:03:32,723 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 206 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 48 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 14:03:32,723 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2022-04-08 14:03:32,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-04-08 14:03:32,920 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:03:32,920 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states. Second operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:03:32,920 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states. Second operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:03:32,920 INFO L87 Difference]: Start difference. First operand 131 states. Second operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:03:32,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:03:32,922 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2022-04-08 14:03:32,922 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-04-08 14:03:32,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:03:32,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:03:32,922 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 131 states. [2022-04-08 14:03:32,922 INFO L87 Difference]: Start difference. First operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 131 states. [2022-04-08 14:03:32,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:03:32,924 INFO L93 Difference]: Finished difference Result 131 states and 160 transitions. [2022-04-08 14:03:32,924 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-04-08 14:03:32,924 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:03:32,924 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:03:32,924 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:03:32,924 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:03:32,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 102 states have (on average 1.2941176470588236) internal successors, (132), 103 states have internal predecessors, (132), 15 states have call successors, (15), 14 states have call predecessors, (15), 13 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:03:32,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 160 transitions. [2022-04-08 14:03:32,927 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 160 transitions. Word has length 90 [2022-04-08 14:03:32,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:03:32,927 INFO L478 AbstractCegarLoop]: Abstraction has 131 states and 160 transitions. [2022-04-08 14:03:32,927 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-08 14:03:32,927 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 131 states and 160 transitions. [2022-04-08 14:03:50,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 152 inductive. 0 not inductive. 8 times theorem prover too weak to decide inductivity. [2022-04-08 14:03:50,198 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 160 transitions. [2022-04-08 14:03:50,199 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-08 14:03:50,199 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:03:50,199 INFO L499 BasicCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:03:50,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-08 14:03:50,411 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-04-08 14:03:50,411 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:03:50,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:03:50,412 INFO L85 PathProgramCache]: Analyzing trace with hash -164303550, now seen corresponding path program 17 times [2022-04-08 14:03:50,412 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:03:50,412 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [267292273] [2022-04-08 14:03:56,460 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:03:56,460 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:03:56,460 INFO L85 PathProgramCache]: Analyzing trace with hash -164303550, now seen corresponding path program 18 times [2022-04-08 14:03:56,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:03:56,460 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024506629] [2022-04-08 14:03:56,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:03:56,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:03:56,473 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:03:56,473 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [139417897] [2022-04-08 14:03:56,473 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:03:56,473 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:03:56,473 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:03:56,474 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:03:56,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 14:03:57,885 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 14:03:57,885 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:03:57,889 INFO L263 TraceCheckSpWp]: Trace formula consists of 320 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 14:03:57,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:03:57,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:03:58,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {16010#true} call ULTIMATE.init(); {16010#true} is VALID [2022-04-08 14:03:58,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {16010#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {16018#(<= ~counter~0 0)} assume true; {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,335 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16018#(<= ~counter~0 0)} {16010#true} #77#return; {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,335 INFO L272 TraceCheckUtils]: 4: Hoare triple {16018#(<= ~counter~0 0)} call #t~ret7 := main(); {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {16018#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,336 INFO L272 TraceCheckUtils]: 6: Hoare triple {16018#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {16018#(<= ~counter~0 0)} ~cond := #in~cond; {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {16018#(<= ~counter~0 0)} assume !(0 == ~cond); {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {16018#(<= ~counter~0 0)} assume true; {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,337 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16018#(<= ~counter~0 0)} {16018#(<= ~counter~0 0)} #69#return; {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {16018#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {16018#(<= ~counter~0 0)} is VALID [2022-04-08 14:03:58,338 INFO L290 TraceCheckUtils]: 12: Hoare triple {16018#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16052#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:58,338 INFO L290 TraceCheckUtils]: 13: Hoare triple {16052#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {16052#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:58,339 INFO L272 TraceCheckUtils]: 14: Hoare triple {16052#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16052#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:58,339 INFO L290 TraceCheckUtils]: 15: Hoare triple {16052#(<= ~counter~0 1)} ~cond := #in~cond; {16052#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:58,339 INFO L290 TraceCheckUtils]: 16: Hoare triple {16052#(<= ~counter~0 1)} assume !(0 == ~cond); {16052#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:58,340 INFO L290 TraceCheckUtils]: 17: Hoare triple {16052#(<= ~counter~0 1)} assume true; {16052#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:58,340 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16052#(<= ~counter~0 1)} {16052#(<= ~counter~0 1)} #71#return; {16052#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:58,340 INFO L290 TraceCheckUtils]: 19: Hoare triple {16052#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {16052#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:58,341 INFO L290 TraceCheckUtils]: 20: Hoare triple {16052#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16052#(<= ~counter~0 1)} is VALID [2022-04-08 14:03:58,341 INFO L290 TraceCheckUtils]: 21: Hoare triple {16052#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16080#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:58,341 INFO L290 TraceCheckUtils]: 22: Hoare triple {16080#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {16080#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:58,342 INFO L272 TraceCheckUtils]: 23: Hoare triple {16080#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16080#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:58,342 INFO L290 TraceCheckUtils]: 24: Hoare triple {16080#(<= ~counter~0 2)} ~cond := #in~cond; {16080#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:58,343 INFO L290 TraceCheckUtils]: 25: Hoare triple {16080#(<= ~counter~0 2)} assume !(0 == ~cond); {16080#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:58,343 INFO L290 TraceCheckUtils]: 26: Hoare triple {16080#(<= ~counter~0 2)} assume true; {16080#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:58,343 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16080#(<= ~counter~0 2)} {16080#(<= ~counter~0 2)} #71#return; {16080#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:58,344 INFO L290 TraceCheckUtils]: 28: Hoare triple {16080#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {16080#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:58,344 INFO L290 TraceCheckUtils]: 29: Hoare triple {16080#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16080#(<= ~counter~0 2)} is VALID [2022-04-08 14:03:58,344 INFO L290 TraceCheckUtils]: 30: Hoare triple {16080#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16108#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:58,345 INFO L290 TraceCheckUtils]: 31: Hoare triple {16108#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {16108#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:58,345 INFO L272 TraceCheckUtils]: 32: Hoare triple {16108#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16108#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:58,346 INFO L290 TraceCheckUtils]: 33: Hoare triple {16108#(<= ~counter~0 3)} ~cond := #in~cond; {16108#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:58,346 INFO L290 TraceCheckUtils]: 34: Hoare triple {16108#(<= ~counter~0 3)} assume !(0 == ~cond); {16108#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:58,346 INFO L290 TraceCheckUtils]: 35: Hoare triple {16108#(<= ~counter~0 3)} assume true; {16108#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:58,347 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16108#(<= ~counter~0 3)} {16108#(<= ~counter~0 3)} #71#return; {16108#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:58,347 INFO L290 TraceCheckUtils]: 37: Hoare triple {16108#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {16108#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:58,347 INFO L290 TraceCheckUtils]: 38: Hoare triple {16108#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16108#(<= ~counter~0 3)} is VALID [2022-04-08 14:03:58,348 INFO L290 TraceCheckUtils]: 39: Hoare triple {16108#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16136#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:58,348 INFO L290 TraceCheckUtils]: 40: Hoare triple {16136#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {16136#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:58,349 INFO L272 TraceCheckUtils]: 41: Hoare triple {16136#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16136#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:58,349 INFO L290 TraceCheckUtils]: 42: Hoare triple {16136#(<= ~counter~0 4)} ~cond := #in~cond; {16136#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:58,349 INFO L290 TraceCheckUtils]: 43: Hoare triple {16136#(<= ~counter~0 4)} assume !(0 == ~cond); {16136#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:58,349 INFO L290 TraceCheckUtils]: 44: Hoare triple {16136#(<= ~counter~0 4)} assume true; {16136#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:58,350 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16136#(<= ~counter~0 4)} {16136#(<= ~counter~0 4)} #71#return; {16136#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:58,350 INFO L290 TraceCheckUtils]: 46: Hoare triple {16136#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {16136#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:58,350 INFO L290 TraceCheckUtils]: 47: Hoare triple {16136#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16136#(<= ~counter~0 4)} is VALID [2022-04-08 14:03:58,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {16136#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16164#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:58,351 INFO L290 TraceCheckUtils]: 49: Hoare triple {16164#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {16164#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:58,352 INFO L272 TraceCheckUtils]: 50: Hoare triple {16164#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16164#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:58,352 INFO L290 TraceCheckUtils]: 51: Hoare triple {16164#(<= ~counter~0 5)} ~cond := #in~cond; {16164#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:58,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {16164#(<= ~counter~0 5)} assume !(0 == ~cond); {16164#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:58,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {16164#(<= ~counter~0 5)} assume true; {16164#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:58,353 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16164#(<= ~counter~0 5)} {16164#(<= ~counter~0 5)} #71#return; {16164#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:58,353 INFO L290 TraceCheckUtils]: 55: Hoare triple {16164#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {16164#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:58,354 INFO L290 TraceCheckUtils]: 56: Hoare triple {16164#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16164#(<= ~counter~0 5)} is VALID [2022-04-08 14:03:58,354 INFO L290 TraceCheckUtils]: 57: Hoare triple {16164#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16192#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:58,354 INFO L290 TraceCheckUtils]: 58: Hoare triple {16192#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {16192#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:58,355 INFO L272 TraceCheckUtils]: 59: Hoare triple {16192#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16192#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:58,355 INFO L290 TraceCheckUtils]: 60: Hoare triple {16192#(<= ~counter~0 6)} ~cond := #in~cond; {16192#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:58,356 INFO L290 TraceCheckUtils]: 61: Hoare triple {16192#(<= ~counter~0 6)} assume !(0 == ~cond); {16192#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:58,356 INFO L290 TraceCheckUtils]: 62: Hoare triple {16192#(<= ~counter~0 6)} assume true; {16192#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:58,357 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16192#(<= ~counter~0 6)} {16192#(<= ~counter~0 6)} #71#return; {16192#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:58,357 INFO L290 TraceCheckUtils]: 64: Hoare triple {16192#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {16192#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:58,357 INFO L290 TraceCheckUtils]: 65: Hoare triple {16192#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16192#(<= ~counter~0 6)} is VALID [2022-04-08 14:03:58,358 INFO L290 TraceCheckUtils]: 66: Hoare triple {16192#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16220#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:58,358 INFO L290 TraceCheckUtils]: 67: Hoare triple {16220#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {16220#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:58,358 INFO L272 TraceCheckUtils]: 68: Hoare triple {16220#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16220#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:58,359 INFO L290 TraceCheckUtils]: 69: Hoare triple {16220#(<= ~counter~0 7)} ~cond := #in~cond; {16220#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:58,359 INFO L290 TraceCheckUtils]: 70: Hoare triple {16220#(<= ~counter~0 7)} assume !(0 == ~cond); {16220#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:58,359 INFO L290 TraceCheckUtils]: 71: Hoare triple {16220#(<= ~counter~0 7)} assume true; {16220#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:58,360 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16220#(<= ~counter~0 7)} {16220#(<= ~counter~0 7)} #71#return; {16220#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:58,360 INFO L290 TraceCheckUtils]: 73: Hoare triple {16220#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {16220#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:58,360 INFO L290 TraceCheckUtils]: 74: Hoare triple {16220#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16220#(<= ~counter~0 7)} is VALID [2022-04-08 14:03:58,361 INFO L290 TraceCheckUtils]: 75: Hoare triple {16220#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16248#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:58,361 INFO L290 TraceCheckUtils]: 76: Hoare triple {16248#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {16248#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:58,362 INFO L272 TraceCheckUtils]: 77: Hoare triple {16248#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16248#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:58,362 INFO L290 TraceCheckUtils]: 78: Hoare triple {16248#(<= ~counter~0 8)} ~cond := #in~cond; {16248#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:58,362 INFO L290 TraceCheckUtils]: 79: Hoare triple {16248#(<= ~counter~0 8)} assume !(0 == ~cond); {16248#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:58,362 INFO L290 TraceCheckUtils]: 80: Hoare triple {16248#(<= ~counter~0 8)} assume true; {16248#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:58,363 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16248#(<= ~counter~0 8)} {16248#(<= ~counter~0 8)} #71#return; {16248#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:58,363 INFO L290 TraceCheckUtils]: 82: Hoare triple {16248#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {16248#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:58,364 INFO L290 TraceCheckUtils]: 83: Hoare triple {16248#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16248#(<= ~counter~0 8)} is VALID [2022-04-08 14:03:58,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {16248#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16276#(<= ~counter~0 9)} is VALID [2022-04-08 14:03:58,364 INFO L290 TraceCheckUtils]: 85: Hoare triple {16276#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {16276#(<= ~counter~0 9)} is VALID [2022-04-08 14:03:58,365 INFO L272 TraceCheckUtils]: 86: Hoare triple {16276#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16276#(<= ~counter~0 9)} is VALID [2022-04-08 14:03:58,365 INFO L290 TraceCheckUtils]: 87: Hoare triple {16276#(<= ~counter~0 9)} ~cond := #in~cond; {16276#(<= ~counter~0 9)} is VALID [2022-04-08 14:03:58,366 INFO L290 TraceCheckUtils]: 88: Hoare triple {16276#(<= ~counter~0 9)} assume !(0 == ~cond); {16276#(<= ~counter~0 9)} is VALID [2022-04-08 14:03:58,366 INFO L290 TraceCheckUtils]: 89: Hoare triple {16276#(<= ~counter~0 9)} assume true; {16276#(<= ~counter~0 9)} is VALID [2022-04-08 14:03:58,367 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16276#(<= ~counter~0 9)} {16276#(<= ~counter~0 9)} #71#return; {16276#(<= ~counter~0 9)} is VALID [2022-04-08 14:03:58,367 INFO L290 TraceCheckUtils]: 91: Hoare triple {16276#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {16276#(<= ~counter~0 9)} is VALID [2022-04-08 14:03:58,367 INFO L290 TraceCheckUtils]: 92: Hoare triple {16276#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16276#(<= ~counter~0 9)} is VALID [2022-04-08 14:03:58,368 INFO L290 TraceCheckUtils]: 93: Hoare triple {16276#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16304#(<= |main_#t~post6| 9)} is VALID [2022-04-08 14:03:58,368 INFO L290 TraceCheckUtils]: 94: Hoare triple {16304#(<= |main_#t~post6| 9)} assume !(#t~post6 < 20);havoc #t~post6; {16011#false} is VALID [2022-04-08 14:03:58,368 INFO L272 TraceCheckUtils]: 95: Hoare triple {16011#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {16011#false} is VALID [2022-04-08 14:03:58,368 INFO L290 TraceCheckUtils]: 96: Hoare triple {16011#false} ~cond := #in~cond; {16011#false} is VALID [2022-04-08 14:03:58,368 INFO L290 TraceCheckUtils]: 97: Hoare triple {16011#false} assume 0 == ~cond; {16011#false} is VALID [2022-04-08 14:03:58,368 INFO L290 TraceCheckUtils]: 98: Hoare triple {16011#false} assume !false; {16011#false} is VALID [2022-04-08 14:03:58,369 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 18 proven. 342 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:03:58,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:03:58,860 INFO L290 TraceCheckUtils]: 98: Hoare triple {16011#false} assume !false; {16011#false} is VALID [2022-04-08 14:03:58,860 INFO L290 TraceCheckUtils]: 97: Hoare triple {16011#false} assume 0 == ~cond; {16011#false} is VALID [2022-04-08 14:03:58,861 INFO L290 TraceCheckUtils]: 96: Hoare triple {16011#false} ~cond := #in~cond; {16011#false} is VALID [2022-04-08 14:03:58,861 INFO L272 TraceCheckUtils]: 95: Hoare triple {16011#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {16011#false} is VALID [2022-04-08 14:03:58,861 INFO L290 TraceCheckUtils]: 94: Hoare triple {16332#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {16011#false} is VALID [2022-04-08 14:03:58,861 INFO L290 TraceCheckUtils]: 93: Hoare triple {16336#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16332#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:03:58,861 INFO L290 TraceCheckUtils]: 92: Hoare triple {16336#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16336#(< ~counter~0 20)} is VALID [2022-04-08 14:03:58,862 INFO L290 TraceCheckUtils]: 91: Hoare triple {16336#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {16336#(< ~counter~0 20)} is VALID [2022-04-08 14:03:58,862 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {16010#true} {16336#(< ~counter~0 20)} #71#return; {16336#(< ~counter~0 20)} is VALID [2022-04-08 14:03:58,862 INFO L290 TraceCheckUtils]: 89: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,862 INFO L290 TraceCheckUtils]: 88: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,863 INFO L290 TraceCheckUtils]: 87: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,863 INFO L272 TraceCheckUtils]: 86: Hoare triple {16336#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,863 INFO L290 TraceCheckUtils]: 85: Hoare triple {16336#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {16336#(< ~counter~0 20)} is VALID [2022-04-08 14:03:58,863 INFO L290 TraceCheckUtils]: 84: Hoare triple {16364#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16336#(< ~counter~0 20)} is VALID [2022-04-08 14:03:58,864 INFO L290 TraceCheckUtils]: 83: Hoare triple {16364#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16364#(< ~counter~0 19)} is VALID [2022-04-08 14:03:58,864 INFO L290 TraceCheckUtils]: 82: Hoare triple {16364#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {16364#(< ~counter~0 19)} is VALID [2022-04-08 14:03:58,864 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {16010#true} {16364#(< ~counter~0 19)} #71#return; {16364#(< ~counter~0 19)} is VALID [2022-04-08 14:03:58,865 INFO L290 TraceCheckUtils]: 80: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,865 INFO L290 TraceCheckUtils]: 79: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,865 INFO L272 TraceCheckUtils]: 77: Hoare triple {16364#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {16364#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {16364#(< ~counter~0 19)} is VALID [2022-04-08 14:03:58,865 INFO L290 TraceCheckUtils]: 75: Hoare triple {16392#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16364#(< ~counter~0 19)} is VALID [2022-04-08 14:03:58,866 INFO L290 TraceCheckUtils]: 74: Hoare triple {16392#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16392#(< ~counter~0 18)} is VALID [2022-04-08 14:03:58,866 INFO L290 TraceCheckUtils]: 73: Hoare triple {16392#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {16392#(< ~counter~0 18)} is VALID [2022-04-08 14:03:58,866 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {16010#true} {16392#(< ~counter~0 18)} #71#return; {16392#(< ~counter~0 18)} is VALID [2022-04-08 14:03:58,867 INFO L290 TraceCheckUtils]: 71: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,867 INFO L290 TraceCheckUtils]: 70: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,867 INFO L290 TraceCheckUtils]: 69: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,867 INFO L272 TraceCheckUtils]: 68: Hoare triple {16392#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,867 INFO L290 TraceCheckUtils]: 67: Hoare triple {16392#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {16392#(< ~counter~0 18)} is VALID [2022-04-08 14:03:58,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {16420#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16392#(< ~counter~0 18)} is VALID [2022-04-08 14:03:58,868 INFO L290 TraceCheckUtils]: 65: Hoare triple {16420#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16420#(< ~counter~0 17)} is VALID [2022-04-08 14:03:58,868 INFO L290 TraceCheckUtils]: 64: Hoare triple {16420#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {16420#(< ~counter~0 17)} is VALID [2022-04-08 14:03:58,868 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16010#true} {16420#(< ~counter~0 17)} #71#return; {16420#(< ~counter~0 17)} is VALID [2022-04-08 14:03:58,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,869 INFO L272 TraceCheckUtils]: 59: Hoare triple {16420#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {16420#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {16420#(< ~counter~0 17)} is VALID [2022-04-08 14:03:58,869 INFO L290 TraceCheckUtils]: 57: Hoare triple {16448#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16420#(< ~counter~0 17)} is VALID [2022-04-08 14:03:58,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {16448#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16448#(< ~counter~0 16)} is VALID [2022-04-08 14:03:58,870 INFO L290 TraceCheckUtils]: 55: Hoare triple {16448#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {16448#(< ~counter~0 16)} is VALID [2022-04-08 14:03:58,870 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {16010#true} {16448#(< ~counter~0 16)} #71#return; {16448#(< ~counter~0 16)} is VALID [2022-04-08 14:03:58,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,871 INFO L290 TraceCheckUtils]: 51: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,871 INFO L272 TraceCheckUtils]: 50: Hoare triple {16448#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,871 INFO L290 TraceCheckUtils]: 49: Hoare triple {16448#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {16448#(< ~counter~0 16)} is VALID [2022-04-08 14:03:58,871 INFO L290 TraceCheckUtils]: 48: Hoare triple {16476#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16448#(< ~counter~0 16)} is VALID [2022-04-08 14:03:58,872 INFO L290 TraceCheckUtils]: 47: Hoare triple {16476#(< ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16476#(< ~counter~0 15)} is VALID [2022-04-08 14:03:58,872 INFO L290 TraceCheckUtils]: 46: Hoare triple {16476#(< ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {16476#(< ~counter~0 15)} is VALID [2022-04-08 14:03:58,873 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {16010#true} {16476#(< ~counter~0 15)} #71#return; {16476#(< ~counter~0 15)} is VALID [2022-04-08 14:03:58,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,873 INFO L290 TraceCheckUtils]: 43: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,873 INFO L290 TraceCheckUtils]: 42: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,873 INFO L272 TraceCheckUtils]: 41: Hoare triple {16476#(< ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {16476#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {16476#(< ~counter~0 15)} is VALID [2022-04-08 14:03:58,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {16504#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16476#(< ~counter~0 15)} is VALID [2022-04-08 14:03:58,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {16504#(< ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16504#(< ~counter~0 14)} is VALID [2022-04-08 14:03:58,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {16504#(< ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {16504#(< ~counter~0 14)} is VALID [2022-04-08 14:03:58,877 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {16010#true} {16504#(< ~counter~0 14)} #71#return; {16504#(< ~counter~0 14)} is VALID [2022-04-08 14:03:58,877 INFO L290 TraceCheckUtils]: 35: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,877 INFO L290 TraceCheckUtils]: 34: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,877 INFO L272 TraceCheckUtils]: 32: Hoare triple {16504#(< ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,877 INFO L290 TraceCheckUtils]: 31: Hoare triple {16504#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {16504#(< ~counter~0 14)} is VALID [2022-04-08 14:03:58,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {16532#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16504#(< ~counter~0 14)} is VALID [2022-04-08 14:03:58,878 INFO L290 TraceCheckUtils]: 29: Hoare triple {16532#(< ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16532#(< ~counter~0 13)} is VALID [2022-04-08 14:03:58,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {16532#(< ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {16532#(< ~counter~0 13)} is VALID [2022-04-08 14:03:58,879 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {16010#true} {16532#(< ~counter~0 13)} #71#return; {16532#(< ~counter~0 13)} is VALID [2022-04-08 14:03:58,879 INFO L290 TraceCheckUtils]: 26: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,879 INFO L272 TraceCheckUtils]: 23: Hoare triple {16532#(< ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {16532#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {16532#(< ~counter~0 13)} is VALID [2022-04-08 14:03:58,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {16560#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16532#(< ~counter~0 13)} is VALID [2022-04-08 14:03:58,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {16560#(< ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {16560#(< ~counter~0 12)} is VALID [2022-04-08 14:03:58,880 INFO L290 TraceCheckUtils]: 19: Hoare triple {16560#(< ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {16560#(< ~counter~0 12)} is VALID [2022-04-08 14:03:58,881 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {16010#true} {16560#(< ~counter~0 12)} #71#return; {16560#(< ~counter~0 12)} is VALID [2022-04-08 14:03:58,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,881 INFO L272 TraceCheckUtils]: 14: Hoare triple {16560#(< ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,881 INFO L290 TraceCheckUtils]: 13: Hoare triple {16560#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {16560#(< ~counter~0 12)} is VALID [2022-04-08 14:03:58,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {16588#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16560#(< ~counter~0 12)} is VALID [2022-04-08 14:03:58,882 INFO L290 TraceCheckUtils]: 11: Hoare triple {16588#(< ~counter~0 11)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {16588#(< ~counter~0 11)} is VALID [2022-04-08 14:03:58,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16010#true} {16588#(< ~counter~0 11)} #69#return; {16588#(< ~counter~0 11)} is VALID [2022-04-08 14:03:58,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {16010#true} assume true; {16010#true} is VALID [2022-04-08 14:03:58,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {16010#true} assume !(0 == ~cond); {16010#true} is VALID [2022-04-08 14:03:58,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {16010#true} ~cond := #in~cond; {16010#true} is VALID [2022-04-08 14:03:58,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {16588#(< ~counter~0 11)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {16010#true} is VALID [2022-04-08 14:03:58,888 INFO L290 TraceCheckUtils]: 5: Hoare triple {16588#(< ~counter~0 11)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {16588#(< ~counter~0 11)} is VALID [2022-04-08 14:03:58,888 INFO L272 TraceCheckUtils]: 4: Hoare triple {16588#(< ~counter~0 11)} call #t~ret7 := main(); {16588#(< ~counter~0 11)} is VALID [2022-04-08 14:03:58,889 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16588#(< ~counter~0 11)} {16010#true} #77#return; {16588#(< ~counter~0 11)} is VALID [2022-04-08 14:03:58,889 INFO L290 TraceCheckUtils]: 2: Hoare triple {16588#(< ~counter~0 11)} assume true; {16588#(< ~counter~0 11)} is VALID [2022-04-08 14:03:58,889 INFO L290 TraceCheckUtils]: 1: Hoare triple {16010#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {16588#(< ~counter~0 11)} is VALID [2022-04-08 14:03:58,890 INFO L272 TraceCheckUtils]: 0: Hoare triple {16010#true} call ULTIMATE.init(); {16010#true} is VALID [2022-04-08 14:03:58,890 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 18 proven. 198 refuted. 0 times theorem prover too weak. 144 trivial. 0 not checked. [2022-04-08 14:03:58,890 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:03:58,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024506629] [2022-04-08 14:03:58,890 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:03:58,890 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [139417897] [2022-04-08 14:03:58,890 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [139417897] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:03:58,890 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:03:58,890 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 14:03:58,891 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:03:58,891 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [267292273] [2022-04-08 14:03:58,891 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [267292273] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:03:58,891 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:03:58,891 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 14:03:58,891 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721260028] [2022-04-08 14:03:58,891 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:03:58,891 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 99 [2022-04-08 14:03:58,892 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:03:58,892 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:03:58,956 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:03:58,956 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 14:03:58,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:03:58,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 14:03:58,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:03:58,957 INFO L87 Difference]: Start difference. First operand 131 states and 160 transitions. Second operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:03:59,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:03:59,483 INFO L93 Difference]: Finished difference Result 150 states and 183 transitions. [2022-04-08 14:03:59,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 14:03:59,484 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) Word has length 99 [2022-04-08 14:03:59,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:03:59,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:03:59,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 169 transitions. [2022-04-08 14:03:59,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:03:59,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 169 transitions. [2022-04-08 14:03:59,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 169 transitions. [2022-04-08 14:03:59,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:03:59,642 INFO L225 Difference]: With dead ends: 150 [2022-04-08 14:03:59,643 INFO L226 Difference]: Without dead ends: 142 [2022-04-08 14:03:59,643 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=443, Invalid=613, Unknown=0, NotChecked=0, Total=1056 [2022-04-08 14:03:59,643 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 122 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 186 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:03:59,643 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [122 Valid, 186 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:03:59,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-04-08 14:03:59,868 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-04-08 14:03:59,868 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:03:59,868 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:03:59,869 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:03:59,869 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:03:59,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:03:59,871 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2022-04-08 14:03:59,871 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-08 14:03:59,871 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:03:59,871 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:03:59,871 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 142 states. [2022-04-08 14:03:59,872 INFO L87 Difference]: Start difference. First operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 142 states. [2022-04-08 14:03:59,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:03:59,874 INFO L93 Difference]: Finished difference Result 142 states and 174 transitions. [2022-04-08 14:03:59,874 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-08 14:03:59,874 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:03:59,874 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:03:59,874 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:03:59,874 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:03:59,874 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 111 states have (on average 1.2972972972972974) internal successors, (144), 112 states have internal predecessors, (144), 16 states have call successors, (16), 15 states have call predecessors, (16), 14 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:03:59,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 174 transitions. [2022-04-08 14:03:59,877 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 174 transitions. Word has length 99 [2022-04-08 14:03:59,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:03:59,877 INFO L478 AbstractCegarLoop]: Abstraction has 142 states and 174 transitions. [2022-04-08 14:03:59,877 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 10 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-08 14:03:59,877 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 142 states and 174 transitions. [2022-04-08 14:04:19,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 174 edges. 165 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-04-08 14:04:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 174 transitions. [2022-04-08 14:04:19,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 109 [2022-04-08 14:04:19,319 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:04:19,319 INFO L499 BasicCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:04:19,335 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 14:04:19,526 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:04:19,527 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:04:19,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:04:19,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1397474810, now seen corresponding path program 19 times [2022-04-08 14:04:19,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:04:19,527 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [272927226] [2022-04-08 14:04:25,576 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:04:25,577 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:04:25,577 INFO L85 PathProgramCache]: Analyzing trace with hash 1397474810, now seen corresponding path program 20 times [2022-04-08 14:04:25,577 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:04:25,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2063352957] [2022-04-08 14:04:25,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:04:25,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:04:25,591 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:04:25,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1701776806] [2022-04-08 14:04:25,591 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:04:25,591 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:04:25,591 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:04:25,592 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:04:25,592 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 14:04:25,668 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:04:25,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:04:25,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 14:04:25,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:04:25,699 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:04:26,158 INFO L272 TraceCheckUtils]: 0: Hoare triple {17513#true} call ULTIMATE.init(); {17513#true} is VALID [2022-04-08 14:04:26,158 INFO L290 TraceCheckUtils]: 1: Hoare triple {17513#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,159 INFO L290 TraceCheckUtils]: 2: Hoare triple {17521#(<= ~counter~0 0)} assume true; {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,159 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17521#(<= ~counter~0 0)} {17513#true} #77#return; {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,159 INFO L272 TraceCheckUtils]: 4: Hoare triple {17521#(<= ~counter~0 0)} call #t~ret7 := main(); {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,159 INFO L290 TraceCheckUtils]: 5: Hoare triple {17521#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,160 INFO L272 TraceCheckUtils]: 6: Hoare triple {17521#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,160 INFO L290 TraceCheckUtils]: 7: Hoare triple {17521#(<= ~counter~0 0)} ~cond := #in~cond; {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,160 INFO L290 TraceCheckUtils]: 8: Hoare triple {17521#(<= ~counter~0 0)} assume !(0 == ~cond); {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {17521#(<= ~counter~0 0)} assume true; {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17521#(<= ~counter~0 0)} {17521#(<= ~counter~0 0)} #69#return; {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {17521#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {17521#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:26,162 INFO L290 TraceCheckUtils]: 12: Hoare triple {17521#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17555#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:26,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {17555#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {17555#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:26,163 INFO L272 TraceCheckUtils]: 14: Hoare triple {17555#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17555#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:26,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {17555#(<= ~counter~0 1)} ~cond := #in~cond; {17555#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:26,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {17555#(<= ~counter~0 1)} assume !(0 == ~cond); {17555#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:26,163 INFO L290 TraceCheckUtils]: 17: Hoare triple {17555#(<= ~counter~0 1)} assume true; {17555#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:26,164 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17555#(<= ~counter~0 1)} {17555#(<= ~counter~0 1)} #71#return; {17555#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:26,164 INFO L290 TraceCheckUtils]: 19: Hoare triple {17555#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {17555#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:26,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {17555#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17555#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:26,165 INFO L290 TraceCheckUtils]: 21: Hoare triple {17555#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17583#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:26,165 INFO L290 TraceCheckUtils]: 22: Hoare triple {17583#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {17583#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:26,166 INFO L272 TraceCheckUtils]: 23: Hoare triple {17583#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17583#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:26,166 INFO L290 TraceCheckUtils]: 24: Hoare triple {17583#(<= ~counter~0 2)} ~cond := #in~cond; {17583#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:26,166 INFO L290 TraceCheckUtils]: 25: Hoare triple {17583#(<= ~counter~0 2)} assume !(0 == ~cond); {17583#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:26,167 INFO L290 TraceCheckUtils]: 26: Hoare triple {17583#(<= ~counter~0 2)} assume true; {17583#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:26,167 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17583#(<= ~counter~0 2)} {17583#(<= ~counter~0 2)} #71#return; {17583#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:26,167 INFO L290 TraceCheckUtils]: 28: Hoare triple {17583#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {17583#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:26,168 INFO L290 TraceCheckUtils]: 29: Hoare triple {17583#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17583#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:26,168 INFO L290 TraceCheckUtils]: 30: Hoare triple {17583#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17611#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:26,168 INFO L290 TraceCheckUtils]: 31: Hoare triple {17611#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {17611#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:26,169 INFO L272 TraceCheckUtils]: 32: Hoare triple {17611#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17611#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:26,169 INFO L290 TraceCheckUtils]: 33: Hoare triple {17611#(<= ~counter~0 3)} ~cond := #in~cond; {17611#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:26,169 INFO L290 TraceCheckUtils]: 34: Hoare triple {17611#(<= ~counter~0 3)} assume !(0 == ~cond); {17611#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:26,170 INFO L290 TraceCheckUtils]: 35: Hoare triple {17611#(<= ~counter~0 3)} assume true; {17611#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:26,170 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17611#(<= ~counter~0 3)} {17611#(<= ~counter~0 3)} #71#return; {17611#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:26,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {17611#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {17611#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:26,171 INFO L290 TraceCheckUtils]: 38: Hoare triple {17611#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17611#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:26,171 INFO L290 TraceCheckUtils]: 39: Hoare triple {17611#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17639#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:26,171 INFO L290 TraceCheckUtils]: 40: Hoare triple {17639#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {17639#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:26,172 INFO L272 TraceCheckUtils]: 41: Hoare triple {17639#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17639#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:26,172 INFO L290 TraceCheckUtils]: 42: Hoare triple {17639#(<= ~counter~0 4)} ~cond := #in~cond; {17639#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:26,172 INFO L290 TraceCheckUtils]: 43: Hoare triple {17639#(<= ~counter~0 4)} assume !(0 == ~cond); {17639#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:26,173 INFO L290 TraceCheckUtils]: 44: Hoare triple {17639#(<= ~counter~0 4)} assume true; {17639#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:26,173 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17639#(<= ~counter~0 4)} {17639#(<= ~counter~0 4)} #71#return; {17639#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:26,174 INFO L290 TraceCheckUtils]: 46: Hoare triple {17639#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {17639#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:26,174 INFO L290 TraceCheckUtils]: 47: Hoare triple {17639#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17639#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:26,174 INFO L290 TraceCheckUtils]: 48: Hoare triple {17639#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17667#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:26,174 INFO L290 TraceCheckUtils]: 49: Hoare triple {17667#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {17667#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:26,175 INFO L272 TraceCheckUtils]: 50: Hoare triple {17667#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17667#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:26,175 INFO L290 TraceCheckUtils]: 51: Hoare triple {17667#(<= ~counter~0 5)} ~cond := #in~cond; {17667#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:26,176 INFO L290 TraceCheckUtils]: 52: Hoare triple {17667#(<= ~counter~0 5)} assume !(0 == ~cond); {17667#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:26,176 INFO L290 TraceCheckUtils]: 53: Hoare triple {17667#(<= ~counter~0 5)} assume true; {17667#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:26,176 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17667#(<= ~counter~0 5)} {17667#(<= ~counter~0 5)} #71#return; {17667#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:26,177 INFO L290 TraceCheckUtils]: 55: Hoare triple {17667#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {17667#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:26,177 INFO L290 TraceCheckUtils]: 56: Hoare triple {17667#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17667#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:26,177 INFO L290 TraceCheckUtils]: 57: Hoare triple {17667#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17695#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:26,177 INFO L290 TraceCheckUtils]: 58: Hoare triple {17695#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {17695#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:26,178 INFO L272 TraceCheckUtils]: 59: Hoare triple {17695#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17695#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:26,178 INFO L290 TraceCheckUtils]: 60: Hoare triple {17695#(<= ~counter~0 6)} ~cond := #in~cond; {17695#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:26,179 INFO L290 TraceCheckUtils]: 61: Hoare triple {17695#(<= ~counter~0 6)} assume !(0 == ~cond); {17695#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:26,179 INFO L290 TraceCheckUtils]: 62: Hoare triple {17695#(<= ~counter~0 6)} assume true; {17695#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:26,179 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17695#(<= ~counter~0 6)} {17695#(<= ~counter~0 6)} #71#return; {17695#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:26,180 INFO L290 TraceCheckUtils]: 64: Hoare triple {17695#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {17695#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:26,180 INFO L290 TraceCheckUtils]: 65: Hoare triple {17695#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17695#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:26,180 INFO L290 TraceCheckUtils]: 66: Hoare triple {17695#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17723#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:26,181 INFO L290 TraceCheckUtils]: 67: Hoare triple {17723#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {17723#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:26,181 INFO L272 TraceCheckUtils]: 68: Hoare triple {17723#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17723#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:26,181 INFO L290 TraceCheckUtils]: 69: Hoare triple {17723#(<= ~counter~0 7)} ~cond := #in~cond; {17723#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:26,182 INFO L290 TraceCheckUtils]: 70: Hoare triple {17723#(<= ~counter~0 7)} assume !(0 == ~cond); {17723#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:26,182 INFO L290 TraceCheckUtils]: 71: Hoare triple {17723#(<= ~counter~0 7)} assume true; {17723#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:26,182 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {17723#(<= ~counter~0 7)} {17723#(<= ~counter~0 7)} #71#return; {17723#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:26,183 INFO L290 TraceCheckUtils]: 73: Hoare triple {17723#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {17723#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:26,183 INFO L290 TraceCheckUtils]: 74: Hoare triple {17723#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17723#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:26,183 INFO L290 TraceCheckUtils]: 75: Hoare triple {17723#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17751#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:26,184 INFO L290 TraceCheckUtils]: 76: Hoare triple {17751#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {17751#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:26,184 INFO L272 TraceCheckUtils]: 77: Hoare triple {17751#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17751#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:26,184 INFO L290 TraceCheckUtils]: 78: Hoare triple {17751#(<= ~counter~0 8)} ~cond := #in~cond; {17751#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:26,185 INFO L290 TraceCheckUtils]: 79: Hoare triple {17751#(<= ~counter~0 8)} assume !(0 == ~cond); {17751#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:26,185 INFO L290 TraceCheckUtils]: 80: Hoare triple {17751#(<= ~counter~0 8)} assume true; {17751#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:26,185 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17751#(<= ~counter~0 8)} {17751#(<= ~counter~0 8)} #71#return; {17751#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:26,186 INFO L290 TraceCheckUtils]: 82: Hoare triple {17751#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {17751#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:26,186 INFO L290 TraceCheckUtils]: 83: Hoare triple {17751#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17751#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:26,186 INFO L290 TraceCheckUtils]: 84: Hoare triple {17751#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,187 INFO L290 TraceCheckUtils]: 85: Hoare triple {17779#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,187 INFO L272 TraceCheckUtils]: 86: Hoare triple {17779#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,187 INFO L290 TraceCheckUtils]: 87: Hoare triple {17779#(<= ~counter~0 9)} ~cond := #in~cond; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,188 INFO L290 TraceCheckUtils]: 88: Hoare triple {17779#(<= ~counter~0 9)} assume !(0 == ~cond); {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,188 INFO L290 TraceCheckUtils]: 89: Hoare triple {17779#(<= ~counter~0 9)} assume true; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,188 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17779#(<= ~counter~0 9)} {17779#(<= ~counter~0 9)} #71#return; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,189 INFO L290 TraceCheckUtils]: 91: Hoare triple {17779#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,189 INFO L290 TraceCheckUtils]: 92: Hoare triple {17779#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,189 INFO L290 TraceCheckUtils]: 93: Hoare triple {17779#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,190 INFO L290 TraceCheckUtils]: 94: Hoare triple {17807#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,190 INFO L272 TraceCheckUtils]: 95: Hoare triple {17807#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,190 INFO L290 TraceCheckUtils]: 96: Hoare triple {17807#(<= ~counter~0 10)} ~cond := #in~cond; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,191 INFO L290 TraceCheckUtils]: 97: Hoare triple {17807#(<= ~counter~0 10)} assume !(0 == ~cond); {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,191 INFO L290 TraceCheckUtils]: 98: Hoare triple {17807#(<= ~counter~0 10)} assume true; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,191 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {17807#(<= ~counter~0 10)} {17807#(<= ~counter~0 10)} #71#return; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,192 INFO L290 TraceCheckUtils]: 100: Hoare triple {17807#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,192 INFO L290 TraceCheckUtils]: 101: Hoare triple {17807#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,192 INFO L290 TraceCheckUtils]: 102: Hoare triple {17807#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17835#(<= |main_#t~post6| 10)} is VALID [2022-04-08 14:04:26,193 INFO L290 TraceCheckUtils]: 103: Hoare triple {17835#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {17514#false} is VALID [2022-04-08 14:04:26,193 INFO L272 TraceCheckUtils]: 104: Hoare triple {17514#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {17514#false} is VALID [2022-04-08 14:04:26,193 INFO L290 TraceCheckUtils]: 105: Hoare triple {17514#false} ~cond := #in~cond; {17514#false} is VALID [2022-04-08 14:04:26,193 INFO L290 TraceCheckUtils]: 106: Hoare triple {17514#false} assume 0 == ~cond; {17514#false} is VALID [2022-04-08 14:04:26,193 INFO L290 TraceCheckUtils]: 107: Hoare triple {17514#false} assume !false; {17514#false} is VALID [2022-04-08 14:04:26,193 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:04:26,193 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:04:26,718 INFO L290 TraceCheckUtils]: 107: Hoare triple {17514#false} assume !false; {17514#false} is VALID [2022-04-08 14:04:26,718 INFO L290 TraceCheckUtils]: 106: Hoare triple {17514#false} assume 0 == ~cond; {17514#false} is VALID [2022-04-08 14:04:26,718 INFO L290 TraceCheckUtils]: 105: Hoare triple {17514#false} ~cond := #in~cond; {17514#false} is VALID [2022-04-08 14:04:26,718 INFO L272 TraceCheckUtils]: 104: Hoare triple {17514#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {17514#false} is VALID [2022-04-08 14:04:26,723 INFO L290 TraceCheckUtils]: 103: Hoare triple {17863#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {17514#false} is VALID [2022-04-08 14:04:26,723 INFO L290 TraceCheckUtils]: 102: Hoare triple {17867#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17863#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:04:26,724 INFO L290 TraceCheckUtils]: 101: Hoare triple {17867#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17867#(< ~counter~0 20)} is VALID [2022-04-08 14:04:26,724 INFO L290 TraceCheckUtils]: 100: Hoare triple {17867#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {17867#(< ~counter~0 20)} is VALID [2022-04-08 14:04:26,725 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {17513#true} {17867#(< ~counter~0 20)} #71#return; {17867#(< ~counter~0 20)} is VALID [2022-04-08 14:04:26,725 INFO L290 TraceCheckUtils]: 98: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,725 INFO L290 TraceCheckUtils]: 97: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,725 INFO L290 TraceCheckUtils]: 96: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,725 INFO L272 TraceCheckUtils]: 95: Hoare triple {17867#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,725 INFO L290 TraceCheckUtils]: 94: Hoare triple {17867#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {17867#(< ~counter~0 20)} is VALID [2022-04-08 14:04:26,726 INFO L290 TraceCheckUtils]: 93: Hoare triple {17895#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17867#(< ~counter~0 20)} is VALID [2022-04-08 14:04:26,726 INFO L290 TraceCheckUtils]: 92: Hoare triple {17895#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17895#(< ~counter~0 19)} is VALID [2022-04-08 14:04:26,726 INFO L290 TraceCheckUtils]: 91: Hoare triple {17895#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {17895#(< ~counter~0 19)} is VALID [2022-04-08 14:04:26,727 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {17513#true} {17895#(< ~counter~0 19)} #71#return; {17895#(< ~counter~0 19)} is VALID [2022-04-08 14:04:26,727 INFO L290 TraceCheckUtils]: 89: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,727 INFO L290 TraceCheckUtils]: 88: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,727 INFO L290 TraceCheckUtils]: 87: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,727 INFO L272 TraceCheckUtils]: 86: Hoare triple {17895#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,727 INFO L290 TraceCheckUtils]: 85: Hoare triple {17895#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {17895#(< ~counter~0 19)} is VALID [2022-04-08 14:04:26,728 INFO L290 TraceCheckUtils]: 84: Hoare triple {17923#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17895#(< ~counter~0 19)} is VALID [2022-04-08 14:04:26,728 INFO L290 TraceCheckUtils]: 83: Hoare triple {17923#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17923#(< ~counter~0 18)} is VALID [2022-04-08 14:04:26,728 INFO L290 TraceCheckUtils]: 82: Hoare triple {17923#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {17923#(< ~counter~0 18)} is VALID [2022-04-08 14:04:26,729 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {17513#true} {17923#(< ~counter~0 18)} #71#return; {17923#(< ~counter~0 18)} is VALID [2022-04-08 14:04:26,729 INFO L290 TraceCheckUtils]: 80: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,729 INFO L290 TraceCheckUtils]: 79: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,729 INFO L290 TraceCheckUtils]: 78: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,729 INFO L272 TraceCheckUtils]: 77: Hoare triple {17923#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,731 INFO L290 TraceCheckUtils]: 76: Hoare triple {17923#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {17923#(< ~counter~0 18)} is VALID [2022-04-08 14:04:26,731 INFO L290 TraceCheckUtils]: 75: Hoare triple {17951#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17923#(< ~counter~0 18)} is VALID [2022-04-08 14:04:26,732 INFO L290 TraceCheckUtils]: 74: Hoare triple {17951#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17951#(< ~counter~0 17)} is VALID [2022-04-08 14:04:26,732 INFO L290 TraceCheckUtils]: 73: Hoare triple {17951#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {17951#(< ~counter~0 17)} is VALID [2022-04-08 14:04:26,732 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {17513#true} {17951#(< ~counter~0 17)} #71#return; {17951#(< ~counter~0 17)} is VALID [2022-04-08 14:04:26,732 INFO L290 TraceCheckUtils]: 71: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,733 INFO L290 TraceCheckUtils]: 70: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,733 INFO L290 TraceCheckUtils]: 69: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,733 INFO L272 TraceCheckUtils]: 68: Hoare triple {17951#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,733 INFO L290 TraceCheckUtils]: 67: Hoare triple {17951#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {17951#(< ~counter~0 17)} is VALID [2022-04-08 14:04:26,733 INFO L290 TraceCheckUtils]: 66: Hoare triple {17979#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17951#(< ~counter~0 17)} is VALID [2022-04-08 14:04:26,734 INFO L290 TraceCheckUtils]: 65: Hoare triple {17979#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17979#(< ~counter~0 16)} is VALID [2022-04-08 14:04:26,734 INFO L290 TraceCheckUtils]: 64: Hoare triple {17979#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {17979#(< ~counter~0 16)} is VALID [2022-04-08 14:04:26,734 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17513#true} {17979#(< ~counter~0 16)} #71#return; {17979#(< ~counter~0 16)} is VALID [2022-04-08 14:04:26,735 INFO L290 TraceCheckUtils]: 62: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,735 INFO L290 TraceCheckUtils]: 61: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,735 INFO L290 TraceCheckUtils]: 60: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,735 INFO L272 TraceCheckUtils]: 59: Hoare triple {17979#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,735 INFO L290 TraceCheckUtils]: 58: Hoare triple {17979#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {17979#(< ~counter~0 16)} is VALID [2022-04-08 14:04:26,735 INFO L290 TraceCheckUtils]: 57: Hoare triple {18007#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17979#(< ~counter~0 16)} is VALID [2022-04-08 14:04:26,736 INFO L290 TraceCheckUtils]: 56: Hoare triple {18007#(< ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18007#(< ~counter~0 15)} is VALID [2022-04-08 14:04:26,736 INFO L290 TraceCheckUtils]: 55: Hoare triple {18007#(< ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {18007#(< ~counter~0 15)} is VALID [2022-04-08 14:04:26,736 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {17513#true} {18007#(< ~counter~0 15)} #71#return; {18007#(< ~counter~0 15)} is VALID [2022-04-08 14:04:26,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,737 INFO L272 TraceCheckUtils]: 50: Hoare triple {18007#(< ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,737 INFO L290 TraceCheckUtils]: 49: Hoare triple {18007#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {18007#(< ~counter~0 15)} is VALID [2022-04-08 14:04:26,737 INFO L290 TraceCheckUtils]: 48: Hoare triple {18035#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18007#(< ~counter~0 15)} is VALID [2022-04-08 14:04:26,738 INFO L290 TraceCheckUtils]: 47: Hoare triple {18035#(< ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18035#(< ~counter~0 14)} is VALID [2022-04-08 14:04:26,738 INFO L290 TraceCheckUtils]: 46: Hoare triple {18035#(< ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {18035#(< ~counter~0 14)} is VALID [2022-04-08 14:04:26,739 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {17513#true} {18035#(< ~counter~0 14)} #71#return; {18035#(< ~counter~0 14)} is VALID [2022-04-08 14:04:26,739 INFO L290 TraceCheckUtils]: 44: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,743 INFO L290 TraceCheckUtils]: 43: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,743 INFO L290 TraceCheckUtils]: 42: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,744 INFO L272 TraceCheckUtils]: 41: Hoare triple {18035#(< ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,745 INFO L290 TraceCheckUtils]: 40: Hoare triple {18035#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {18035#(< ~counter~0 14)} is VALID [2022-04-08 14:04:26,745 INFO L290 TraceCheckUtils]: 39: Hoare triple {18063#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18035#(< ~counter~0 14)} is VALID [2022-04-08 14:04:26,745 INFO L290 TraceCheckUtils]: 38: Hoare triple {18063#(< ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18063#(< ~counter~0 13)} is VALID [2022-04-08 14:04:26,746 INFO L290 TraceCheckUtils]: 37: Hoare triple {18063#(< ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {18063#(< ~counter~0 13)} is VALID [2022-04-08 14:04:26,746 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {17513#true} {18063#(< ~counter~0 13)} #71#return; {18063#(< ~counter~0 13)} is VALID [2022-04-08 14:04:26,746 INFO L290 TraceCheckUtils]: 35: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,747 INFO L290 TraceCheckUtils]: 34: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,747 INFO L290 TraceCheckUtils]: 33: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,747 INFO L272 TraceCheckUtils]: 32: Hoare triple {18063#(< ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,747 INFO L290 TraceCheckUtils]: 31: Hoare triple {18063#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {18063#(< ~counter~0 13)} is VALID [2022-04-08 14:04:26,747 INFO L290 TraceCheckUtils]: 30: Hoare triple {18091#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18063#(< ~counter~0 13)} is VALID [2022-04-08 14:04:26,748 INFO L290 TraceCheckUtils]: 29: Hoare triple {18091#(< ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {18091#(< ~counter~0 12)} is VALID [2022-04-08 14:04:26,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {18091#(< ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {18091#(< ~counter~0 12)} is VALID [2022-04-08 14:04:26,748 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {17513#true} {18091#(< ~counter~0 12)} #71#return; {18091#(< ~counter~0 12)} is VALID [2022-04-08 14:04:26,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,749 INFO L272 TraceCheckUtils]: 23: Hoare triple {18091#(< ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,749 INFO L290 TraceCheckUtils]: 22: Hoare triple {18091#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {18091#(< ~counter~0 12)} is VALID [2022-04-08 14:04:26,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {17807#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18091#(< ~counter~0 12)} is VALID [2022-04-08 14:04:26,750 INFO L290 TraceCheckUtils]: 20: Hoare triple {17807#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {17807#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,750 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {17513#true} {17807#(<= ~counter~0 10)} #71#return; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,751 INFO L290 TraceCheckUtils]: 17: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,751 INFO L272 TraceCheckUtils]: 14: Hoare triple {17807#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,751 INFO L290 TraceCheckUtils]: 13: Hoare triple {17807#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,751 INFO L290 TraceCheckUtils]: 12: Hoare triple {17779#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17807#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:26,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {17779#(<= ~counter~0 9)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,752 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17513#true} {17779#(<= ~counter~0 9)} #69#return; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,752 INFO L290 TraceCheckUtils]: 9: Hoare triple {17513#true} assume true; {17513#true} is VALID [2022-04-08 14:04:26,752 INFO L290 TraceCheckUtils]: 8: Hoare triple {17513#true} assume !(0 == ~cond); {17513#true} is VALID [2022-04-08 14:04:26,752 INFO L290 TraceCheckUtils]: 7: Hoare triple {17513#true} ~cond := #in~cond; {17513#true} is VALID [2022-04-08 14:04:26,752 INFO L272 TraceCheckUtils]: 6: Hoare triple {17779#(<= ~counter~0 9)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {17513#true} is VALID [2022-04-08 14:04:26,753 INFO L290 TraceCheckUtils]: 5: Hoare triple {17779#(<= ~counter~0 9)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,753 INFO L272 TraceCheckUtils]: 4: Hoare triple {17779#(<= ~counter~0 9)} call #t~ret7 := main(); {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17779#(<= ~counter~0 9)} {17513#true} #77#return; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {17779#(<= ~counter~0 9)} assume true; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {17513#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {17779#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:26,754 INFO L272 TraceCheckUtils]: 0: Hoare triple {17513#true} call ULTIMATE.init(); {17513#true} is VALID [2022-04-08 14:04:26,754 INFO L134 CoverageAnalysis]: Checked inductivity of 445 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 180 trivial. 0 not checked. [2022-04-08 14:04:26,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:04:26,754 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2063352957] [2022-04-08 14:04:26,755 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:04:26,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1701776806] [2022-04-08 14:04:26,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1701776806] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:04:26,755 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:04:26,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-08 14:04:26,755 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:04:26,755 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [272927226] [2022-04-08 14:04:26,755 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [272927226] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:04:26,755 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:04:26,755 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 14:04:26,755 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809285264] [2022-04-08 14:04:26,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:04:26,756 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 108 [2022-04-08 14:04:26,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:04:26,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:04:26,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:04:26,840 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 14:04:26,840 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:04:26,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 14:04:26,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:04:26,841 INFO L87 Difference]: Start difference. First operand 142 states and 174 transitions. Second operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:04:27,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:04:27,402 INFO L93 Difference]: Finished difference Result 161 states and 197 transitions. [2022-04-08 14:04:27,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 14:04:27,402 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) Word has length 108 [2022-04-08 14:04:27,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:04:27,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:04:27,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-04-08 14:04:27,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:04:27,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 183 transitions. [2022-04-08 14:04:27,407 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 183 transitions. [2022-04-08 14:04:27,562 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:04:27,564 INFO L225 Difference]: With dead ends: 161 [2022-04-08 14:04:27,564 INFO L226 Difference]: Without dead ends: 153 [2022-04-08 14:04:27,565 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 225 GetRequests, 192 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=466, Invalid=656, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 14:04:27,565 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 97 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:04:27,565 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 222 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:04:27,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-04-08 14:04:27,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-04-08 14:04:27,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:04:27,795 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:04:27,795 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:04:27,795 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:04:27,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:04:27,809 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2022-04-08 14:04:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-08 14:04:27,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:04:27,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:04:27,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 153 states. [2022-04-08 14:04:27,810 INFO L87 Difference]: Start difference. First operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 153 states. [2022-04-08 14:04:27,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:04:27,811 INFO L93 Difference]: Finished difference Result 153 states and 188 transitions. [2022-04-08 14:04:27,811 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-08 14:04:27,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:04:27,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:04:27,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:04:27,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:04:27,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 120 states have (on average 1.3) internal successors, (156), 121 states have internal predecessors, (156), 17 states have call successors, (17), 16 states have call predecessors, (17), 15 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:04:27,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 188 transitions. [2022-04-08 14:04:27,813 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 188 transitions. Word has length 108 [2022-04-08 14:04:27,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:04:27,813 INFO L478 AbstractCegarLoop]: Abstraction has 153 states and 188 transitions. [2022-04-08 14:04:27,814 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 11 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-08 14:04:27,814 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 153 states and 188 transitions. [2022-04-08 14:04:49,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 178 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-04-08 14:04:49,391 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 188 transitions. [2022-04-08 14:04:49,392 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2022-04-08 14:04:49,392 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:04:49,392 INFO L499 BasicCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:04:49,410 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-08 14:04:49,592 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:04:49,592 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:04:49,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:04:49,593 INFO L85 PathProgramCache]: Analyzing trace with hash -617530302, now seen corresponding path program 21 times [2022-04-08 14:04:49,593 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:04:49,593 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [459354718] [2022-04-08 14:04:55,639 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:04:55,640 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:04:55,640 INFO L85 PathProgramCache]: Analyzing trace with hash -617530302, now seen corresponding path program 22 times [2022-04-08 14:04:55,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:04:55,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [62077798] [2022-04-08 14:04:55,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:04:55,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:04:55,655 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:04:55,655 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [718322106] [2022-04-08 14:04:55,656 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:04:55,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:04:55,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:04:55,656 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:04:55,657 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 14:04:55,745 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:04:55,746 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:04:55,748 INFO L263 TraceCheckSpWp]: Trace formula consists of 372 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 14:04:55,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:04:55,767 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:04:56,267 INFO L272 TraceCheckUtils]: 0: Hoare triple {19138#true} call ULTIMATE.init(); {19138#true} is VALID [2022-04-08 14:04:56,268 INFO L290 TraceCheckUtils]: 1: Hoare triple {19138#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,268 INFO L290 TraceCheckUtils]: 2: Hoare triple {19146#(<= ~counter~0 0)} assume true; {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,268 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19146#(<= ~counter~0 0)} {19138#true} #77#return; {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,269 INFO L272 TraceCheckUtils]: 4: Hoare triple {19146#(<= ~counter~0 0)} call #t~ret7 := main(); {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,269 INFO L290 TraceCheckUtils]: 5: Hoare triple {19146#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,269 INFO L272 TraceCheckUtils]: 6: Hoare triple {19146#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,269 INFO L290 TraceCheckUtils]: 7: Hoare triple {19146#(<= ~counter~0 0)} ~cond := #in~cond; {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,270 INFO L290 TraceCheckUtils]: 8: Hoare triple {19146#(<= ~counter~0 0)} assume !(0 == ~cond); {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,270 INFO L290 TraceCheckUtils]: 9: Hoare triple {19146#(<= ~counter~0 0)} assume true; {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,270 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19146#(<= ~counter~0 0)} {19146#(<= ~counter~0 0)} #69#return; {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,271 INFO L290 TraceCheckUtils]: 11: Hoare triple {19146#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {19146#(<= ~counter~0 0)} is VALID [2022-04-08 14:04:56,271 INFO L290 TraceCheckUtils]: 12: Hoare triple {19146#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19180#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:56,271 INFO L290 TraceCheckUtils]: 13: Hoare triple {19180#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {19180#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:56,272 INFO L272 TraceCheckUtils]: 14: Hoare triple {19180#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19180#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:56,272 INFO L290 TraceCheckUtils]: 15: Hoare triple {19180#(<= ~counter~0 1)} ~cond := #in~cond; {19180#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:56,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {19180#(<= ~counter~0 1)} assume !(0 == ~cond); {19180#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:56,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {19180#(<= ~counter~0 1)} assume true; {19180#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:56,273 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19180#(<= ~counter~0 1)} {19180#(<= ~counter~0 1)} #71#return; {19180#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:56,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {19180#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {19180#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:56,274 INFO L290 TraceCheckUtils]: 20: Hoare triple {19180#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19180#(<= ~counter~0 1)} is VALID [2022-04-08 14:04:56,274 INFO L290 TraceCheckUtils]: 21: Hoare triple {19180#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19208#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:56,274 INFO L290 TraceCheckUtils]: 22: Hoare triple {19208#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {19208#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:56,275 INFO L272 TraceCheckUtils]: 23: Hoare triple {19208#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19208#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:56,275 INFO L290 TraceCheckUtils]: 24: Hoare triple {19208#(<= ~counter~0 2)} ~cond := #in~cond; {19208#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:56,276 INFO L290 TraceCheckUtils]: 25: Hoare triple {19208#(<= ~counter~0 2)} assume !(0 == ~cond); {19208#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:56,276 INFO L290 TraceCheckUtils]: 26: Hoare triple {19208#(<= ~counter~0 2)} assume true; {19208#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:56,276 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19208#(<= ~counter~0 2)} {19208#(<= ~counter~0 2)} #71#return; {19208#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:56,277 INFO L290 TraceCheckUtils]: 28: Hoare triple {19208#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {19208#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:56,277 INFO L290 TraceCheckUtils]: 29: Hoare triple {19208#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19208#(<= ~counter~0 2)} is VALID [2022-04-08 14:04:56,277 INFO L290 TraceCheckUtils]: 30: Hoare triple {19208#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19236#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:56,278 INFO L290 TraceCheckUtils]: 31: Hoare triple {19236#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {19236#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:56,278 INFO L272 TraceCheckUtils]: 32: Hoare triple {19236#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19236#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:56,278 INFO L290 TraceCheckUtils]: 33: Hoare triple {19236#(<= ~counter~0 3)} ~cond := #in~cond; {19236#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:56,279 INFO L290 TraceCheckUtils]: 34: Hoare triple {19236#(<= ~counter~0 3)} assume !(0 == ~cond); {19236#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:56,279 INFO L290 TraceCheckUtils]: 35: Hoare triple {19236#(<= ~counter~0 3)} assume true; {19236#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:56,279 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19236#(<= ~counter~0 3)} {19236#(<= ~counter~0 3)} #71#return; {19236#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:56,280 INFO L290 TraceCheckUtils]: 37: Hoare triple {19236#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {19236#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:56,280 INFO L290 TraceCheckUtils]: 38: Hoare triple {19236#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19236#(<= ~counter~0 3)} is VALID [2022-04-08 14:04:56,280 INFO L290 TraceCheckUtils]: 39: Hoare triple {19236#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19264#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:56,281 INFO L290 TraceCheckUtils]: 40: Hoare triple {19264#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {19264#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:56,281 INFO L272 TraceCheckUtils]: 41: Hoare triple {19264#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19264#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:56,281 INFO L290 TraceCheckUtils]: 42: Hoare triple {19264#(<= ~counter~0 4)} ~cond := #in~cond; {19264#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:56,282 INFO L290 TraceCheckUtils]: 43: Hoare triple {19264#(<= ~counter~0 4)} assume !(0 == ~cond); {19264#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:56,282 INFO L290 TraceCheckUtils]: 44: Hoare triple {19264#(<= ~counter~0 4)} assume true; {19264#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:56,282 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19264#(<= ~counter~0 4)} {19264#(<= ~counter~0 4)} #71#return; {19264#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:56,283 INFO L290 TraceCheckUtils]: 46: Hoare triple {19264#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {19264#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:56,283 INFO L290 TraceCheckUtils]: 47: Hoare triple {19264#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19264#(<= ~counter~0 4)} is VALID [2022-04-08 14:04:56,283 INFO L290 TraceCheckUtils]: 48: Hoare triple {19264#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19292#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:56,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {19292#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {19292#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:56,284 INFO L272 TraceCheckUtils]: 50: Hoare triple {19292#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19292#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:56,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {19292#(<= ~counter~0 5)} ~cond := #in~cond; {19292#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:56,285 INFO L290 TraceCheckUtils]: 52: Hoare triple {19292#(<= ~counter~0 5)} assume !(0 == ~cond); {19292#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:56,285 INFO L290 TraceCheckUtils]: 53: Hoare triple {19292#(<= ~counter~0 5)} assume true; {19292#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:56,285 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19292#(<= ~counter~0 5)} {19292#(<= ~counter~0 5)} #71#return; {19292#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:56,286 INFO L290 TraceCheckUtils]: 55: Hoare triple {19292#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {19292#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:56,286 INFO L290 TraceCheckUtils]: 56: Hoare triple {19292#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19292#(<= ~counter~0 5)} is VALID [2022-04-08 14:04:56,286 INFO L290 TraceCheckUtils]: 57: Hoare triple {19292#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19320#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:56,287 INFO L290 TraceCheckUtils]: 58: Hoare triple {19320#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {19320#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:56,287 INFO L272 TraceCheckUtils]: 59: Hoare triple {19320#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19320#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:56,287 INFO L290 TraceCheckUtils]: 60: Hoare triple {19320#(<= ~counter~0 6)} ~cond := #in~cond; {19320#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:56,288 INFO L290 TraceCheckUtils]: 61: Hoare triple {19320#(<= ~counter~0 6)} assume !(0 == ~cond); {19320#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:56,288 INFO L290 TraceCheckUtils]: 62: Hoare triple {19320#(<= ~counter~0 6)} assume true; {19320#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:56,288 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19320#(<= ~counter~0 6)} {19320#(<= ~counter~0 6)} #71#return; {19320#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:56,289 INFO L290 TraceCheckUtils]: 64: Hoare triple {19320#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {19320#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:56,289 INFO L290 TraceCheckUtils]: 65: Hoare triple {19320#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19320#(<= ~counter~0 6)} is VALID [2022-04-08 14:04:56,289 INFO L290 TraceCheckUtils]: 66: Hoare triple {19320#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19348#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:56,290 INFO L290 TraceCheckUtils]: 67: Hoare triple {19348#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {19348#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:56,290 INFO L272 TraceCheckUtils]: 68: Hoare triple {19348#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19348#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:56,290 INFO L290 TraceCheckUtils]: 69: Hoare triple {19348#(<= ~counter~0 7)} ~cond := #in~cond; {19348#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:56,291 INFO L290 TraceCheckUtils]: 70: Hoare triple {19348#(<= ~counter~0 7)} assume !(0 == ~cond); {19348#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:56,291 INFO L290 TraceCheckUtils]: 71: Hoare triple {19348#(<= ~counter~0 7)} assume true; {19348#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:56,291 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {19348#(<= ~counter~0 7)} {19348#(<= ~counter~0 7)} #71#return; {19348#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:56,292 INFO L290 TraceCheckUtils]: 73: Hoare triple {19348#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {19348#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:56,292 INFO L290 TraceCheckUtils]: 74: Hoare triple {19348#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19348#(<= ~counter~0 7)} is VALID [2022-04-08 14:04:56,292 INFO L290 TraceCheckUtils]: 75: Hoare triple {19348#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,293 INFO L290 TraceCheckUtils]: 76: Hoare triple {19376#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,293 INFO L272 TraceCheckUtils]: 77: Hoare triple {19376#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {19376#(<= ~counter~0 8)} ~cond := #in~cond; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,294 INFO L290 TraceCheckUtils]: 79: Hoare triple {19376#(<= ~counter~0 8)} assume !(0 == ~cond); {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,294 INFO L290 TraceCheckUtils]: 80: Hoare triple {19376#(<= ~counter~0 8)} assume true; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,294 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19376#(<= ~counter~0 8)} {19376#(<= ~counter~0 8)} #71#return; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,295 INFO L290 TraceCheckUtils]: 82: Hoare triple {19376#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,295 INFO L290 TraceCheckUtils]: 83: Hoare triple {19376#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,295 INFO L290 TraceCheckUtils]: 84: Hoare triple {19376#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,296 INFO L290 TraceCheckUtils]: 85: Hoare triple {19404#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,296 INFO L272 TraceCheckUtils]: 86: Hoare triple {19404#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,296 INFO L290 TraceCheckUtils]: 87: Hoare triple {19404#(<= ~counter~0 9)} ~cond := #in~cond; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,297 INFO L290 TraceCheckUtils]: 88: Hoare triple {19404#(<= ~counter~0 9)} assume !(0 == ~cond); {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,297 INFO L290 TraceCheckUtils]: 89: Hoare triple {19404#(<= ~counter~0 9)} assume true; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,298 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {19404#(<= ~counter~0 9)} {19404#(<= ~counter~0 9)} #71#return; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,298 INFO L290 TraceCheckUtils]: 91: Hoare triple {19404#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,298 INFO L290 TraceCheckUtils]: 92: Hoare triple {19404#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,298 INFO L290 TraceCheckUtils]: 93: Hoare triple {19404#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,299 INFO L290 TraceCheckUtils]: 94: Hoare triple {19432#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,299 INFO L272 TraceCheckUtils]: 95: Hoare triple {19432#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,299 INFO L290 TraceCheckUtils]: 96: Hoare triple {19432#(<= ~counter~0 10)} ~cond := #in~cond; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,300 INFO L290 TraceCheckUtils]: 97: Hoare triple {19432#(<= ~counter~0 10)} assume !(0 == ~cond); {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,300 INFO L290 TraceCheckUtils]: 98: Hoare triple {19432#(<= ~counter~0 10)} assume true; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,301 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {19432#(<= ~counter~0 10)} {19432#(<= ~counter~0 10)} #71#return; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,301 INFO L290 TraceCheckUtils]: 100: Hoare triple {19432#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,301 INFO L290 TraceCheckUtils]: 101: Hoare triple {19432#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,308 INFO L290 TraceCheckUtils]: 102: Hoare triple {19432#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,308 INFO L290 TraceCheckUtils]: 103: Hoare triple {19460#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,309 INFO L272 TraceCheckUtils]: 104: Hoare triple {19460#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,309 INFO L290 TraceCheckUtils]: 105: Hoare triple {19460#(<= ~counter~0 11)} ~cond := #in~cond; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,309 INFO L290 TraceCheckUtils]: 106: Hoare triple {19460#(<= ~counter~0 11)} assume !(0 == ~cond); {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,309 INFO L290 TraceCheckUtils]: 107: Hoare triple {19460#(<= ~counter~0 11)} assume true; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,310 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19460#(<= ~counter~0 11)} {19460#(<= ~counter~0 11)} #71#return; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,310 INFO L290 TraceCheckUtils]: 109: Hoare triple {19460#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,310 INFO L290 TraceCheckUtils]: 110: Hoare triple {19460#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,311 INFO L290 TraceCheckUtils]: 111: Hoare triple {19460#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19488#(<= |main_#t~post6| 11)} is VALID [2022-04-08 14:04:56,311 INFO L290 TraceCheckUtils]: 112: Hoare triple {19488#(<= |main_#t~post6| 11)} assume !(#t~post6 < 20);havoc #t~post6; {19139#false} is VALID [2022-04-08 14:04:56,311 INFO L272 TraceCheckUtils]: 113: Hoare triple {19139#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {19139#false} is VALID [2022-04-08 14:04:56,311 INFO L290 TraceCheckUtils]: 114: Hoare triple {19139#false} ~cond := #in~cond; {19139#false} is VALID [2022-04-08 14:04:56,311 INFO L290 TraceCheckUtils]: 115: Hoare triple {19139#false} assume 0 == ~cond; {19139#false} is VALID [2022-04-08 14:04:56,311 INFO L290 TraceCheckUtils]: 116: Hoare triple {19139#false} assume !false; {19139#false} is VALID [2022-04-08 14:04:56,312 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 22 proven. 517 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:04:56,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:04:56,897 INFO L290 TraceCheckUtils]: 116: Hoare triple {19139#false} assume !false; {19139#false} is VALID [2022-04-08 14:04:56,897 INFO L290 TraceCheckUtils]: 115: Hoare triple {19139#false} assume 0 == ~cond; {19139#false} is VALID [2022-04-08 14:04:56,898 INFO L290 TraceCheckUtils]: 114: Hoare triple {19139#false} ~cond := #in~cond; {19139#false} is VALID [2022-04-08 14:04:56,898 INFO L272 TraceCheckUtils]: 113: Hoare triple {19139#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {19139#false} is VALID [2022-04-08 14:04:56,898 INFO L290 TraceCheckUtils]: 112: Hoare triple {19516#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {19139#false} is VALID [2022-04-08 14:04:56,898 INFO L290 TraceCheckUtils]: 111: Hoare triple {19520#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19516#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:04:56,899 INFO L290 TraceCheckUtils]: 110: Hoare triple {19520#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19520#(< ~counter~0 20)} is VALID [2022-04-08 14:04:56,899 INFO L290 TraceCheckUtils]: 109: Hoare triple {19520#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {19520#(< ~counter~0 20)} is VALID [2022-04-08 14:04:56,899 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {19138#true} {19520#(< ~counter~0 20)} #71#return; {19520#(< ~counter~0 20)} is VALID [2022-04-08 14:04:56,899 INFO L290 TraceCheckUtils]: 107: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,900 INFO L290 TraceCheckUtils]: 106: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,900 INFO L290 TraceCheckUtils]: 105: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,900 INFO L272 TraceCheckUtils]: 104: Hoare triple {19520#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,900 INFO L290 TraceCheckUtils]: 103: Hoare triple {19520#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {19520#(< ~counter~0 20)} is VALID [2022-04-08 14:04:56,901 INFO L290 TraceCheckUtils]: 102: Hoare triple {19548#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19520#(< ~counter~0 20)} is VALID [2022-04-08 14:04:56,901 INFO L290 TraceCheckUtils]: 101: Hoare triple {19548#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19548#(< ~counter~0 19)} is VALID [2022-04-08 14:04:56,901 INFO L290 TraceCheckUtils]: 100: Hoare triple {19548#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {19548#(< ~counter~0 19)} is VALID [2022-04-08 14:04:56,902 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {19138#true} {19548#(< ~counter~0 19)} #71#return; {19548#(< ~counter~0 19)} is VALID [2022-04-08 14:04:56,902 INFO L290 TraceCheckUtils]: 98: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,902 INFO L290 TraceCheckUtils]: 97: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,902 INFO L290 TraceCheckUtils]: 96: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,902 INFO L272 TraceCheckUtils]: 95: Hoare triple {19548#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,902 INFO L290 TraceCheckUtils]: 94: Hoare triple {19548#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {19548#(< ~counter~0 19)} is VALID [2022-04-08 14:04:56,903 INFO L290 TraceCheckUtils]: 93: Hoare triple {19576#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19548#(< ~counter~0 19)} is VALID [2022-04-08 14:04:56,903 INFO L290 TraceCheckUtils]: 92: Hoare triple {19576#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19576#(< ~counter~0 18)} is VALID [2022-04-08 14:04:56,903 INFO L290 TraceCheckUtils]: 91: Hoare triple {19576#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {19576#(< ~counter~0 18)} is VALID [2022-04-08 14:04:56,904 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {19138#true} {19576#(< ~counter~0 18)} #71#return; {19576#(< ~counter~0 18)} is VALID [2022-04-08 14:04:56,904 INFO L290 TraceCheckUtils]: 89: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,904 INFO L290 TraceCheckUtils]: 88: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,904 INFO L290 TraceCheckUtils]: 87: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,904 INFO L272 TraceCheckUtils]: 86: Hoare triple {19576#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,904 INFO L290 TraceCheckUtils]: 85: Hoare triple {19576#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {19576#(< ~counter~0 18)} is VALID [2022-04-08 14:04:56,905 INFO L290 TraceCheckUtils]: 84: Hoare triple {19604#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19576#(< ~counter~0 18)} is VALID [2022-04-08 14:04:56,905 INFO L290 TraceCheckUtils]: 83: Hoare triple {19604#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19604#(< ~counter~0 17)} is VALID [2022-04-08 14:04:56,905 INFO L290 TraceCheckUtils]: 82: Hoare triple {19604#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {19604#(< ~counter~0 17)} is VALID [2022-04-08 14:04:56,906 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {19138#true} {19604#(< ~counter~0 17)} #71#return; {19604#(< ~counter~0 17)} is VALID [2022-04-08 14:04:56,906 INFO L290 TraceCheckUtils]: 80: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,906 INFO L290 TraceCheckUtils]: 79: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,906 INFO L290 TraceCheckUtils]: 78: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,906 INFO L272 TraceCheckUtils]: 77: Hoare triple {19604#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,906 INFO L290 TraceCheckUtils]: 76: Hoare triple {19604#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {19604#(< ~counter~0 17)} is VALID [2022-04-08 14:04:56,907 INFO L290 TraceCheckUtils]: 75: Hoare triple {19632#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19604#(< ~counter~0 17)} is VALID [2022-04-08 14:04:56,907 INFO L290 TraceCheckUtils]: 74: Hoare triple {19632#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19632#(< ~counter~0 16)} is VALID [2022-04-08 14:04:56,907 INFO L290 TraceCheckUtils]: 73: Hoare triple {19632#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {19632#(< ~counter~0 16)} is VALID [2022-04-08 14:04:56,908 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {19138#true} {19632#(< ~counter~0 16)} #71#return; {19632#(< ~counter~0 16)} is VALID [2022-04-08 14:04:56,908 INFO L290 TraceCheckUtils]: 71: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,908 INFO L290 TraceCheckUtils]: 70: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,908 INFO L290 TraceCheckUtils]: 69: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,908 INFO L272 TraceCheckUtils]: 68: Hoare triple {19632#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,908 INFO L290 TraceCheckUtils]: 67: Hoare triple {19632#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {19632#(< ~counter~0 16)} is VALID [2022-04-08 14:04:56,909 INFO L290 TraceCheckUtils]: 66: Hoare triple {19660#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19632#(< ~counter~0 16)} is VALID [2022-04-08 14:04:56,909 INFO L290 TraceCheckUtils]: 65: Hoare triple {19660#(< ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19660#(< ~counter~0 15)} is VALID [2022-04-08 14:04:56,909 INFO L290 TraceCheckUtils]: 64: Hoare triple {19660#(< ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {19660#(< ~counter~0 15)} is VALID [2022-04-08 14:04:56,910 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19138#true} {19660#(< ~counter~0 15)} #71#return; {19660#(< ~counter~0 15)} is VALID [2022-04-08 14:04:56,910 INFO L290 TraceCheckUtils]: 62: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,910 INFO L290 TraceCheckUtils]: 61: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,910 INFO L290 TraceCheckUtils]: 60: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,910 INFO L272 TraceCheckUtils]: 59: Hoare triple {19660#(< ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,910 INFO L290 TraceCheckUtils]: 58: Hoare triple {19660#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {19660#(< ~counter~0 15)} is VALID [2022-04-08 14:04:56,911 INFO L290 TraceCheckUtils]: 57: Hoare triple {19688#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19660#(< ~counter~0 15)} is VALID [2022-04-08 14:04:56,911 INFO L290 TraceCheckUtils]: 56: Hoare triple {19688#(< ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19688#(< ~counter~0 14)} is VALID [2022-04-08 14:04:56,911 INFO L290 TraceCheckUtils]: 55: Hoare triple {19688#(< ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {19688#(< ~counter~0 14)} is VALID [2022-04-08 14:04:56,912 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {19138#true} {19688#(< ~counter~0 14)} #71#return; {19688#(< ~counter~0 14)} is VALID [2022-04-08 14:04:56,912 INFO L290 TraceCheckUtils]: 53: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,912 INFO L290 TraceCheckUtils]: 52: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,912 INFO L290 TraceCheckUtils]: 51: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,912 INFO L272 TraceCheckUtils]: 50: Hoare triple {19688#(< ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,913 INFO L290 TraceCheckUtils]: 49: Hoare triple {19688#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {19688#(< ~counter~0 14)} is VALID [2022-04-08 14:04:56,913 INFO L290 TraceCheckUtils]: 48: Hoare triple {19716#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19688#(< ~counter~0 14)} is VALID [2022-04-08 14:04:56,913 INFO L290 TraceCheckUtils]: 47: Hoare triple {19716#(< ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19716#(< ~counter~0 13)} is VALID [2022-04-08 14:04:56,914 INFO L290 TraceCheckUtils]: 46: Hoare triple {19716#(< ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {19716#(< ~counter~0 13)} is VALID [2022-04-08 14:04:56,914 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {19138#true} {19716#(< ~counter~0 13)} #71#return; {19716#(< ~counter~0 13)} is VALID [2022-04-08 14:04:56,914 INFO L290 TraceCheckUtils]: 44: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,914 INFO L290 TraceCheckUtils]: 43: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,914 INFO L290 TraceCheckUtils]: 42: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,914 INFO L272 TraceCheckUtils]: 41: Hoare triple {19716#(< ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,915 INFO L290 TraceCheckUtils]: 40: Hoare triple {19716#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {19716#(< ~counter~0 13)} is VALID [2022-04-08 14:04:56,915 INFO L290 TraceCheckUtils]: 39: Hoare triple {19460#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19716#(< ~counter~0 13)} is VALID [2022-04-08 14:04:56,915 INFO L290 TraceCheckUtils]: 38: Hoare triple {19460#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,916 INFO L290 TraceCheckUtils]: 37: Hoare triple {19460#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,916 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {19138#true} {19460#(<= ~counter~0 11)} #71#return; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,916 INFO L290 TraceCheckUtils]: 35: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,916 INFO L290 TraceCheckUtils]: 34: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,916 INFO L290 TraceCheckUtils]: 33: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,916 INFO L272 TraceCheckUtils]: 32: Hoare triple {19460#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,917 INFO L290 TraceCheckUtils]: 31: Hoare triple {19460#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,917 INFO L290 TraceCheckUtils]: 30: Hoare triple {19432#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19460#(<= ~counter~0 11)} is VALID [2022-04-08 14:04:56,917 INFO L290 TraceCheckUtils]: 29: Hoare triple {19432#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,918 INFO L290 TraceCheckUtils]: 28: Hoare triple {19432#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,918 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {19138#true} {19432#(<= ~counter~0 10)} #71#return; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,918 INFO L290 TraceCheckUtils]: 26: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,919 INFO L272 TraceCheckUtils]: 23: Hoare triple {19432#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {19432#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {19404#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19432#(<= ~counter~0 10)} is VALID [2022-04-08 14:04:56,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {19404#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,920 INFO L290 TraceCheckUtils]: 19: Hoare triple {19404#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,920 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {19138#true} {19404#(<= ~counter~0 9)} #71#return; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,921 INFO L290 TraceCheckUtils]: 16: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,921 INFO L290 TraceCheckUtils]: 15: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,921 INFO L272 TraceCheckUtils]: 14: Hoare triple {19404#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {19404#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {19376#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19404#(<= ~counter~0 9)} is VALID [2022-04-08 14:04:56,922 INFO L290 TraceCheckUtils]: 11: Hoare triple {19376#(<= ~counter~0 8)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,922 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19138#true} {19376#(<= ~counter~0 8)} #69#return; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,922 INFO L290 TraceCheckUtils]: 9: Hoare triple {19138#true} assume true; {19138#true} is VALID [2022-04-08 14:04:56,922 INFO L290 TraceCheckUtils]: 8: Hoare triple {19138#true} assume !(0 == ~cond); {19138#true} is VALID [2022-04-08 14:04:56,922 INFO L290 TraceCheckUtils]: 7: Hoare triple {19138#true} ~cond := #in~cond; {19138#true} is VALID [2022-04-08 14:04:56,922 INFO L272 TraceCheckUtils]: 6: Hoare triple {19376#(<= ~counter~0 8)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {19138#true} is VALID [2022-04-08 14:04:56,923 INFO L290 TraceCheckUtils]: 5: Hoare triple {19376#(<= ~counter~0 8)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,923 INFO L272 TraceCheckUtils]: 4: Hoare triple {19376#(<= ~counter~0 8)} call #t~ret7 := main(); {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,923 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19376#(<= ~counter~0 8)} {19138#true} #77#return; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {19376#(<= ~counter~0 8)} assume true; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,924 INFO L290 TraceCheckUtils]: 1: Hoare triple {19138#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {19376#(<= ~counter~0 8)} is VALID [2022-04-08 14:04:56,924 INFO L272 TraceCheckUtils]: 0: Hoare triple {19138#true} call ULTIMATE.init(); {19138#true} is VALID [2022-04-08 14:04:56,924 INFO L134 CoverageAnalysis]: Checked inductivity of 539 backedges. 22 proven. 297 refuted. 0 times theorem prover too weak. 220 trivial. 0 not checked. [2022-04-08 14:04:56,924 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:04:56,924 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [62077798] [2022-04-08 14:04:56,925 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:04:56,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [718322106] [2022-04-08 14:04:56,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [718322106] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:04:56,925 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:04:56,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 14:04:56,925 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:04:56,925 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [459354718] [2022-04-08 14:04:56,925 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [459354718] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:04:56,925 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:04:56,925 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 14:04:56,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658788662] [2022-04-08 14:04:56,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:04:56,926 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 117 [2022-04-08 14:04:56,926 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:04:56,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:04:57,003 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 14:04:57,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 14:04:57,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:04:57,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 14:04:57,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:04:57,004 INFO L87 Difference]: Start difference. First operand 153 states and 188 transitions. Second operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:04:57,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:04:57,707 INFO L93 Difference]: Finished difference Result 172 states and 211 transitions. [2022-04-08 14:04:57,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 14:04:57,708 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Word has length 117 [2022-04-08 14:04:57,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:04:57,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:04:57,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 197 transitions. [2022-04-08 14:04:57,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:04:57,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 197 transitions. [2022-04-08 14:04:57,712 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 197 transitions. [2022-04-08 14:04:57,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:04:57,871 INFO L225 Difference]: With dead ends: 172 [2022-04-08 14:04:57,871 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 14:04:57,871 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 244 GetRequests, 210 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 93 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=489, Invalid=701, Unknown=0, NotChecked=0, Total=1190 [2022-04-08 14:04:57,871 INFO L913 BasicCegarLoop]: 41 mSDtfsCounter, 194 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:04:57,872 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 218 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:04:57,872 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 14:04:58,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-08 14:04:58,127 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:04:58,127 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:04:58,127 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:04:58,127 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:04:58,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:04:58,129 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2022-04-08 14:04:58,129 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2022-04-08 14:04:58,129 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:04:58,130 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:04:58,130 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 164 states. [2022-04-08 14:04:58,130 INFO L87 Difference]: Start difference. First operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 164 states. [2022-04-08 14:04:58,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:04:58,131 INFO L93 Difference]: Finished difference Result 164 states and 202 transitions. [2022-04-08 14:04:58,132 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2022-04-08 14:04:58,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:04:58,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:04:58,132 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:04:58,132 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:04:58,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 129 states have (on average 1.302325581395349) internal successors, (168), 130 states have internal predecessors, (168), 18 states have call successors, (18), 17 states have call predecessors, (18), 16 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:04:58,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 202 transitions. [2022-04-08 14:04:58,134 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 202 transitions. Word has length 117 [2022-04-08 14:04:58,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:04:58,134 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 202 transitions. [2022-04-08 14:04:58,134 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-08 14:04:58,134 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 202 transitions. [2022-04-08 14:05:22,050 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 191 inductive. 0 not inductive. 11 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:22,051 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 202 transitions. [2022-04-08 14:05:22,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 127 [2022-04-08 14:05:22,051 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:05:22,051 INFO L499 BasicCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:05:22,068 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2022-04-08 14:05:22,267 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-08 14:05:22,267 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:05:22,268 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:05:22,268 INFO L85 PathProgramCache]: Analyzing trace with hash -206022918, now seen corresponding path program 23 times [2022-04-08 14:05:22,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:22,268 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1310944162] [2022-04-08 14:05:28,313 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:05:28,314 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:05:28,314 INFO L85 PathProgramCache]: Analyzing trace with hash -206022918, now seen corresponding path program 24 times [2022-04-08 14:05:28,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:05:28,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936132362] [2022-04-08 14:05:28,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:05:28,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:05:28,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:05:28,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1363071834] [2022-04-08 14:05:28,333 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:05:28,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:05:28,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:05:28,334 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:05:28,341 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-08 14:05:28,513 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 14:05:28,513 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:05:28,516 INFO L263 TraceCheckSpWp]: Trace formula consists of 398 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 14:05:28,538 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:05:28,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:05:29,080 INFO L272 TraceCheckUtils]: 0: Hoare triple {20885#true} call ULTIMATE.init(); {20885#true} is VALID [2022-04-08 14:05:29,080 INFO L290 TraceCheckUtils]: 1: Hoare triple {20885#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,081 INFO L290 TraceCheckUtils]: 2: Hoare triple {20893#(<= ~counter~0 0)} assume true; {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,081 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20893#(<= ~counter~0 0)} {20885#true} #77#return; {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,081 INFO L272 TraceCheckUtils]: 4: Hoare triple {20893#(<= ~counter~0 0)} call #t~ret7 := main(); {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,082 INFO L290 TraceCheckUtils]: 5: Hoare triple {20893#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,082 INFO L272 TraceCheckUtils]: 6: Hoare triple {20893#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,082 INFO L290 TraceCheckUtils]: 7: Hoare triple {20893#(<= ~counter~0 0)} ~cond := #in~cond; {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,082 INFO L290 TraceCheckUtils]: 8: Hoare triple {20893#(<= ~counter~0 0)} assume !(0 == ~cond); {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {20893#(<= ~counter~0 0)} assume true; {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20893#(<= ~counter~0 0)} {20893#(<= ~counter~0 0)} #69#return; {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,083 INFO L290 TraceCheckUtils]: 11: Hoare triple {20893#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {20893#(<= ~counter~0 0)} is VALID [2022-04-08 14:05:29,084 INFO L290 TraceCheckUtils]: 12: Hoare triple {20893#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20927#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:29,084 INFO L290 TraceCheckUtils]: 13: Hoare triple {20927#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {20927#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:29,085 INFO L272 TraceCheckUtils]: 14: Hoare triple {20927#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20927#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:29,085 INFO L290 TraceCheckUtils]: 15: Hoare triple {20927#(<= ~counter~0 1)} ~cond := #in~cond; {20927#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:29,085 INFO L290 TraceCheckUtils]: 16: Hoare triple {20927#(<= ~counter~0 1)} assume !(0 == ~cond); {20927#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:29,086 INFO L290 TraceCheckUtils]: 17: Hoare triple {20927#(<= ~counter~0 1)} assume true; {20927#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:29,086 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20927#(<= ~counter~0 1)} {20927#(<= ~counter~0 1)} #71#return; {20927#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:29,087 INFO L290 TraceCheckUtils]: 19: Hoare triple {20927#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {20927#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:29,087 INFO L290 TraceCheckUtils]: 20: Hoare triple {20927#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {20927#(<= ~counter~0 1)} is VALID [2022-04-08 14:05:29,088 INFO L290 TraceCheckUtils]: 21: Hoare triple {20927#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20955#(<= ~counter~0 2)} is VALID [2022-04-08 14:05:29,088 INFO L290 TraceCheckUtils]: 22: Hoare triple {20955#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {20955#(<= ~counter~0 2)} is VALID [2022-04-08 14:05:29,088 INFO L272 TraceCheckUtils]: 23: Hoare triple {20955#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20955#(<= ~counter~0 2)} is VALID [2022-04-08 14:05:29,089 INFO L290 TraceCheckUtils]: 24: Hoare triple {20955#(<= ~counter~0 2)} ~cond := #in~cond; {20955#(<= ~counter~0 2)} is VALID [2022-04-08 14:05:29,089 INFO L290 TraceCheckUtils]: 25: Hoare triple {20955#(<= ~counter~0 2)} assume !(0 == ~cond); {20955#(<= ~counter~0 2)} is VALID [2022-04-08 14:05:29,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {20955#(<= ~counter~0 2)} assume true; {20955#(<= ~counter~0 2)} is VALID [2022-04-08 14:05:29,090 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20955#(<= ~counter~0 2)} {20955#(<= ~counter~0 2)} #71#return; {20955#(<= ~counter~0 2)} is VALID [2022-04-08 14:05:29,090 INFO L290 TraceCheckUtils]: 28: Hoare triple {20955#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {20955#(<= ~counter~0 2)} is VALID [2022-04-08 14:05:29,090 INFO L290 TraceCheckUtils]: 29: Hoare triple {20955#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {20955#(<= ~counter~0 2)} is VALID [2022-04-08 14:05:29,091 INFO L290 TraceCheckUtils]: 30: Hoare triple {20955#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20983#(<= ~counter~0 3)} is VALID [2022-04-08 14:05:29,091 INFO L290 TraceCheckUtils]: 31: Hoare triple {20983#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {20983#(<= ~counter~0 3)} is VALID [2022-04-08 14:05:29,091 INFO L272 TraceCheckUtils]: 32: Hoare triple {20983#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20983#(<= ~counter~0 3)} is VALID [2022-04-08 14:05:29,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {20983#(<= ~counter~0 3)} ~cond := #in~cond; {20983#(<= ~counter~0 3)} is VALID [2022-04-08 14:05:29,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {20983#(<= ~counter~0 3)} assume !(0 == ~cond); {20983#(<= ~counter~0 3)} is VALID [2022-04-08 14:05:29,092 INFO L290 TraceCheckUtils]: 35: Hoare triple {20983#(<= ~counter~0 3)} assume true; {20983#(<= ~counter~0 3)} is VALID [2022-04-08 14:05:29,093 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20983#(<= ~counter~0 3)} {20983#(<= ~counter~0 3)} #71#return; {20983#(<= ~counter~0 3)} is VALID [2022-04-08 14:05:29,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {20983#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {20983#(<= ~counter~0 3)} is VALID [2022-04-08 14:05:29,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {20983#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {20983#(<= ~counter~0 3)} is VALID [2022-04-08 14:05:29,094 INFO L290 TraceCheckUtils]: 39: Hoare triple {20983#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21011#(<= ~counter~0 4)} is VALID [2022-04-08 14:05:29,094 INFO L290 TraceCheckUtils]: 40: Hoare triple {21011#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {21011#(<= ~counter~0 4)} is VALID [2022-04-08 14:05:29,094 INFO L272 TraceCheckUtils]: 41: Hoare triple {21011#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21011#(<= ~counter~0 4)} is VALID [2022-04-08 14:05:29,095 INFO L290 TraceCheckUtils]: 42: Hoare triple {21011#(<= ~counter~0 4)} ~cond := #in~cond; {21011#(<= ~counter~0 4)} is VALID [2022-04-08 14:05:29,095 INFO L290 TraceCheckUtils]: 43: Hoare triple {21011#(<= ~counter~0 4)} assume !(0 == ~cond); {21011#(<= ~counter~0 4)} is VALID [2022-04-08 14:05:29,095 INFO L290 TraceCheckUtils]: 44: Hoare triple {21011#(<= ~counter~0 4)} assume true; {21011#(<= ~counter~0 4)} is VALID [2022-04-08 14:05:29,096 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {21011#(<= ~counter~0 4)} {21011#(<= ~counter~0 4)} #71#return; {21011#(<= ~counter~0 4)} is VALID [2022-04-08 14:05:29,096 INFO L290 TraceCheckUtils]: 46: Hoare triple {21011#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {21011#(<= ~counter~0 4)} is VALID [2022-04-08 14:05:29,096 INFO L290 TraceCheckUtils]: 47: Hoare triple {21011#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21011#(<= ~counter~0 4)} is VALID [2022-04-08 14:05:29,097 INFO L290 TraceCheckUtils]: 48: Hoare triple {21011#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21039#(<= ~counter~0 5)} is VALID [2022-04-08 14:05:29,097 INFO L290 TraceCheckUtils]: 49: Hoare triple {21039#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {21039#(<= ~counter~0 5)} is VALID [2022-04-08 14:05:29,097 INFO L272 TraceCheckUtils]: 50: Hoare triple {21039#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21039#(<= ~counter~0 5)} is VALID [2022-04-08 14:05:29,098 INFO L290 TraceCheckUtils]: 51: Hoare triple {21039#(<= ~counter~0 5)} ~cond := #in~cond; {21039#(<= ~counter~0 5)} is VALID [2022-04-08 14:05:29,098 INFO L290 TraceCheckUtils]: 52: Hoare triple {21039#(<= ~counter~0 5)} assume !(0 == ~cond); {21039#(<= ~counter~0 5)} is VALID [2022-04-08 14:05:29,098 INFO L290 TraceCheckUtils]: 53: Hoare triple {21039#(<= ~counter~0 5)} assume true; {21039#(<= ~counter~0 5)} is VALID [2022-04-08 14:05:29,099 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {21039#(<= ~counter~0 5)} {21039#(<= ~counter~0 5)} #71#return; {21039#(<= ~counter~0 5)} is VALID [2022-04-08 14:05:29,099 INFO L290 TraceCheckUtils]: 55: Hoare triple {21039#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {21039#(<= ~counter~0 5)} is VALID [2022-04-08 14:05:29,099 INFO L290 TraceCheckUtils]: 56: Hoare triple {21039#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21039#(<= ~counter~0 5)} is VALID [2022-04-08 14:05:29,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {21039#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21067#(<= ~counter~0 6)} is VALID [2022-04-08 14:05:29,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {21067#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {21067#(<= ~counter~0 6)} is VALID [2022-04-08 14:05:29,100 INFO L272 TraceCheckUtils]: 59: Hoare triple {21067#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21067#(<= ~counter~0 6)} is VALID [2022-04-08 14:05:29,101 INFO L290 TraceCheckUtils]: 60: Hoare triple {21067#(<= ~counter~0 6)} ~cond := #in~cond; {21067#(<= ~counter~0 6)} is VALID [2022-04-08 14:05:29,101 INFO L290 TraceCheckUtils]: 61: Hoare triple {21067#(<= ~counter~0 6)} assume !(0 == ~cond); {21067#(<= ~counter~0 6)} is VALID [2022-04-08 14:05:29,101 INFO L290 TraceCheckUtils]: 62: Hoare triple {21067#(<= ~counter~0 6)} assume true; {21067#(<= ~counter~0 6)} is VALID [2022-04-08 14:05:29,102 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21067#(<= ~counter~0 6)} {21067#(<= ~counter~0 6)} #71#return; {21067#(<= ~counter~0 6)} is VALID [2022-04-08 14:05:29,102 INFO L290 TraceCheckUtils]: 64: Hoare triple {21067#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {21067#(<= ~counter~0 6)} is VALID [2022-04-08 14:05:29,102 INFO L290 TraceCheckUtils]: 65: Hoare triple {21067#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21067#(<= ~counter~0 6)} is VALID [2022-04-08 14:05:29,103 INFO L290 TraceCheckUtils]: 66: Hoare triple {21067#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,103 INFO L290 TraceCheckUtils]: 67: Hoare triple {21095#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,103 INFO L272 TraceCheckUtils]: 68: Hoare triple {21095#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,104 INFO L290 TraceCheckUtils]: 69: Hoare triple {21095#(<= ~counter~0 7)} ~cond := #in~cond; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,104 INFO L290 TraceCheckUtils]: 70: Hoare triple {21095#(<= ~counter~0 7)} assume !(0 == ~cond); {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,104 INFO L290 TraceCheckUtils]: 71: Hoare triple {21095#(<= ~counter~0 7)} assume true; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,105 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {21095#(<= ~counter~0 7)} {21095#(<= ~counter~0 7)} #71#return; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,105 INFO L290 TraceCheckUtils]: 73: Hoare triple {21095#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,105 INFO L290 TraceCheckUtils]: 74: Hoare triple {21095#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,105 INFO L290 TraceCheckUtils]: 75: Hoare triple {21095#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,106 INFO L290 TraceCheckUtils]: 76: Hoare triple {21123#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,106 INFO L272 TraceCheckUtils]: 77: Hoare triple {21123#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,107 INFO L290 TraceCheckUtils]: 78: Hoare triple {21123#(<= ~counter~0 8)} ~cond := #in~cond; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,107 INFO L290 TraceCheckUtils]: 79: Hoare triple {21123#(<= ~counter~0 8)} assume !(0 == ~cond); {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,107 INFO L290 TraceCheckUtils]: 80: Hoare triple {21123#(<= ~counter~0 8)} assume true; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,108 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {21123#(<= ~counter~0 8)} {21123#(<= ~counter~0 8)} #71#return; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,108 INFO L290 TraceCheckUtils]: 82: Hoare triple {21123#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,108 INFO L290 TraceCheckUtils]: 83: Hoare triple {21123#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,108 INFO L290 TraceCheckUtils]: 84: Hoare triple {21123#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,109 INFO L290 TraceCheckUtils]: 85: Hoare triple {21151#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,109 INFO L272 TraceCheckUtils]: 86: Hoare triple {21151#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,110 INFO L290 TraceCheckUtils]: 87: Hoare triple {21151#(<= ~counter~0 9)} ~cond := #in~cond; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,110 INFO L290 TraceCheckUtils]: 88: Hoare triple {21151#(<= ~counter~0 9)} assume !(0 == ~cond); {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,110 INFO L290 TraceCheckUtils]: 89: Hoare triple {21151#(<= ~counter~0 9)} assume true; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,111 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {21151#(<= ~counter~0 9)} {21151#(<= ~counter~0 9)} #71#return; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,111 INFO L290 TraceCheckUtils]: 91: Hoare triple {21151#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,111 INFO L290 TraceCheckUtils]: 92: Hoare triple {21151#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,111 INFO L290 TraceCheckUtils]: 93: Hoare triple {21151#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,112 INFO L290 TraceCheckUtils]: 94: Hoare triple {21179#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,112 INFO L272 TraceCheckUtils]: 95: Hoare triple {21179#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,112 INFO L290 TraceCheckUtils]: 96: Hoare triple {21179#(<= ~counter~0 10)} ~cond := #in~cond; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,113 INFO L290 TraceCheckUtils]: 97: Hoare triple {21179#(<= ~counter~0 10)} assume !(0 == ~cond); {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,113 INFO L290 TraceCheckUtils]: 98: Hoare triple {21179#(<= ~counter~0 10)} assume true; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,114 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {21179#(<= ~counter~0 10)} {21179#(<= ~counter~0 10)} #71#return; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,114 INFO L290 TraceCheckUtils]: 100: Hoare triple {21179#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,114 INFO L290 TraceCheckUtils]: 101: Hoare triple {21179#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,114 INFO L290 TraceCheckUtils]: 102: Hoare triple {21179#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,115 INFO L290 TraceCheckUtils]: 103: Hoare triple {21207#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,115 INFO L272 TraceCheckUtils]: 104: Hoare triple {21207#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,115 INFO L290 TraceCheckUtils]: 105: Hoare triple {21207#(<= ~counter~0 11)} ~cond := #in~cond; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,116 INFO L290 TraceCheckUtils]: 106: Hoare triple {21207#(<= ~counter~0 11)} assume !(0 == ~cond); {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,116 INFO L290 TraceCheckUtils]: 107: Hoare triple {21207#(<= ~counter~0 11)} assume true; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,116 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {21207#(<= ~counter~0 11)} {21207#(<= ~counter~0 11)} #71#return; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,117 INFO L290 TraceCheckUtils]: 109: Hoare triple {21207#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,117 INFO L290 TraceCheckUtils]: 110: Hoare triple {21207#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,117 INFO L290 TraceCheckUtils]: 111: Hoare triple {21207#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,118 INFO L290 TraceCheckUtils]: 112: Hoare triple {21235#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,118 INFO L272 TraceCheckUtils]: 113: Hoare triple {21235#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,118 INFO L290 TraceCheckUtils]: 114: Hoare triple {21235#(<= ~counter~0 12)} ~cond := #in~cond; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,119 INFO L290 TraceCheckUtils]: 115: Hoare triple {21235#(<= ~counter~0 12)} assume !(0 == ~cond); {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,119 INFO L290 TraceCheckUtils]: 116: Hoare triple {21235#(<= ~counter~0 12)} assume true; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,119 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {21235#(<= ~counter~0 12)} {21235#(<= ~counter~0 12)} #71#return; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,120 INFO L290 TraceCheckUtils]: 118: Hoare triple {21235#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,120 INFO L290 TraceCheckUtils]: 119: Hoare triple {21235#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,120 INFO L290 TraceCheckUtils]: 120: Hoare triple {21235#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21263#(<= |main_#t~post6| 12)} is VALID [2022-04-08 14:05:29,121 INFO L290 TraceCheckUtils]: 121: Hoare triple {21263#(<= |main_#t~post6| 12)} assume !(#t~post6 < 20);havoc #t~post6; {20886#false} is VALID [2022-04-08 14:05:29,121 INFO L272 TraceCheckUtils]: 122: Hoare triple {20886#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {20886#false} is VALID [2022-04-08 14:05:29,121 INFO L290 TraceCheckUtils]: 123: Hoare triple {20886#false} ~cond := #in~cond; {20886#false} is VALID [2022-04-08 14:05:29,121 INFO L290 TraceCheckUtils]: 124: Hoare triple {20886#false} assume 0 == ~cond; {20886#false} is VALID [2022-04-08 14:05:29,121 INFO L290 TraceCheckUtils]: 125: Hoare triple {20886#false} assume !false; {20886#false} is VALID [2022-04-08 14:05:29,121 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 24 proven. 618 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:05:29,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:05:29,707 INFO L290 TraceCheckUtils]: 125: Hoare triple {20886#false} assume !false; {20886#false} is VALID [2022-04-08 14:05:29,707 INFO L290 TraceCheckUtils]: 124: Hoare triple {20886#false} assume 0 == ~cond; {20886#false} is VALID [2022-04-08 14:05:29,707 INFO L290 TraceCheckUtils]: 123: Hoare triple {20886#false} ~cond := #in~cond; {20886#false} is VALID [2022-04-08 14:05:29,707 INFO L272 TraceCheckUtils]: 122: Hoare triple {20886#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {20886#false} is VALID [2022-04-08 14:05:29,708 INFO L290 TraceCheckUtils]: 121: Hoare triple {21291#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {20886#false} is VALID [2022-04-08 14:05:29,708 INFO L290 TraceCheckUtils]: 120: Hoare triple {21295#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21291#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:05:29,708 INFO L290 TraceCheckUtils]: 119: Hoare triple {21295#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21295#(< ~counter~0 20)} is VALID [2022-04-08 14:05:29,709 INFO L290 TraceCheckUtils]: 118: Hoare triple {21295#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {21295#(< ~counter~0 20)} is VALID [2022-04-08 14:05:29,709 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {20885#true} {21295#(< ~counter~0 20)} #71#return; {21295#(< ~counter~0 20)} is VALID [2022-04-08 14:05:29,709 INFO L290 TraceCheckUtils]: 116: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,709 INFO L290 TraceCheckUtils]: 115: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,709 INFO L290 TraceCheckUtils]: 114: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,709 INFO L272 TraceCheckUtils]: 113: Hoare triple {21295#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,710 INFO L290 TraceCheckUtils]: 112: Hoare triple {21295#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {21295#(< ~counter~0 20)} is VALID [2022-04-08 14:05:29,710 INFO L290 TraceCheckUtils]: 111: Hoare triple {21323#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21295#(< ~counter~0 20)} is VALID [2022-04-08 14:05:29,711 INFO L290 TraceCheckUtils]: 110: Hoare triple {21323#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21323#(< ~counter~0 19)} is VALID [2022-04-08 14:05:29,711 INFO L290 TraceCheckUtils]: 109: Hoare triple {21323#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {21323#(< ~counter~0 19)} is VALID [2022-04-08 14:05:29,711 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {20885#true} {21323#(< ~counter~0 19)} #71#return; {21323#(< ~counter~0 19)} is VALID [2022-04-08 14:05:29,711 INFO L290 TraceCheckUtils]: 107: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,712 INFO L290 TraceCheckUtils]: 106: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,712 INFO L290 TraceCheckUtils]: 105: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,712 INFO L272 TraceCheckUtils]: 104: Hoare triple {21323#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,712 INFO L290 TraceCheckUtils]: 103: Hoare triple {21323#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {21323#(< ~counter~0 19)} is VALID [2022-04-08 14:05:29,712 INFO L290 TraceCheckUtils]: 102: Hoare triple {21351#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21323#(< ~counter~0 19)} is VALID [2022-04-08 14:05:29,713 INFO L290 TraceCheckUtils]: 101: Hoare triple {21351#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21351#(< ~counter~0 18)} is VALID [2022-04-08 14:05:29,713 INFO L290 TraceCheckUtils]: 100: Hoare triple {21351#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {21351#(< ~counter~0 18)} is VALID [2022-04-08 14:05:29,713 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {20885#true} {21351#(< ~counter~0 18)} #71#return; {21351#(< ~counter~0 18)} is VALID [2022-04-08 14:05:29,714 INFO L290 TraceCheckUtils]: 98: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,714 INFO L290 TraceCheckUtils]: 97: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,714 INFO L290 TraceCheckUtils]: 96: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,714 INFO L272 TraceCheckUtils]: 95: Hoare triple {21351#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,714 INFO L290 TraceCheckUtils]: 94: Hoare triple {21351#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {21351#(< ~counter~0 18)} is VALID [2022-04-08 14:05:29,714 INFO L290 TraceCheckUtils]: 93: Hoare triple {21379#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21351#(< ~counter~0 18)} is VALID [2022-04-08 14:05:29,715 INFO L290 TraceCheckUtils]: 92: Hoare triple {21379#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21379#(< ~counter~0 17)} is VALID [2022-04-08 14:05:29,715 INFO L290 TraceCheckUtils]: 91: Hoare triple {21379#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {21379#(< ~counter~0 17)} is VALID [2022-04-08 14:05:29,715 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {20885#true} {21379#(< ~counter~0 17)} #71#return; {21379#(< ~counter~0 17)} is VALID [2022-04-08 14:05:29,716 INFO L290 TraceCheckUtils]: 89: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,716 INFO L290 TraceCheckUtils]: 88: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,716 INFO L290 TraceCheckUtils]: 87: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,716 INFO L272 TraceCheckUtils]: 86: Hoare triple {21379#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,716 INFO L290 TraceCheckUtils]: 85: Hoare triple {21379#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {21379#(< ~counter~0 17)} is VALID [2022-04-08 14:05:29,716 INFO L290 TraceCheckUtils]: 84: Hoare triple {21407#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21379#(< ~counter~0 17)} is VALID [2022-04-08 14:05:29,717 INFO L290 TraceCheckUtils]: 83: Hoare triple {21407#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21407#(< ~counter~0 16)} is VALID [2022-04-08 14:05:29,717 INFO L290 TraceCheckUtils]: 82: Hoare triple {21407#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {21407#(< ~counter~0 16)} is VALID [2022-04-08 14:05:29,717 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {20885#true} {21407#(< ~counter~0 16)} #71#return; {21407#(< ~counter~0 16)} is VALID [2022-04-08 14:05:29,718 INFO L290 TraceCheckUtils]: 80: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,718 INFO L290 TraceCheckUtils]: 79: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,718 INFO L290 TraceCheckUtils]: 78: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,718 INFO L272 TraceCheckUtils]: 77: Hoare triple {21407#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,718 INFO L290 TraceCheckUtils]: 76: Hoare triple {21407#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {21407#(< ~counter~0 16)} is VALID [2022-04-08 14:05:29,718 INFO L290 TraceCheckUtils]: 75: Hoare triple {21435#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21407#(< ~counter~0 16)} is VALID [2022-04-08 14:05:29,719 INFO L290 TraceCheckUtils]: 74: Hoare triple {21435#(< ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21435#(< ~counter~0 15)} is VALID [2022-04-08 14:05:29,719 INFO L290 TraceCheckUtils]: 73: Hoare triple {21435#(< ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {21435#(< ~counter~0 15)} is VALID [2022-04-08 14:05:29,720 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {20885#true} {21435#(< ~counter~0 15)} #71#return; {21435#(< ~counter~0 15)} is VALID [2022-04-08 14:05:29,720 INFO L290 TraceCheckUtils]: 71: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,720 INFO L290 TraceCheckUtils]: 70: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,720 INFO L290 TraceCheckUtils]: 69: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,720 INFO L272 TraceCheckUtils]: 68: Hoare triple {21435#(< ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,720 INFO L290 TraceCheckUtils]: 67: Hoare triple {21435#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {21435#(< ~counter~0 15)} is VALID [2022-04-08 14:05:29,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {21463#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21435#(< ~counter~0 15)} is VALID [2022-04-08 14:05:29,721 INFO L290 TraceCheckUtils]: 65: Hoare triple {21463#(< ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21463#(< ~counter~0 14)} is VALID [2022-04-08 14:05:29,721 INFO L290 TraceCheckUtils]: 64: Hoare triple {21463#(< ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {21463#(< ~counter~0 14)} is VALID [2022-04-08 14:05:29,722 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {20885#true} {21463#(< ~counter~0 14)} #71#return; {21463#(< ~counter~0 14)} is VALID [2022-04-08 14:05:29,722 INFO L290 TraceCheckUtils]: 62: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,722 INFO L290 TraceCheckUtils]: 61: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,722 INFO L290 TraceCheckUtils]: 60: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,722 INFO L272 TraceCheckUtils]: 59: Hoare triple {21463#(< ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,722 INFO L290 TraceCheckUtils]: 58: Hoare triple {21463#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {21463#(< ~counter~0 14)} is VALID [2022-04-08 14:05:29,723 INFO L290 TraceCheckUtils]: 57: Hoare triple {21235#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21463#(< ~counter~0 14)} is VALID [2022-04-08 14:05:29,723 INFO L290 TraceCheckUtils]: 56: Hoare triple {21235#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,723 INFO L290 TraceCheckUtils]: 55: Hoare triple {21235#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,724 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {20885#true} {21235#(<= ~counter~0 12)} #71#return; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,724 INFO L290 TraceCheckUtils]: 53: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,724 INFO L290 TraceCheckUtils]: 52: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,724 INFO L290 TraceCheckUtils]: 51: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,724 INFO L272 TraceCheckUtils]: 50: Hoare triple {21235#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {21235#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,725 INFO L290 TraceCheckUtils]: 48: Hoare triple {21207#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21235#(<= ~counter~0 12)} is VALID [2022-04-08 14:05:29,725 INFO L290 TraceCheckUtils]: 47: Hoare triple {21207#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,725 INFO L290 TraceCheckUtils]: 46: Hoare triple {21207#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,726 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {20885#true} {21207#(<= ~counter~0 11)} #71#return; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,726 INFO L290 TraceCheckUtils]: 44: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,726 INFO L290 TraceCheckUtils]: 43: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,726 INFO L290 TraceCheckUtils]: 42: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,726 INFO L272 TraceCheckUtils]: 41: Hoare triple {21207#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,726 INFO L290 TraceCheckUtils]: 40: Hoare triple {21207#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,727 INFO L290 TraceCheckUtils]: 39: Hoare triple {21179#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21207#(<= ~counter~0 11)} is VALID [2022-04-08 14:05:29,727 INFO L290 TraceCheckUtils]: 38: Hoare triple {21179#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,727 INFO L290 TraceCheckUtils]: 37: Hoare triple {21179#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,728 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {20885#true} {21179#(<= ~counter~0 10)} #71#return; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,728 INFO L290 TraceCheckUtils]: 35: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,728 INFO L290 TraceCheckUtils]: 34: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,728 INFO L290 TraceCheckUtils]: 33: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,728 INFO L272 TraceCheckUtils]: 32: Hoare triple {21179#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,728 INFO L290 TraceCheckUtils]: 31: Hoare triple {21179#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {21151#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21179#(<= ~counter~0 10)} is VALID [2022-04-08 14:05:29,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {21151#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {21151#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,730 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {20885#true} {21151#(<= ~counter~0 9)} #71#return; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,730 INFO L290 TraceCheckUtils]: 26: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,730 INFO L290 TraceCheckUtils]: 25: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,730 INFO L290 TraceCheckUtils]: 24: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,730 INFO L272 TraceCheckUtils]: 23: Hoare triple {21151#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,730 INFO L290 TraceCheckUtils]: 22: Hoare triple {21151#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,731 INFO L290 TraceCheckUtils]: 21: Hoare triple {21123#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21151#(<= ~counter~0 9)} is VALID [2022-04-08 14:05:29,731 INFO L290 TraceCheckUtils]: 20: Hoare triple {21123#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,731 INFO L290 TraceCheckUtils]: 19: Hoare triple {21123#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,732 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {20885#true} {21123#(<= ~counter~0 8)} #71#return; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,732 INFO L290 TraceCheckUtils]: 17: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,732 INFO L272 TraceCheckUtils]: 14: Hoare triple {21123#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,732 INFO L290 TraceCheckUtils]: 13: Hoare triple {21123#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,733 INFO L290 TraceCheckUtils]: 12: Hoare triple {21095#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21123#(<= ~counter~0 8)} is VALID [2022-04-08 14:05:29,733 INFO L290 TraceCheckUtils]: 11: Hoare triple {21095#(<= ~counter~0 7)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,733 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {20885#true} {21095#(<= ~counter~0 7)} #69#return; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {20885#true} assume true; {20885#true} is VALID [2022-04-08 14:05:29,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {20885#true} assume !(0 == ~cond); {20885#true} is VALID [2022-04-08 14:05:29,734 INFO L290 TraceCheckUtils]: 7: Hoare triple {20885#true} ~cond := #in~cond; {20885#true} is VALID [2022-04-08 14:05:29,734 INFO L272 TraceCheckUtils]: 6: Hoare triple {21095#(<= ~counter~0 7)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {20885#true} is VALID [2022-04-08 14:05:29,734 INFO L290 TraceCheckUtils]: 5: Hoare triple {21095#(<= ~counter~0 7)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,734 INFO L272 TraceCheckUtils]: 4: Hoare triple {21095#(<= ~counter~0 7)} call #t~ret7 := main(); {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,734 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21095#(<= ~counter~0 7)} {20885#true} #77#return; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,735 INFO L290 TraceCheckUtils]: 2: Hoare triple {21095#(<= ~counter~0 7)} assume true; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,735 INFO L290 TraceCheckUtils]: 1: Hoare triple {20885#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {21095#(<= ~counter~0 7)} is VALID [2022-04-08 14:05:29,735 INFO L272 TraceCheckUtils]: 0: Hoare triple {20885#true} call ULTIMATE.init(); {20885#true} is VALID [2022-04-08 14:05:29,736 INFO L134 CoverageAnalysis]: Checked inductivity of 642 backedges. 24 proven. 354 refuted. 0 times theorem prover too weak. 264 trivial. 0 not checked. [2022-04-08 14:05:29,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:05:29,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936132362] [2022-04-08 14:05:29,736 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:05:29,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1363071834] [2022-04-08 14:05:29,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1363071834] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:05:29,736 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:05:29,736 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-08 14:05:29,736 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:05:29,736 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1310944162] [2022-04-08 14:05:29,736 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1310944162] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:05:29,736 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:05:29,737 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 14:05:29,737 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610358896] [2022-04-08 14:05:29,737 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:05:29,737 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 126 [2022-04-08 14:05:29,737 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:05:29,737 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:05:29,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:29,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 14:05:29,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:29,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 14:05:29,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:05:29,821 INFO L87 Difference]: Start difference. First operand 164 states and 202 transitions. Second operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:05:30,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:30,512 INFO L93 Difference]: Finished difference Result 183 states and 225 transitions. [2022-04-08 14:05:30,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 14:05:30,512 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) Word has length 126 [2022-04-08 14:05:30,512 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:05:30,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:05:30,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 211 transitions. [2022-04-08 14:05:30,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:05:30,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 211 transitions. [2022-04-08 14:05:30,516 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 211 transitions. [2022-04-08 14:05:30,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:30,671 INFO L225 Difference]: With dead ends: 183 [2022-04-08 14:05:30,671 INFO L226 Difference]: Without dead ends: 175 [2022-04-08 14:05:30,671 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 228 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=512, Invalid=748, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 14:05:30,671 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 165 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 246 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:05:30,672 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 246 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:05:30,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-04-08 14:05:30,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 175. [2022-04-08 14:05:30,945 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:05:30,945 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:05:30,945 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:05:30,945 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:05:30,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:30,947 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2022-04-08 14:05:30,947 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-08 14:05:30,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:30,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:30,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 175 states. [2022-04-08 14:05:30,948 INFO L87 Difference]: Start difference. First operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 175 states. [2022-04-08 14:05:30,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:05:30,950 INFO L93 Difference]: Finished difference Result 175 states and 216 transitions. [2022-04-08 14:05:30,950 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-08 14:05:30,950 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:05:30,950 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:05:30,950 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:05:30,950 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:05:30,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 175 states, 138 states have (on average 1.3043478260869565) internal successors, (180), 139 states have internal predecessors, (180), 19 states have call successors, (19), 18 states have call predecessors, (19), 17 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:05:30,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 175 states to 175 states and 216 transitions. [2022-04-08 14:05:30,952 INFO L78 Accepts]: Start accepts. Automaton has 175 states and 216 transitions. Word has length 126 [2022-04-08 14:05:30,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:05:30,952 INFO L478 AbstractCegarLoop]: Abstraction has 175 states and 216 transitions. [2022-04-08 14:05:30,952 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 13 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-08 14:05:30,952 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 175 states and 216 transitions. [2022-04-08 14:05:57,164 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 204 inductive. 0 not inductive. 12 times theorem prover too weak to decide inductivity. [2022-04-08 14:05:57,164 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 216 transitions. [2022-04-08 14:05:57,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-08 14:05:57,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:05:57,165 INFO L499 BasicCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:05:57,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-08 14:05:57,365 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-08 14:05:57,365 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:05:57,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:05:57,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1923626174, now seen corresponding path program 25 times [2022-04-08 14:05:57,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:05:57,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [323640506] [2022-04-08 14:06:03,415 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:06:03,416 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:06:03,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1923626174, now seen corresponding path program 26 times [2022-04-08 14:06:03,416 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:06:03,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283570947] [2022-04-08 14:06:03,416 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:06:03,416 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:06:03,431 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:06:03,431 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [730405390] [2022-04-08 14:06:03,431 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:06:03,431 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:06:03,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:06:03,432 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:06:03,432 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-08 14:06:03,516 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:06:03,516 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:06:03,517 INFO L263 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 14:06:03,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:06:03,544 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:06:04,123 INFO L272 TraceCheckUtils]: 0: Hoare triple {22754#true} call ULTIMATE.init(); {22754#true} is VALID [2022-04-08 14:06:04,124 INFO L290 TraceCheckUtils]: 1: Hoare triple {22754#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,124 INFO L290 TraceCheckUtils]: 2: Hoare triple {22762#(<= ~counter~0 0)} assume true; {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,124 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22762#(<= ~counter~0 0)} {22754#true} #77#return; {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,124 INFO L272 TraceCheckUtils]: 4: Hoare triple {22762#(<= ~counter~0 0)} call #t~ret7 := main(); {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,125 INFO L290 TraceCheckUtils]: 5: Hoare triple {22762#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,125 INFO L272 TraceCheckUtils]: 6: Hoare triple {22762#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,125 INFO L290 TraceCheckUtils]: 7: Hoare triple {22762#(<= ~counter~0 0)} ~cond := #in~cond; {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {22762#(<= ~counter~0 0)} assume !(0 == ~cond); {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {22762#(<= ~counter~0 0)} assume true; {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22762#(<= ~counter~0 0)} {22762#(<= ~counter~0 0)} #69#return; {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {22762#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {22762#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:04,127 INFO L290 TraceCheckUtils]: 12: Hoare triple {22762#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22796#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:04,127 INFO L290 TraceCheckUtils]: 13: Hoare triple {22796#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {22796#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:04,128 INFO L272 TraceCheckUtils]: 14: Hoare triple {22796#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22796#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:04,128 INFO L290 TraceCheckUtils]: 15: Hoare triple {22796#(<= ~counter~0 1)} ~cond := #in~cond; {22796#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:04,128 INFO L290 TraceCheckUtils]: 16: Hoare triple {22796#(<= ~counter~0 1)} assume !(0 == ~cond); {22796#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:04,129 INFO L290 TraceCheckUtils]: 17: Hoare triple {22796#(<= ~counter~0 1)} assume true; {22796#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:04,129 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22796#(<= ~counter~0 1)} {22796#(<= ~counter~0 1)} #71#return; {22796#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:04,129 INFO L290 TraceCheckUtils]: 19: Hoare triple {22796#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {22796#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:04,130 INFO L290 TraceCheckUtils]: 20: Hoare triple {22796#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22796#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:04,130 INFO L290 TraceCheckUtils]: 21: Hoare triple {22796#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22824#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:04,130 INFO L290 TraceCheckUtils]: 22: Hoare triple {22824#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {22824#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:04,131 INFO L272 TraceCheckUtils]: 23: Hoare triple {22824#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22824#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:04,131 INFO L290 TraceCheckUtils]: 24: Hoare triple {22824#(<= ~counter~0 2)} ~cond := #in~cond; {22824#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:04,131 INFO L290 TraceCheckUtils]: 25: Hoare triple {22824#(<= ~counter~0 2)} assume !(0 == ~cond); {22824#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:04,132 INFO L290 TraceCheckUtils]: 26: Hoare triple {22824#(<= ~counter~0 2)} assume true; {22824#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:04,132 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22824#(<= ~counter~0 2)} {22824#(<= ~counter~0 2)} #71#return; {22824#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:04,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {22824#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {22824#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:04,133 INFO L290 TraceCheckUtils]: 29: Hoare triple {22824#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22824#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:04,133 INFO L290 TraceCheckUtils]: 30: Hoare triple {22824#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22852#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:04,133 INFO L290 TraceCheckUtils]: 31: Hoare triple {22852#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {22852#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:04,134 INFO L272 TraceCheckUtils]: 32: Hoare triple {22852#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22852#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:04,134 INFO L290 TraceCheckUtils]: 33: Hoare triple {22852#(<= ~counter~0 3)} ~cond := #in~cond; {22852#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:04,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {22852#(<= ~counter~0 3)} assume !(0 == ~cond); {22852#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:04,135 INFO L290 TraceCheckUtils]: 35: Hoare triple {22852#(<= ~counter~0 3)} assume true; {22852#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:04,135 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22852#(<= ~counter~0 3)} {22852#(<= ~counter~0 3)} #71#return; {22852#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:04,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {22852#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {22852#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:04,136 INFO L290 TraceCheckUtils]: 38: Hoare triple {22852#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22852#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:04,136 INFO L290 TraceCheckUtils]: 39: Hoare triple {22852#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22880#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:04,136 INFO L290 TraceCheckUtils]: 40: Hoare triple {22880#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {22880#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:04,137 INFO L272 TraceCheckUtils]: 41: Hoare triple {22880#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22880#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:04,137 INFO L290 TraceCheckUtils]: 42: Hoare triple {22880#(<= ~counter~0 4)} ~cond := #in~cond; {22880#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:04,137 INFO L290 TraceCheckUtils]: 43: Hoare triple {22880#(<= ~counter~0 4)} assume !(0 == ~cond); {22880#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:04,137 INFO L290 TraceCheckUtils]: 44: Hoare triple {22880#(<= ~counter~0 4)} assume true; {22880#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:04,138 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22880#(<= ~counter~0 4)} {22880#(<= ~counter~0 4)} #71#return; {22880#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:04,138 INFO L290 TraceCheckUtils]: 46: Hoare triple {22880#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {22880#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:04,138 INFO L290 TraceCheckUtils]: 47: Hoare triple {22880#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22880#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:04,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {22880#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22908#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:04,139 INFO L290 TraceCheckUtils]: 49: Hoare triple {22908#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {22908#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:04,140 INFO L272 TraceCheckUtils]: 50: Hoare triple {22908#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22908#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:04,140 INFO L290 TraceCheckUtils]: 51: Hoare triple {22908#(<= ~counter~0 5)} ~cond := #in~cond; {22908#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:04,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {22908#(<= ~counter~0 5)} assume !(0 == ~cond); {22908#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:04,140 INFO L290 TraceCheckUtils]: 53: Hoare triple {22908#(<= ~counter~0 5)} assume true; {22908#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:04,141 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22908#(<= ~counter~0 5)} {22908#(<= ~counter~0 5)} #71#return; {22908#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:04,141 INFO L290 TraceCheckUtils]: 55: Hoare triple {22908#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {22908#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:04,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {22908#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22908#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:04,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {22908#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,152 INFO L290 TraceCheckUtils]: 58: Hoare triple {22936#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,153 INFO L272 TraceCheckUtils]: 59: Hoare triple {22936#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,153 INFO L290 TraceCheckUtils]: 60: Hoare triple {22936#(<= ~counter~0 6)} ~cond := #in~cond; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,153 INFO L290 TraceCheckUtils]: 61: Hoare triple {22936#(<= ~counter~0 6)} assume !(0 == ~cond); {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,154 INFO L290 TraceCheckUtils]: 62: Hoare triple {22936#(<= ~counter~0 6)} assume true; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,155 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22936#(<= ~counter~0 6)} {22936#(<= ~counter~0 6)} #71#return; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,155 INFO L290 TraceCheckUtils]: 64: Hoare triple {22936#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,155 INFO L290 TraceCheckUtils]: 65: Hoare triple {22936#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,156 INFO L290 TraceCheckUtils]: 66: Hoare triple {22936#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,156 INFO L290 TraceCheckUtils]: 67: Hoare triple {22964#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,157 INFO L272 TraceCheckUtils]: 68: Hoare triple {22964#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,158 INFO L290 TraceCheckUtils]: 69: Hoare triple {22964#(<= ~counter~0 7)} ~cond := #in~cond; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,158 INFO L290 TraceCheckUtils]: 70: Hoare triple {22964#(<= ~counter~0 7)} assume !(0 == ~cond); {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,158 INFO L290 TraceCheckUtils]: 71: Hoare triple {22964#(<= ~counter~0 7)} assume true; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,159 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22964#(<= ~counter~0 7)} {22964#(<= ~counter~0 7)} #71#return; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,160 INFO L290 TraceCheckUtils]: 73: Hoare triple {22964#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,160 INFO L290 TraceCheckUtils]: 74: Hoare triple {22964#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,160 INFO L290 TraceCheckUtils]: 75: Hoare triple {22964#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,161 INFO L290 TraceCheckUtils]: 76: Hoare triple {22992#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,162 INFO L272 TraceCheckUtils]: 77: Hoare triple {22992#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,162 INFO L290 TraceCheckUtils]: 78: Hoare triple {22992#(<= ~counter~0 8)} ~cond := #in~cond; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,162 INFO L290 TraceCheckUtils]: 79: Hoare triple {22992#(<= ~counter~0 8)} assume !(0 == ~cond); {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,163 INFO L290 TraceCheckUtils]: 80: Hoare triple {22992#(<= ~counter~0 8)} assume true; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,163 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22992#(<= ~counter~0 8)} {22992#(<= ~counter~0 8)} #71#return; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,163 INFO L290 TraceCheckUtils]: 82: Hoare triple {22992#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,164 INFO L290 TraceCheckUtils]: 83: Hoare triple {22992#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,164 INFO L290 TraceCheckUtils]: 84: Hoare triple {22992#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,164 INFO L290 TraceCheckUtils]: 85: Hoare triple {23020#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,165 INFO L272 TraceCheckUtils]: 86: Hoare triple {23020#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,165 INFO L290 TraceCheckUtils]: 87: Hoare triple {23020#(<= ~counter~0 9)} ~cond := #in~cond; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,165 INFO L290 TraceCheckUtils]: 88: Hoare triple {23020#(<= ~counter~0 9)} assume !(0 == ~cond); {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,166 INFO L290 TraceCheckUtils]: 89: Hoare triple {23020#(<= ~counter~0 9)} assume true; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,166 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {23020#(<= ~counter~0 9)} {23020#(<= ~counter~0 9)} #71#return; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,166 INFO L290 TraceCheckUtils]: 91: Hoare triple {23020#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,167 INFO L290 TraceCheckUtils]: 92: Hoare triple {23020#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,167 INFO L290 TraceCheckUtils]: 93: Hoare triple {23020#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,167 INFO L290 TraceCheckUtils]: 94: Hoare triple {23048#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,168 INFO L272 TraceCheckUtils]: 95: Hoare triple {23048#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,168 INFO L290 TraceCheckUtils]: 96: Hoare triple {23048#(<= ~counter~0 10)} ~cond := #in~cond; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,168 INFO L290 TraceCheckUtils]: 97: Hoare triple {23048#(<= ~counter~0 10)} assume !(0 == ~cond); {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,169 INFO L290 TraceCheckUtils]: 98: Hoare triple {23048#(<= ~counter~0 10)} assume true; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,169 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {23048#(<= ~counter~0 10)} {23048#(<= ~counter~0 10)} #71#return; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,169 INFO L290 TraceCheckUtils]: 100: Hoare triple {23048#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,170 INFO L290 TraceCheckUtils]: 101: Hoare triple {23048#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,170 INFO L290 TraceCheckUtils]: 102: Hoare triple {23048#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,170 INFO L290 TraceCheckUtils]: 103: Hoare triple {23076#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,171 INFO L272 TraceCheckUtils]: 104: Hoare triple {23076#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,171 INFO L290 TraceCheckUtils]: 105: Hoare triple {23076#(<= ~counter~0 11)} ~cond := #in~cond; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,171 INFO L290 TraceCheckUtils]: 106: Hoare triple {23076#(<= ~counter~0 11)} assume !(0 == ~cond); {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,172 INFO L290 TraceCheckUtils]: 107: Hoare triple {23076#(<= ~counter~0 11)} assume true; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,172 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {23076#(<= ~counter~0 11)} {23076#(<= ~counter~0 11)} #71#return; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,172 INFO L290 TraceCheckUtils]: 109: Hoare triple {23076#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,173 INFO L290 TraceCheckUtils]: 110: Hoare triple {23076#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,173 INFO L290 TraceCheckUtils]: 111: Hoare triple {23076#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,173 INFO L290 TraceCheckUtils]: 112: Hoare triple {23104#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,174 INFO L272 TraceCheckUtils]: 113: Hoare triple {23104#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,174 INFO L290 TraceCheckUtils]: 114: Hoare triple {23104#(<= ~counter~0 12)} ~cond := #in~cond; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,174 INFO L290 TraceCheckUtils]: 115: Hoare triple {23104#(<= ~counter~0 12)} assume !(0 == ~cond); {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,175 INFO L290 TraceCheckUtils]: 116: Hoare triple {23104#(<= ~counter~0 12)} assume true; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,175 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {23104#(<= ~counter~0 12)} {23104#(<= ~counter~0 12)} #71#return; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,175 INFO L290 TraceCheckUtils]: 118: Hoare triple {23104#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,186 INFO L290 TraceCheckUtils]: 119: Hoare triple {23104#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,187 INFO L290 TraceCheckUtils]: 120: Hoare triple {23104#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,187 INFO L290 TraceCheckUtils]: 121: Hoare triple {23132#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,188 INFO L272 TraceCheckUtils]: 122: Hoare triple {23132#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,188 INFO L290 TraceCheckUtils]: 123: Hoare triple {23132#(<= ~counter~0 13)} ~cond := #in~cond; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,188 INFO L290 TraceCheckUtils]: 124: Hoare triple {23132#(<= ~counter~0 13)} assume !(0 == ~cond); {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,188 INFO L290 TraceCheckUtils]: 125: Hoare triple {23132#(<= ~counter~0 13)} assume true; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,189 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {23132#(<= ~counter~0 13)} {23132#(<= ~counter~0 13)} #71#return; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,189 INFO L290 TraceCheckUtils]: 127: Hoare triple {23132#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,189 INFO L290 TraceCheckUtils]: 128: Hoare triple {23132#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,190 INFO L290 TraceCheckUtils]: 129: Hoare triple {23132#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23160#(<= |main_#t~post6| 13)} is VALID [2022-04-08 14:06:04,190 INFO L290 TraceCheckUtils]: 130: Hoare triple {23160#(<= |main_#t~post6| 13)} assume !(#t~post6 < 20);havoc #t~post6; {22755#false} is VALID [2022-04-08 14:06:04,190 INFO L272 TraceCheckUtils]: 131: Hoare triple {22755#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {22755#false} is VALID [2022-04-08 14:06:04,190 INFO L290 TraceCheckUtils]: 132: Hoare triple {22755#false} ~cond := #in~cond; {22755#false} is VALID [2022-04-08 14:06:04,190 INFO L290 TraceCheckUtils]: 133: Hoare triple {22755#false} assume 0 == ~cond; {22755#false} is VALID [2022-04-08 14:06:04,190 INFO L290 TraceCheckUtils]: 134: Hoare triple {22755#false} assume !false; {22755#false} is VALID [2022-04-08 14:06:04,191 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 26 proven. 728 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:06:04,191 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:06:04,799 INFO L290 TraceCheckUtils]: 134: Hoare triple {22755#false} assume !false; {22755#false} is VALID [2022-04-08 14:06:04,799 INFO L290 TraceCheckUtils]: 133: Hoare triple {22755#false} assume 0 == ~cond; {22755#false} is VALID [2022-04-08 14:06:04,799 INFO L290 TraceCheckUtils]: 132: Hoare triple {22755#false} ~cond := #in~cond; {22755#false} is VALID [2022-04-08 14:06:04,799 INFO L272 TraceCheckUtils]: 131: Hoare triple {22755#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {22755#false} is VALID [2022-04-08 14:06:04,799 INFO L290 TraceCheckUtils]: 130: Hoare triple {23188#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {22755#false} is VALID [2022-04-08 14:06:04,800 INFO L290 TraceCheckUtils]: 129: Hoare triple {23192#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23188#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:06:04,800 INFO L290 TraceCheckUtils]: 128: Hoare triple {23192#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23192#(< ~counter~0 20)} is VALID [2022-04-08 14:06:04,800 INFO L290 TraceCheckUtils]: 127: Hoare triple {23192#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {23192#(< ~counter~0 20)} is VALID [2022-04-08 14:06:04,801 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {22754#true} {23192#(< ~counter~0 20)} #71#return; {23192#(< ~counter~0 20)} is VALID [2022-04-08 14:06:04,801 INFO L290 TraceCheckUtils]: 125: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,801 INFO L290 TraceCheckUtils]: 124: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,801 INFO L290 TraceCheckUtils]: 123: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,801 INFO L272 TraceCheckUtils]: 122: Hoare triple {23192#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,801 INFO L290 TraceCheckUtils]: 121: Hoare triple {23192#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {23192#(< ~counter~0 20)} is VALID [2022-04-08 14:06:04,802 INFO L290 TraceCheckUtils]: 120: Hoare triple {23220#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23192#(< ~counter~0 20)} is VALID [2022-04-08 14:06:04,802 INFO L290 TraceCheckUtils]: 119: Hoare triple {23220#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23220#(< ~counter~0 19)} is VALID [2022-04-08 14:06:04,803 INFO L290 TraceCheckUtils]: 118: Hoare triple {23220#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {23220#(< ~counter~0 19)} is VALID [2022-04-08 14:06:04,803 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {22754#true} {23220#(< ~counter~0 19)} #71#return; {23220#(< ~counter~0 19)} is VALID [2022-04-08 14:06:04,803 INFO L290 TraceCheckUtils]: 116: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,803 INFO L290 TraceCheckUtils]: 115: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,803 INFO L290 TraceCheckUtils]: 114: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,803 INFO L272 TraceCheckUtils]: 113: Hoare triple {23220#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,804 INFO L290 TraceCheckUtils]: 112: Hoare triple {23220#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {23220#(< ~counter~0 19)} is VALID [2022-04-08 14:06:04,804 INFO L290 TraceCheckUtils]: 111: Hoare triple {23248#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23220#(< ~counter~0 19)} is VALID [2022-04-08 14:06:04,804 INFO L290 TraceCheckUtils]: 110: Hoare triple {23248#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23248#(< ~counter~0 18)} is VALID [2022-04-08 14:06:04,805 INFO L290 TraceCheckUtils]: 109: Hoare triple {23248#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {23248#(< ~counter~0 18)} is VALID [2022-04-08 14:06:04,805 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {22754#true} {23248#(< ~counter~0 18)} #71#return; {23248#(< ~counter~0 18)} is VALID [2022-04-08 14:06:04,805 INFO L290 TraceCheckUtils]: 107: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,805 INFO L290 TraceCheckUtils]: 106: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,805 INFO L290 TraceCheckUtils]: 105: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,805 INFO L272 TraceCheckUtils]: 104: Hoare triple {23248#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,806 INFO L290 TraceCheckUtils]: 103: Hoare triple {23248#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {23248#(< ~counter~0 18)} is VALID [2022-04-08 14:06:04,806 INFO L290 TraceCheckUtils]: 102: Hoare triple {23276#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23248#(< ~counter~0 18)} is VALID [2022-04-08 14:06:04,806 INFO L290 TraceCheckUtils]: 101: Hoare triple {23276#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23276#(< ~counter~0 17)} is VALID [2022-04-08 14:06:04,807 INFO L290 TraceCheckUtils]: 100: Hoare triple {23276#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {23276#(< ~counter~0 17)} is VALID [2022-04-08 14:06:04,807 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {22754#true} {23276#(< ~counter~0 17)} #71#return; {23276#(< ~counter~0 17)} is VALID [2022-04-08 14:06:04,807 INFO L290 TraceCheckUtils]: 98: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,807 INFO L290 TraceCheckUtils]: 97: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,807 INFO L290 TraceCheckUtils]: 96: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,807 INFO L272 TraceCheckUtils]: 95: Hoare triple {23276#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,808 INFO L290 TraceCheckUtils]: 94: Hoare triple {23276#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {23276#(< ~counter~0 17)} is VALID [2022-04-08 14:06:04,808 INFO L290 TraceCheckUtils]: 93: Hoare triple {23304#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23276#(< ~counter~0 17)} is VALID [2022-04-08 14:06:04,808 INFO L290 TraceCheckUtils]: 92: Hoare triple {23304#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23304#(< ~counter~0 16)} is VALID [2022-04-08 14:06:04,809 INFO L290 TraceCheckUtils]: 91: Hoare triple {23304#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {23304#(< ~counter~0 16)} is VALID [2022-04-08 14:06:04,809 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {22754#true} {23304#(< ~counter~0 16)} #71#return; {23304#(< ~counter~0 16)} is VALID [2022-04-08 14:06:04,809 INFO L290 TraceCheckUtils]: 89: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,809 INFO L290 TraceCheckUtils]: 88: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,809 INFO L290 TraceCheckUtils]: 87: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,813 INFO L272 TraceCheckUtils]: 86: Hoare triple {23304#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,813 INFO L290 TraceCheckUtils]: 85: Hoare triple {23304#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {23304#(< ~counter~0 16)} is VALID [2022-04-08 14:06:04,814 INFO L290 TraceCheckUtils]: 84: Hoare triple {23332#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23304#(< ~counter~0 16)} is VALID [2022-04-08 14:06:04,815 INFO L290 TraceCheckUtils]: 83: Hoare triple {23332#(< ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23332#(< ~counter~0 15)} is VALID [2022-04-08 14:06:04,815 INFO L290 TraceCheckUtils]: 82: Hoare triple {23332#(< ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {23332#(< ~counter~0 15)} is VALID [2022-04-08 14:06:04,816 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {22754#true} {23332#(< ~counter~0 15)} #71#return; {23332#(< ~counter~0 15)} is VALID [2022-04-08 14:06:04,816 INFO L290 TraceCheckUtils]: 80: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,816 INFO L290 TraceCheckUtils]: 79: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,816 INFO L290 TraceCheckUtils]: 78: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,816 INFO L272 TraceCheckUtils]: 77: Hoare triple {23332#(< ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,816 INFO L290 TraceCheckUtils]: 76: Hoare triple {23332#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {23332#(< ~counter~0 15)} is VALID [2022-04-08 14:06:04,817 INFO L290 TraceCheckUtils]: 75: Hoare triple {23132#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23332#(< ~counter~0 15)} is VALID [2022-04-08 14:06:04,817 INFO L290 TraceCheckUtils]: 74: Hoare triple {23132#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,817 INFO L290 TraceCheckUtils]: 73: Hoare triple {23132#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,818 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {22754#true} {23132#(<= ~counter~0 13)} #71#return; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,818 INFO L290 TraceCheckUtils]: 71: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,818 INFO L290 TraceCheckUtils]: 70: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,818 INFO L290 TraceCheckUtils]: 69: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,818 INFO L272 TraceCheckUtils]: 68: Hoare triple {23132#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,818 INFO L290 TraceCheckUtils]: 67: Hoare triple {23132#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,819 INFO L290 TraceCheckUtils]: 66: Hoare triple {23104#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23132#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:04,819 INFO L290 TraceCheckUtils]: 65: Hoare triple {23104#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,819 INFO L290 TraceCheckUtils]: 64: Hoare triple {23104#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,820 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22754#true} {23104#(<= ~counter~0 12)} #71#return; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,820 INFO L290 TraceCheckUtils]: 62: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,820 INFO L290 TraceCheckUtils]: 61: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,820 INFO L290 TraceCheckUtils]: 60: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,820 INFO L272 TraceCheckUtils]: 59: Hoare triple {23104#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {23104#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,821 INFO L290 TraceCheckUtils]: 57: Hoare triple {23076#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23104#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:04,821 INFO L290 TraceCheckUtils]: 56: Hoare triple {23076#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,821 INFO L290 TraceCheckUtils]: 55: Hoare triple {23076#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,822 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {22754#true} {23076#(<= ~counter~0 11)} #71#return; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,822 INFO L290 TraceCheckUtils]: 53: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,822 INFO L290 TraceCheckUtils]: 51: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,822 INFO L272 TraceCheckUtils]: 50: Hoare triple {23076#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,822 INFO L290 TraceCheckUtils]: 49: Hoare triple {23076#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,823 INFO L290 TraceCheckUtils]: 48: Hoare triple {23048#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23076#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:04,823 INFO L290 TraceCheckUtils]: 47: Hoare triple {23048#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,823 INFO L290 TraceCheckUtils]: 46: Hoare triple {23048#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,833 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {22754#true} {23048#(<= ~counter~0 10)} #71#return; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,833 INFO L290 TraceCheckUtils]: 44: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,833 INFO L290 TraceCheckUtils]: 43: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,833 INFO L290 TraceCheckUtils]: 42: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,833 INFO L272 TraceCheckUtils]: 41: Hoare triple {23048#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,834 INFO L290 TraceCheckUtils]: 40: Hoare triple {23048#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,835 INFO L290 TraceCheckUtils]: 39: Hoare triple {23020#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23048#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:04,835 INFO L290 TraceCheckUtils]: 38: Hoare triple {23020#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,835 INFO L290 TraceCheckUtils]: 37: Hoare triple {23020#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,836 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {22754#true} {23020#(<= ~counter~0 9)} #71#return; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,836 INFO L290 TraceCheckUtils]: 35: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,836 INFO L290 TraceCheckUtils]: 34: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,836 INFO L290 TraceCheckUtils]: 33: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,836 INFO L272 TraceCheckUtils]: 32: Hoare triple {23020#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,837 INFO L290 TraceCheckUtils]: 31: Hoare triple {23020#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,837 INFO L290 TraceCheckUtils]: 30: Hoare triple {22992#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23020#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:04,837 INFO L290 TraceCheckUtils]: 29: Hoare triple {22992#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {22992#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,838 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {22754#true} {22992#(<= ~counter~0 8)} #71#return; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,838 INFO L290 TraceCheckUtils]: 25: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,838 INFO L272 TraceCheckUtils]: 23: Hoare triple {22992#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,855 INFO L290 TraceCheckUtils]: 22: Hoare triple {22992#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {22964#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22992#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:04,857 INFO L290 TraceCheckUtils]: 20: Hoare triple {22964#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,857 INFO L290 TraceCheckUtils]: 19: Hoare triple {22964#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,858 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {22754#true} {22964#(<= ~counter~0 7)} #71#return; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,858 INFO L290 TraceCheckUtils]: 15: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,858 INFO L272 TraceCheckUtils]: 14: Hoare triple {22964#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {22964#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {22936#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22964#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:04,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {22936#(<= ~counter~0 6)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,860 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22754#true} {22936#(<= ~counter~0 6)} #69#return; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,860 INFO L290 TraceCheckUtils]: 9: Hoare triple {22754#true} assume true; {22754#true} is VALID [2022-04-08 14:06:04,860 INFO L290 TraceCheckUtils]: 8: Hoare triple {22754#true} assume !(0 == ~cond); {22754#true} is VALID [2022-04-08 14:06:04,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {22754#true} ~cond := #in~cond; {22754#true} is VALID [2022-04-08 14:06:04,860 INFO L272 TraceCheckUtils]: 6: Hoare triple {22936#(<= ~counter~0 6)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {22754#true} is VALID [2022-04-08 14:06:04,861 INFO L290 TraceCheckUtils]: 5: Hoare triple {22936#(<= ~counter~0 6)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,861 INFO L272 TraceCheckUtils]: 4: Hoare triple {22936#(<= ~counter~0 6)} call #t~ret7 := main(); {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,862 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22936#(<= ~counter~0 6)} {22754#true} #77#return; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,862 INFO L290 TraceCheckUtils]: 2: Hoare triple {22936#(<= ~counter~0 6)} assume true; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,862 INFO L290 TraceCheckUtils]: 1: Hoare triple {22754#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {22936#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:04,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {22754#true} call ULTIMATE.init(); {22754#true} is VALID [2022-04-08 14:06:04,863 INFO L134 CoverageAnalysis]: Checked inductivity of 754 backedges. 26 proven. 416 refuted. 0 times theorem prover too weak. 312 trivial. 0 not checked. [2022-04-08 14:06:04,863 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:06:04,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283570947] [2022-04-08 14:06:04,863 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:06:04,863 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [730405390] [2022-04-08 14:06:04,863 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [730405390] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:06:04,863 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:06:04,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-08 14:06:04,864 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:06:04,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [323640506] [2022-04-08 14:06:04,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [323640506] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:06:04,864 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:06:04,864 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 14:06:04,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1930629052] [2022-04-08 14:06:04,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:06:04,864 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 135 [2022-04-08 14:06:04,865 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:06:04,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:06:04,961 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:06:04,961 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 14:06:04,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:06:04,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 14:06:04,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:06:04,962 INFO L87 Difference]: Start difference. First operand 175 states and 216 transitions. Second operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:06:05,752 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:06:05,753 INFO L93 Difference]: Finished difference Result 194 states and 239 transitions. [2022-04-08 14:06:05,753 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 14:06:05,753 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Word has length 135 [2022-04-08 14:06:05,753 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:06:05,753 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:06:05,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 225 transitions. [2022-04-08 14:06:05,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:06:05,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 225 transitions. [2022-04-08 14:06:05,758 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 225 transitions. [2022-04-08 14:06:05,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:06:05,962 INFO L225 Difference]: With dead ends: 194 [2022-04-08 14:06:05,962 INFO L226 Difference]: Without dead ends: 186 [2022-04-08 14:06:05,963 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 282 GetRequests, 246 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 116 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=535, Invalid=797, Unknown=0, NotChecked=0, Total=1332 [2022-04-08 14:06:05,963 INFO L913 BasicCegarLoop]: 43 mSDtfsCounter, 154 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 154 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:06:05,964 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [154 Valid, 266 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:06:05,964 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-04-08 14:06:06,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-04-08 14:06:06,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:06:06,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:06:06,254 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:06:06,255 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:06:06,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:06:06,256 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2022-04-08 14:06:06,256 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2022-04-08 14:06:06,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:06:06,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:06:06,257 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 186 states. [2022-04-08 14:06:06,257 INFO L87 Difference]: Start difference. First operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 186 states. [2022-04-08 14:06:06,259 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:06:06,259 INFO L93 Difference]: Finished difference Result 186 states and 230 transitions. [2022-04-08 14:06:06,259 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2022-04-08 14:06:06,259 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:06:06,259 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:06:06,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:06:06,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:06:06,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 147 states have (on average 1.3061224489795917) internal successors, (192), 148 states have internal predecessors, (192), 20 states have call successors, (20), 19 states have call predecessors, (20), 18 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:06:06,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 230 transitions. [2022-04-08 14:06:06,262 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 230 transitions. Word has length 135 [2022-04-08 14:06:06,262 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:06:06,262 INFO L478 AbstractCegarLoop]: Abstraction has 186 states and 230 transitions. [2022-04-08 14:06:06,262 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-08 14:06:06,262 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 186 states and 230 transitions. [2022-04-08 14:06:34,502 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 217 inductive. 0 not inductive. 13 times theorem prover too weak to decide inductivity. [2022-04-08 14:06:34,502 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 230 transitions. [2022-04-08 14:06:34,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 145 [2022-04-08 14:06:34,503 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:06:34,503 INFO L499 BasicCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:06:34,521 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-08 14:06:34,721 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-08 14:06:34,722 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:06:34,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:06:34,722 INFO L85 PathProgramCache]: Analyzing trace with hash 1384294394, now seen corresponding path program 27 times [2022-04-08 14:06:34,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:06:34,722 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1993378403] [2022-04-08 14:06:40,767 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:06:40,767 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:06:40,767 INFO L85 PathProgramCache]: Analyzing trace with hash 1384294394, now seen corresponding path program 28 times [2022-04-08 14:06:40,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:06:40,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645593976] [2022-04-08 14:06:40,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:06:40,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:06:40,785 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:06:40,786 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [847856410] [2022-04-08 14:06:40,786 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:06:40,786 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:06:40,786 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:06:40,787 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:06:40,787 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-08 14:06:40,904 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:06:40,904 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:06:40,906 INFO L263 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 14:06:40,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:06:40,933 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:06:41,601 INFO L272 TraceCheckUtils]: 0: Hoare triple {24745#true} call ULTIMATE.init(); {24745#true} is VALID [2022-04-08 14:06:41,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {24745#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {24753#(<= ~counter~0 0)} assume true; {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,602 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24753#(<= ~counter~0 0)} {24745#true} #77#return; {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,602 INFO L272 TraceCheckUtils]: 4: Hoare triple {24753#(<= ~counter~0 0)} call #t~ret7 := main(); {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {24753#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,603 INFO L272 TraceCheckUtils]: 6: Hoare triple {24753#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {24753#(<= ~counter~0 0)} ~cond := #in~cond; {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {24753#(<= ~counter~0 0)} assume !(0 == ~cond); {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {24753#(<= ~counter~0 0)} assume true; {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,604 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24753#(<= ~counter~0 0)} {24753#(<= ~counter~0 0)} #69#return; {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {24753#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {24753#(<= ~counter~0 0)} is VALID [2022-04-08 14:06:41,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {24753#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24787#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:41,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {24787#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {24787#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:41,606 INFO L272 TraceCheckUtils]: 14: Hoare triple {24787#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24787#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:41,607 INFO L290 TraceCheckUtils]: 15: Hoare triple {24787#(<= ~counter~0 1)} ~cond := #in~cond; {24787#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:41,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {24787#(<= ~counter~0 1)} assume !(0 == ~cond); {24787#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:41,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {24787#(<= ~counter~0 1)} assume true; {24787#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:41,608 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24787#(<= ~counter~0 1)} {24787#(<= ~counter~0 1)} #71#return; {24787#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:41,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {24787#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {24787#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:41,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {24787#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24787#(<= ~counter~0 1)} is VALID [2022-04-08 14:06:41,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {24787#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24815#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:41,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {24815#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {24815#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:41,609 INFO L272 TraceCheckUtils]: 23: Hoare triple {24815#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24815#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:41,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {24815#(<= ~counter~0 2)} ~cond := #in~cond; {24815#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:41,610 INFO L290 TraceCheckUtils]: 25: Hoare triple {24815#(<= ~counter~0 2)} assume !(0 == ~cond); {24815#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:41,610 INFO L290 TraceCheckUtils]: 26: Hoare triple {24815#(<= ~counter~0 2)} assume true; {24815#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:41,611 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24815#(<= ~counter~0 2)} {24815#(<= ~counter~0 2)} #71#return; {24815#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:41,611 INFO L290 TraceCheckUtils]: 28: Hoare triple {24815#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {24815#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:41,611 INFO L290 TraceCheckUtils]: 29: Hoare triple {24815#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24815#(<= ~counter~0 2)} is VALID [2022-04-08 14:06:41,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {24815#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24843#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:41,612 INFO L290 TraceCheckUtils]: 31: Hoare triple {24843#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {24843#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:41,612 INFO L272 TraceCheckUtils]: 32: Hoare triple {24843#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24843#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:41,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {24843#(<= ~counter~0 3)} ~cond := #in~cond; {24843#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:41,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {24843#(<= ~counter~0 3)} assume !(0 == ~cond); {24843#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:41,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {24843#(<= ~counter~0 3)} assume true; {24843#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:41,614 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24843#(<= ~counter~0 3)} {24843#(<= ~counter~0 3)} #71#return; {24843#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:41,614 INFO L290 TraceCheckUtils]: 37: Hoare triple {24843#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {24843#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:41,614 INFO L290 TraceCheckUtils]: 38: Hoare triple {24843#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24843#(<= ~counter~0 3)} is VALID [2022-04-08 14:06:41,615 INFO L290 TraceCheckUtils]: 39: Hoare triple {24843#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24871#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:41,615 INFO L290 TraceCheckUtils]: 40: Hoare triple {24871#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {24871#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:41,615 INFO L272 TraceCheckUtils]: 41: Hoare triple {24871#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24871#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:41,616 INFO L290 TraceCheckUtils]: 42: Hoare triple {24871#(<= ~counter~0 4)} ~cond := #in~cond; {24871#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:41,616 INFO L290 TraceCheckUtils]: 43: Hoare triple {24871#(<= ~counter~0 4)} assume !(0 == ~cond); {24871#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:41,616 INFO L290 TraceCheckUtils]: 44: Hoare triple {24871#(<= ~counter~0 4)} assume true; {24871#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:41,617 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24871#(<= ~counter~0 4)} {24871#(<= ~counter~0 4)} #71#return; {24871#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:41,617 INFO L290 TraceCheckUtils]: 46: Hoare triple {24871#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {24871#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:41,617 INFO L290 TraceCheckUtils]: 47: Hoare triple {24871#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24871#(<= ~counter~0 4)} is VALID [2022-04-08 14:06:41,617 INFO L290 TraceCheckUtils]: 48: Hoare triple {24871#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:41,618 INFO L290 TraceCheckUtils]: 49: Hoare triple {24899#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:41,618 INFO L272 TraceCheckUtils]: 50: Hoare triple {24899#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:41,618 INFO L290 TraceCheckUtils]: 51: Hoare triple {24899#(<= ~counter~0 5)} ~cond := #in~cond; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:41,619 INFO L290 TraceCheckUtils]: 52: Hoare triple {24899#(<= ~counter~0 5)} assume !(0 == ~cond); {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:41,619 INFO L290 TraceCheckUtils]: 53: Hoare triple {24899#(<= ~counter~0 5)} assume true; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:41,619 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {24899#(<= ~counter~0 5)} {24899#(<= ~counter~0 5)} #71#return; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:41,620 INFO L290 TraceCheckUtils]: 55: Hoare triple {24899#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:41,620 INFO L290 TraceCheckUtils]: 56: Hoare triple {24899#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:41,620 INFO L290 TraceCheckUtils]: 57: Hoare triple {24899#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:41,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {24927#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:41,621 INFO L272 TraceCheckUtils]: 59: Hoare triple {24927#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:41,621 INFO L290 TraceCheckUtils]: 60: Hoare triple {24927#(<= ~counter~0 6)} ~cond := #in~cond; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:41,622 INFO L290 TraceCheckUtils]: 61: Hoare triple {24927#(<= ~counter~0 6)} assume !(0 == ~cond); {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:41,622 INFO L290 TraceCheckUtils]: 62: Hoare triple {24927#(<= ~counter~0 6)} assume true; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:41,622 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24927#(<= ~counter~0 6)} {24927#(<= ~counter~0 6)} #71#return; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:41,623 INFO L290 TraceCheckUtils]: 64: Hoare triple {24927#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:41,623 INFO L290 TraceCheckUtils]: 65: Hoare triple {24927#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:41,623 INFO L290 TraceCheckUtils]: 66: Hoare triple {24927#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:41,624 INFO L290 TraceCheckUtils]: 67: Hoare triple {24955#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:41,624 INFO L272 TraceCheckUtils]: 68: Hoare triple {24955#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:41,624 INFO L290 TraceCheckUtils]: 69: Hoare triple {24955#(<= ~counter~0 7)} ~cond := #in~cond; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:41,625 INFO L290 TraceCheckUtils]: 70: Hoare triple {24955#(<= ~counter~0 7)} assume !(0 == ~cond); {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:41,625 INFO L290 TraceCheckUtils]: 71: Hoare triple {24955#(<= ~counter~0 7)} assume true; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:41,625 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24955#(<= ~counter~0 7)} {24955#(<= ~counter~0 7)} #71#return; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:41,626 INFO L290 TraceCheckUtils]: 73: Hoare triple {24955#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:41,626 INFO L290 TraceCheckUtils]: 74: Hoare triple {24955#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:41,626 INFO L290 TraceCheckUtils]: 75: Hoare triple {24955#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:41,627 INFO L290 TraceCheckUtils]: 76: Hoare triple {24983#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:41,627 INFO L272 TraceCheckUtils]: 77: Hoare triple {24983#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:41,627 INFO L290 TraceCheckUtils]: 78: Hoare triple {24983#(<= ~counter~0 8)} ~cond := #in~cond; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:41,628 INFO L290 TraceCheckUtils]: 79: Hoare triple {24983#(<= ~counter~0 8)} assume !(0 == ~cond); {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:41,628 INFO L290 TraceCheckUtils]: 80: Hoare triple {24983#(<= ~counter~0 8)} assume true; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:41,628 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {24983#(<= ~counter~0 8)} {24983#(<= ~counter~0 8)} #71#return; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:41,629 INFO L290 TraceCheckUtils]: 82: Hoare triple {24983#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:41,629 INFO L290 TraceCheckUtils]: 83: Hoare triple {24983#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:41,629 INFO L290 TraceCheckUtils]: 84: Hoare triple {24983#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:41,630 INFO L290 TraceCheckUtils]: 85: Hoare triple {25011#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:41,630 INFO L272 TraceCheckUtils]: 86: Hoare triple {25011#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:41,630 INFO L290 TraceCheckUtils]: 87: Hoare triple {25011#(<= ~counter~0 9)} ~cond := #in~cond; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:41,631 INFO L290 TraceCheckUtils]: 88: Hoare triple {25011#(<= ~counter~0 9)} assume !(0 == ~cond); {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:41,631 INFO L290 TraceCheckUtils]: 89: Hoare triple {25011#(<= ~counter~0 9)} assume true; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:41,631 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {25011#(<= ~counter~0 9)} {25011#(<= ~counter~0 9)} #71#return; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:41,632 INFO L290 TraceCheckUtils]: 91: Hoare triple {25011#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:41,632 INFO L290 TraceCheckUtils]: 92: Hoare triple {25011#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:41,632 INFO L290 TraceCheckUtils]: 93: Hoare triple {25011#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:41,632 INFO L290 TraceCheckUtils]: 94: Hoare triple {25039#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:41,633 INFO L272 TraceCheckUtils]: 95: Hoare triple {25039#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:41,633 INFO L290 TraceCheckUtils]: 96: Hoare triple {25039#(<= ~counter~0 10)} ~cond := #in~cond; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:41,634 INFO L290 TraceCheckUtils]: 97: Hoare triple {25039#(<= ~counter~0 10)} assume !(0 == ~cond); {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:41,634 INFO L290 TraceCheckUtils]: 98: Hoare triple {25039#(<= ~counter~0 10)} assume true; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:41,634 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {25039#(<= ~counter~0 10)} {25039#(<= ~counter~0 10)} #71#return; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:41,635 INFO L290 TraceCheckUtils]: 100: Hoare triple {25039#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:41,635 INFO L290 TraceCheckUtils]: 101: Hoare triple {25039#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:41,635 INFO L290 TraceCheckUtils]: 102: Hoare triple {25039#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:41,635 INFO L290 TraceCheckUtils]: 103: Hoare triple {25067#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:41,636 INFO L272 TraceCheckUtils]: 104: Hoare triple {25067#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:41,636 INFO L290 TraceCheckUtils]: 105: Hoare triple {25067#(<= ~counter~0 11)} ~cond := #in~cond; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:41,636 INFO L290 TraceCheckUtils]: 106: Hoare triple {25067#(<= ~counter~0 11)} assume !(0 == ~cond); {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:41,637 INFO L290 TraceCheckUtils]: 107: Hoare triple {25067#(<= ~counter~0 11)} assume true; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:41,637 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {25067#(<= ~counter~0 11)} {25067#(<= ~counter~0 11)} #71#return; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:41,637 INFO L290 TraceCheckUtils]: 109: Hoare triple {25067#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:41,638 INFO L290 TraceCheckUtils]: 110: Hoare triple {25067#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:41,638 INFO L290 TraceCheckUtils]: 111: Hoare triple {25067#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:41,638 INFO L290 TraceCheckUtils]: 112: Hoare triple {25095#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:41,639 INFO L272 TraceCheckUtils]: 113: Hoare triple {25095#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:41,639 INFO L290 TraceCheckUtils]: 114: Hoare triple {25095#(<= ~counter~0 12)} ~cond := #in~cond; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:41,639 INFO L290 TraceCheckUtils]: 115: Hoare triple {25095#(<= ~counter~0 12)} assume !(0 == ~cond); {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:41,640 INFO L290 TraceCheckUtils]: 116: Hoare triple {25095#(<= ~counter~0 12)} assume true; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:41,640 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {25095#(<= ~counter~0 12)} {25095#(<= ~counter~0 12)} #71#return; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:41,640 INFO L290 TraceCheckUtils]: 118: Hoare triple {25095#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:41,641 INFO L290 TraceCheckUtils]: 119: Hoare triple {25095#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:41,641 INFO L290 TraceCheckUtils]: 120: Hoare triple {25095#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:41,641 INFO L290 TraceCheckUtils]: 121: Hoare triple {25123#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:41,642 INFO L272 TraceCheckUtils]: 122: Hoare triple {25123#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:41,642 INFO L290 TraceCheckUtils]: 123: Hoare triple {25123#(<= ~counter~0 13)} ~cond := #in~cond; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:41,642 INFO L290 TraceCheckUtils]: 124: Hoare triple {25123#(<= ~counter~0 13)} assume !(0 == ~cond); {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:41,643 INFO L290 TraceCheckUtils]: 125: Hoare triple {25123#(<= ~counter~0 13)} assume true; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:41,643 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {25123#(<= ~counter~0 13)} {25123#(<= ~counter~0 13)} #71#return; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:41,643 INFO L290 TraceCheckUtils]: 127: Hoare triple {25123#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:41,644 INFO L290 TraceCheckUtils]: 128: Hoare triple {25123#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:41,644 INFO L290 TraceCheckUtils]: 129: Hoare triple {25123#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:41,644 INFO L290 TraceCheckUtils]: 130: Hoare triple {25151#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:41,645 INFO L272 TraceCheckUtils]: 131: Hoare triple {25151#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:41,645 INFO L290 TraceCheckUtils]: 132: Hoare triple {25151#(<= ~counter~0 14)} ~cond := #in~cond; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:41,645 INFO L290 TraceCheckUtils]: 133: Hoare triple {25151#(<= ~counter~0 14)} assume !(0 == ~cond); {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:41,646 INFO L290 TraceCheckUtils]: 134: Hoare triple {25151#(<= ~counter~0 14)} assume true; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:41,646 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {25151#(<= ~counter~0 14)} {25151#(<= ~counter~0 14)} #71#return; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:41,646 INFO L290 TraceCheckUtils]: 136: Hoare triple {25151#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:41,647 INFO L290 TraceCheckUtils]: 137: Hoare triple {25151#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:41,647 INFO L290 TraceCheckUtils]: 138: Hoare triple {25151#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25179#(<= |main_#t~post6| 14)} is VALID [2022-04-08 14:06:41,647 INFO L290 TraceCheckUtils]: 139: Hoare triple {25179#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {24746#false} is VALID [2022-04-08 14:06:41,647 INFO L272 TraceCheckUtils]: 140: Hoare triple {24746#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {24746#false} is VALID [2022-04-08 14:06:41,647 INFO L290 TraceCheckUtils]: 141: Hoare triple {24746#false} ~cond := #in~cond; {24746#false} is VALID [2022-04-08 14:06:41,647 INFO L290 TraceCheckUtils]: 142: Hoare triple {24746#false} assume 0 == ~cond; {24746#false} is VALID [2022-04-08 14:06:41,648 INFO L290 TraceCheckUtils]: 143: Hoare triple {24746#false} assume !false; {24746#false} is VALID [2022-04-08 14:06:41,648 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 28 proven. 847 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:06:41,648 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:06:42,246 INFO L290 TraceCheckUtils]: 143: Hoare triple {24746#false} assume !false; {24746#false} is VALID [2022-04-08 14:06:42,246 INFO L290 TraceCheckUtils]: 142: Hoare triple {24746#false} assume 0 == ~cond; {24746#false} is VALID [2022-04-08 14:06:42,246 INFO L290 TraceCheckUtils]: 141: Hoare triple {24746#false} ~cond := #in~cond; {24746#false} is VALID [2022-04-08 14:06:42,246 INFO L272 TraceCheckUtils]: 140: Hoare triple {24746#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {24746#false} is VALID [2022-04-08 14:06:42,246 INFO L290 TraceCheckUtils]: 139: Hoare triple {25207#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {24746#false} is VALID [2022-04-08 14:06:42,247 INFO L290 TraceCheckUtils]: 138: Hoare triple {25211#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25207#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:06:42,247 INFO L290 TraceCheckUtils]: 137: Hoare triple {25211#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25211#(< ~counter~0 20)} is VALID [2022-04-08 14:06:42,247 INFO L290 TraceCheckUtils]: 136: Hoare triple {25211#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {25211#(< ~counter~0 20)} is VALID [2022-04-08 14:06:42,248 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {24745#true} {25211#(< ~counter~0 20)} #71#return; {25211#(< ~counter~0 20)} is VALID [2022-04-08 14:06:42,248 INFO L290 TraceCheckUtils]: 134: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,248 INFO L290 TraceCheckUtils]: 133: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,248 INFO L290 TraceCheckUtils]: 132: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,248 INFO L272 TraceCheckUtils]: 131: Hoare triple {25211#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,249 INFO L290 TraceCheckUtils]: 130: Hoare triple {25211#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {25211#(< ~counter~0 20)} is VALID [2022-04-08 14:06:42,249 INFO L290 TraceCheckUtils]: 129: Hoare triple {25239#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25211#(< ~counter~0 20)} is VALID [2022-04-08 14:06:42,250 INFO L290 TraceCheckUtils]: 128: Hoare triple {25239#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25239#(< ~counter~0 19)} is VALID [2022-04-08 14:06:42,250 INFO L290 TraceCheckUtils]: 127: Hoare triple {25239#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {25239#(< ~counter~0 19)} is VALID [2022-04-08 14:06:42,250 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {24745#true} {25239#(< ~counter~0 19)} #71#return; {25239#(< ~counter~0 19)} is VALID [2022-04-08 14:06:42,250 INFO L290 TraceCheckUtils]: 125: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,250 INFO L290 TraceCheckUtils]: 124: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,251 INFO L290 TraceCheckUtils]: 123: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,251 INFO L272 TraceCheckUtils]: 122: Hoare triple {25239#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,251 INFO L290 TraceCheckUtils]: 121: Hoare triple {25239#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {25239#(< ~counter~0 19)} is VALID [2022-04-08 14:06:42,251 INFO L290 TraceCheckUtils]: 120: Hoare triple {25267#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25239#(< ~counter~0 19)} is VALID [2022-04-08 14:06:42,252 INFO L290 TraceCheckUtils]: 119: Hoare triple {25267#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25267#(< ~counter~0 18)} is VALID [2022-04-08 14:06:42,252 INFO L290 TraceCheckUtils]: 118: Hoare triple {25267#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {25267#(< ~counter~0 18)} is VALID [2022-04-08 14:06:42,252 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {24745#true} {25267#(< ~counter~0 18)} #71#return; {25267#(< ~counter~0 18)} is VALID [2022-04-08 14:06:42,252 INFO L290 TraceCheckUtils]: 116: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,252 INFO L290 TraceCheckUtils]: 115: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,253 INFO L290 TraceCheckUtils]: 114: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,253 INFO L272 TraceCheckUtils]: 113: Hoare triple {25267#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,253 INFO L290 TraceCheckUtils]: 112: Hoare triple {25267#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {25267#(< ~counter~0 18)} is VALID [2022-04-08 14:06:42,253 INFO L290 TraceCheckUtils]: 111: Hoare triple {25295#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25267#(< ~counter~0 18)} is VALID [2022-04-08 14:06:42,254 INFO L290 TraceCheckUtils]: 110: Hoare triple {25295#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25295#(< ~counter~0 17)} is VALID [2022-04-08 14:06:42,254 INFO L290 TraceCheckUtils]: 109: Hoare triple {25295#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {25295#(< ~counter~0 17)} is VALID [2022-04-08 14:06:42,254 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {24745#true} {25295#(< ~counter~0 17)} #71#return; {25295#(< ~counter~0 17)} is VALID [2022-04-08 14:06:42,254 INFO L290 TraceCheckUtils]: 107: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,254 INFO L290 TraceCheckUtils]: 106: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,255 INFO L290 TraceCheckUtils]: 105: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,255 INFO L272 TraceCheckUtils]: 104: Hoare triple {25295#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,255 INFO L290 TraceCheckUtils]: 103: Hoare triple {25295#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {25295#(< ~counter~0 17)} is VALID [2022-04-08 14:06:42,255 INFO L290 TraceCheckUtils]: 102: Hoare triple {25323#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25295#(< ~counter~0 17)} is VALID [2022-04-08 14:06:42,256 INFO L290 TraceCheckUtils]: 101: Hoare triple {25323#(< ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25323#(< ~counter~0 16)} is VALID [2022-04-08 14:06:42,256 INFO L290 TraceCheckUtils]: 100: Hoare triple {25323#(< ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {25323#(< ~counter~0 16)} is VALID [2022-04-08 14:06:42,256 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {24745#true} {25323#(< ~counter~0 16)} #71#return; {25323#(< ~counter~0 16)} is VALID [2022-04-08 14:06:42,256 INFO L290 TraceCheckUtils]: 98: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,256 INFO L290 TraceCheckUtils]: 97: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,257 INFO L290 TraceCheckUtils]: 96: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,257 INFO L272 TraceCheckUtils]: 95: Hoare triple {25323#(< ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,257 INFO L290 TraceCheckUtils]: 94: Hoare triple {25323#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {25323#(< ~counter~0 16)} is VALID [2022-04-08 14:06:42,257 INFO L290 TraceCheckUtils]: 93: Hoare triple {25151#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25323#(< ~counter~0 16)} is VALID [2022-04-08 14:06:42,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {25151#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:42,258 INFO L290 TraceCheckUtils]: 91: Hoare triple {25151#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:42,258 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {24745#true} {25151#(<= ~counter~0 14)} #71#return; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:42,258 INFO L290 TraceCheckUtils]: 89: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,258 INFO L290 TraceCheckUtils]: 88: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,258 INFO L290 TraceCheckUtils]: 87: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,259 INFO L272 TraceCheckUtils]: 86: Hoare triple {25151#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,259 INFO L290 TraceCheckUtils]: 85: Hoare triple {25151#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:42,259 INFO L290 TraceCheckUtils]: 84: Hoare triple {25123#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25151#(<= ~counter~0 14)} is VALID [2022-04-08 14:06:42,260 INFO L290 TraceCheckUtils]: 83: Hoare triple {25123#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:42,260 INFO L290 TraceCheckUtils]: 82: Hoare triple {25123#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:42,260 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {24745#true} {25123#(<= ~counter~0 13)} #71#return; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:42,260 INFO L290 TraceCheckUtils]: 80: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,260 INFO L290 TraceCheckUtils]: 79: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,260 INFO L290 TraceCheckUtils]: 78: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,261 INFO L272 TraceCheckUtils]: 77: Hoare triple {25123#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,261 INFO L290 TraceCheckUtils]: 76: Hoare triple {25123#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:42,261 INFO L290 TraceCheckUtils]: 75: Hoare triple {25095#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25123#(<= ~counter~0 13)} is VALID [2022-04-08 14:06:42,261 INFO L290 TraceCheckUtils]: 74: Hoare triple {25095#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:42,262 INFO L290 TraceCheckUtils]: 73: Hoare triple {25095#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:42,262 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {24745#true} {25095#(<= ~counter~0 12)} #71#return; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:42,262 INFO L290 TraceCheckUtils]: 71: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,262 INFO L290 TraceCheckUtils]: 70: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,262 INFO L290 TraceCheckUtils]: 69: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,263 INFO L272 TraceCheckUtils]: 68: Hoare triple {25095#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,263 INFO L290 TraceCheckUtils]: 67: Hoare triple {25095#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:42,263 INFO L290 TraceCheckUtils]: 66: Hoare triple {25067#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25095#(<= ~counter~0 12)} is VALID [2022-04-08 14:06:42,263 INFO L290 TraceCheckUtils]: 65: Hoare triple {25067#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:42,264 INFO L290 TraceCheckUtils]: 64: Hoare triple {25067#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:42,264 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24745#true} {25067#(<= ~counter~0 11)} #71#return; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:42,264 INFO L290 TraceCheckUtils]: 62: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,264 INFO L290 TraceCheckUtils]: 61: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,264 INFO L290 TraceCheckUtils]: 60: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,265 INFO L272 TraceCheckUtils]: 59: Hoare triple {25067#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,265 INFO L290 TraceCheckUtils]: 58: Hoare triple {25067#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:42,265 INFO L290 TraceCheckUtils]: 57: Hoare triple {25039#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25067#(<= ~counter~0 11)} is VALID [2022-04-08 14:06:42,265 INFO L290 TraceCheckUtils]: 56: Hoare triple {25039#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:42,266 INFO L290 TraceCheckUtils]: 55: Hoare triple {25039#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:42,266 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {24745#true} {25039#(<= ~counter~0 10)} #71#return; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:42,266 INFO L290 TraceCheckUtils]: 53: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,266 INFO L290 TraceCheckUtils]: 52: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,266 INFO L290 TraceCheckUtils]: 51: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,267 INFO L272 TraceCheckUtils]: 50: Hoare triple {25039#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,267 INFO L290 TraceCheckUtils]: 49: Hoare triple {25039#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:42,267 INFO L290 TraceCheckUtils]: 48: Hoare triple {25011#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25039#(<= ~counter~0 10)} is VALID [2022-04-08 14:06:42,267 INFO L290 TraceCheckUtils]: 47: Hoare triple {25011#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:42,268 INFO L290 TraceCheckUtils]: 46: Hoare triple {25011#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:42,268 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {24745#true} {25011#(<= ~counter~0 9)} #71#return; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:42,268 INFO L290 TraceCheckUtils]: 44: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,268 INFO L290 TraceCheckUtils]: 43: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,268 INFO L290 TraceCheckUtils]: 42: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,269 INFO L272 TraceCheckUtils]: 41: Hoare triple {25011#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,269 INFO L290 TraceCheckUtils]: 40: Hoare triple {25011#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:42,269 INFO L290 TraceCheckUtils]: 39: Hoare triple {24983#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {25011#(<= ~counter~0 9)} is VALID [2022-04-08 14:06:42,269 INFO L290 TraceCheckUtils]: 38: Hoare triple {24983#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:42,270 INFO L290 TraceCheckUtils]: 37: Hoare triple {24983#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:42,270 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {24745#true} {24983#(<= ~counter~0 8)} #71#return; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:42,270 INFO L290 TraceCheckUtils]: 35: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,270 INFO L290 TraceCheckUtils]: 34: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,270 INFO L290 TraceCheckUtils]: 33: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,271 INFO L272 TraceCheckUtils]: 32: Hoare triple {24983#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,271 INFO L290 TraceCheckUtils]: 31: Hoare triple {24983#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:42,271 INFO L290 TraceCheckUtils]: 30: Hoare triple {24955#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24983#(<= ~counter~0 8)} is VALID [2022-04-08 14:06:42,271 INFO L290 TraceCheckUtils]: 29: Hoare triple {24955#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:42,272 INFO L290 TraceCheckUtils]: 28: Hoare triple {24955#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:42,272 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {24745#true} {24955#(<= ~counter~0 7)} #71#return; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:42,272 INFO L290 TraceCheckUtils]: 26: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,272 INFO L290 TraceCheckUtils]: 25: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,272 INFO L290 TraceCheckUtils]: 24: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,272 INFO L272 TraceCheckUtils]: 23: Hoare triple {24955#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,273 INFO L290 TraceCheckUtils]: 22: Hoare triple {24955#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:42,273 INFO L290 TraceCheckUtils]: 21: Hoare triple {24927#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24955#(<= ~counter~0 7)} is VALID [2022-04-08 14:06:42,273 INFO L290 TraceCheckUtils]: 20: Hoare triple {24927#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:42,274 INFO L290 TraceCheckUtils]: 19: Hoare triple {24927#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:42,274 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {24745#true} {24927#(<= ~counter~0 6)} #71#return; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:42,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,274 INFO L290 TraceCheckUtils]: 15: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,274 INFO L272 TraceCheckUtils]: 14: Hoare triple {24927#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,275 INFO L290 TraceCheckUtils]: 13: Hoare triple {24927#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:42,275 INFO L290 TraceCheckUtils]: 12: Hoare triple {24899#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24927#(<= ~counter~0 6)} is VALID [2022-04-08 14:06:42,275 INFO L290 TraceCheckUtils]: 11: Hoare triple {24899#(<= ~counter~0 5)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:42,276 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24745#true} {24899#(<= ~counter~0 5)} #69#return; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:42,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {24745#true} assume true; {24745#true} is VALID [2022-04-08 14:06:42,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {24745#true} assume !(0 == ~cond); {24745#true} is VALID [2022-04-08 14:06:42,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {24745#true} ~cond := #in~cond; {24745#true} is VALID [2022-04-08 14:06:42,276 INFO L272 TraceCheckUtils]: 6: Hoare triple {24899#(<= ~counter~0 5)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {24745#true} is VALID [2022-04-08 14:06:42,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {24899#(<= ~counter~0 5)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:42,277 INFO L272 TraceCheckUtils]: 4: Hoare triple {24899#(<= ~counter~0 5)} call #t~ret7 := main(); {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:42,277 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24899#(<= ~counter~0 5)} {24745#true} #77#return; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:42,277 INFO L290 TraceCheckUtils]: 2: Hoare triple {24899#(<= ~counter~0 5)} assume true; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:42,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {24745#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {24899#(<= ~counter~0 5)} is VALID [2022-04-08 14:06:42,278 INFO L272 TraceCheckUtils]: 0: Hoare triple {24745#true} call ULTIMATE.init(); {24745#true} is VALID [2022-04-08 14:06:42,278 INFO L134 CoverageAnalysis]: Checked inductivity of 875 backedges. 28 proven. 483 refuted. 0 times theorem prover too weak. 364 trivial. 0 not checked. [2022-04-08 14:06:42,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:06:42,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645593976] [2022-04-08 14:06:42,278 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:06:42,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [847856410] [2022-04-08 14:06:42,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [847856410] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:06:42,279 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:06:42,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-08 14:06:42,279 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:06:42,279 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1993378403] [2022-04-08 14:06:42,279 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1993378403] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:06:42,279 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:06:42,279 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 14:06:42,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330965932] [2022-04-08 14:06:42,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:06:42,279 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 144 [2022-04-08 14:06:42,280 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:06:42,280 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:06:42,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:06:42,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 14:06:42,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:06:42,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 14:06:42,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:06:42,376 INFO L87 Difference]: Start difference. First operand 186 states and 230 transitions. Second operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:06:43,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:06:43,164 INFO L93 Difference]: Finished difference Result 205 states and 253 transitions. [2022-04-08 14:06:43,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 14:06:43,164 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Word has length 144 [2022-04-08 14:06:43,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:06:43,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:06:43,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 239 transitions. [2022-04-08 14:06:43,167 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:06:43,169 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 239 transitions. [2022-04-08 14:06:43,170 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 239 transitions. [2022-04-08 14:06:43,356 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:06:43,359 INFO L225 Difference]: With dead ends: 205 [2022-04-08 14:06:43,359 INFO L226 Difference]: Without dead ends: 197 [2022-04-08 14:06:43,359 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 301 GetRequests, 264 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=558, Invalid=848, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 14:06:43,360 INFO L913 BasicCegarLoop]: 44 mSDtfsCounter, 177 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 82 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 82 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:06:43,360 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 262 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 82 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:06:43,360 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 197 states. [2022-04-08 14:06:43,670 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 197 to 197. [2022-04-08 14:06:43,670 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:06:43,671 INFO L82 GeneralOperation]: Start isEquivalent. First operand 197 states. Second operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:06:43,671 INFO L74 IsIncluded]: Start isIncluded. First operand 197 states. Second operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:06:43,671 INFO L87 Difference]: Start difference. First operand 197 states. Second operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:06:43,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:06:43,673 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2022-04-08 14:06:43,673 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-08 14:06:43,674 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:06:43,674 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:06:43,674 INFO L74 IsIncluded]: Start isIncluded. First operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 197 states. [2022-04-08 14:06:43,674 INFO L87 Difference]: Start difference. First operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 197 states. [2022-04-08 14:06:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:06:43,676 INFO L93 Difference]: Finished difference Result 197 states and 244 transitions. [2022-04-08 14:06:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-08 14:06:43,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:06:43,676 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:06:43,676 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:06:43,676 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:06:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 197 states, 156 states have (on average 1.3076923076923077) internal successors, (204), 157 states have internal predecessors, (204), 21 states have call successors, (21), 20 states have call predecessors, (21), 19 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:06:43,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 197 states to 197 states and 244 transitions. [2022-04-08 14:06:43,679 INFO L78 Accepts]: Start accepts. Automaton has 197 states and 244 transitions. Word has length 144 [2022-04-08 14:06:43,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:06:43,679 INFO L478 AbstractCegarLoop]: Abstraction has 197 states and 244 transitions. [2022-04-08 14:06:43,679 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-08 14:06:43,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 197 states and 244 transitions. [2022-04-08 14:07:13,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 230 inductive. 0 not inductive. 14 times theorem prover too weak to decide inductivity. [2022-04-08 14:07:13,995 INFO L276 IsEmpty]: Start isEmpty. Operand 197 states and 244 transitions. [2022-04-08 14:07:13,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-08 14:07:13,995 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:07:13,995 INFO L499 BasicCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:07:14,012 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-08 14:07:14,203 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-08 14:07:14,203 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:07:14,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:07:14,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1855494722, now seen corresponding path program 29 times [2022-04-08 14:07:14,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:07:14,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [849130402] [2022-04-08 14:07:18,282 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:07:18,282 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:07:18,282 INFO L85 PathProgramCache]: Analyzing trace with hash 1855494722, now seen corresponding path program 30 times [2022-04-08 14:07:18,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:07:18,282 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [57868605] [2022-04-08 14:07:18,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:07:18,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:07:18,300 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:07:18,300 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [360937050] [2022-04-08 14:07:18,301 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:07:18,301 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:07:18,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:07:18,301 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:07:18,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-08 14:07:18,497 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 14:07:18,497 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:07:18,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 14:07:18,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:07:18,526 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:07:19,238 INFO L272 TraceCheckUtils]: 0: Hoare triple {26858#true} call ULTIMATE.init(); {26858#true} is VALID [2022-04-08 14:07:19,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {26858#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {26866#(<= ~counter~0 0)} assume true; {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26866#(<= ~counter~0 0)} {26858#true} #77#return; {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {26866#(<= ~counter~0 0)} call #t~ret7 := main(); {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {26866#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {26866#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {26866#(<= ~counter~0 0)} ~cond := #in~cond; {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {26866#(<= ~counter~0 0)} assume !(0 == ~cond); {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {26866#(<= ~counter~0 0)} assume true; {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,242 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26866#(<= ~counter~0 0)} {26866#(<= ~counter~0 0)} #69#return; {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,243 INFO L290 TraceCheckUtils]: 11: Hoare triple {26866#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {26866#(<= ~counter~0 0)} is VALID [2022-04-08 14:07:19,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {26866#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26900#(<= ~counter~0 1)} is VALID [2022-04-08 14:07:19,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {26900#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {26900#(<= ~counter~0 1)} is VALID [2022-04-08 14:07:19,244 INFO L272 TraceCheckUtils]: 14: Hoare triple {26900#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26900#(<= ~counter~0 1)} is VALID [2022-04-08 14:07:19,245 INFO L290 TraceCheckUtils]: 15: Hoare triple {26900#(<= ~counter~0 1)} ~cond := #in~cond; {26900#(<= ~counter~0 1)} is VALID [2022-04-08 14:07:19,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {26900#(<= ~counter~0 1)} assume !(0 == ~cond); {26900#(<= ~counter~0 1)} is VALID [2022-04-08 14:07:19,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {26900#(<= ~counter~0 1)} assume true; {26900#(<= ~counter~0 1)} is VALID [2022-04-08 14:07:19,246 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26900#(<= ~counter~0 1)} {26900#(<= ~counter~0 1)} #71#return; {26900#(<= ~counter~0 1)} is VALID [2022-04-08 14:07:19,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {26900#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {26900#(<= ~counter~0 1)} is VALID [2022-04-08 14:07:19,246 INFO L290 TraceCheckUtils]: 20: Hoare triple {26900#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26900#(<= ~counter~0 1)} is VALID [2022-04-08 14:07:19,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {26900#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26928#(<= ~counter~0 2)} is VALID [2022-04-08 14:07:19,247 INFO L290 TraceCheckUtils]: 22: Hoare triple {26928#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {26928#(<= ~counter~0 2)} is VALID [2022-04-08 14:07:19,247 INFO L272 TraceCheckUtils]: 23: Hoare triple {26928#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26928#(<= ~counter~0 2)} is VALID [2022-04-08 14:07:19,248 INFO L290 TraceCheckUtils]: 24: Hoare triple {26928#(<= ~counter~0 2)} ~cond := #in~cond; {26928#(<= ~counter~0 2)} is VALID [2022-04-08 14:07:19,248 INFO L290 TraceCheckUtils]: 25: Hoare triple {26928#(<= ~counter~0 2)} assume !(0 == ~cond); {26928#(<= ~counter~0 2)} is VALID [2022-04-08 14:07:19,248 INFO L290 TraceCheckUtils]: 26: Hoare triple {26928#(<= ~counter~0 2)} assume true; {26928#(<= ~counter~0 2)} is VALID [2022-04-08 14:07:19,249 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26928#(<= ~counter~0 2)} {26928#(<= ~counter~0 2)} #71#return; {26928#(<= ~counter~0 2)} is VALID [2022-04-08 14:07:19,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {26928#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {26928#(<= ~counter~0 2)} is VALID [2022-04-08 14:07:19,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {26928#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26928#(<= ~counter~0 2)} is VALID [2022-04-08 14:07:19,250 INFO L290 TraceCheckUtils]: 30: Hoare triple {26928#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26956#(<= ~counter~0 3)} is VALID [2022-04-08 14:07:19,250 INFO L290 TraceCheckUtils]: 31: Hoare triple {26956#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {26956#(<= ~counter~0 3)} is VALID [2022-04-08 14:07:19,250 INFO L272 TraceCheckUtils]: 32: Hoare triple {26956#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26956#(<= ~counter~0 3)} is VALID [2022-04-08 14:07:19,251 INFO L290 TraceCheckUtils]: 33: Hoare triple {26956#(<= ~counter~0 3)} ~cond := #in~cond; {26956#(<= ~counter~0 3)} is VALID [2022-04-08 14:07:19,251 INFO L290 TraceCheckUtils]: 34: Hoare triple {26956#(<= ~counter~0 3)} assume !(0 == ~cond); {26956#(<= ~counter~0 3)} is VALID [2022-04-08 14:07:19,251 INFO L290 TraceCheckUtils]: 35: Hoare triple {26956#(<= ~counter~0 3)} assume true; {26956#(<= ~counter~0 3)} is VALID [2022-04-08 14:07:19,252 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26956#(<= ~counter~0 3)} {26956#(<= ~counter~0 3)} #71#return; {26956#(<= ~counter~0 3)} is VALID [2022-04-08 14:07:19,252 INFO L290 TraceCheckUtils]: 37: Hoare triple {26956#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {26956#(<= ~counter~0 3)} is VALID [2022-04-08 14:07:19,252 INFO L290 TraceCheckUtils]: 38: Hoare triple {26956#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26956#(<= ~counter~0 3)} is VALID [2022-04-08 14:07:19,253 INFO L290 TraceCheckUtils]: 39: Hoare triple {26956#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,253 INFO L290 TraceCheckUtils]: 40: Hoare triple {26984#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,254 INFO L272 TraceCheckUtils]: 41: Hoare triple {26984#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,254 INFO L290 TraceCheckUtils]: 42: Hoare triple {26984#(<= ~counter~0 4)} ~cond := #in~cond; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,254 INFO L290 TraceCheckUtils]: 43: Hoare triple {26984#(<= ~counter~0 4)} assume !(0 == ~cond); {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,254 INFO L290 TraceCheckUtils]: 44: Hoare triple {26984#(<= ~counter~0 4)} assume true; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,255 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {26984#(<= ~counter~0 4)} {26984#(<= ~counter~0 4)} #71#return; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,255 INFO L290 TraceCheckUtils]: 46: Hoare triple {26984#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,255 INFO L290 TraceCheckUtils]: 47: Hoare triple {26984#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,256 INFO L290 TraceCheckUtils]: 48: Hoare triple {26984#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,256 INFO L290 TraceCheckUtils]: 49: Hoare triple {27012#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,257 INFO L272 TraceCheckUtils]: 50: Hoare triple {27012#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,257 INFO L290 TraceCheckUtils]: 51: Hoare triple {27012#(<= ~counter~0 5)} ~cond := #in~cond; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,257 INFO L290 TraceCheckUtils]: 52: Hoare triple {27012#(<= ~counter~0 5)} assume !(0 == ~cond); {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,257 INFO L290 TraceCheckUtils]: 53: Hoare triple {27012#(<= ~counter~0 5)} assume true; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,258 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {27012#(<= ~counter~0 5)} {27012#(<= ~counter~0 5)} #71#return; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,258 INFO L290 TraceCheckUtils]: 55: Hoare triple {27012#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,258 INFO L290 TraceCheckUtils]: 56: Hoare triple {27012#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,259 INFO L290 TraceCheckUtils]: 57: Hoare triple {27012#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,259 INFO L290 TraceCheckUtils]: 58: Hoare triple {27040#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,260 INFO L272 TraceCheckUtils]: 59: Hoare triple {27040#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,260 INFO L290 TraceCheckUtils]: 60: Hoare triple {27040#(<= ~counter~0 6)} ~cond := #in~cond; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,260 INFO L290 TraceCheckUtils]: 61: Hoare triple {27040#(<= ~counter~0 6)} assume !(0 == ~cond); {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,260 INFO L290 TraceCheckUtils]: 62: Hoare triple {27040#(<= ~counter~0 6)} assume true; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,261 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {27040#(<= ~counter~0 6)} {27040#(<= ~counter~0 6)} #71#return; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,261 INFO L290 TraceCheckUtils]: 64: Hoare triple {27040#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,262 INFO L290 TraceCheckUtils]: 65: Hoare triple {27040#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,262 INFO L290 TraceCheckUtils]: 66: Hoare triple {27040#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,262 INFO L290 TraceCheckUtils]: 67: Hoare triple {27068#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,263 INFO L272 TraceCheckUtils]: 68: Hoare triple {27068#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,263 INFO L290 TraceCheckUtils]: 69: Hoare triple {27068#(<= ~counter~0 7)} ~cond := #in~cond; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,263 INFO L290 TraceCheckUtils]: 70: Hoare triple {27068#(<= ~counter~0 7)} assume !(0 == ~cond); {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,264 INFO L290 TraceCheckUtils]: 71: Hoare triple {27068#(<= ~counter~0 7)} assume true; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,264 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {27068#(<= ~counter~0 7)} {27068#(<= ~counter~0 7)} #71#return; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,264 INFO L290 TraceCheckUtils]: 73: Hoare triple {27068#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,265 INFO L290 TraceCheckUtils]: 74: Hoare triple {27068#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,265 INFO L290 TraceCheckUtils]: 75: Hoare triple {27068#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,265 INFO L290 TraceCheckUtils]: 76: Hoare triple {27096#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,266 INFO L272 TraceCheckUtils]: 77: Hoare triple {27096#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,266 INFO L290 TraceCheckUtils]: 78: Hoare triple {27096#(<= ~counter~0 8)} ~cond := #in~cond; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,266 INFO L290 TraceCheckUtils]: 79: Hoare triple {27096#(<= ~counter~0 8)} assume !(0 == ~cond); {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,267 INFO L290 TraceCheckUtils]: 80: Hoare triple {27096#(<= ~counter~0 8)} assume true; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,267 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {27096#(<= ~counter~0 8)} {27096#(<= ~counter~0 8)} #71#return; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,267 INFO L290 TraceCheckUtils]: 82: Hoare triple {27096#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,268 INFO L290 TraceCheckUtils]: 83: Hoare triple {27096#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,268 INFO L290 TraceCheckUtils]: 84: Hoare triple {27096#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,268 INFO L290 TraceCheckUtils]: 85: Hoare triple {27124#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,269 INFO L272 TraceCheckUtils]: 86: Hoare triple {27124#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,269 INFO L290 TraceCheckUtils]: 87: Hoare triple {27124#(<= ~counter~0 9)} ~cond := #in~cond; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,269 INFO L290 TraceCheckUtils]: 88: Hoare triple {27124#(<= ~counter~0 9)} assume !(0 == ~cond); {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,270 INFO L290 TraceCheckUtils]: 89: Hoare triple {27124#(<= ~counter~0 9)} assume true; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,270 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {27124#(<= ~counter~0 9)} {27124#(<= ~counter~0 9)} #71#return; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,270 INFO L290 TraceCheckUtils]: 91: Hoare triple {27124#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,271 INFO L290 TraceCheckUtils]: 92: Hoare triple {27124#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,271 INFO L290 TraceCheckUtils]: 93: Hoare triple {27124#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,271 INFO L290 TraceCheckUtils]: 94: Hoare triple {27152#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,272 INFO L272 TraceCheckUtils]: 95: Hoare triple {27152#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,272 INFO L290 TraceCheckUtils]: 96: Hoare triple {27152#(<= ~counter~0 10)} ~cond := #in~cond; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,272 INFO L290 TraceCheckUtils]: 97: Hoare triple {27152#(<= ~counter~0 10)} assume !(0 == ~cond); {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,273 INFO L290 TraceCheckUtils]: 98: Hoare triple {27152#(<= ~counter~0 10)} assume true; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,273 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {27152#(<= ~counter~0 10)} {27152#(<= ~counter~0 10)} #71#return; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,273 INFO L290 TraceCheckUtils]: 100: Hoare triple {27152#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,274 INFO L290 TraceCheckUtils]: 101: Hoare triple {27152#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,274 INFO L290 TraceCheckUtils]: 102: Hoare triple {27152#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,274 INFO L290 TraceCheckUtils]: 103: Hoare triple {27180#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,275 INFO L272 TraceCheckUtils]: 104: Hoare triple {27180#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,275 INFO L290 TraceCheckUtils]: 105: Hoare triple {27180#(<= ~counter~0 11)} ~cond := #in~cond; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,275 INFO L290 TraceCheckUtils]: 106: Hoare triple {27180#(<= ~counter~0 11)} assume !(0 == ~cond); {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,276 INFO L290 TraceCheckUtils]: 107: Hoare triple {27180#(<= ~counter~0 11)} assume true; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,276 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {27180#(<= ~counter~0 11)} {27180#(<= ~counter~0 11)} #71#return; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,276 INFO L290 TraceCheckUtils]: 109: Hoare triple {27180#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,277 INFO L290 TraceCheckUtils]: 110: Hoare triple {27180#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,277 INFO L290 TraceCheckUtils]: 111: Hoare triple {27180#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,277 INFO L290 TraceCheckUtils]: 112: Hoare triple {27208#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,278 INFO L272 TraceCheckUtils]: 113: Hoare triple {27208#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,278 INFO L290 TraceCheckUtils]: 114: Hoare triple {27208#(<= ~counter~0 12)} ~cond := #in~cond; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,278 INFO L290 TraceCheckUtils]: 115: Hoare triple {27208#(<= ~counter~0 12)} assume !(0 == ~cond); {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,279 INFO L290 TraceCheckUtils]: 116: Hoare triple {27208#(<= ~counter~0 12)} assume true; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,279 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {27208#(<= ~counter~0 12)} {27208#(<= ~counter~0 12)} #71#return; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,279 INFO L290 TraceCheckUtils]: 118: Hoare triple {27208#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,280 INFO L290 TraceCheckUtils]: 119: Hoare triple {27208#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,280 INFO L290 TraceCheckUtils]: 120: Hoare triple {27208#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,280 INFO L290 TraceCheckUtils]: 121: Hoare triple {27236#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,281 INFO L272 TraceCheckUtils]: 122: Hoare triple {27236#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,281 INFO L290 TraceCheckUtils]: 123: Hoare triple {27236#(<= ~counter~0 13)} ~cond := #in~cond; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,281 INFO L290 TraceCheckUtils]: 124: Hoare triple {27236#(<= ~counter~0 13)} assume !(0 == ~cond); {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,282 INFO L290 TraceCheckUtils]: 125: Hoare triple {27236#(<= ~counter~0 13)} assume true; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,282 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {27236#(<= ~counter~0 13)} {27236#(<= ~counter~0 13)} #71#return; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,283 INFO L290 TraceCheckUtils]: 127: Hoare triple {27236#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,283 INFO L290 TraceCheckUtils]: 128: Hoare triple {27236#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,283 INFO L290 TraceCheckUtils]: 129: Hoare triple {27236#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,284 INFO L290 TraceCheckUtils]: 130: Hoare triple {27264#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,284 INFO L272 TraceCheckUtils]: 131: Hoare triple {27264#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,284 INFO L290 TraceCheckUtils]: 132: Hoare triple {27264#(<= ~counter~0 14)} ~cond := #in~cond; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,285 INFO L290 TraceCheckUtils]: 133: Hoare triple {27264#(<= ~counter~0 14)} assume !(0 == ~cond); {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,285 INFO L290 TraceCheckUtils]: 134: Hoare triple {27264#(<= ~counter~0 14)} assume true; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,285 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {27264#(<= ~counter~0 14)} {27264#(<= ~counter~0 14)} #71#return; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,286 INFO L290 TraceCheckUtils]: 136: Hoare triple {27264#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,286 INFO L290 TraceCheckUtils]: 137: Hoare triple {27264#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,286 INFO L290 TraceCheckUtils]: 138: Hoare triple {27264#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,287 INFO L290 TraceCheckUtils]: 139: Hoare triple {27292#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,287 INFO L272 TraceCheckUtils]: 140: Hoare triple {27292#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,288 INFO L290 TraceCheckUtils]: 141: Hoare triple {27292#(<= ~counter~0 15)} ~cond := #in~cond; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,288 INFO L290 TraceCheckUtils]: 142: Hoare triple {27292#(<= ~counter~0 15)} assume !(0 == ~cond); {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,288 INFO L290 TraceCheckUtils]: 143: Hoare triple {27292#(<= ~counter~0 15)} assume true; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,289 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {27292#(<= ~counter~0 15)} {27292#(<= ~counter~0 15)} #71#return; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,289 INFO L290 TraceCheckUtils]: 145: Hoare triple {27292#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,289 INFO L290 TraceCheckUtils]: 146: Hoare triple {27292#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,290 INFO L290 TraceCheckUtils]: 147: Hoare triple {27292#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27320#(<= |main_#t~post6| 15)} is VALID [2022-04-08 14:07:19,290 INFO L290 TraceCheckUtils]: 148: Hoare triple {27320#(<= |main_#t~post6| 15)} assume !(#t~post6 < 20);havoc #t~post6; {26859#false} is VALID [2022-04-08 14:07:19,290 INFO L272 TraceCheckUtils]: 149: Hoare triple {26859#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {26859#false} is VALID [2022-04-08 14:07:19,290 INFO L290 TraceCheckUtils]: 150: Hoare triple {26859#false} ~cond := #in~cond; {26859#false} is VALID [2022-04-08 14:07:19,290 INFO L290 TraceCheckUtils]: 151: Hoare triple {26859#false} assume 0 == ~cond; {26859#false} is VALID [2022-04-08 14:07:19,290 INFO L290 TraceCheckUtils]: 152: Hoare triple {26859#false} assume !false; {26859#false} is VALID [2022-04-08 14:07:19,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 30 proven. 975 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:07:19,291 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:07:19,944 INFO L290 TraceCheckUtils]: 152: Hoare triple {26859#false} assume !false; {26859#false} is VALID [2022-04-08 14:07:19,944 INFO L290 TraceCheckUtils]: 151: Hoare triple {26859#false} assume 0 == ~cond; {26859#false} is VALID [2022-04-08 14:07:19,944 INFO L290 TraceCheckUtils]: 150: Hoare triple {26859#false} ~cond := #in~cond; {26859#false} is VALID [2022-04-08 14:07:19,944 INFO L272 TraceCheckUtils]: 149: Hoare triple {26859#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {26859#false} is VALID [2022-04-08 14:07:19,944 INFO L290 TraceCheckUtils]: 148: Hoare triple {27348#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {26859#false} is VALID [2022-04-08 14:07:19,945 INFO L290 TraceCheckUtils]: 147: Hoare triple {27352#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27348#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:07:19,945 INFO L290 TraceCheckUtils]: 146: Hoare triple {27352#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27352#(< ~counter~0 20)} is VALID [2022-04-08 14:07:19,945 INFO L290 TraceCheckUtils]: 145: Hoare triple {27352#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {27352#(< ~counter~0 20)} is VALID [2022-04-08 14:07:19,946 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {26858#true} {27352#(< ~counter~0 20)} #71#return; {27352#(< ~counter~0 20)} is VALID [2022-04-08 14:07:19,946 INFO L290 TraceCheckUtils]: 143: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,946 INFO L290 TraceCheckUtils]: 142: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,946 INFO L290 TraceCheckUtils]: 141: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,946 INFO L272 TraceCheckUtils]: 140: Hoare triple {27352#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,946 INFO L290 TraceCheckUtils]: 139: Hoare triple {27352#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {27352#(< ~counter~0 20)} is VALID [2022-04-08 14:07:19,947 INFO L290 TraceCheckUtils]: 138: Hoare triple {27380#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27352#(< ~counter~0 20)} is VALID [2022-04-08 14:07:19,947 INFO L290 TraceCheckUtils]: 137: Hoare triple {27380#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27380#(< ~counter~0 19)} is VALID [2022-04-08 14:07:19,947 INFO L290 TraceCheckUtils]: 136: Hoare triple {27380#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {27380#(< ~counter~0 19)} is VALID [2022-04-08 14:07:19,948 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {26858#true} {27380#(< ~counter~0 19)} #71#return; {27380#(< ~counter~0 19)} is VALID [2022-04-08 14:07:19,948 INFO L290 TraceCheckUtils]: 134: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,948 INFO L290 TraceCheckUtils]: 133: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,948 INFO L290 TraceCheckUtils]: 132: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,948 INFO L272 TraceCheckUtils]: 131: Hoare triple {27380#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,949 INFO L290 TraceCheckUtils]: 130: Hoare triple {27380#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {27380#(< ~counter~0 19)} is VALID [2022-04-08 14:07:19,949 INFO L290 TraceCheckUtils]: 129: Hoare triple {27408#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27380#(< ~counter~0 19)} is VALID [2022-04-08 14:07:19,949 INFO L290 TraceCheckUtils]: 128: Hoare triple {27408#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27408#(< ~counter~0 18)} is VALID [2022-04-08 14:07:19,950 INFO L290 TraceCheckUtils]: 127: Hoare triple {27408#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {27408#(< ~counter~0 18)} is VALID [2022-04-08 14:07:19,950 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {26858#true} {27408#(< ~counter~0 18)} #71#return; {27408#(< ~counter~0 18)} is VALID [2022-04-08 14:07:19,950 INFO L290 TraceCheckUtils]: 125: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,950 INFO L290 TraceCheckUtils]: 124: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,950 INFO L290 TraceCheckUtils]: 123: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,950 INFO L272 TraceCheckUtils]: 122: Hoare triple {27408#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,951 INFO L290 TraceCheckUtils]: 121: Hoare triple {27408#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {27408#(< ~counter~0 18)} is VALID [2022-04-08 14:07:19,951 INFO L290 TraceCheckUtils]: 120: Hoare triple {27436#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27408#(< ~counter~0 18)} is VALID [2022-04-08 14:07:19,951 INFO L290 TraceCheckUtils]: 119: Hoare triple {27436#(< ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27436#(< ~counter~0 17)} is VALID [2022-04-08 14:07:19,952 INFO L290 TraceCheckUtils]: 118: Hoare triple {27436#(< ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {27436#(< ~counter~0 17)} is VALID [2022-04-08 14:07:19,952 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {26858#true} {27436#(< ~counter~0 17)} #71#return; {27436#(< ~counter~0 17)} is VALID [2022-04-08 14:07:19,952 INFO L290 TraceCheckUtils]: 116: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,952 INFO L290 TraceCheckUtils]: 115: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,952 INFO L290 TraceCheckUtils]: 114: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,952 INFO L272 TraceCheckUtils]: 113: Hoare triple {27436#(< ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,953 INFO L290 TraceCheckUtils]: 112: Hoare triple {27436#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {27436#(< ~counter~0 17)} is VALID [2022-04-08 14:07:19,953 INFO L290 TraceCheckUtils]: 111: Hoare triple {27292#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27436#(< ~counter~0 17)} is VALID [2022-04-08 14:07:19,953 INFO L290 TraceCheckUtils]: 110: Hoare triple {27292#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,954 INFO L290 TraceCheckUtils]: 109: Hoare triple {27292#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,954 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {26858#true} {27292#(<= ~counter~0 15)} #71#return; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,954 INFO L290 TraceCheckUtils]: 107: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,954 INFO L290 TraceCheckUtils]: 106: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,954 INFO L290 TraceCheckUtils]: 105: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,954 INFO L272 TraceCheckUtils]: 104: Hoare triple {27292#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,955 INFO L290 TraceCheckUtils]: 103: Hoare triple {27292#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,955 INFO L290 TraceCheckUtils]: 102: Hoare triple {27264#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27292#(<= ~counter~0 15)} is VALID [2022-04-08 14:07:19,955 INFO L290 TraceCheckUtils]: 101: Hoare triple {27264#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,956 INFO L290 TraceCheckUtils]: 100: Hoare triple {27264#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,956 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {26858#true} {27264#(<= ~counter~0 14)} #71#return; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,956 INFO L290 TraceCheckUtils]: 98: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,956 INFO L290 TraceCheckUtils]: 97: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,956 INFO L290 TraceCheckUtils]: 96: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,956 INFO L272 TraceCheckUtils]: 95: Hoare triple {27264#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,958 INFO L290 TraceCheckUtils]: 94: Hoare triple {27264#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,958 INFO L290 TraceCheckUtils]: 93: Hoare triple {27236#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27264#(<= ~counter~0 14)} is VALID [2022-04-08 14:07:19,958 INFO L290 TraceCheckUtils]: 92: Hoare triple {27236#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,959 INFO L290 TraceCheckUtils]: 91: Hoare triple {27236#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,959 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {26858#true} {27236#(<= ~counter~0 13)} #71#return; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,959 INFO L290 TraceCheckUtils]: 89: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,959 INFO L290 TraceCheckUtils]: 88: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,959 INFO L290 TraceCheckUtils]: 87: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,959 INFO L272 TraceCheckUtils]: 86: Hoare triple {27236#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,960 INFO L290 TraceCheckUtils]: 85: Hoare triple {27236#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,960 INFO L290 TraceCheckUtils]: 84: Hoare triple {27208#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27236#(<= ~counter~0 13)} is VALID [2022-04-08 14:07:19,963 INFO L290 TraceCheckUtils]: 83: Hoare triple {27208#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,963 INFO L290 TraceCheckUtils]: 82: Hoare triple {27208#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,964 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {26858#true} {27208#(<= ~counter~0 12)} #71#return; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,964 INFO L290 TraceCheckUtils]: 80: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,964 INFO L290 TraceCheckUtils]: 79: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,964 INFO L290 TraceCheckUtils]: 78: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,964 INFO L272 TraceCheckUtils]: 77: Hoare triple {27208#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,965 INFO L290 TraceCheckUtils]: 76: Hoare triple {27208#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,965 INFO L290 TraceCheckUtils]: 75: Hoare triple {27180#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27208#(<= ~counter~0 12)} is VALID [2022-04-08 14:07:19,966 INFO L290 TraceCheckUtils]: 74: Hoare triple {27180#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,966 INFO L290 TraceCheckUtils]: 73: Hoare triple {27180#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,966 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {26858#true} {27180#(<= ~counter~0 11)} #71#return; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,967 INFO L290 TraceCheckUtils]: 71: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,967 INFO L290 TraceCheckUtils]: 70: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,967 INFO L290 TraceCheckUtils]: 69: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,967 INFO L272 TraceCheckUtils]: 68: Hoare triple {27180#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,967 INFO L290 TraceCheckUtils]: 67: Hoare triple {27180#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,967 INFO L290 TraceCheckUtils]: 66: Hoare triple {27152#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27180#(<= ~counter~0 11)} is VALID [2022-04-08 14:07:19,968 INFO L290 TraceCheckUtils]: 65: Hoare triple {27152#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,968 INFO L290 TraceCheckUtils]: 64: Hoare triple {27152#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,969 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26858#true} {27152#(<= ~counter~0 10)} #71#return; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,969 INFO L290 TraceCheckUtils]: 62: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,969 INFO L290 TraceCheckUtils]: 61: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,969 INFO L290 TraceCheckUtils]: 60: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,969 INFO L272 TraceCheckUtils]: 59: Hoare triple {27152#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,969 INFO L290 TraceCheckUtils]: 58: Hoare triple {27152#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,970 INFO L290 TraceCheckUtils]: 57: Hoare triple {27124#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27152#(<= ~counter~0 10)} is VALID [2022-04-08 14:07:19,970 INFO L290 TraceCheckUtils]: 56: Hoare triple {27124#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,970 INFO L290 TraceCheckUtils]: 55: Hoare triple {27124#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,971 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {26858#true} {27124#(<= ~counter~0 9)} #71#return; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,971 INFO L290 TraceCheckUtils]: 53: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,971 INFO L290 TraceCheckUtils]: 52: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,971 INFO L290 TraceCheckUtils]: 51: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,971 INFO L272 TraceCheckUtils]: 50: Hoare triple {27124#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,971 INFO L290 TraceCheckUtils]: 49: Hoare triple {27124#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {27096#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27124#(<= ~counter~0 9)} is VALID [2022-04-08 14:07:19,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {27096#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,972 INFO L290 TraceCheckUtils]: 46: Hoare triple {27096#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,973 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {26858#true} {27096#(<= ~counter~0 8)} #71#return; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,973 INFO L290 TraceCheckUtils]: 44: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,973 INFO L290 TraceCheckUtils]: 43: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,973 INFO L290 TraceCheckUtils]: 42: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,973 INFO L272 TraceCheckUtils]: 41: Hoare triple {27096#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,974 INFO L290 TraceCheckUtils]: 40: Hoare triple {27096#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,974 INFO L290 TraceCheckUtils]: 39: Hoare triple {27068#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27096#(<= ~counter~0 8)} is VALID [2022-04-08 14:07:19,974 INFO L290 TraceCheckUtils]: 38: Hoare triple {27068#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,975 INFO L290 TraceCheckUtils]: 37: Hoare triple {27068#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,975 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {26858#true} {27068#(<= ~counter~0 7)} #71#return; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,975 INFO L290 TraceCheckUtils]: 35: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,975 INFO L290 TraceCheckUtils]: 34: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,975 INFO L290 TraceCheckUtils]: 33: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,975 INFO L272 TraceCheckUtils]: 32: Hoare triple {27068#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,976 INFO L290 TraceCheckUtils]: 31: Hoare triple {27068#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,976 INFO L290 TraceCheckUtils]: 30: Hoare triple {27040#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27068#(<= ~counter~0 7)} is VALID [2022-04-08 14:07:19,977 INFO L290 TraceCheckUtils]: 29: Hoare triple {27040#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,977 INFO L290 TraceCheckUtils]: 28: Hoare triple {27040#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,977 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {26858#true} {27040#(<= ~counter~0 6)} #71#return; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,977 INFO L290 TraceCheckUtils]: 26: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,978 INFO L290 TraceCheckUtils]: 25: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,978 INFO L272 TraceCheckUtils]: 23: Hoare triple {27040#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,978 INFO L290 TraceCheckUtils]: 22: Hoare triple {27040#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,978 INFO L290 TraceCheckUtils]: 21: Hoare triple {27012#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27040#(<= ~counter~0 6)} is VALID [2022-04-08 14:07:19,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {27012#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {27012#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,979 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {26858#true} {27012#(<= ~counter~0 5)} #71#return; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,980 INFO L290 TraceCheckUtils]: 15: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,980 INFO L272 TraceCheckUtils]: 14: Hoare triple {27012#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {27012#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {26984#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27012#(<= ~counter~0 5)} is VALID [2022-04-08 14:07:19,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {26984#(<= ~counter~0 4)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,981 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26858#true} {26984#(<= ~counter~0 4)} #69#return; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {26858#true} assume true; {26858#true} is VALID [2022-04-08 14:07:19,981 INFO L290 TraceCheckUtils]: 8: Hoare triple {26858#true} assume !(0 == ~cond); {26858#true} is VALID [2022-04-08 14:07:19,981 INFO L290 TraceCheckUtils]: 7: Hoare triple {26858#true} ~cond := #in~cond; {26858#true} is VALID [2022-04-08 14:07:19,981 INFO L272 TraceCheckUtils]: 6: Hoare triple {26984#(<= ~counter~0 4)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {26858#true} is VALID [2022-04-08 14:07:19,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {26984#(<= ~counter~0 4)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,982 INFO L272 TraceCheckUtils]: 4: Hoare triple {26984#(<= ~counter~0 4)} call #t~ret7 := main(); {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,982 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26984#(<= ~counter~0 4)} {26858#true} #77#return; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {26984#(<= ~counter~0 4)} assume true; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,983 INFO L290 TraceCheckUtils]: 1: Hoare triple {26858#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {26984#(<= ~counter~0 4)} is VALID [2022-04-08 14:07:19,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {26858#true} call ULTIMATE.init(); {26858#true} is VALID [2022-04-08 14:07:19,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1005 backedges. 30 proven. 555 refuted. 0 times theorem prover too weak. 420 trivial. 0 not checked. [2022-04-08 14:07:19,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:07:19,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [57868605] [2022-04-08 14:07:19,984 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:07:19,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [360937050] [2022-04-08 14:07:19,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [360937050] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:07:19,984 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:07:19,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-08 14:07:19,984 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:07:19,984 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [849130402] [2022-04-08 14:07:19,984 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [849130402] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:07:19,984 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:07:19,984 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 14:07:19,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267849456] [2022-04-08 14:07:19,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:07:19,985 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 153 [2022-04-08 14:07:19,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:07:19,985 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:07:20,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:07:20,109 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 14:07:20,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:07:20,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 14:07:20,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:07:20,109 INFO L87 Difference]: Start difference. First operand 197 states and 244 transitions. Second operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:07:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:07:21,011 INFO L93 Difference]: Finished difference Result 216 states and 267 transitions. [2022-04-08 14:07:21,011 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 14:07:21,011 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) Word has length 153 [2022-04-08 14:07:21,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:07:21,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:07:21,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 253 transitions. [2022-04-08 14:07:21,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:07:21,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 253 transitions. [2022-04-08 14:07:21,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 253 transitions. [2022-04-08 14:07:21,218 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 253 edges. 253 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:07:21,220 INFO L225 Difference]: With dead ends: 216 [2022-04-08 14:07:21,220 INFO L226 Difference]: Without dead ends: 208 [2022-04-08 14:07:21,221 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 320 GetRequests, 282 SyntacticMatches, 1 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=581, Invalid=901, Unknown=0, NotChecked=0, Total=1482 [2022-04-08 14:07:21,221 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 172 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 90 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 90 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:07:21,221 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [172 Valid, 282 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 90 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:07:21,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2022-04-08 14:07:21,571 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 208. [2022-04-08 14:07:21,571 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:07:21,572 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 14:07:21,572 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 14:07:21,572 INFO L87 Difference]: Start difference. First operand 208 states. Second operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 14:07:21,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:07:21,574 INFO L93 Difference]: Finished difference Result 208 states and 258 transitions. [2022-04-08 14:07:21,574 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2022-04-08 14:07:21,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:07:21,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:07:21,575 INFO L74 IsIncluded]: Start isIncluded. First operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 208 states. [2022-04-08 14:07:21,575 INFO L87 Difference]: Start difference. First operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 208 states. [2022-04-08 14:07:21,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:07:21,577 INFO L93 Difference]: Finished difference Result 208 states and 258 transitions. [2022-04-08 14:07:21,577 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2022-04-08 14:07:21,578 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:07:21,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:07:21,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:07:21,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:07:21,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 208 states, 165 states have (on average 1.309090909090909) internal successors, (216), 166 states have internal predecessors, (216), 22 states have call successors, (22), 21 states have call predecessors, (22), 20 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 14:07:21,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 208 states to 208 states and 258 transitions. [2022-04-08 14:07:21,580 INFO L78 Accepts]: Start accepts. Automaton has 208 states and 258 transitions. Word has length 153 [2022-04-08 14:07:21,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:07:21,581 INFO L478 AbstractCegarLoop]: Abstraction has 208 states and 258 transitions. [2022-04-08 14:07:21,581 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 16 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-08 14:07:21,581 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 208 states and 258 transitions. [2022-04-08 14:07:54,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 243 inductive. 0 not inductive. 15 times theorem prover too weak to decide inductivity. [2022-04-08 14:07:54,247 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 258 transitions. [2022-04-08 14:07:54,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 163 [2022-04-08 14:07:54,248 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:07:54,248 INFO L499 BasicCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:07:54,265 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-08 14:07:54,463 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-08 14:07:54,463 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:07:54,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:07:54,464 INFO L85 PathProgramCache]: Analyzing trace with hash 1002092794, now seen corresponding path program 31 times [2022-04-08 14:07:54,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:07:54,464 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [343221334] [2022-04-08 14:08:00,510 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:08:00,510 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:08:00,511 INFO L85 PathProgramCache]: Analyzing trace with hash 1002092794, now seen corresponding path program 32 times [2022-04-08 14:08:00,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:08:00,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88113574] [2022-04-08 14:08:00,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:08:00,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:08:00,531 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:08:00,531 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2081523768] [2022-04-08 14:08:00,532 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:08:00,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:08:00,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:08:00,532 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:08:00,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-08 14:08:00,620 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:08:00,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:08:00,622 INFO L263 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 14:08:00,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:00,666 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:08:01,416 INFO L272 TraceCheckUtils]: 0: Hoare triple {29093#true} call ULTIMATE.init(); {29093#true} is VALID [2022-04-08 14:08:01,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {29093#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {29101#(<= ~counter~0 0)} assume true; {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,418 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29101#(<= ~counter~0 0)} {29093#true} #77#return; {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,418 INFO L272 TraceCheckUtils]: 4: Hoare triple {29101#(<= ~counter~0 0)} call #t~ret7 := main(); {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {29101#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,419 INFO L272 TraceCheckUtils]: 6: Hoare triple {29101#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {29101#(<= ~counter~0 0)} ~cond := #in~cond; {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,419 INFO L290 TraceCheckUtils]: 8: Hoare triple {29101#(<= ~counter~0 0)} assume !(0 == ~cond); {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,419 INFO L290 TraceCheckUtils]: 9: Hoare triple {29101#(<= ~counter~0 0)} assume true; {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,420 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29101#(<= ~counter~0 0)} {29101#(<= ~counter~0 0)} #69#return; {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,420 INFO L290 TraceCheckUtils]: 11: Hoare triple {29101#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {29101#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:01,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {29101#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29135#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:01,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {29135#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {29135#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:01,421 INFO L272 TraceCheckUtils]: 14: Hoare triple {29135#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29135#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:01,422 INFO L290 TraceCheckUtils]: 15: Hoare triple {29135#(<= ~counter~0 1)} ~cond := #in~cond; {29135#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:01,422 INFO L290 TraceCheckUtils]: 16: Hoare triple {29135#(<= ~counter~0 1)} assume !(0 == ~cond); {29135#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:01,422 INFO L290 TraceCheckUtils]: 17: Hoare triple {29135#(<= ~counter~0 1)} assume true; {29135#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:01,423 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29135#(<= ~counter~0 1)} {29135#(<= ~counter~0 1)} #71#return; {29135#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:01,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {29135#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {29135#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:01,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {29135#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29135#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:01,424 INFO L290 TraceCheckUtils]: 21: Hoare triple {29135#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29163#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:01,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {29163#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {29163#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:01,424 INFO L272 TraceCheckUtils]: 23: Hoare triple {29163#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29163#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:01,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {29163#(<= ~counter~0 2)} ~cond := #in~cond; {29163#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:01,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {29163#(<= ~counter~0 2)} assume !(0 == ~cond); {29163#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:01,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {29163#(<= ~counter~0 2)} assume true; {29163#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:01,426 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29163#(<= ~counter~0 2)} {29163#(<= ~counter~0 2)} #71#return; {29163#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:01,426 INFO L290 TraceCheckUtils]: 28: Hoare triple {29163#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {29163#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:01,426 INFO L290 TraceCheckUtils]: 29: Hoare triple {29163#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29163#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:01,426 INFO L290 TraceCheckUtils]: 30: Hoare triple {29163#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:01,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {29191#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:01,427 INFO L272 TraceCheckUtils]: 32: Hoare triple {29191#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:01,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {29191#(<= ~counter~0 3)} ~cond := #in~cond; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:01,428 INFO L290 TraceCheckUtils]: 34: Hoare triple {29191#(<= ~counter~0 3)} assume !(0 == ~cond); {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:01,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {29191#(<= ~counter~0 3)} assume true; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:01,428 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29191#(<= ~counter~0 3)} {29191#(<= ~counter~0 3)} #71#return; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:01,429 INFO L290 TraceCheckUtils]: 37: Hoare triple {29191#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:01,429 INFO L290 TraceCheckUtils]: 38: Hoare triple {29191#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:01,429 INFO L290 TraceCheckUtils]: 39: Hoare triple {29191#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:01,430 INFO L290 TraceCheckUtils]: 40: Hoare triple {29219#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:01,430 INFO L272 TraceCheckUtils]: 41: Hoare triple {29219#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:01,430 INFO L290 TraceCheckUtils]: 42: Hoare triple {29219#(<= ~counter~0 4)} ~cond := #in~cond; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:01,431 INFO L290 TraceCheckUtils]: 43: Hoare triple {29219#(<= ~counter~0 4)} assume !(0 == ~cond); {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:01,431 INFO L290 TraceCheckUtils]: 44: Hoare triple {29219#(<= ~counter~0 4)} assume true; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:01,432 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29219#(<= ~counter~0 4)} {29219#(<= ~counter~0 4)} #71#return; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:01,432 INFO L290 TraceCheckUtils]: 46: Hoare triple {29219#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:01,432 INFO L290 TraceCheckUtils]: 47: Hoare triple {29219#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:01,433 INFO L290 TraceCheckUtils]: 48: Hoare triple {29219#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:01,433 INFO L290 TraceCheckUtils]: 49: Hoare triple {29247#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:01,434 INFO L272 TraceCheckUtils]: 50: Hoare triple {29247#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:01,434 INFO L290 TraceCheckUtils]: 51: Hoare triple {29247#(<= ~counter~0 5)} ~cond := #in~cond; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:01,434 INFO L290 TraceCheckUtils]: 52: Hoare triple {29247#(<= ~counter~0 5)} assume !(0 == ~cond); {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:01,434 INFO L290 TraceCheckUtils]: 53: Hoare triple {29247#(<= ~counter~0 5)} assume true; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:01,435 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29247#(<= ~counter~0 5)} {29247#(<= ~counter~0 5)} #71#return; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:01,435 INFO L290 TraceCheckUtils]: 55: Hoare triple {29247#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:01,435 INFO L290 TraceCheckUtils]: 56: Hoare triple {29247#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:01,436 INFO L290 TraceCheckUtils]: 57: Hoare triple {29247#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:01,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {29275#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:01,437 INFO L272 TraceCheckUtils]: 59: Hoare triple {29275#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:01,437 INFO L290 TraceCheckUtils]: 60: Hoare triple {29275#(<= ~counter~0 6)} ~cond := #in~cond; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:01,437 INFO L290 TraceCheckUtils]: 61: Hoare triple {29275#(<= ~counter~0 6)} assume !(0 == ~cond); {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:01,437 INFO L290 TraceCheckUtils]: 62: Hoare triple {29275#(<= ~counter~0 6)} assume true; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:01,438 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29275#(<= ~counter~0 6)} {29275#(<= ~counter~0 6)} #71#return; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:01,438 INFO L290 TraceCheckUtils]: 64: Hoare triple {29275#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:01,438 INFO L290 TraceCheckUtils]: 65: Hoare triple {29275#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:01,439 INFO L290 TraceCheckUtils]: 66: Hoare triple {29275#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:01,439 INFO L290 TraceCheckUtils]: 67: Hoare triple {29303#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:01,439 INFO L272 TraceCheckUtils]: 68: Hoare triple {29303#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:01,440 INFO L290 TraceCheckUtils]: 69: Hoare triple {29303#(<= ~counter~0 7)} ~cond := #in~cond; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:01,440 INFO L290 TraceCheckUtils]: 70: Hoare triple {29303#(<= ~counter~0 7)} assume !(0 == ~cond); {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:01,440 INFO L290 TraceCheckUtils]: 71: Hoare triple {29303#(<= ~counter~0 7)} assume true; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:01,441 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29303#(<= ~counter~0 7)} {29303#(<= ~counter~0 7)} #71#return; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:01,441 INFO L290 TraceCheckUtils]: 73: Hoare triple {29303#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:01,441 INFO L290 TraceCheckUtils]: 74: Hoare triple {29303#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:01,442 INFO L290 TraceCheckUtils]: 75: Hoare triple {29303#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:01,442 INFO L290 TraceCheckUtils]: 76: Hoare triple {29331#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:01,442 INFO L272 TraceCheckUtils]: 77: Hoare triple {29331#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:01,443 INFO L290 TraceCheckUtils]: 78: Hoare triple {29331#(<= ~counter~0 8)} ~cond := #in~cond; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:01,443 INFO L290 TraceCheckUtils]: 79: Hoare triple {29331#(<= ~counter~0 8)} assume !(0 == ~cond); {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:01,443 INFO L290 TraceCheckUtils]: 80: Hoare triple {29331#(<= ~counter~0 8)} assume true; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:01,444 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29331#(<= ~counter~0 8)} {29331#(<= ~counter~0 8)} #71#return; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:01,444 INFO L290 TraceCheckUtils]: 82: Hoare triple {29331#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:01,444 INFO L290 TraceCheckUtils]: 83: Hoare triple {29331#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:01,445 INFO L290 TraceCheckUtils]: 84: Hoare triple {29331#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:01,445 INFO L290 TraceCheckUtils]: 85: Hoare triple {29359#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:01,445 INFO L272 TraceCheckUtils]: 86: Hoare triple {29359#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:01,446 INFO L290 TraceCheckUtils]: 87: Hoare triple {29359#(<= ~counter~0 9)} ~cond := #in~cond; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:01,446 INFO L290 TraceCheckUtils]: 88: Hoare triple {29359#(<= ~counter~0 9)} assume !(0 == ~cond); {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:01,446 INFO L290 TraceCheckUtils]: 89: Hoare triple {29359#(<= ~counter~0 9)} assume true; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:01,447 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29359#(<= ~counter~0 9)} {29359#(<= ~counter~0 9)} #71#return; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:01,447 INFO L290 TraceCheckUtils]: 91: Hoare triple {29359#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:01,447 INFO L290 TraceCheckUtils]: 92: Hoare triple {29359#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:01,448 INFO L290 TraceCheckUtils]: 93: Hoare triple {29359#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:01,448 INFO L290 TraceCheckUtils]: 94: Hoare triple {29387#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:01,448 INFO L272 TraceCheckUtils]: 95: Hoare triple {29387#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:01,449 INFO L290 TraceCheckUtils]: 96: Hoare triple {29387#(<= ~counter~0 10)} ~cond := #in~cond; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:01,449 INFO L290 TraceCheckUtils]: 97: Hoare triple {29387#(<= ~counter~0 10)} assume !(0 == ~cond); {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:01,449 INFO L290 TraceCheckUtils]: 98: Hoare triple {29387#(<= ~counter~0 10)} assume true; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:01,450 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {29387#(<= ~counter~0 10)} {29387#(<= ~counter~0 10)} #71#return; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:01,450 INFO L290 TraceCheckUtils]: 100: Hoare triple {29387#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:01,450 INFO L290 TraceCheckUtils]: 101: Hoare triple {29387#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:01,451 INFO L290 TraceCheckUtils]: 102: Hoare triple {29387#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:01,451 INFO L290 TraceCheckUtils]: 103: Hoare triple {29415#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:01,451 INFO L272 TraceCheckUtils]: 104: Hoare triple {29415#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:01,452 INFO L290 TraceCheckUtils]: 105: Hoare triple {29415#(<= ~counter~0 11)} ~cond := #in~cond; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:01,452 INFO L290 TraceCheckUtils]: 106: Hoare triple {29415#(<= ~counter~0 11)} assume !(0 == ~cond); {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:01,452 INFO L290 TraceCheckUtils]: 107: Hoare triple {29415#(<= ~counter~0 11)} assume true; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:01,453 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29415#(<= ~counter~0 11)} {29415#(<= ~counter~0 11)} #71#return; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:01,453 INFO L290 TraceCheckUtils]: 109: Hoare triple {29415#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:01,453 INFO L290 TraceCheckUtils]: 110: Hoare triple {29415#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:01,453 INFO L290 TraceCheckUtils]: 111: Hoare triple {29415#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:01,454 INFO L290 TraceCheckUtils]: 112: Hoare triple {29443#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:01,454 INFO L272 TraceCheckUtils]: 113: Hoare triple {29443#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:01,454 INFO L290 TraceCheckUtils]: 114: Hoare triple {29443#(<= ~counter~0 12)} ~cond := #in~cond; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:01,455 INFO L290 TraceCheckUtils]: 115: Hoare triple {29443#(<= ~counter~0 12)} assume !(0 == ~cond); {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:01,455 INFO L290 TraceCheckUtils]: 116: Hoare triple {29443#(<= ~counter~0 12)} assume true; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:01,455 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {29443#(<= ~counter~0 12)} {29443#(<= ~counter~0 12)} #71#return; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:01,456 INFO L290 TraceCheckUtils]: 118: Hoare triple {29443#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:01,456 INFO L290 TraceCheckUtils]: 119: Hoare triple {29443#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:01,456 INFO L290 TraceCheckUtils]: 120: Hoare triple {29443#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:01,457 INFO L290 TraceCheckUtils]: 121: Hoare triple {29471#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:01,457 INFO L272 TraceCheckUtils]: 122: Hoare triple {29471#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:01,457 INFO L290 TraceCheckUtils]: 123: Hoare triple {29471#(<= ~counter~0 13)} ~cond := #in~cond; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:01,458 INFO L290 TraceCheckUtils]: 124: Hoare triple {29471#(<= ~counter~0 13)} assume !(0 == ~cond); {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:01,458 INFO L290 TraceCheckUtils]: 125: Hoare triple {29471#(<= ~counter~0 13)} assume true; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:01,458 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {29471#(<= ~counter~0 13)} {29471#(<= ~counter~0 13)} #71#return; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:01,459 INFO L290 TraceCheckUtils]: 127: Hoare triple {29471#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:01,459 INFO L290 TraceCheckUtils]: 128: Hoare triple {29471#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:01,459 INFO L290 TraceCheckUtils]: 129: Hoare triple {29471#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:01,460 INFO L290 TraceCheckUtils]: 130: Hoare triple {29499#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:01,460 INFO L272 TraceCheckUtils]: 131: Hoare triple {29499#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:01,460 INFO L290 TraceCheckUtils]: 132: Hoare triple {29499#(<= ~counter~0 14)} ~cond := #in~cond; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:01,461 INFO L290 TraceCheckUtils]: 133: Hoare triple {29499#(<= ~counter~0 14)} assume !(0 == ~cond); {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:01,461 INFO L290 TraceCheckUtils]: 134: Hoare triple {29499#(<= ~counter~0 14)} assume true; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:01,461 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {29499#(<= ~counter~0 14)} {29499#(<= ~counter~0 14)} #71#return; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:01,462 INFO L290 TraceCheckUtils]: 136: Hoare triple {29499#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:01,462 INFO L290 TraceCheckUtils]: 137: Hoare triple {29499#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:01,462 INFO L290 TraceCheckUtils]: 138: Hoare triple {29499#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:01,463 INFO L290 TraceCheckUtils]: 139: Hoare triple {29527#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:01,463 INFO L272 TraceCheckUtils]: 140: Hoare triple {29527#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:01,463 INFO L290 TraceCheckUtils]: 141: Hoare triple {29527#(<= ~counter~0 15)} ~cond := #in~cond; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:01,464 INFO L290 TraceCheckUtils]: 142: Hoare triple {29527#(<= ~counter~0 15)} assume !(0 == ~cond); {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:01,464 INFO L290 TraceCheckUtils]: 143: Hoare triple {29527#(<= ~counter~0 15)} assume true; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:01,464 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {29527#(<= ~counter~0 15)} {29527#(<= ~counter~0 15)} #71#return; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:01,465 INFO L290 TraceCheckUtils]: 145: Hoare triple {29527#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:01,465 INFO L290 TraceCheckUtils]: 146: Hoare triple {29527#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:01,465 INFO L290 TraceCheckUtils]: 147: Hoare triple {29527#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:01,466 INFO L290 TraceCheckUtils]: 148: Hoare triple {29555#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:01,466 INFO L272 TraceCheckUtils]: 149: Hoare triple {29555#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:01,466 INFO L290 TraceCheckUtils]: 150: Hoare triple {29555#(<= ~counter~0 16)} ~cond := #in~cond; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:01,467 INFO L290 TraceCheckUtils]: 151: Hoare triple {29555#(<= ~counter~0 16)} assume !(0 == ~cond); {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:01,467 INFO L290 TraceCheckUtils]: 152: Hoare triple {29555#(<= ~counter~0 16)} assume true; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:01,467 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {29555#(<= ~counter~0 16)} {29555#(<= ~counter~0 16)} #71#return; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:01,468 INFO L290 TraceCheckUtils]: 154: Hoare triple {29555#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:01,468 INFO L290 TraceCheckUtils]: 155: Hoare triple {29555#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:01,468 INFO L290 TraceCheckUtils]: 156: Hoare triple {29555#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29583#(<= |main_#t~post6| 16)} is VALID [2022-04-08 14:08:01,468 INFO L290 TraceCheckUtils]: 157: Hoare triple {29583#(<= |main_#t~post6| 16)} assume !(#t~post6 < 20);havoc #t~post6; {29094#false} is VALID [2022-04-08 14:08:01,469 INFO L272 TraceCheckUtils]: 158: Hoare triple {29094#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {29094#false} is VALID [2022-04-08 14:08:01,469 INFO L290 TraceCheckUtils]: 159: Hoare triple {29094#false} ~cond := #in~cond; {29094#false} is VALID [2022-04-08 14:08:01,469 INFO L290 TraceCheckUtils]: 160: Hoare triple {29094#false} assume 0 == ~cond; {29094#false} is VALID [2022-04-08 14:08:01,469 INFO L290 TraceCheckUtils]: 161: Hoare triple {29094#false} assume !false; {29094#false} is VALID [2022-04-08 14:08:01,469 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 32 proven. 1112 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:08:01,469 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:08:02,156 INFO L290 TraceCheckUtils]: 161: Hoare triple {29094#false} assume !false; {29094#false} is VALID [2022-04-08 14:08:02,156 INFO L290 TraceCheckUtils]: 160: Hoare triple {29094#false} assume 0 == ~cond; {29094#false} is VALID [2022-04-08 14:08:02,156 INFO L290 TraceCheckUtils]: 159: Hoare triple {29094#false} ~cond := #in~cond; {29094#false} is VALID [2022-04-08 14:08:02,156 INFO L272 TraceCheckUtils]: 158: Hoare triple {29094#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {29094#false} is VALID [2022-04-08 14:08:02,157 INFO L290 TraceCheckUtils]: 157: Hoare triple {29611#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {29094#false} is VALID [2022-04-08 14:08:02,157 INFO L290 TraceCheckUtils]: 156: Hoare triple {29615#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29611#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:08:02,157 INFO L290 TraceCheckUtils]: 155: Hoare triple {29615#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29615#(< ~counter~0 20)} is VALID [2022-04-08 14:08:02,158 INFO L290 TraceCheckUtils]: 154: Hoare triple {29615#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {29615#(< ~counter~0 20)} is VALID [2022-04-08 14:08:02,158 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {29093#true} {29615#(< ~counter~0 20)} #71#return; {29615#(< ~counter~0 20)} is VALID [2022-04-08 14:08:02,158 INFO L290 TraceCheckUtils]: 152: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,158 INFO L290 TraceCheckUtils]: 151: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,159 INFO L290 TraceCheckUtils]: 150: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,159 INFO L272 TraceCheckUtils]: 149: Hoare triple {29615#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,159 INFO L290 TraceCheckUtils]: 148: Hoare triple {29615#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {29615#(< ~counter~0 20)} is VALID [2022-04-08 14:08:02,160 INFO L290 TraceCheckUtils]: 147: Hoare triple {29643#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29615#(< ~counter~0 20)} is VALID [2022-04-08 14:08:02,160 INFO L290 TraceCheckUtils]: 146: Hoare triple {29643#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29643#(< ~counter~0 19)} is VALID [2022-04-08 14:08:02,160 INFO L290 TraceCheckUtils]: 145: Hoare triple {29643#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {29643#(< ~counter~0 19)} is VALID [2022-04-08 14:08:02,161 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {29093#true} {29643#(< ~counter~0 19)} #71#return; {29643#(< ~counter~0 19)} is VALID [2022-04-08 14:08:02,161 INFO L290 TraceCheckUtils]: 143: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,161 INFO L290 TraceCheckUtils]: 142: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,161 INFO L290 TraceCheckUtils]: 141: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,161 INFO L272 TraceCheckUtils]: 140: Hoare triple {29643#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,161 INFO L290 TraceCheckUtils]: 139: Hoare triple {29643#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {29643#(< ~counter~0 19)} is VALID [2022-04-08 14:08:02,162 INFO L290 TraceCheckUtils]: 138: Hoare triple {29671#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29643#(< ~counter~0 19)} is VALID [2022-04-08 14:08:02,162 INFO L290 TraceCheckUtils]: 137: Hoare triple {29671#(< ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29671#(< ~counter~0 18)} is VALID [2022-04-08 14:08:02,162 INFO L290 TraceCheckUtils]: 136: Hoare triple {29671#(< ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {29671#(< ~counter~0 18)} is VALID [2022-04-08 14:08:02,163 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {29093#true} {29671#(< ~counter~0 18)} #71#return; {29671#(< ~counter~0 18)} is VALID [2022-04-08 14:08:02,163 INFO L290 TraceCheckUtils]: 134: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,163 INFO L290 TraceCheckUtils]: 133: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,163 INFO L290 TraceCheckUtils]: 132: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,163 INFO L272 TraceCheckUtils]: 131: Hoare triple {29671#(< ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,163 INFO L290 TraceCheckUtils]: 130: Hoare triple {29671#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {29671#(< ~counter~0 18)} is VALID [2022-04-08 14:08:02,164 INFO L290 TraceCheckUtils]: 129: Hoare triple {29555#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29671#(< ~counter~0 18)} is VALID [2022-04-08 14:08:02,164 INFO L290 TraceCheckUtils]: 128: Hoare triple {29555#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:02,165 INFO L290 TraceCheckUtils]: 127: Hoare triple {29555#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:02,165 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {29093#true} {29555#(<= ~counter~0 16)} #71#return; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:02,165 INFO L290 TraceCheckUtils]: 125: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,165 INFO L290 TraceCheckUtils]: 124: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,165 INFO L290 TraceCheckUtils]: 123: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,165 INFO L272 TraceCheckUtils]: 122: Hoare triple {29555#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,166 INFO L290 TraceCheckUtils]: 121: Hoare triple {29555#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:02,166 INFO L290 TraceCheckUtils]: 120: Hoare triple {29527#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29555#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:02,166 INFO L290 TraceCheckUtils]: 119: Hoare triple {29527#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:02,167 INFO L290 TraceCheckUtils]: 118: Hoare triple {29527#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:02,167 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {29093#true} {29527#(<= ~counter~0 15)} #71#return; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:02,168 INFO L290 TraceCheckUtils]: 116: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,168 INFO L290 TraceCheckUtils]: 115: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,168 INFO L290 TraceCheckUtils]: 114: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,168 INFO L272 TraceCheckUtils]: 113: Hoare triple {29527#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,168 INFO L290 TraceCheckUtils]: 112: Hoare triple {29527#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:02,169 INFO L290 TraceCheckUtils]: 111: Hoare triple {29499#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29527#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:02,169 INFO L290 TraceCheckUtils]: 110: Hoare triple {29499#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:02,169 INFO L290 TraceCheckUtils]: 109: Hoare triple {29499#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:02,170 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {29093#true} {29499#(<= ~counter~0 14)} #71#return; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:02,170 INFO L290 TraceCheckUtils]: 107: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,170 INFO L290 TraceCheckUtils]: 106: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,170 INFO L290 TraceCheckUtils]: 105: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,170 INFO L272 TraceCheckUtils]: 104: Hoare triple {29499#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,170 INFO L290 TraceCheckUtils]: 103: Hoare triple {29499#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:02,171 INFO L290 TraceCheckUtils]: 102: Hoare triple {29471#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29499#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:02,171 INFO L290 TraceCheckUtils]: 101: Hoare triple {29471#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:02,172 INFO L290 TraceCheckUtils]: 100: Hoare triple {29471#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:02,172 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {29093#true} {29471#(<= ~counter~0 13)} #71#return; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:02,172 INFO L290 TraceCheckUtils]: 98: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,172 INFO L290 TraceCheckUtils]: 97: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,173 INFO L290 TraceCheckUtils]: 96: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,173 INFO L272 TraceCheckUtils]: 95: Hoare triple {29471#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,173 INFO L290 TraceCheckUtils]: 94: Hoare triple {29471#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:02,173 INFO L290 TraceCheckUtils]: 93: Hoare triple {29443#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29471#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:02,174 INFO L290 TraceCheckUtils]: 92: Hoare triple {29443#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:02,174 INFO L290 TraceCheckUtils]: 91: Hoare triple {29443#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:02,175 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {29093#true} {29443#(<= ~counter~0 12)} #71#return; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:02,175 INFO L290 TraceCheckUtils]: 89: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,175 INFO L290 TraceCheckUtils]: 88: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,175 INFO L290 TraceCheckUtils]: 87: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,175 INFO L272 TraceCheckUtils]: 86: Hoare triple {29443#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,175 INFO L290 TraceCheckUtils]: 85: Hoare triple {29443#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:02,176 INFO L290 TraceCheckUtils]: 84: Hoare triple {29415#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29443#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:02,176 INFO L290 TraceCheckUtils]: 83: Hoare triple {29415#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:02,176 INFO L290 TraceCheckUtils]: 82: Hoare triple {29415#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:02,177 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {29093#true} {29415#(<= ~counter~0 11)} #71#return; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:02,177 INFO L290 TraceCheckUtils]: 80: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,177 INFO L290 TraceCheckUtils]: 79: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,177 INFO L290 TraceCheckUtils]: 78: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,177 INFO L272 TraceCheckUtils]: 77: Hoare triple {29415#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,178 INFO L290 TraceCheckUtils]: 76: Hoare triple {29415#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:02,178 INFO L290 TraceCheckUtils]: 75: Hoare triple {29387#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29415#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:02,179 INFO L290 TraceCheckUtils]: 74: Hoare triple {29387#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:02,179 INFO L290 TraceCheckUtils]: 73: Hoare triple {29387#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:02,180 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {29093#true} {29387#(<= ~counter~0 10)} #71#return; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:02,180 INFO L290 TraceCheckUtils]: 71: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,180 INFO L290 TraceCheckUtils]: 70: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,180 INFO L290 TraceCheckUtils]: 69: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,180 INFO L272 TraceCheckUtils]: 68: Hoare triple {29387#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,180 INFO L290 TraceCheckUtils]: 67: Hoare triple {29387#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:02,181 INFO L290 TraceCheckUtils]: 66: Hoare triple {29359#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29387#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:02,181 INFO L290 TraceCheckUtils]: 65: Hoare triple {29359#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:02,181 INFO L290 TraceCheckUtils]: 64: Hoare triple {29359#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:02,182 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29093#true} {29359#(<= ~counter~0 9)} #71#return; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:02,182 INFO L290 TraceCheckUtils]: 62: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,182 INFO L290 TraceCheckUtils]: 61: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,182 INFO L290 TraceCheckUtils]: 60: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,182 INFO L272 TraceCheckUtils]: 59: Hoare triple {29359#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,183 INFO L290 TraceCheckUtils]: 58: Hoare triple {29359#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:02,183 INFO L290 TraceCheckUtils]: 57: Hoare triple {29331#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29359#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:02,183 INFO L290 TraceCheckUtils]: 56: Hoare triple {29331#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:02,184 INFO L290 TraceCheckUtils]: 55: Hoare triple {29331#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:02,184 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {29093#true} {29331#(<= ~counter~0 8)} #71#return; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:02,184 INFO L290 TraceCheckUtils]: 53: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,184 INFO L290 TraceCheckUtils]: 52: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,185 INFO L290 TraceCheckUtils]: 51: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,185 INFO L272 TraceCheckUtils]: 50: Hoare triple {29331#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,185 INFO L290 TraceCheckUtils]: 49: Hoare triple {29331#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:02,185 INFO L290 TraceCheckUtils]: 48: Hoare triple {29303#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29331#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:02,186 INFO L290 TraceCheckUtils]: 47: Hoare triple {29303#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:02,186 INFO L290 TraceCheckUtils]: 46: Hoare triple {29303#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:02,187 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {29093#true} {29303#(<= ~counter~0 7)} #71#return; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:02,187 INFO L290 TraceCheckUtils]: 44: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,187 INFO L290 TraceCheckUtils]: 43: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,187 INFO L290 TraceCheckUtils]: 42: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,187 INFO L272 TraceCheckUtils]: 41: Hoare triple {29303#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,187 INFO L290 TraceCheckUtils]: 40: Hoare triple {29303#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:02,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {29275#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29303#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:02,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {29275#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:02,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {29275#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:02,189 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {29093#true} {29275#(<= ~counter~0 6)} #71#return; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:02,189 INFO L290 TraceCheckUtils]: 35: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,189 INFO L290 TraceCheckUtils]: 34: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,189 INFO L290 TraceCheckUtils]: 33: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,189 INFO L272 TraceCheckUtils]: 32: Hoare triple {29275#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,189 INFO L290 TraceCheckUtils]: 31: Hoare triple {29275#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:02,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {29247#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29275#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:02,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {29247#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:02,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {29247#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:02,191 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {29093#true} {29247#(<= ~counter~0 5)} #71#return; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:02,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,191 INFO L272 TraceCheckUtils]: 23: Hoare triple {29247#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,192 INFO L290 TraceCheckUtils]: 22: Hoare triple {29247#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:02,192 INFO L290 TraceCheckUtils]: 21: Hoare triple {29219#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29247#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:02,193 INFO L290 TraceCheckUtils]: 20: Hoare triple {29219#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:02,193 INFO L290 TraceCheckUtils]: 19: Hoare triple {29219#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:02,193 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {29093#true} {29219#(<= ~counter~0 4)} #71#return; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:02,194 INFO L290 TraceCheckUtils]: 17: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,194 INFO L290 TraceCheckUtils]: 16: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,194 INFO L290 TraceCheckUtils]: 15: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,194 INFO L272 TraceCheckUtils]: 14: Hoare triple {29219#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {29219#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:02,194 INFO L290 TraceCheckUtils]: 12: Hoare triple {29191#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29219#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:02,195 INFO L290 TraceCheckUtils]: 11: Hoare triple {29191#(<= ~counter~0 3)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:02,195 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29093#true} {29191#(<= ~counter~0 3)} #69#return; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:02,195 INFO L290 TraceCheckUtils]: 9: Hoare triple {29093#true} assume true; {29093#true} is VALID [2022-04-08 14:08:02,195 INFO L290 TraceCheckUtils]: 8: Hoare triple {29093#true} assume !(0 == ~cond); {29093#true} is VALID [2022-04-08 14:08:02,195 INFO L290 TraceCheckUtils]: 7: Hoare triple {29093#true} ~cond := #in~cond; {29093#true} is VALID [2022-04-08 14:08:02,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {29191#(<= ~counter~0 3)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {29093#true} is VALID [2022-04-08 14:08:02,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {29191#(<= ~counter~0 3)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:02,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {29191#(<= ~counter~0 3)} call #t~ret7 := main(); {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:02,196 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29191#(<= ~counter~0 3)} {29093#true} #77#return; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:02,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {29191#(<= ~counter~0 3)} assume true; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:02,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {29093#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {29191#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:02,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {29093#true} call ULTIMATE.init(); {29093#true} is VALID [2022-04-08 14:08:02,198 INFO L134 CoverageAnalysis]: Checked inductivity of 1144 backedges. 32 proven. 632 refuted. 0 times theorem prover too weak. 480 trivial. 0 not checked. [2022-04-08 14:08:02,198 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:08:02,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88113574] [2022-04-08 14:08:02,198 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:08:02,198 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2081523768] [2022-04-08 14:08:02,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2081523768] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:08:02,198 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:08:02,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-08 14:08:02,199 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:08:02,199 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [343221334] [2022-04-08 14:08:02,199 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [343221334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:02,199 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:02,199 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 14:08:02,199 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1555011863] [2022-04-08 14:08:02,199 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:08:02,199 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 162 [2022-04-08 14:08:02,199 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:08:02,200 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:08:02,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:02,331 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 14:08:02,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:02,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 14:08:02,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:08:02,332 INFO L87 Difference]: Start difference. First operand 208 states and 258 transitions. Second operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:08:03,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:03,295 INFO L93 Difference]: Finished difference Result 227 states and 281 transitions. [2022-04-08 14:08:03,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 14:08:03,295 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) Word has length 162 [2022-04-08 14:08:03,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:08:03,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:08:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 267 transitions. [2022-04-08 14:08:03,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:08:03,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 267 transitions. [2022-04-08 14:08:03,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 267 transitions. [2022-04-08 14:08:03,513 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 267 edges. 267 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:03,520 INFO L225 Difference]: With dead ends: 227 [2022-04-08 14:08:03,520 INFO L226 Difference]: Without dead ends: 219 [2022-04-08 14:08:03,521 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 339 GetRequests, 300 SyntacticMatches, 1 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=604, Invalid=956, Unknown=0, NotChecked=0, Total=1560 [2022-04-08 14:08:03,521 INFO L913 BasicCegarLoop]: 46 mSDtfsCounter, 271 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:08:03,521 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 286 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:08:03,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-04-08 14:08:03,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 219. [2022-04-08 14:08:03,873 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:08:03,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 14:08:03,874 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 14:08:03,874 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 14:08:03,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:03,876 INFO L93 Difference]: Finished difference Result 219 states and 272 transitions. [2022-04-08 14:08:03,876 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2022-04-08 14:08:03,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:03,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:03,877 INFO L74 IsIncluded]: Start isIncluded. First operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 219 states. [2022-04-08 14:08:03,877 INFO L87 Difference]: Start difference. First operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 219 states. [2022-04-08 14:08:03,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:03,879 INFO L93 Difference]: Finished difference Result 219 states and 272 transitions. [2022-04-08 14:08:03,880 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2022-04-08 14:08:03,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:03,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:03,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:08:03,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:08:03,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 219 states, 174 states have (on average 1.3103448275862069) internal successors, (228), 175 states have internal predecessors, (228), 23 states have call successors, (23), 22 states have call predecessors, (23), 21 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 14:08:03,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 219 states to 219 states and 272 transitions. [2022-04-08 14:08:03,883 INFO L78 Accepts]: Start accepts. Automaton has 219 states and 272 transitions. Word has length 162 [2022-04-08 14:08:03,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:08:03,883 INFO L478 AbstractCegarLoop]: Abstraction has 219 states and 272 transitions. [2022-04-08 14:08:03,883 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 17 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-08 14:08:03,883 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 219 states and 272 transitions. [2022-04-08 14:08:39,088 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 256 inductive. 0 not inductive. 16 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:39,089 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 272 transitions. [2022-04-08 14:08:39,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-08 14:08:39,089 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:08:39,090 INFO L499 BasicCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:08:39,106 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-08 14:08:39,290 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:08:39,290 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:08:39,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:08:39,291 INFO L85 PathProgramCache]: Analyzing trace with hash 1155770690, now seen corresponding path program 33 times [2022-04-08 14:08:39,291 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:39,291 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1986228699] [2022-04-08 14:08:45,338 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:08:45,338 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:08:45,339 INFO L85 PathProgramCache]: Analyzing trace with hash 1155770690, now seen corresponding path program 34 times [2022-04-08 14:08:45,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:08:45,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1314555020] [2022-04-08 14:08:45,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:08:45,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:08:45,357 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:08:45,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1781609976] [2022-04-08 14:08:45,357 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 14:08:45,357 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:08:45,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:08:45,358 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:08:45,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-08 14:08:45,500 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 14:08:45,500 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:08:45,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 528 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 14:08:45,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:08:45,535 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:08:46,312 INFO L272 TraceCheckUtils]: 0: Hoare triple {31450#true} call ULTIMATE.init(); {31450#true} is VALID [2022-04-08 14:08:46,312 INFO L290 TraceCheckUtils]: 1: Hoare triple {31450#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,313 INFO L290 TraceCheckUtils]: 2: Hoare triple {31458#(<= ~counter~0 0)} assume true; {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,313 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31458#(<= ~counter~0 0)} {31450#true} #77#return; {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,313 INFO L272 TraceCheckUtils]: 4: Hoare triple {31458#(<= ~counter~0 0)} call #t~ret7 := main(); {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,314 INFO L290 TraceCheckUtils]: 5: Hoare triple {31458#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,314 INFO L272 TraceCheckUtils]: 6: Hoare triple {31458#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {31458#(<= ~counter~0 0)} ~cond := #in~cond; {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {31458#(<= ~counter~0 0)} assume !(0 == ~cond); {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,315 INFO L290 TraceCheckUtils]: 9: Hoare triple {31458#(<= ~counter~0 0)} assume true; {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,315 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31458#(<= ~counter~0 0)} {31458#(<= ~counter~0 0)} #69#return; {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {31458#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {31458#(<= ~counter~0 0)} is VALID [2022-04-08 14:08:46,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {31458#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31492#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:46,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {31492#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {31492#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:46,317 INFO L272 TraceCheckUtils]: 14: Hoare triple {31492#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31492#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:46,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {31492#(<= ~counter~0 1)} ~cond := #in~cond; {31492#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:46,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {31492#(<= ~counter~0 1)} assume !(0 == ~cond); {31492#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:46,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {31492#(<= ~counter~0 1)} assume true; {31492#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:46,318 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31492#(<= ~counter~0 1)} {31492#(<= ~counter~0 1)} #71#return; {31492#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:46,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {31492#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {31492#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:46,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {31492#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31492#(<= ~counter~0 1)} is VALID [2022-04-08 14:08:46,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {31492#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:46,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {31520#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:46,320 INFO L272 TraceCheckUtils]: 23: Hoare triple {31520#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:46,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {31520#(<= ~counter~0 2)} ~cond := #in~cond; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:46,320 INFO L290 TraceCheckUtils]: 25: Hoare triple {31520#(<= ~counter~0 2)} assume !(0 == ~cond); {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:46,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {31520#(<= ~counter~0 2)} assume true; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:46,321 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {31520#(<= ~counter~0 2)} {31520#(<= ~counter~0 2)} #71#return; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:46,321 INFO L290 TraceCheckUtils]: 28: Hoare triple {31520#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:46,321 INFO L290 TraceCheckUtils]: 29: Hoare triple {31520#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:46,322 INFO L290 TraceCheckUtils]: 30: Hoare triple {31520#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:46,322 INFO L290 TraceCheckUtils]: 31: Hoare triple {31548#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:46,323 INFO L272 TraceCheckUtils]: 32: Hoare triple {31548#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:46,323 INFO L290 TraceCheckUtils]: 33: Hoare triple {31548#(<= ~counter~0 3)} ~cond := #in~cond; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:46,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {31548#(<= ~counter~0 3)} assume !(0 == ~cond); {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:46,323 INFO L290 TraceCheckUtils]: 35: Hoare triple {31548#(<= ~counter~0 3)} assume true; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:46,324 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31548#(<= ~counter~0 3)} {31548#(<= ~counter~0 3)} #71#return; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:46,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {31548#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:46,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {31548#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:46,325 INFO L290 TraceCheckUtils]: 39: Hoare triple {31548#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:46,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {31576#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:46,326 INFO L272 TraceCheckUtils]: 41: Hoare triple {31576#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:46,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {31576#(<= ~counter~0 4)} ~cond := #in~cond; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:46,326 INFO L290 TraceCheckUtils]: 43: Hoare triple {31576#(<= ~counter~0 4)} assume !(0 == ~cond); {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:46,326 INFO L290 TraceCheckUtils]: 44: Hoare triple {31576#(<= ~counter~0 4)} assume true; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:46,327 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31576#(<= ~counter~0 4)} {31576#(<= ~counter~0 4)} #71#return; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:46,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {31576#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:46,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {31576#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:46,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {31576#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:46,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {31604#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:46,329 INFO L272 TraceCheckUtils]: 50: Hoare triple {31604#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:46,329 INFO L290 TraceCheckUtils]: 51: Hoare triple {31604#(<= ~counter~0 5)} ~cond := #in~cond; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:46,329 INFO L290 TraceCheckUtils]: 52: Hoare triple {31604#(<= ~counter~0 5)} assume !(0 == ~cond); {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:46,329 INFO L290 TraceCheckUtils]: 53: Hoare triple {31604#(<= ~counter~0 5)} assume true; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:46,330 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31604#(<= ~counter~0 5)} {31604#(<= ~counter~0 5)} #71#return; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:46,330 INFO L290 TraceCheckUtils]: 55: Hoare triple {31604#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:46,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {31604#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:46,331 INFO L290 TraceCheckUtils]: 57: Hoare triple {31604#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:46,331 INFO L290 TraceCheckUtils]: 58: Hoare triple {31632#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:46,332 INFO L272 TraceCheckUtils]: 59: Hoare triple {31632#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:46,332 INFO L290 TraceCheckUtils]: 60: Hoare triple {31632#(<= ~counter~0 6)} ~cond := #in~cond; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:46,332 INFO L290 TraceCheckUtils]: 61: Hoare triple {31632#(<= ~counter~0 6)} assume !(0 == ~cond); {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:46,332 INFO L290 TraceCheckUtils]: 62: Hoare triple {31632#(<= ~counter~0 6)} assume true; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:46,333 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31632#(<= ~counter~0 6)} {31632#(<= ~counter~0 6)} #71#return; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:46,333 INFO L290 TraceCheckUtils]: 64: Hoare triple {31632#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:46,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {31632#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:46,334 INFO L290 TraceCheckUtils]: 66: Hoare triple {31632#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:46,334 INFO L290 TraceCheckUtils]: 67: Hoare triple {31660#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:46,335 INFO L272 TraceCheckUtils]: 68: Hoare triple {31660#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:46,335 INFO L290 TraceCheckUtils]: 69: Hoare triple {31660#(<= ~counter~0 7)} ~cond := #in~cond; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:46,335 INFO L290 TraceCheckUtils]: 70: Hoare triple {31660#(<= ~counter~0 7)} assume !(0 == ~cond); {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:46,335 INFO L290 TraceCheckUtils]: 71: Hoare triple {31660#(<= ~counter~0 7)} assume true; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:46,336 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {31660#(<= ~counter~0 7)} {31660#(<= ~counter~0 7)} #71#return; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:46,336 INFO L290 TraceCheckUtils]: 73: Hoare triple {31660#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:46,336 INFO L290 TraceCheckUtils]: 74: Hoare triple {31660#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:46,337 INFO L290 TraceCheckUtils]: 75: Hoare triple {31660#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:46,337 INFO L290 TraceCheckUtils]: 76: Hoare triple {31688#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:46,338 INFO L272 TraceCheckUtils]: 77: Hoare triple {31688#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:46,338 INFO L290 TraceCheckUtils]: 78: Hoare triple {31688#(<= ~counter~0 8)} ~cond := #in~cond; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:46,338 INFO L290 TraceCheckUtils]: 79: Hoare triple {31688#(<= ~counter~0 8)} assume !(0 == ~cond); {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:46,338 INFO L290 TraceCheckUtils]: 80: Hoare triple {31688#(<= ~counter~0 8)} assume true; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:46,339 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {31688#(<= ~counter~0 8)} {31688#(<= ~counter~0 8)} #71#return; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:46,339 INFO L290 TraceCheckUtils]: 82: Hoare triple {31688#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:46,339 INFO L290 TraceCheckUtils]: 83: Hoare triple {31688#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:46,340 INFO L290 TraceCheckUtils]: 84: Hoare triple {31688#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:46,340 INFO L290 TraceCheckUtils]: 85: Hoare triple {31716#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:46,340 INFO L272 TraceCheckUtils]: 86: Hoare triple {31716#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:46,341 INFO L290 TraceCheckUtils]: 87: Hoare triple {31716#(<= ~counter~0 9)} ~cond := #in~cond; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:46,341 INFO L290 TraceCheckUtils]: 88: Hoare triple {31716#(<= ~counter~0 9)} assume !(0 == ~cond); {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:46,341 INFO L290 TraceCheckUtils]: 89: Hoare triple {31716#(<= ~counter~0 9)} assume true; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:46,342 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {31716#(<= ~counter~0 9)} {31716#(<= ~counter~0 9)} #71#return; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:46,342 INFO L290 TraceCheckUtils]: 91: Hoare triple {31716#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:46,342 INFO L290 TraceCheckUtils]: 92: Hoare triple {31716#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:46,343 INFO L290 TraceCheckUtils]: 93: Hoare triple {31716#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:46,343 INFO L290 TraceCheckUtils]: 94: Hoare triple {31744#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:46,343 INFO L272 TraceCheckUtils]: 95: Hoare triple {31744#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:46,344 INFO L290 TraceCheckUtils]: 96: Hoare triple {31744#(<= ~counter~0 10)} ~cond := #in~cond; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:46,344 INFO L290 TraceCheckUtils]: 97: Hoare triple {31744#(<= ~counter~0 10)} assume !(0 == ~cond); {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:46,344 INFO L290 TraceCheckUtils]: 98: Hoare triple {31744#(<= ~counter~0 10)} assume true; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:46,345 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {31744#(<= ~counter~0 10)} {31744#(<= ~counter~0 10)} #71#return; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:46,345 INFO L290 TraceCheckUtils]: 100: Hoare triple {31744#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:46,345 INFO L290 TraceCheckUtils]: 101: Hoare triple {31744#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:46,346 INFO L290 TraceCheckUtils]: 102: Hoare triple {31744#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:46,346 INFO L290 TraceCheckUtils]: 103: Hoare triple {31772#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:46,346 INFO L272 TraceCheckUtils]: 104: Hoare triple {31772#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:46,347 INFO L290 TraceCheckUtils]: 105: Hoare triple {31772#(<= ~counter~0 11)} ~cond := #in~cond; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:46,347 INFO L290 TraceCheckUtils]: 106: Hoare triple {31772#(<= ~counter~0 11)} assume !(0 == ~cond); {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:46,347 INFO L290 TraceCheckUtils]: 107: Hoare triple {31772#(<= ~counter~0 11)} assume true; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:46,348 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31772#(<= ~counter~0 11)} {31772#(<= ~counter~0 11)} #71#return; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:46,348 INFO L290 TraceCheckUtils]: 109: Hoare triple {31772#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:46,348 INFO L290 TraceCheckUtils]: 110: Hoare triple {31772#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:46,349 INFO L290 TraceCheckUtils]: 111: Hoare triple {31772#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:46,349 INFO L290 TraceCheckUtils]: 112: Hoare triple {31800#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:46,349 INFO L272 TraceCheckUtils]: 113: Hoare triple {31800#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:46,350 INFO L290 TraceCheckUtils]: 114: Hoare triple {31800#(<= ~counter~0 12)} ~cond := #in~cond; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:46,350 INFO L290 TraceCheckUtils]: 115: Hoare triple {31800#(<= ~counter~0 12)} assume !(0 == ~cond); {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:46,350 INFO L290 TraceCheckUtils]: 116: Hoare triple {31800#(<= ~counter~0 12)} assume true; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:46,351 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {31800#(<= ~counter~0 12)} {31800#(<= ~counter~0 12)} #71#return; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:46,351 INFO L290 TraceCheckUtils]: 118: Hoare triple {31800#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:46,351 INFO L290 TraceCheckUtils]: 119: Hoare triple {31800#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:46,352 INFO L290 TraceCheckUtils]: 120: Hoare triple {31800#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:46,352 INFO L290 TraceCheckUtils]: 121: Hoare triple {31828#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:46,352 INFO L272 TraceCheckUtils]: 122: Hoare triple {31828#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:46,353 INFO L290 TraceCheckUtils]: 123: Hoare triple {31828#(<= ~counter~0 13)} ~cond := #in~cond; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:46,353 INFO L290 TraceCheckUtils]: 124: Hoare triple {31828#(<= ~counter~0 13)} assume !(0 == ~cond); {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:46,353 INFO L290 TraceCheckUtils]: 125: Hoare triple {31828#(<= ~counter~0 13)} assume true; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:46,354 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {31828#(<= ~counter~0 13)} {31828#(<= ~counter~0 13)} #71#return; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:46,354 INFO L290 TraceCheckUtils]: 127: Hoare triple {31828#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:46,354 INFO L290 TraceCheckUtils]: 128: Hoare triple {31828#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:46,355 INFO L290 TraceCheckUtils]: 129: Hoare triple {31828#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:46,355 INFO L290 TraceCheckUtils]: 130: Hoare triple {31856#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:46,355 INFO L272 TraceCheckUtils]: 131: Hoare triple {31856#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:46,356 INFO L290 TraceCheckUtils]: 132: Hoare triple {31856#(<= ~counter~0 14)} ~cond := #in~cond; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:46,356 INFO L290 TraceCheckUtils]: 133: Hoare triple {31856#(<= ~counter~0 14)} assume !(0 == ~cond); {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:46,356 INFO L290 TraceCheckUtils]: 134: Hoare triple {31856#(<= ~counter~0 14)} assume true; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:46,357 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31856#(<= ~counter~0 14)} {31856#(<= ~counter~0 14)} #71#return; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:46,357 INFO L290 TraceCheckUtils]: 136: Hoare triple {31856#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:46,357 INFO L290 TraceCheckUtils]: 137: Hoare triple {31856#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:46,357 INFO L290 TraceCheckUtils]: 138: Hoare triple {31856#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:46,358 INFO L290 TraceCheckUtils]: 139: Hoare triple {31884#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:46,358 INFO L272 TraceCheckUtils]: 140: Hoare triple {31884#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:46,359 INFO L290 TraceCheckUtils]: 141: Hoare triple {31884#(<= ~counter~0 15)} ~cond := #in~cond; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:46,359 INFO L290 TraceCheckUtils]: 142: Hoare triple {31884#(<= ~counter~0 15)} assume !(0 == ~cond); {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:46,359 INFO L290 TraceCheckUtils]: 143: Hoare triple {31884#(<= ~counter~0 15)} assume true; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:46,360 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {31884#(<= ~counter~0 15)} {31884#(<= ~counter~0 15)} #71#return; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:46,360 INFO L290 TraceCheckUtils]: 145: Hoare triple {31884#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:46,360 INFO L290 TraceCheckUtils]: 146: Hoare triple {31884#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:46,360 INFO L290 TraceCheckUtils]: 147: Hoare triple {31884#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:46,361 INFO L290 TraceCheckUtils]: 148: Hoare triple {31912#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:46,361 INFO L272 TraceCheckUtils]: 149: Hoare triple {31912#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:46,361 INFO L290 TraceCheckUtils]: 150: Hoare triple {31912#(<= ~counter~0 16)} ~cond := #in~cond; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:46,362 INFO L290 TraceCheckUtils]: 151: Hoare triple {31912#(<= ~counter~0 16)} assume !(0 == ~cond); {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:46,362 INFO L290 TraceCheckUtils]: 152: Hoare triple {31912#(<= ~counter~0 16)} assume true; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:46,362 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {31912#(<= ~counter~0 16)} {31912#(<= ~counter~0 16)} #71#return; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:46,363 INFO L290 TraceCheckUtils]: 154: Hoare triple {31912#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:46,363 INFO L290 TraceCheckUtils]: 155: Hoare triple {31912#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:46,363 INFO L290 TraceCheckUtils]: 156: Hoare triple {31912#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:46,364 INFO L290 TraceCheckUtils]: 157: Hoare triple {31940#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:46,364 INFO L272 TraceCheckUtils]: 158: Hoare triple {31940#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:46,364 INFO L290 TraceCheckUtils]: 159: Hoare triple {31940#(<= ~counter~0 17)} ~cond := #in~cond; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:46,365 INFO L290 TraceCheckUtils]: 160: Hoare triple {31940#(<= ~counter~0 17)} assume !(0 == ~cond); {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:46,365 INFO L290 TraceCheckUtils]: 161: Hoare triple {31940#(<= ~counter~0 17)} assume true; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:46,365 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {31940#(<= ~counter~0 17)} {31940#(<= ~counter~0 17)} #71#return; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:46,366 INFO L290 TraceCheckUtils]: 163: Hoare triple {31940#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:46,366 INFO L290 TraceCheckUtils]: 164: Hoare triple {31940#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:46,366 INFO L290 TraceCheckUtils]: 165: Hoare triple {31940#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31968#(<= |main_#t~post6| 17)} is VALID [2022-04-08 14:08:46,367 INFO L290 TraceCheckUtils]: 166: Hoare triple {31968#(<= |main_#t~post6| 17)} assume !(#t~post6 < 20);havoc #t~post6; {31451#false} is VALID [2022-04-08 14:08:46,367 INFO L272 TraceCheckUtils]: 167: Hoare triple {31451#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {31451#false} is VALID [2022-04-08 14:08:46,367 INFO L290 TraceCheckUtils]: 168: Hoare triple {31451#false} ~cond := #in~cond; {31451#false} is VALID [2022-04-08 14:08:46,367 INFO L290 TraceCheckUtils]: 169: Hoare triple {31451#false} assume 0 == ~cond; {31451#false} is VALID [2022-04-08 14:08:46,367 INFO L290 TraceCheckUtils]: 170: Hoare triple {31451#false} assume !false; {31451#false} is VALID [2022-04-08 14:08:46,368 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 34 proven. 1258 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:08:46,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:08:47,030 INFO L290 TraceCheckUtils]: 170: Hoare triple {31451#false} assume !false; {31451#false} is VALID [2022-04-08 14:08:47,030 INFO L290 TraceCheckUtils]: 169: Hoare triple {31451#false} assume 0 == ~cond; {31451#false} is VALID [2022-04-08 14:08:47,030 INFO L290 TraceCheckUtils]: 168: Hoare triple {31451#false} ~cond := #in~cond; {31451#false} is VALID [2022-04-08 14:08:47,030 INFO L272 TraceCheckUtils]: 167: Hoare triple {31451#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {31451#false} is VALID [2022-04-08 14:08:47,030 INFO L290 TraceCheckUtils]: 166: Hoare triple {31996#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {31451#false} is VALID [2022-04-08 14:08:47,031 INFO L290 TraceCheckUtils]: 165: Hoare triple {32000#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31996#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:08:47,031 INFO L290 TraceCheckUtils]: 164: Hoare triple {32000#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32000#(< ~counter~0 20)} is VALID [2022-04-08 14:08:47,031 INFO L290 TraceCheckUtils]: 163: Hoare triple {32000#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {32000#(< ~counter~0 20)} is VALID [2022-04-08 14:08:47,032 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {31450#true} {32000#(< ~counter~0 20)} #71#return; {32000#(< ~counter~0 20)} is VALID [2022-04-08 14:08:47,032 INFO L290 TraceCheckUtils]: 161: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,032 INFO L290 TraceCheckUtils]: 160: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,032 INFO L290 TraceCheckUtils]: 159: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,032 INFO L272 TraceCheckUtils]: 158: Hoare triple {32000#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,032 INFO L290 TraceCheckUtils]: 157: Hoare triple {32000#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {32000#(< ~counter~0 20)} is VALID [2022-04-08 14:08:47,033 INFO L290 TraceCheckUtils]: 156: Hoare triple {32028#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32000#(< ~counter~0 20)} is VALID [2022-04-08 14:08:47,033 INFO L290 TraceCheckUtils]: 155: Hoare triple {32028#(< ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {32028#(< ~counter~0 19)} is VALID [2022-04-08 14:08:47,034 INFO L290 TraceCheckUtils]: 154: Hoare triple {32028#(< ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {32028#(< ~counter~0 19)} is VALID [2022-04-08 14:08:47,034 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {31450#true} {32028#(< ~counter~0 19)} #71#return; {32028#(< ~counter~0 19)} is VALID [2022-04-08 14:08:47,034 INFO L290 TraceCheckUtils]: 152: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,034 INFO L290 TraceCheckUtils]: 151: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,034 INFO L290 TraceCheckUtils]: 150: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,035 INFO L272 TraceCheckUtils]: 149: Hoare triple {32028#(< ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,035 INFO L290 TraceCheckUtils]: 148: Hoare triple {32028#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {32028#(< ~counter~0 19)} is VALID [2022-04-08 14:08:47,035 INFO L290 TraceCheckUtils]: 147: Hoare triple {31940#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32028#(< ~counter~0 19)} is VALID [2022-04-08 14:08:47,036 INFO L290 TraceCheckUtils]: 146: Hoare triple {31940#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:47,036 INFO L290 TraceCheckUtils]: 145: Hoare triple {31940#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:47,036 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {31450#true} {31940#(<= ~counter~0 17)} #71#return; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:47,037 INFO L290 TraceCheckUtils]: 143: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,037 INFO L290 TraceCheckUtils]: 142: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,037 INFO L290 TraceCheckUtils]: 141: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,037 INFO L272 TraceCheckUtils]: 140: Hoare triple {31940#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,037 INFO L290 TraceCheckUtils]: 139: Hoare triple {31940#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:47,037 INFO L290 TraceCheckUtils]: 138: Hoare triple {31912#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31940#(<= ~counter~0 17)} is VALID [2022-04-08 14:08:47,038 INFO L290 TraceCheckUtils]: 137: Hoare triple {31912#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:47,038 INFO L290 TraceCheckUtils]: 136: Hoare triple {31912#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:47,039 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {31450#true} {31912#(<= ~counter~0 16)} #71#return; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:47,039 INFO L290 TraceCheckUtils]: 134: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,039 INFO L290 TraceCheckUtils]: 133: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,039 INFO L290 TraceCheckUtils]: 132: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,039 INFO L272 TraceCheckUtils]: 131: Hoare triple {31912#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,039 INFO L290 TraceCheckUtils]: 130: Hoare triple {31912#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:47,040 INFO L290 TraceCheckUtils]: 129: Hoare triple {31884#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31912#(<= ~counter~0 16)} is VALID [2022-04-08 14:08:47,040 INFO L290 TraceCheckUtils]: 128: Hoare triple {31884#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:47,040 INFO L290 TraceCheckUtils]: 127: Hoare triple {31884#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:47,041 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {31450#true} {31884#(<= ~counter~0 15)} #71#return; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:47,041 INFO L290 TraceCheckUtils]: 125: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,041 INFO L290 TraceCheckUtils]: 124: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,041 INFO L290 TraceCheckUtils]: 123: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,041 INFO L272 TraceCheckUtils]: 122: Hoare triple {31884#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,041 INFO L290 TraceCheckUtils]: 121: Hoare triple {31884#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:47,042 INFO L290 TraceCheckUtils]: 120: Hoare triple {31856#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31884#(<= ~counter~0 15)} is VALID [2022-04-08 14:08:47,042 INFO L290 TraceCheckUtils]: 119: Hoare triple {31856#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:47,042 INFO L290 TraceCheckUtils]: 118: Hoare triple {31856#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:47,043 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {31450#true} {31856#(<= ~counter~0 14)} #71#return; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:47,043 INFO L290 TraceCheckUtils]: 116: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,043 INFO L290 TraceCheckUtils]: 115: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,043 INFO L290 TraceCheckUtils]: 114: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,043 INFO L272 TraceCheckUtils]: 113: Hoare triple {31856#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,043 INFO L290 TraceCheckUtils]: 112: Hoare triple {31856#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:47,044 INFO L290 TraceCheckUtils]: 111: Hoare triple {31828#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31856#(<= ~counter~0 14)} is VALID [2022-04-08 14:08:47,044 INFO L290 TraceCheckUtils]: 110: Hoare triple {31828#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:47,044 INFO L290 TraceCheckUtils]: 109: Hoare triple {31828#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:47,045 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {31450#true} {31828#(<= ~counter~0 13)} #71#return; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:47,045 INFO L290 TraceCheckUtils]: 107: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,045 INFO L290 TraceCheckUtils]: 106: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,045 INFO L290 TraceCheckUtils]: 105: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,045 INFO L272 TraceCheckUtils]: 104: Hoare triple {31828#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,046 INFO L290 TraceCheckUtils]: 103: Hoare triple {31828#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:47,046 INFO L290 TraceCheckUtils]: 102: Hoare triple {31800#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31828#(<= ~counter~0 13)} is VALID [2022-04-08 14:08:47,046 INFO L290 TraceCheckUtils]: 101: Hoare triple {31800#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:47,047 INFO L290 TraceCheckUtils]: 100: Hoare triple {31800#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:47,047 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {31450#true} {31800#(<= ~counter~0 12)} #71#return; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:47,047 INFO L290 TraceCheckUtils]: 98: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,047 INFO L290 TraceCheckUtils]: 97: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,047 INFO L290 TraceCheckUtils]: 96: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,047 INFO L272 TraceCheckUtils]: 95: Hoare triple {31800#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,048 INFO L290 TraceCheckUtils]: 94: Hoare triple {31800#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:47,048 INFO L290 TraceCheckUtils]: 93: Hoare triple {31772#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31800#(<= ~counter~0 12)} is VALID [2022-04-08 14:08:47,048 INFO L290 TraceCheckUtils]: 92: Hoare triple {31772#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:47,049 INFO L290 TraceCheckUtils]: 91: Hoare triple {31772#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:47,049 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {31450#true} {31772#(<= ~counter~0 11)} #71#return; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:47,049 INFO L290 TraceCheckUtils]: 89: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,049 INFO L290 TraceCheckUtils]: 88: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,049 INFO L290 TraceCheckUtils]: 87: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,049 INFO L272 TraceCheckUtils]: 86: Hoare triple {31772#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,050 INFO L290 TraceCheckUtils]: 85: Hoare triple {31772#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:47,050 INFO L290 TraceCheckUtils]: 84: Hoare triple {31744#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31772#(<= ~counter~0 11)} is VALID [2022-04-08 14:08:47,050 INFO L290 TraceCheckUtils]: 83: Hoare triple {31744#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:47,051 INFO L290 TraceCheckUtils]: 82: Hoare triple {31744#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:47,051 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {31450#true} {31744#(<= ~counter~0 10)} #71#return; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:47,051 INFO L290 TraceCheckUtils]: 80: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,051 INFO L290 TraceCheckUtils]: 79: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,051 INFO L290 TraceCheckUtils]: 78: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,051 INFO L272 TraceCheckUtils]: 77: Hoare triple {31744#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,052 INFO L290 TraceCheckUtils]: 76: Hoare triple {31744#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:47,052 INFO L290 TraceCheckUtils]: 75: Hoare triple {31716#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31744#(<= ~counter~0 10)} is VALID [2022-04-08 14:08:47,052 INFO L290 TraceCheckUtils]: 74: Hoare triple {31716#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:47,053 INFO L290 TraceCheckUtils]: 73: Hoare triple {31716#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:47,053 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {31450#true} {31716#(<= ~counter~0 9)} #71#return; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:47,053 INFO L290 TraceCheckUtils]: 71: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,053 INFO L290 TraceCheckUtils]: 70: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,053 INFO L290 TraceCheckUtils]: 69: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,053 INFO L272 TraceCheckUtils]: 68: Hoare triple {31716#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,054 INFO L290 TraceCheckUtils]: 67: Hoare triple {31716#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:47,054 INFO L290 TraceCheckUtils]: 66: Hoare triple {31688#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31716#(<= ~counter~0 9)} is VALID [2022-04-08 14:08:47,054 INFO L290 TraceCheckUtils]: 65: Hoare triple {31688#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:47,055 INFO L290 TraceCheckUtils]: 64: Hoare triple {31688#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:47,055 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {31450#true} {31688#(<= ~counter~0 8)} #71#return; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:47,055 INFO L290 TraceCheckUtils]: 62: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,055 INFO L290 TraceCheckUtils]: 61: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,055 INFO L290 TraceCheckUtils]: 60: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,056 INFO L272 TraceCheckUtils]: 59: Hoare triple {31688#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,056 INFO L290 TraceCheckUtils]: 58: Hoare triple {31688#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:47,056 INFO L290 TraceCheckUtils]: 57: Hoare triple {31660#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31688#(<= ~counter~0 8)} is VALID [2022-04-08 14:08:47,056 INFO L290 TraceCheckUtils]: 56: Hoare triple {31660#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:47,057 INFO L290 TraceCheckUtils]: 55: Hoare triple {31660#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:47,057 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {31450#true} {31660#(<= ~counter~0 7)} #71#return; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:47,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,057 INFO L290 TraceCheckUtils]: 52: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,057 INFO L290 TraceCheckUtils]: 51: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,058 INFO L272 TraceCheckUtils]: 50: Hoare triple {31660#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,059 INFO L290 TraceCheckUtils]: 49: Hoare triple {31660#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:47,060 INFO L290 TraceCheckUtils]: 48: Hoare triple {31632#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31660#(<= ~counter~0 7)} is VALID [2022-04-08 14:08:47,060 INFO L290 TraceCheckUtils]: 47: Hoare triple {31632#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:47,060 INFO L290 TraceCheckUtils]: 46: Hoare triple {31632#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:47,061 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {31450#true} {31632#(<= ~counter~0 6)} #71#return; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:47,061 INFO L290 TraceCheckUtils]: 44: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,061 INFO L290 TraceCheckUtils]: 43: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,061 INFO L272 TraceCheckUtils]: 41: Hoare triple {31632#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,061 INFO L290 TraceCheckUtils]: 40: Hoare triple {31632#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:47,062 INFO L290 TraceCheckUtils]: 39: Hoare triple {31604#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31632#(<= ~counter~0 6)} is VALID [2022-04-08 14:08:47,062 INFO L290 TraceCheckUtils]: 38: Hoare triple {31604#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:47,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {31604#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:47,063 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {31450#true} {31604#(<= ~counter~0 5)} #71#return; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:47,063 INFO L290 TraceCheckUtils]: 35: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,063 INFO L272 TraceCheckUtils]: 32: Hoare triple {31604#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,063 INFO L290 TraceCheckUtils]: 31: Hoare triple {31604#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:47,064 INFO L290 TraceCheckUtils]: 30: Hoare triple {31576#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31604#(<= ~counter~0 5)} is VALID [2022-04-08 14:08:47,064 INFO L290 TraceCheckUtils]: 29: Hoare triple {31576#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:47,064 INFO L290 TraceCheckUtils]: 28: Hoare triple {31576#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:47,065 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {31450#true} {31576#(<= ~counter~0 4)} #71#return; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:47,065 INFO L290 TraceCheckUtils]: 26: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,065 INFO L272 TraceCheckUtils]: 23: Hoare triple {31576#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {31576#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:47,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {31548#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31576#(<= ~counter~0 4)} is VALID [2022-04-08 14:08:47,066 INFO L290 TraceCheckUtils]: 20: Hoare triple {31548#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:47,066 INFO L290 TraceCheckUtils]: 19: Hoare triple {31548#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:47,067 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {31450#true} {31548#(<= ~counter~0 3)} #71#return; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:47,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,068 INFO L272 TraceCheckUtils]: 14: Hoare triple {31548#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {31548#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:47,068 INFO L290 TraceCheckUtils]: 12: Hoare triple {31520#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {31548#(<= ~counter~0 3)} is VALID [2022-04-08 14:08:47,069 INFO L290 TraceCheckUtils]: 11: Hoare triple {31520#(<= ~counter~0 2)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:47,069 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {31450#true} {31520#(<= ~counter~0 2)} #69#return; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:47,069 INFO L290 TraceCheckUtils]: 9: Hoare triple {31450#true} assume true; {31450#true} is VALID [2022-04-08 14:08:47,069 INFO L290 TraceCheckUtils]: 8: Hoare triple {31450#true} assume !(0 == ~cond); {31450#true} is VALID [2022-04-08 14:08:47,069 INFO L290 TraceCheckUtils]: 7: Hoare triple {31450#true} ~cond := #in~cond; {31450#true} is VALID [2022-04-08 14:08:47,069 INFO L272 TraceCheckUtils]: 6: Hoare triple {31520#(<= ~counter~0 2)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {31450#true} is VALID [2022-04-08 14:08:47,070 INFO L290 TraceCheckUtils]: 5: Hoare triple {31520#(<= ~counter~0 2)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:47,070 INFO L272 TraceCheckUtils]: 4: Hoare triple {31520#(<= ~counter~0 2)} call #t~ret7 := main(); {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:47,070 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31520#(<= ~counter~0 2)} {31450#true} #77#return; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:47,070 INFO L290 TraceCheckUtils]: 2: Hoare triple {31520#(<= ~counter~0 2)} assume true; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:47,071 INFO L290 TraceCheckUtils]: 1: Hoare triple {31450#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {31520#(<= ~counter~0 2)} is VALID [2022-04-08 14:08:47,071 INFO L272 TraceCheckUtils]: 0: Hoare triple {31450#true} call ULTIMATE.init(); {31450#true} is VALID [2022-04-08 14:08:47,072 INFO L134 CoverageAnalysis]: Checked inductivity of 1292 backedges. 34 proven. 714 refuted. 0 times theorem prover too weak. 544 trivial. 0 not checked. [2022-04-08 14:08:47,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:08:47,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1314555020] [2022-04-08 14:08:47,072 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:08:47,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1781609976] [2022-04-08 14:08:47,072 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1781609976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:08:47,072 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:08:47,072 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-08 14:08:47,072 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:08:47,072 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1986228699] [2022-04-08 14:08:47,073 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1986228699] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:08:47,073 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:08:47,073 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 14:08:47,073 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424784859] [2022-04-08 14:08:47,073 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:08:47,074 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Word has length 171 [2022-04-08 14:08:47,074 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:08:47,074 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:08:47,193 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:47,193 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 14:08:47,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:08:47,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 14:08:47,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:08:47,194 INFO L87 Difference]: Start difference. First operand 219 states and 272 transitions. Second operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:08:48,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:48,225 INFO L93 Difference]: Finished difference Result 238 states and 295 transitions. [2022-04-08 14:08:48,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 14:08:48,226 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Word has length 171 [2022-04-08 14:08:48,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:08:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:08:48,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 281 transitions. [2022-04-08 14:08:48,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:08:48,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 281 transitions. [2022-04-08 14:08:48,232 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 281 transitions. [2022-04-08 14:08:48,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:08:48,471 INFO L225 Difference]: With dead ends: 238 [2022-04-08 14:08:48,471 INFO L226 Difference]: Without dead ends: 230 [2022-04-08 14:08:48,472 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 318 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=627, Invalid=1013, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 14:08:48,472 INFO L913 BasicCegarLoop]: 47 mSDtfsCounter, 243 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 243 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:08:48,472 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [243 Valid, 306 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:08:48,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-04-08 14:08:48,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 230. [2022-04-08 14:08:48,856 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:08:48,856 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 14:08:48,857 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 14:08:48,857 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 14:08:48,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:48,859 INFO L93 Difference]: Finished difference Result 230 states and 286 transitions. [2022-04-08 14:08:48,859 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2022-04-08 14:08:48,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:48,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:48,860 INFO L74 IsIncluded]: Start isIncluded. First operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 230 states. [2022-04-08 14:08:48,860 INFO L87 Difference]: Start difference. First operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 230 states. [2022-04-08 14:08:48,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:08:48,863 INFO L93 Difference]: Finished difference Result 230 states and 286 transitions. [2022-04-08 14:08:48,863 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2022-04-08 14:08:48,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:08:48,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:08:48,863 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:08:48,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:08:48,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 183 states have (on average 1.3114754098360655) internal successors, (240), 184 states have internal predecessors, (240), 24 states have call successors, (24), 23 states have call predecessors, (24), 22 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-08 14:08:48,866 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 286 transitions. [2022-04-08 14:08:48,866 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 286 transitions. Word has length 171 [2022-04-08 14:08:48,866 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:08:48,866 INFO L478 AbstractCegarLoop]: Abstraction has 230 states and 286 transitions. [2022-04-08 14:08:48,867 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-08 14:08:48,867 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 230 states and 286 transitions. [2022-04-08 14:09:25,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 286 edges. 269 inductive. 0 not inductive. 17 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:25,914 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 286 transitions. [2022-04-08 14:09:25,914 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 181 [2022-04-08 14:09:25,914 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:09:25,914 INFO L499 BasicCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:09:25,931 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Forceful destruction successful, exit code 0 [2022-04-08 14:09:26,121 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable30 [2022-04-08 14:09:26,121 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:09:26,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:09:26,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1754232326, now seen corresponding path program 35 times [2022-04-08 14:09:26,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:09:26,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1262024815] [2022-04-08 14:09:32,167 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:09:32,168 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:09:32,168 INFO L85 PathProgramCache]: Analyzing trace with hash -1754232326, now seen corresponding path program 36 times [2022-04-08 14:09:32,168 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:09:32,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1313166141] [2022-04-08 14:09:32,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:09:32,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:09:32,188 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:09:32,189 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1579570328] [2022-04-08 14:09:32,189 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 14:09:32,189 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:09:32,189 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:09:32,190 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:09:32,191 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-08 14:09:32,474 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 14:09:32,474 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:09:32,477 INFO L263 TraceCheckSpWp]: Trace formula consists of 554 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 14:09:32,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:09:32,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:09:33,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {33929#true} call ULTIMATE.init(); {33929#true} is VALID [2022-04-08 14:09:33,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {33929#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {33937#(<= ~counter~0 0)} assume true; {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33937#(<= ~counter~0 0)} {33929#true} #77#return; {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,376 INFO L272 TraceCheckUtils]: 4: Hoare triple {33937#(<= ~counter~0 0)} call #t~ret7 := main(); {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {33937#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {33937#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {33937#(<= ~counter~0 0)} ~cond := #in~cond; {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {33937#(<= ~counter~0 0)} assume !(0 == ~cond); {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {33937#(<= ~counter~0 0)} assume true; {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,378 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33937#(<= ~counter~0 0)} {33937#(<= ~counter~0 0)} #69#return; {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {33937#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {33937#(<= ~counter~0 0)} is VALID [2022-04-08 14:09:33,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {33937#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:33,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {33971#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:33,380 INFO L272 TraceCheckUtils]: 14: Hoare triple {33971#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:33,380 INFO L290 TraceCheckUtils]: 15: Hoare triple {33971#(<= ~counter~0 1)} ~cond := #in~cond; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:33,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {33971#(<= ~counter~0 1)} assume !(0 == ~cond); {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:33,381 INFO L290 TraceCheckUtils]: 17: Hoare triple {33971#(<= ~counter~0 1)} assume true; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:33,381 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {33971#(<= ~counter~0 1)} {33971#(<= ~counter~0 1)} #71#return; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:33,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {33971#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:33,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {33971#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:33,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {33971#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:33,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {33999#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:33,383 INFO L272 TraceCheckUtils]: 23: Hoare triple {33999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:33,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {33999#(<= ~counter~0 2)} ~cond := #in~cond; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:33,383 INFO L290 TraceCheckUtils]: 25: Hoare triple {33999#(<= ~counter~0 2)} assume !(0 == ~cond); {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:33,385 INFO L290 TraceCheckUtils]: 26: Hoare triple {33999#(<= ~counter~0 2)} assume true; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:33,386 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {33999#(<= ~counter~0 2)} {33999#(<= ~counter~0 2)} #71#return; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:33,386 INFO L290 TraceCheckUtils]: 28: Hoare triple {33999#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:33,386 INFO L290 TraceCheckUtils]: 29: Hoare triple {33999#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:33,387 INFO L290 TraceCheckUtils]: 30: Hoare triple {33999#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:33,387 INFO L290 TraceCheckUtils]: 31: Hoare triple {34027#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:33,387 INFO L272 TraceCheckUtils]: 32: Hoare triple {34027#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:33,388 INFO L290 TraceCheckUtils]: 33: Hoare triple {34027#(<= ~counter~0 3)} ~cond := #in~cond; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:33,388 INFO L290 TraceCheckUtils]: 34: Hoare triple {34027#(<= ~counter~0 3)} assume !(0 == ~cond); {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:33,388 INFO L290 TraceCheckUtils]: 35: Hoare triple {34027#(<= ~counter~0 3)} assume true; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:33,389 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {34027#(<= ~counter~0 3)} {34027#(<= ~counter~0 3)} #71#return; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:33,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {34027#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:33,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {34027#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:33,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {34027#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:33,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {34055#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:33,390 INFO L272 TraceCheckUtils]: 41: Hoare triple {34055#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:33,391 INFO L290 TraceCheckUtils]: 42: Hoare triple {34055#(<= ~counter~0 4)} ~cond := #in~cond; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:33,391 INFO L290 TraceCheckUtils]: 43: Hoare triple {34055#(<= ~counter~0 4)} assume !(0 == ~cond); {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:33,391 INFO L290 TraceCheckUtils]: 44: Hoare triple {34055#(<= ~counter~0 4)} assume true; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:33,392 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {34055#(<= ~counter~0 4)} {34055#(<= ~counter~0 4)} #71#return; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:33,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {34055#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:33,392 INFO L290 TraceCheckUtils]: 47: Hoare triple {34055#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:33,393 INFO L290 TraceCheckUtils]: 48: Hoare triple {34055#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:33,393 INFO L290 TraceCheckUtils]: 49: Hoare triple {34083#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:33,393 INFO L272 TraceCheckUtils]: 50: Hoare triple {34083#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:33,394 INFO L290 TraceCheckUtils]: 51: Hoare triple {34083#(<= ~counter~0 5)} ~cond := #in~cond; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:33,394 INFO L290 TraceCheckUtils]: 52: Hoare triple {34083#(<= ~counter~0 5)} assume !(0 == ~cond); {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:33,394 INFO L290 TraceCheckUtils]: 53: Hoare triple {34083#(<= ~counter~0 5)} assume true; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:33,395 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {34083#(<= ~counter~0 5)} {34083#(<= ~counter~0 5)} #71#return; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:33,395 INFO L290 TraceCheckUtils]: 55: Hoare triple {34083#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:33,395 INFO L290 TraceCheckUtils]: 56: Hoare triple {34083#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:33,396 INFO L290 TraceCheckUtils]: 57: Hoare triple {34083#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:33,396 INFO L290 TraceCheckUtils]: 58: Hoare triple {34111#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:33,396 INFO L272 TraceCheckUtils]: 59: Hoare triple {34111#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:33,397 INFO L290 TraceCheckUtils]: 60: Hoare triple {34111#(<= ~counter~0 6)} ~cond := #in~cond; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:33,397 INFO L290 TraceCheckUtils]: 61: Hoare triple {34111#(<= ~counter~0 6)} assume !(0 == ~cond); {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:33,397 INFO L290 TraceCheckUtils]: 62: Hoare triple {34111#(<= ~counter~0 6)} assume true; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:33,398 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {34111#(<= ~counter~0 6)} {34111#(<= ~counter~0 6)} #71#return; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:33,398 INFO L290 TraceCheckUtils]: 64: Hoare triple {34111#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:33,398 INFO L290 TraceCheckUtils]: 65: Hoare triple {34111#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:33,399 INFO L290 TraceCheckUtils]: 66: Hoare triple {34111#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:33,399 INFO L290 TraceCheckUtils]: 67: Hoare triple {34139#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:33,399 INFO L272 TraceCheckUtils]: 68: Hoare triple {34139#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:33,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {34139#(<= ~counter~0 7)} ~cond := #in~cond; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:33,400 INFO L290 TraceCheckUtils]: 70: Hoare triple {34139#(<= ~counter~0 7)} assume !(0 == ~cond); {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:33,400 INFO L290 TraceCheckUtils]: 71: Hoare triple {34139#(<= ~counter~0 7)} assume true; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:33,401 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {34139#(<= ~counter~0 7)} {34139#(<= ~counter~0 7)} #71#return; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:33,401 INFO L290 TraceCheckUtils]: 73: Hoare triple {34139#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:33,401 INFO L290 TraceCheckUtils]: 74: Hoare triple {34139#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:33,402 INFO L290 TraceCheckUtils]: 75: Hoare triple {34139#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:33,402 INFO L290 TraceCheckUtils]: 76: Hoare triple {34167#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:33,402 INFO L272 TraceCheckUtils]: 77: Hoare triple {34167#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:33,403 INFO L290 TraceCheckUtils]: 78: Hoare triple {34167#(<= ~counter~0 8)} ~cond := #in~cond; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:33,403 INFO L290 TraceCheckUtils]: 79: Hoare triple {34167#(<= ~counter~0 8)} assume !(0 == ~cond); {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:33,403 INFO L290 TraceCheckUtils]: 80: Hoare triple {34167#(<= ~counter~0 8)} assume true; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:33,404 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {34167#(<= ~counter~0 8)} {34167#(<= ~counter~0 8)} #71#return; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:33,404 INFO L290 TraceCheckUtils]: 82: Hoare triple {34167#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:33,404 INFO L290 TraceCheckUtils]: 83: Hoare triple {34167#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:33,405 INFO L290 TraceCheckUtils]: 84: Hoare triple {34167#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:33,405 INFO L290 TraceCheckUtils]: 85: Hoare triple {34195#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:33,405 INFO L272 TraceCheckUtils]: 86: Hoare triple {34195#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:33,406 INFO L290 TraceCheckUtils]: 87: Hoare triple {34195#(<= ~counter~0 9)} ~cond := #in~cond; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:33,406 INFO L290 TraceCheckUtils]: 88: Hoare triple {34195#(<= ~counter~0 9)} assume !(0 == ~cond); {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:33,406 INFO L290 TraceCheckUtils]: 89: Hoare triple {34195#(<= ~counter~0 9)} assume true; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:33,407 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {34195#(<= ~counter~0 9)} {34195#(<= ~counter~0 9)} #71#return; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:33,407 INFO L290 TraceCheckUtils]: 91: Hoare triple {34195#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:33,407 INFO L290 TraceCheckUtils]: 92: Hoare triple {34195#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:33,408 INFO L290 TraceCheckUtils]: 93: Hoare triple {34195#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:33,408 INFO L290 TraceCheckUtils]: 94: Hoare triple {34223#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:33,408 INFO L272 TraceCheckUtils]: 95: Hoare triple {34223#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:33,409 INFO L290 TraceCheckUtils]: 96: Hoare triple {34223#(<= ~counter~0 10)} ~cond := #in~cond; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:33,409 INFO L290 TraceCheckUtils]: 97: Hoare triple {34223#(<= ~counter~0 10)} assume !(0 == ~cond); {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:33,409 INFO L290 TraceCheckUtils]: 98: Hoare triple {34223#(<= ~counter~0 10)} assume true; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:33,410 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {34223#(<= ~counter~0 10)} {34223#(<= ~counter~0 10)} #71#return; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:33,410 INFO L290 TraceCheckUtils]: 100: Hoare triple {34223#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:33,410 INFO L290 TraceCheckUtils]: 101: Hoare triple {34223#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:33,411 INFO L290 TraceCheckUtils]: 102: Hoare triple {34223#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:33,411 INFO L290 TraceCheckUtils]: 103: Hoare triple {34251#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:33,411 INFO L272 TraceCheckUtils]: 104: Hoare triple {34251#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:33,412 INFO L290 TraceCheckUtils]: 105: Hoare triple {34251#(<= ~counter~0 11)} ~cond := #in~cond; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:33,412 INFO L290 TraceCheckUtils]: 106: Hoare triple {34251#(<= ~counter~0 11)} assume !(0 == ~cond); {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:33,412 INFO L290 TraceCheckUtils]: 107: Hoare triple {34251#(<= ~counter~0 11)} assume true; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:33,413 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {34251#(<= ~counter~0 11)} {34251#(<= ~counter~0 11)} #71#return; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:33,413 INFO L290 TraceCheckUtils]: 109: Hoare triple {34251#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:33,413 INFO L290 TraceCheckUtils]: 110: Hoare triple {34251#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:33,413 INFO L290 TraceCheckUtils]: 111: Hoare triple {34251#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:33,414 INFO L290 TraceCheckUtils]: 112: Hoare triple {34279#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:33,414 INFO L272 TraceCheckUtils]: 113: Hoare triple {34279#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:33,414 INFO L290 TraceCheckUtils]: 114: Hoare triple {34279#(<= ~counter~0 12)} ~cond := #in~cond; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:33,415 INFO L290 TraceCheckUtils]: 115: Hoare triple {34279#(<= ~counter~0 12)} assume !(0 == ~cond); {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:33,415 INFO L290 TraceCheckUtils]: 116: Hoare triple {34279#(<= ~counter~0 12)} assume true; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:33,416 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {34279#(<= ~counter~0 12)} {34279#(<= ~counter~0 12)} #71#return; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:33,416 INFO L290 TraceCheckUtils]: 118: Hoare triple {34279#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:33,416 INFO L290 TraceCheckUtils]: 119: Hoare triple {34279#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:33,416 INFO L290 TraceCheckUtils]: 120: Hoare triple {34279#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:33,417 INFO L290 TraceCheckUtils]: 121: Hoare triple {34307#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:33,417 INFO L272 TraceCheckUtils]: 122: Hoare triple {34307#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:33,417 INFO L290 TraceCheckUtils]: 123: Hoare triple {34307#(<= ~counter~0 13)} ~cond := #in~cond; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:33,418 INFO L290 TraceCheckUtils]: 124: Hoare triple {34307#(<= ~counter~0 13)} assume !(0 == ~cond); {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:33,418 INFO L290 TraceCheckUtils]: 125: Hoare triple {34307#(<= ~counter~0 13)} assume true; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:33,418 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {34307#(<= ~counter~0 13)} {34307#(<= ~counter~0 13)} #71#return; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:33,419 INFO L290 TraceCheckUtils]: 127: Hoare triple {34307#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:33,419 INFO L290 TraceCheckUtils]: 128: Hoare triple {34307#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:33,420 INFO L290 TraceCheckUtils]: 129: Hoare triple {34307#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:33,420 INFO L290 TraceCheckUtils]: 130: Hoare triple {34335#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:33,420 INFO L272 TraceCheckUtils]: 131: Hoare triple {34335#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:33,421 INFO L290 TraceCheckUtils]: 132: Hoare triple {34335#(<= ~counter~0 14)} ~cond := #in~cond; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:33,421 INFO L290 TraceCheckUtils]: 133: Hoare triple {34335#(<= ~counter~0 14)} assume !(0 == ~cond); {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:33,421 INFO L290 TraceCheckUtils]: 134: Hoare triple {34335#(<= ~counter~0 14)} assume true; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:33,422 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {34335#(<= ~counter~0 14)} {34335#(<= ~counter~0 14)} #71#return; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:33,422 INFO L290 TraceCheckUtils]: 136: Hoare triple {34335#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:33,422 INFO L290 TraceCheckUtils]: 137: Hoare triple {34335#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:33,423 INFO L290 TraceCheckUtils]: 138: Hoare triple {34335#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:33,423 INFO L290 TraceCheckUtils]: 139: Hoare triple {34363#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:33,423 INFO L272 TraceCheckUtils]: 140: Hoare triple {34363#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:33,424 INFO L290 TraceCheckUtils]: 141: Hoare triple {34363#(<= ~counter~0 15)} ~cond := #in~cond; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:33,424 INFO L290 TraceCheckUtils]: 142: Hoare triple {34363#(<= ~counter~0 15)} assume !(0 == ~cond); {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:33,424 INFO L290 TraceCheckUtils]: 143: Hoare triple {34363#(<= ~counter~0 15)} assume true; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:33,425 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {34363#(<= ~counter~0 15)} {34363#(<= ~counter~0 15)} #71#return; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:33,425 INFO L290 TraceCheckUtils]: 145: Hoare triple {34363#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:33,425 INFO L290 TraceCheckUtils]: 146: Hoare triple {34363#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:33,426 INFO L290 TraceCheckUtils]: 147: Hoare triple {34363#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:33,426 INFO L290 TraceCheckUtils]: 148: Hoare triple {34391#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:33,426 INFO L272 TraceCheckUtils]: 149: Hoare triple {34391#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:33,427 INFO L290 TraceCheckUtils]: 150: Hoare triple {34391#(<= ~counter~0 16)} ~cond := #in~cond; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:33,427 INFO L290 TraceCheckUtils]: 151: Hoare triple {34391#(<= ~counter~0 16)} assume !(0 == ~cond); {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:33,427 INFO L290 TraceCheckUtils]: 152: Hoare triple {34391#(<= ~counter~0 16)} assume true; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:33,428 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {34391#(<= ~counter~0 16)} {34391#(<= ~counter~0 16)} #71#return; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:33,428 INFO L290 TraceCheckUtils]: 154: Hoare triple {34391#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:33,428 INFO L290 TraceCheckUtils]: 155: Hoare triple {34391#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:33,429 INFO L290 TraceCheckUtils]: 156: Hoare triple {34391#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:33,429 INFO L290 TraceCheckUtils]: 157: Hoare triple {34419#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:33,429 INFO L272 TraceCheckUtils]: 158: Hoare triple {34419#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:33,430 INFO L290 TraceCheckUtils]: 159: Hoare triple {34419#(<= ~counter~0 17)} ~cond := #in~cond; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:33,430 INFO L290 TraceCheckUtils]: 160: Hoare triple {34419#(<= ~counter~0 17)} assume !(0 == ~cond); {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:33,430 INFO L290 TraceCheckUtils]: 161: Hoare triple {34419#(<= ~counter~0 17)} assume true; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:33,431 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {34419#(<= ~counter~0 17)} {34419#(<= ~counter~0 17)} #71#return; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:33,431 INFO L290 TraceCheckUtils]: 163: Hoare triple {34419#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:33,431 INFO L290 TraceCheckUtils]: 164: Hoare triple {34419#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:33,432 INFO L290 TraceCheckUtils]: 165: Hoare triple {34419#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:33,432 INFO L290 TraceCheckUtils]: 166: Hoare triple {34447#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:33,432 INFO L272 TraceCheckUtils]: 167: Hoare triple {34447#(<= ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:33,433 INFO L290 TraceCheckUtils]: 168: Hoare triple {34447#(<= ~counter~0 18)} ~cond := #in~cond; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:33,433 INFO L290 TraceCheckUtils]: 169: Hoare triple {34447#(<= ~counter~0 18)} assume !(0 == ~cond); {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:33,433 INFO L290 TraceCheckUtils]: 170: Hoare triple {34447#(<= ~counter~0 18)} assume true; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:33,434 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {34447#(<= ~counter~0 18)} {34447#(<= ~counter~0 18)} #71#return; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:33,434 INFO L290 TraceCheckUtils]: 172: Hoare triple {34447#(<= ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:33,434 INFO L290 TraceCheckUtils]: 173: Hoare triple {34447#(<= ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:33,434 INFO L290 TraceCheckUtils]: 174: Hoare triple {34447#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34475#(<= |main_#t~post6| 18)} is VALID [2022-04-08 14:09:33,435 INFO L290 TraceCheckUtils]: 175: Hoare triple {34475#(<= |main_#t~post6| 18)} assume !(#t~post6 < 20);havoc #t~post6; {33930#false} is VALID [2022-04-08 14:09:33,435 INFO L272 TraceCheckUtils]: 176: Hoare triple {33930#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {33930#false} is VALID [2022-04-08 14:09:33,435 INFO L290 TraceCheckUtils]: 177: Hoare triple {33930#false} ~cond := #in~cond; {33930#false} is VALID [2022-04-08 14:09:33,435 INFO L290 TraceCheckUtils]: 178: Hoare triple {33930#false} assume 0 == ~cond; {33930#false} is VALID [2022-04-08 14:09:33,435 INFO L290 TraceCheckUtils]: 179: Hoare triple {33930#false} assume !false; {33930#false} is VALID [2022-04-08 14:09:33,436 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 36 proven. 1413 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:09:33,436 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:09:34,183 INFO L290 TraceCheckUtils]: 179: Hoare triple {33930#false} assume !false; {33930#false} is VALID [2022-04-08 14:09:34,183 INFO L290 TraceCheckUtils]: 178: Hoare triple {33930#false} assume 0 == ~cond; {33930#false} is VALID [2022-04-08 14:09:34,183 INFO L290 TraceCheckUtils]: 177: Hoare triple {33930#false} ~cond := #in~cond; {33930#false} is VALID [2022-04-08 14:09:34,183 INFO L272 TraceCheckUtils]: 176: Hoare triple {33930#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {33930#false} is VALID [2022-04-08 14:09:34,184 INFO L290 TraceCheckUtils]: 175: Hoare triple {34503#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {33930#false} is VALID [2022-04-08 14:09:34,184 INFO L290 TraceCheckUtils]: 174: Hoare triple {34507#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34503#(< |main_#t~post6| 20)} is VALID [2022-04-08 14:09:34,184 INFO L290 TraceCheckUtils]: 173: Hoare triple {34507#(< ~counter~0 20)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34507#(< ~counter~0 20)} is VALID [2022-04-08 14:09:34,185 INFO L290 TraceCheckUtils]: 172: Hoare triple {34507#(< ~counter~0 20)} assume !!(0 != ~a~0 && 0 != ~b~0); {34507#(< ~counter~0 20)} is VALID [2022-04-08 14:09:34,185 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {33929#true} {34507#(< ~counter~0 20)} #71#return; {34507#(< ~counter~0 20)} is VALID [2022-04-08 14:09:34,185 INFO L290 TraceCheckUtils]: 170: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,185 INFO L290 TraceCheckUtils]: 169: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,185 INFO L290 TraceCheckUtils]: 168: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,185 INFO L272 TraceCheckUtils]: 167: Hoare triple {34507#(< ~counter~0 20)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,186 INFO L290 TraceCheckUtils]: 166: Hoare triple {34507#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {34507#(< ~counter~0 20)} is VALID [2022-04-08 14:09:34,186 INFO L290 TraceCheckUtils]: 165: Hoare triple {34447#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34507#(< ~counter~0 20)} is VALID [2022-04-08 14:09:34,187 INFO L290 TraceCheckUtils]: 164: Hoare triple {34447#(<= ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:34,187 INFO L290 TraceCheckUtils]: 163: Hoare triple {34447#(<= ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:34,187 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {33929#true} {34447#(<= ~counter~0 18)} #71#return; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:34,188 INFO L290 TraceCheckUtils]: 161: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,188 INFO L290 TraceCheckUtils]: 160: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,188 INFO L290 TraceCheckUtils]: 159: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,188 INFO L272 TraceCheckUtils]: 158: Hoare triple {34447#(<= ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,188 INFO L290 TraceCheckUtils]: 157: Hoare triple {34447#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:34,188 INFO L290 TraceCheckUtils]: 156: Hoare triple {34419#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34447#(<= ~counter~0 18)} is VALID [2022-04-08 14:09:34,189 INFO L290 TraceCheckUtils]: 155: Hoare triple {34419#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:34,189 INFO L290 TraceCheckUtils]: 154: Hoare triple {34419#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:34,190 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {33929#true} {34419#(<= ~counter~0 17)} #71#return; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:34,190 INFO L290 TraceCheckUtils]: 152: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,190 INFO L290 TraceCheckUtils]: 151: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,190 INFO L290 TraceCheckUtils]: 150: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,190 INFO L272 TraceCheckUtils]: 149: Hoare triple {34419#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,190 INFO L290 TraceCheckUtils]: 148: Hoare triple {34419#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:34,191 INFO L290 TraceCheckUtils]: 147: Hoare triple {34391#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34419#(<= ~counter~0 17)} is VALID [2022-04-08 14:09:34,191 INFO L290 TraceCheckUtils]: 146: Hoare triple {34391#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:34,191 INFO L290 TraceCheckUtils]: 145: Hoare triple {34391#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:34,192 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {33929#true} {34391#(<= ~counter~0 16)} #71#return; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:34,192 INFO L290 TraceCheckUtils]: 143: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,192 INFO L290 TraceCheckUtils]: 142: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,192 INFO L290 TraceCheckUtils]: 141: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,192 INFO L272 TraceCheckUtils]: 140: Hoare triple {34391#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,192 INFO L290 TraceCheckUtils]: 139: Hoare triple {34391#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:34,193 INFO L290 TraceCheckUtils]: 138: Hoare triple {34363#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34391#(<= ~counter~0 16)} is VALID [2022-04-08 14:09:34,193 INFO L290 TraceCheckUtils]: 137: Hoare triple {34363#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:34,193 INFO L290 TraceCheckUtils]: 136: Hoare triple {34363#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:34,194 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {33929#true} {34363#(<= ~counter~0 15)} #71#return; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:34,194 INFO L290 TraceCheckUtils]: 134: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,194 INFO L290 TraceCheckUtils]: 133: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,194 INFO L290 TraceCheckUtils]: 132: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,194 INFO L272 TraceCheckUtils]: 131: Hoare triple {34363#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,194 INFO L290 TraceCheckUtils]: 130: Hoare triple {34363#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:34,195 INFO L290 TraceCheckUtils]: 129: Hoare triple {34335#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34363#(<= ~counter~0 15)} is VALID [2022-04-08 14:09:34,195 INFO L290 TraceCheckUtils]: 128: Hoare triple {34335#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:34,195 INFO L290 TraceCheckUtils]: 127: Hoare triple {34335#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:34,196 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {33929#true} {34335#(<= ~counter~0 14)} #71#return; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:34,196 INFO L290 TraceCheckUtils]: 125: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,196 INFO L290 TraceCheckUtils]: 124: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,196 INFO L290 TraceCheckUtils]: 123: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,196 INFO L272 TraceCheckUtils]: 122: Hoare triple {34335#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,197 INFO L290 TraceCheckUtils]: 121: Hoare triple {34335#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:34,197 INFO L290 TraceCheckUtils]: 120: Hoare triple {34307#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34335#(<= ~counter~0 14)} is VALID [2022-04-08 14:09:34,197 INFO L290 TraceCheckUtils]: 119: Hoare triple {34307#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:34,198 INFO L290 TraceCheckUtils]: 118: Hoare triple {34307#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:34,198 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {33929#true} {34307#(<= ~counter~0 13)} #71#return; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:34,198 INFO L290 TraceCheckUtils]: 116: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,198 INFO L290 TraceCheckUtils]: 115: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,198 INFO L290 TraceCheckUtils]: 114: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,198 INFO L272 TraceCheckUtils]: 113: Hoare triple {34307#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,199 INFO L290 TraceCheckUtils]: 112: Hoare triple {34307#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:34,199 INFO L290 TraceCheckUtils]: 111: Hoare triple {34279#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34307#(<= ~counter~0 13)} is VALID [2022-04-08 14:09:34,199 INFO L290 TraceCheckUtils]: 110: Hoare triple {34279#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:34,200 INFO L290 TraceCheckUtils]: 109: Hoare triple {34279#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:34,200 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {33929#true} {34279#(<= ~counter~0 12)} #71#return; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:34,200 INFO L290 TraceCheckUtils]: 107: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,200 INFO L290 TraceCheckUtils]: 106: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,200 INFO L290 TraceCheckUtils]: 105: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,201 INFO L272 TraceCheckUtils]: 104: Hoare triple {34279#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,201 INFO L290 TraceCheckUtils]: 103: Hoare triple {34279#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:34,201 INFO L290 TraceCheckUtils]: 102: Hoare triple {34251#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34279#(<= ~counter~0 12)} is VALID [2022-04-08 14:09:34,202 INFO L290 TraceCheckUtils]: 101: Hoare triple {34251#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:34,202 INFO L290 TraceCheckUtils]: 100: Hoare triple {34251#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:34,202 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {33929#true} {34251#(<= ~counter~0 11)} #71#return; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:34,202 INFO L290 TraceCheckUtils]: 98: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,203 INFO L290 TraceCheckUtils]: 97: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,203 INFO L290 TraceCheckUtils]: 96: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,203 INFO L272 TraceCheckUtils]: 95: Hoare triple {34251#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,203 INFO L290 TraceCheckUtils]: 94: Hoare triple {34251#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:34,203 INFO L290 TraceCheckUtils]: 93: Hoare triple {34223#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34251#(<= ~counter~0 11)} is VALID [2022-04-08 14:09:34,204 INFO L290 TraceCheckUtils]: 92: Hoare triple {34223#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:34,204 INFO L290 TraceCheckUtils]: 91: Hoare triple {34223#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:34,204 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {33929#true} {34223#(<= ~counter~0 10)} #71#return; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:34,205 INFO L290 TraceCheckUtils]: 89: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,205 INFO L290 TraceCheckUtils]: 88: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,205 INFO L290 TraceCheckUtils]: 87: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,205 INFO L272 TraceCheckUtils]: 86: Hoare triple {34223#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,205 INFO L290 TraceCheckUtils]: 85: Hoare triple {34223#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:34,205 INFO L290 TraceCheckUtils]: 84: Hoare triple {34195#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34223#(<= ~counter~0 10)} is VALID [2022-04-08 14:09:34,206 INFO L290 TraceCheckUtils]: 83: Hoare triple {34195#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:34,206 INFO L290 TraceCheckUtils]: 82: Hoare triple {34195#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:34,207 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {33929#true} {34195#(<= ~counter~0 9)} #71#return; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:34,207 INFO L290 TraceCheckUtils]: 80: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,207 INFO L290 TraceCheckUtils]: 79: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,207 INFO L290 TraceCheckUtils]: 78: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,207 INFO L272 TraceCheckUtils]: 77: Hoare triple {34195#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,207 INFO L290 TraceCheckUtils]: 76: Hoare triple {34195#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:34,208 INFO L290 TraceCheckUtils]: 75: Hoare triple {34167#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34195#(<= ~counter~0 9)} is VALID [2022-04-08 14:09:34,208 INFO L290 TraceCheckUtils]: 74: Hoare triple {34167#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:34,208 INFO L290 TraceCheckUtils]: 73: Hoare triple {34167#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:34,209 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {33929#true} {34167#(<= ~counter~0 8)} #71#return; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:34,209 INFO L290 TraceCheckUtils]: 71: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,209 INFO L290 TraceCheckUtils]: 70: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,209 INFO L290 TraceCheckUtils]: 69: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,209 INFO L272 TraceCheckUtils]: 68: Hoare triple {34167#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,209 INFO L290 TraceCheckUtils]: 67: Hoare triple {34167#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:34,210 INFO L290 TraceCheckUtils]: 66: Hoare triple {34139#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34167#(<= ~counter~0 8)} is VALID [2022-04-08 14:09:34,210 INFO L290 TraceCheckUtils]: 65: Hoare triple {34139#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:34,210 INFO L290 TraceCheckUtils]: 64: Hoare triple {34139#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:34,211 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {33929#true} {34139#(<= ~counter~0 7)} #71#return; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:34,211 INFO L290 TraceCheckUtils]: 62: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,211 INFO L290 TraceCheckUtils]: 60: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,211 INFO L272 TraceCheckUtils]: 59: Hoare triple {34139#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,211 INFO L290 TraceCheckUtils]: 58: Hoare triple {34139#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:34,212 INFO L290 TraceCheckUtils]: 57: Hoare triple {34111#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34139#(<= ~counter~0 7)} is VALID [2022-04-08 14:09:34,212 INFO L290 TraceCheckUtils]: 56: Hoare triple {34111#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:34,212 INFO L290 TraceCheckUtils]: 55: Hoare triple {34111#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:34,213 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {33929#true} {34111#(<= ~counter~0 6)} #71#return; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:34,213 INFO L290 TraceCheckUtils]: 53: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,213 INFO L290 TraceCheckUtils]: 52: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,213 INFO L290 TraceCheckUtils]: 51: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,213 INFO L272 TraceCheckUtils]: 50: Hoare triple {34111#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,213 INFO L290 TraceCheckUtils]: 49: Hoare triple {34111#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:34,214 INFO L290 TraceCheckUtils]: 48: Hoare triple {34083#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34111#(<= ~counter~0 6)} is VALID [2022-04-08 14:09:34,214 INFO L290 TraceCheckUtils]: 47: Hoare triple {34083#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:34,214 INFO L290 TraceCheckUtils]: 46: Hoare triple {34083#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:34,215 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {33929#true} {34083#(<= ~counter~0 5)} #71#return; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:34,215 INFO L290 TraceCheckUtils]: 44: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,215 INFO L290 TraceCheckUtils]: 43: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,215 INFO L290 TraceCheckUtils]: 42: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,215 INFO L272 TraceCheckUtils]: 41: Hoare triple {34083#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,216 INFO L290 TraceCheckUtils]: 40: Hoare triple {34083#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:34,216 INFO L290 TraceCheckUtils]: 39: Hoare triple {34055#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34083#(<= ~counter~0 5)} is VALID [2022-04-08 14:09:34,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {34055#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:34,217 INFO L290 TraceCheckUtils]: 37: Hoare triple {34055#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:34,217 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {33929#true} {34055#(<= ~counter~0 4)} #71#return; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:34,217 INFO L290 TraceCheckUtils]: 35: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,217 INFO L290 TraceCheckUtils]: 34: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,217 INFO L272 TraceCheckUtils]: 32: Hoare triple {34055#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {34055#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:34,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {34027#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34055#(<= ~counter~0 4)} is VALID [2022-04-08 14:09:34,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {34027#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:34,219 INFO L290 TraceCheckUtils]: 28: Hoare triple {34027#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:34,219 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {33929#true} {34027#(<= ~counter~0 3)} #71#return; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:34,219 INFO L290 TraceCheckUtils]: 26: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,219 INFO L290 TraceCheckUtils]: 25: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,219 INFO L290 TraceCheckUtils]: 24: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,219 INFO L272 TraceCheckUtils]: 23: Hoare triple {34027#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {34027#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:34,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {33999#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {34027#(<= ~counter~0 3)} is VALID [2022-04-08 14:09:34,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {33999#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:34,221 INFO L290 TraceCheckUtils]: 19: Hoare triple {33999#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:34,221 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {33929#true} {33999#(<= ~counter~0 2)} #71#return; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:34,221 INFO L290 TraceCheckUtils]: 17: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,221 INFO L290 TraceCheckUtils]: 16: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,222 INFO L272 TraceCheckUtils]: 14: Hoare triple {33999#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {33999#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:34,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {33971#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {33999#(<= ~counter~0 2)} is VALID [2022-04-08 14:09:34,223 INFO L290 TraceCheckUtils]: 11: Hoare triple {33971#(<= ~counter~0 1)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:34,223 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33929#true} {33971#(<= ~counter~0 1)} #69#return; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:34,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {33929#true} assume true; {33929#true} is VALID [2022-04-08 14:09:34,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {33929#true} assume !(0 == ~cond); {33929#true} is VALID [2022-04-08 14:09:34,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {33929#true} ~cond := #in~cond; {33929#true} is VALID [2022-04-08 14:09:34,223 INFO L272 TraceCheckUtils]: 6: Hoare triple {33971#(<= ~counter~0 1)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {33929#true} is VALID [2022-04-08 14:09:34,223 INFO L290 TraceCheckUtils]: 5: Hoare triple {33971#(<= ~counter~0 1)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:34,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {33971#(<= ~counter~0 1)} call #t~ret7 := main(); {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:34,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33971#(<= ~counter~0 1)} {33929#true} #77#return; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:34,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {33971#(<= ~counter~0 1)} assume true; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:34,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {33929#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {33971#(<= ~counter~0 1)} is VALID [2022-04-08 14:09:34,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {33929#true} call ULTIMATE.init(); {33929#true} is VALID [2022-04-08 14:09:34,225 INFO L134 CoverageAnalysis]: Checked inductivity of 1449 backedges. 36 proven. 801 refuted. 0 times theorem prover too weak. 612 trivial. 0 not checked. [2022-04-08 14:09:34,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:09:34,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1313166141] [2022-04-08 14:09:34,226 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:09:34,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1579570328] [2022-04-08 14:09:34,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1579570328] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:09:34,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:09:34,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2022-04-08 14:09:34,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:09:34,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1262024815] [2022-04-08 14:09:34,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1262024815] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:09:34,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:09:34,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 14:09:34,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [604437897] [2022-04-08 14:09:34,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:09:34,227 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Word has length 180 [2022-04-08 14:09:34,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:09:34,228 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 14:09:34,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:34,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 14:09:34,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:09:34,375 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 14:09:34,375 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 14:09:34,376 INFO L87 Difference]: Start difference. First operand 230 states and 286 transitions. Second operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 14:09:35,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:35,479 INFO L93 Difference]: Finished difference Result 249 states and 309 transitions. [2022-04-08 14:09:35,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 14:09:35,479 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) Word has length 180 [2022-04-08 14:09:35,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:09:35,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 14:09:35,483 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 295 transitions. [2022-04-08 14:09:35,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 14:09:35,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 295 transitions. [2022-04-08 14:09:35,486 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 295 transitions. [2022-04-08 14:09:35,760 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 295 edges. 295 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:09:35,763 INFO L225 Difference]: With dead ends: 249 [2022-04-08 14:09:35,764 INFO L226 Difference]: Without dead ends: 241 [2022-04-08 14:09:35,764 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 377 GetRequests, 336 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=650, Invalid=1072, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 14:09:35,764 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 254 mSDsluCounter, 278 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:09:35,765 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 326 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:09:35,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 241 states. [2022-04-08 14:09:36,160 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 241 to 241. [2022-04-08 14:09:36,161 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:09:36,161 INFO L82 GeneralOperation]: Start isEquivalent. First operand 241 states. Second operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 14:09:36,161 INFO L74 IsIncluded]: Start isIncluded. First operand 241 states. Second operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 14:09:36,162 INFO L87 Difference]: Start difference. First operand 241 states. Second operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 14:09:36,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:36,164 INFO L93 Difference]: Finished difference Result 241 states and 300 transitions. [2022-04-08 14:09:36,165 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2022-04-08 14:09:36,165 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:09:36,165 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:09:36,165 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 241 states. [2022-04-08 14:09:36,166 INFO L87 Difference]: Start difference. First operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 241 states. [2022-04-08 14:09:36,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:09:36,169 INFO L93 Difference]: Finished difference Result 241 states and 300 transitions. [2022-04-08 14:09:36,169 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2022-04-08 14:09:36,170 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:09:36,170 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:09:36,170 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:09:36,170 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:09:36,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 192 states have (on average 1.3125) internal successors, (252), 193 states have internal predecessors, (252), 25 states have call successors, (25), 24 states have call predecessors, (25), 23 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-08 14:09:36,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 300 transitions. [2022-04-08 14:09:36,175 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 300 transitions. Word has length 180 [2022-04-08 14:09:36,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:09:36,175 INFO L478 AbstractCegarLoop]: Abstraction has 241 states and 300 transitions. [2022-04-08 14:09:36,175 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 19 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-08 14:09:36,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 241 states and 300 transitions. [2022-04-08 14:10:15,765 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 300 edges. 282 inductive. 0 not inductive. 18 times theorem prover too weak to decide inductivity. [2022-04-08 14:10:15,765 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 300 transitions. [2022-04-08 14:10:15,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 190 [2022-04-08 14:10:15,766 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 14:10:15,766 INFO L499 BasicCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 14:10:15,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Ended with exit code 0 [2022-04-08 14:10:15,975 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:10:15,975 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 14:10:15,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 14:10:15,976 INFO L85 PathProgramCache]: Analyzing trace with hash 975763522, now seen corresponding path program 37 times [2022-04-08 14:10:15,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 14:10:15,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [466489170] [2022-04-08 14:10:22,022 INFO L97 AcceleratorQvasr]: Qvasr could not accelerate loop because java.lang.UnsupportedOperationException: Cannot deal with arrays. [2022-04-08 14:10:22,022 INFO L274 tedInterpolationCore]: Could not compute an accelerate. [2022-04-08 14:10:22,022 INFO L85 PathProgramCache]: Analyzing trace with hash 975763522, now seen corresponding path program 38 times [2022-04-08 14:10:22,022 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 14:10:22,022 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1672528008] [2022-04-08 14:10:22,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 14:10:22,022 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 14:10:22,042 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 14:10:22,042 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1119859449] [2022-04-08 14:10:22,042 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 14:10:22,042 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 14:10:22,042 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 14:10:22,043 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 14:10:22,044 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-08 14:10:22,149 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 14:10:22,150 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 14:10:22,152 INFO L263 TraceCheckSpWp]: Trace formula consists of 580 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 14:10:22,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 14:10:22,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 14:10:23,059 INFO L272 TraceCheckUtils]: 0: Hoare triple {36530#true} call ULTIMATE.init(); {36530#true} is VALID [2022-04-08 14:10:23,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {36530#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {36538#(<= ~counter~0 0)} assume true; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,060 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36538#(<= ~counter~0 0)} {36530#true} #77#return; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {36538#(<= ~counter~0 0)} call #t~ret7 := main(); {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {36538#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,061 INFO L272 TraceCheckUtils]: 6: Hoare triple {36538#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {36538#(<= ~counter~0 0)} ~cond := #in~cond; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {36538#(<= ~counter~0 0)} assume !(0 == ~cond); {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {36538#(<= ~counter~0 0)} assume true; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,062 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36538#(<= ~counter~0 0)} {36538#(<= ~counter~0 0)} #69#return; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {36538#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {36538#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {36572#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,064 INFO L272 TraceCheckUtils]: 14: Hoare triple {36572#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {36572#(<= ~counter~0 1)} ~cond := #in~cond; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {36572#(<= ~counter~0 1)} assume !(0 == ~cond); {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {36572#(<= ~counter~0 1)} assume true; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,065 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {36572#(<= ~counter~0 1)} {36572#(<= ~counter~0 1)} #71#return; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {36572#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {36572#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,066 INFO L290 TraceCheckUtils]: 21: Hoare triple {36572#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {36600#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,067 INFO L272 TraceCheckUtils]: 23: Hoare triple {36600#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {36600#(<= ~counter~0 2)} ~cond := #in~cond; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {36600#(<= ~counter~0 2)} assume !(0 == ~cond); {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,068 INFO L290 TraceCheckUtils]: 26: Hoare triple {36600#(<= ~counter~0 2)} assume true; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,068 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {36600#(<= ~counter~0 2)} {36600#(<= ~counter~0 2)} #71#return; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,068 INFO L290 TraceCheckUtils]: 28: Hoare triple {36600#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,069 INFO L290 TraceCheckUtils]: 29: Hoare triple {36600#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,069 INFO L290 TraceCheckUtils]: 30: Hoare triple {36600#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,069 INFO L290 TraceCheckUtils]: 31: Hoare triple {36628#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,070 INFO L272 TraceCheckUtils]: 32: Hoare triple {36628#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,070 INFO L290 TraceCheckUtils]: 33: Hoare triple {36628#(<= ~counter~0 3)} ~cond := #in~cond; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,070 INFO L290 TraceCheckUtils]: 34: Hoare triple {36628#(<= ~counter~0 3)} assume !(0 == ~cond); {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,071 INFO L290 TraceCheckUtils]: 35: Hoare triple {36628#(<= ~counter~0 3)} assume true; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,071 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {36628#(<= ~counter~0 3)} {36628#(<= ~counter~0 3)} #71#return; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,071 INFO L290 TraceCheckUtils]: 37: Hoare triple {36628#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,072 INFO L290 TraceCheckUtils]: 38: Hoare triple {36628#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,072 INFO L290 TraceCheckUtils]: 39: Hoare triple {36628#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,072 INFO L290 TraceCheckUtils]: 40: Hoare triple {36656#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,073 INFO L272 TraceCheckUtils]: 41: Hoare triple {36656#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,073 INFO L290 TraceCheckUtils]: 42: Hoare triple {36656#(<= ~counter~0 4)} ~cond := #in~cond; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,073 INFO L290 TraceCheckUtils]: 43: Hoare triple {36656#(<= ~counter~0 4)} assume !(0 == ~cond); {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,074 INFO L290 TraceCheckUtils]: 44: Hoare triple {36656#(<= ~counter~0 4)} assume true; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,074 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {36656#(<= ~counter~0 4)} {36656#(<= ~counter~0 4)} #71#return; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,074 INFO L290 TraceCheckUtils]: 46: Hoare triple {36656#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,075 INFO L290 TraceCheckUtils]: 47: Hoare triple {36656#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,075 INFO L290 TraceCheckUtils]: 48: Hoare triple {36656#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,075 INFO L290 TraceCheckUtils]: 49: Hoare triple {36684#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,076 INFO L272 TraceCheckUtils]: 50: Hoare triple {36684#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,076 INFO L290 TraceCheckUtils]: 51: Hoare triple {36684#(<= ~counter~0 5)} ~cond := #in~cond; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,076 INFO L290 TraceCheckUtils]: 52: Hoare triple {36684#(<= ~counter~0 5)} assume !(0 == ~cond); {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,077 INFO L290 TraceCheckUtils]: 53: Hoare triple {36684#(<= ~counter~0 5)} assume true; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,077 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {36684#(<= ~counter~0 5)} {36684#(<= ~counter~0 5)} #71#return; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,077 INFO L290 TraceCheckUtils]: 55: Hoare triple {36684#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,078 INFO L290 TraceCheckUtils]: 56: Hoare triple {36684#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,078 INFO L290 TraceCheckUtils]: 57: Hoare triple {36684#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,078 INFO L290 TraceCheckUtils]: 58: Hoare triple {36712#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,079 INFO L272 TraceCheckUtils]: 59: Hoare triple {36712#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,079 INFO L290 TraceCheckUtils]: 60: Hoare triple {36712#(<= ~counter~0 6)} ~cond := #in~cond; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,079 INFO L290 TraceCheckUtils]: 61: Hoare triple {36712#(<= ~counter~0 6)} assume !(0 == ~cond); {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,080 INFO L290 TraceCheckUtils]: 62: Hoare triple {36712#(<= ~counter~0 6)} assume true; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,080 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {36712#(<= ~counter~0 6)} {36712#(<= ~counter~0 6)} #71#return; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,080 INFO L290 TraceCheckUtils]: 64: Hoare triple {36712#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,081 INFO L290 TraceCheckUtils]: 65: Hoare triple {36712#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,081 INFO L290 TraceCheckUtils]: 66: Hoare triple {36712#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,081 INFO L290 TraceCheckUtils]: 67: Hoare triple {36740#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,082 INFO L272 TraceCheckUtils]: 68: Hoare triple {36740#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,082 INFO L290 TraceCheckUtils]: 69: Hoare triple {36740#(<= ~counter~0 7)} ~cond := #in~cond; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,082 INFO L290 TraceCheckUtils]: 70: Hoare triple {36740#(<= ~counter~0 7)} assume !(0 == ~cond); {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,083 INFO L290 TraceCheckUtils]: 71: Hoare triple {36740#(<= ~counter~0 7)} assume true; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,083 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {36740#(<= ~counter~0 7)} {36740#(<= ~counter~0 7)} #71#return; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,083 INFO L290 TraceCheckUtils]: 73: Hoare triple {36740#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,084 INFO L290 TraceCheckUtils]: 74: Hoare triple {36740#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,084 INFO L290 TraceCheckUtils]: 75: Hoare triple {36740#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,084 INFO L290 TraceCheckUtils]: 76: Hoare triple {36768#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,085 INFO L272 TraceCheckUtils]: 77: Hoare triple {36768#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,085 INFO L290 TraceCheckUtils]: 78: Hoare triple {36768#(<= ~counter~0 8)} ~cond := #in~cond; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,085 INFO L290 TraceCheckUtils]: 79: Hoare triple {36768#(<= ~counter~0 8)} assume !(0 == ~cond); {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,086 INFO L290 TraceCheckUtils]: 80: Hoare triple {36768#(<= ~counter~0 8)} assume true; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,086 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {36768#(<= ~counter~0 8)} {36768#(<= ~counter~0 8)} #71#return; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,086 INFO L290 TraceCheckUtils]: 82: Hoare triple {36768#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,087 INFO L290 TraceCheckUtils]: 83: Hoare triple {36768#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,087 INFO L290 TraceCheckUtils]: 84: Hoare triple {36768#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,087 INFO L290 TraceCheckUtils]: 85: Hoare triple {36796#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,088 INFO L272 TraceCheckUtils]: 86: Hoare triple {36796#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,088 INFO L290 TraceCheckUtils]: 87: Hoare triple {36796#(<= ~counter~0 9)} ~cond := #in~cond; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,089 INFO L290 TraceCheckUtils]: 88: Hoare triple {36796#(<= ~counter~0 9)} assume !(0 == ~cond); {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,089 INFO L290 TraceCheckUtils]: 89: Hoare triple {36796#(<= ~counter~0 9)} assume true; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,089 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {36796#(<= ~counter~0 9)} {36796#(<= ~counter~0 9)} #71#return; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,090 INFO L290 TraceCheckUtils]: 91: Hoare triple {36796#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,090 INFO L290 TraceCheckUtils]: 92: Hoare triple {36796#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,090 INFO L290 TraceCheckUtils]: 93: Hoare triple {36796#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,091 INFO L290 TraceCheckUtils]: 94: Hoare triple {36824#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,091 INFO L272 TraceCheckUtils]: 95: Hoare triple {36824#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,091 INFO L290 TraceCheckUtils]: 96: Hoare triple {36824#(<= ~counter~0 10)} ~cond := #in~cond; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,092 INFO L290 TraceCheckUtils]: 97: Hoare triple {36824#(<= ~counter~0 10)} assume !(0 == ~cond); {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,092 INFO L290 TraceCheckUtils]: 98: Hoare triple {36824#(<= ~counter~0 10)} assume true; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,092 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {36824#(<= ~counter~0 10)} {36824#(<= ~counter~0 10)} #71#return; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,093 INFO L290 TraceCheckUtils]: 100: Hoare triple {36824#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,093 INFO L290 TraceCheckUtils]: 101: Hoare triple {36824#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,093 INFO L290 TraceCheckUtils]: 102: Hoare triple {36824#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,094 INFO L290 TraceCheckUtils]: 103: Hoare triple {36852#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,094 INFO L272 TraceCheckUtils]: 104: Hoare triple {36852#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,094 INFO L290 TraceCheckUtils]: 105: Hoare triple {36852#(<= ~counter~0 11)} ~cond := #in~cond; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,095 INFO L290 TraceCheckUtils]: 106: Hoare triple {36852#(<= ~counter~0 11)} assume !(0 == ~cond); {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,095 INFO L290 TraceCheckUtils]: 107: Hoare triple {36852#(<= ~counter~0 11)} assume true; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,095 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {36852#(<= ~counter~0 11)} {36852#(<= ~counter~0 11)} #71#return; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,096 INFO L290 TraceCheckUtils]: 109: Hoare triple {36852#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,096 INFO L290 TraceCheckUtils]: 110: Hoare triple {36852#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,096 INFO L290 TraceCheckUtils]: 111: Hoare triple {36852#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,097 INFO L290 TraceCheckUtils]: 112: Hoare triple {36880#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,097 INFO L272 TraceCheckUtils]: 113: Hoare triple {36880#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,097 INFO L290 TraceCheckUtils]: 114: Hoare triple {36880#(<= ~counter~0 12)} ~cond := #in~cond; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,098 INFO L290 TraceCheckUtils]: 115: Hoare triple {36880#(<= ~counter~0 12)} assume !(0 == ~cond); {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,098 INFO L290 TraceCheckUtils]: 116: Hoare triple {36880#(<= ~counter~0 12)} assume true; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,098 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {36880#(<= ~counter~0 12)} {36880#(<= ~counter~0 12)} #71#return; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,099 INFO L290 TraceCheckUtils]: 118: Hoare triple {36880#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,099 INFO L290 TraceCheckUtils]: 119: Hoare triple {36880#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,099 INFO L290 TraceCheckUtils]: 120: Hoare triple {36880#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,100 INFO L290 TraceCheckUtils]: 121: Hoare triple {36908#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,100 INFO L272 TraceCheckUtils]: 122: Hoare triple {36908#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,100 INFO L290 TraceCheckUtils]: 123: Hoare triple {36908#(<= ~counter~0 13)} ~cond := #in~cond; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,101 INFO L290 TraceCheckUtils]: 124: Hoare triple {36908#(<= ~counter~0 13)} assume !(0 == ~cond); {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,101 INFO L290 TraceCheckUtils]: 125: Hoare triple {36908#(<= ~counter~0 13)} assume true; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,101 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {36908#(<= ~counter~0 13)} {36908#(<= ~counter~0 13)} #71#return; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,102 INFO L290 TraceCheckUtils]: 127: Hoare triple {36908#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,102 INFO L290 TraceCheckUtils]: 128: Hoare triple {36908#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,102 INFO L290 TraceCheckUtils]: 129: Hoare triple {36908#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,103 INFO L290 TraceCheckUtils]: 130: Hoare triple {36936#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,103 INFO L272 TraceCheckUtils]: 131: Hoare triple {36936#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,103 INFO L290 TraceCheckUtils]: 132: Hoare triple {36936#(<= ~counter~0 14)} ~cond := #in~cond; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,104 INFO L290 TraceCheckUtils]: 133: Hoare triple {36936#(<= ~counter~0 14)} assume !(0 == ~cond); {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,104 INFO L290 TraceCheckUtils]: 134: Hoare triple {36936#(<= ~counter~0 14)} assume true; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,104 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {36936#(<= ~counter~0 14)} {36936#(<= ~counter~0 14)} #71#return; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,105 INFO L290 TraceCheckUtils]: 136: Hoare triple {36936#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,105 INFO L290 TraceCheckUtils]: 137: Hoare triple {36936#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,105 INFO L290 TraceCheckUtils]: 138: Hoare triple {36936#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,106 INFO L290 TraceCheckUtils]: 139: Hoare triple {36964#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,106 INFO L272 TraceCheckUtils]: 140: Hoare triple {36964#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,106 INFO L290 TraceCheckUtils]: 141: Hoare triple {36964#(<= ~counter~0 15)} ~cond := #in~cond; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,107 INFO L290 TraceCheckUtils]: 142: Hoare triple {36964#(<= ~counter~0 15)} assume !(0 == ~cond); {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,107 INFO L290 TraceCheckUtils]: 143: Hoare triple {36964#(<= ~counter~0 15)} assume true; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,107 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {36964#(<= ~counter~0 15)} {36964#(<= ~counter~0 15)} #71#return; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,108 INFO L290 TraceCheckUtils]: 145: Hoare triple {36964#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,108 INFO L290 TraceCheckUtils]: 146: Hoare triple {36964#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,108 INFO L290 TraceCheckUtils]: 147: Hoare triple {36964#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,108 INFO L290 TraceCheckUtils]: 148: Hoare triple {36992#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,109 INFO L272 TraceCheckUtils]: 149: Hoare triple {36992#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,109 INFO L290 TraceCheckUtils]: 150: Hoare triple {36992#(<= ~counter~0 16)} ~cond := #in~cond; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,109 INFO L290 TraceCheckUtils]: 151: Hoare triple {36992#(<= ~counter~0 16)} assume !(0 == ~cond); {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,110 INFO L290 TraceCheckUtils]: 152: Hoare triple {36992#(<= ~counter~0 16)} assume true; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,110 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {36992#(<= ~counter~0 16)} {36992#(<= ~counter~0 16)} #71#return; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,110 INFO L290 TraceCheckUtils]: 154: Hoare triple {36992#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,111 INFO L290 TraceCheckUtils]: 155: Hoare triple {36992#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,111 INFO L290 TraceCheckUtils]: 156: Hoare triple {36992#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,111 INFO L290 TraceCheckUtils]: 157: Hoare triple {37020#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,112 INFO L272 TraceCheckUtils]: 158: Hoare triple {37020#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,112 INFO L290 TraceCheckUtils]: 159: Hoare triple {37020#(<= ~counter~0 17)} ~cond := #in~cond; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,112 INFO L290 TraceCheckUtils]: 160: Hoare triple {37020#(<= ~counter~0 17)} assume !(0 == ~cond); {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,113 INFO L290 TraceCheckUtils]: 161: Hoare triple {37020#(<= ~counter~0 17)} assume true; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,113 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {37020#(<= ~counter~0 17)} {37020#(<= ~counter~0 17)} #71#return; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,113 INFO L290 TraceCheckUtils]: 163: Hoare triple {37020#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,114 INFO L290 TraceCheckUtils]: 164: Hoare triple {37020#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,114 INFO L290 TraceCheckUtils]: 165: Hoare triple {37020#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,114 INFO L290 TraceCheckUtils]: 166: Hoare triple {37048#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,115 INFO L272 TraceCheckUtils]: 167: Hoare triple {37048#(<= ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,115 INFO L290 TraceCheckUtils]: 168: Hoare triple {37048#(<= ~counter~0 18)} ~cond := #in~cond; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,115 INFO L290 TraceCheckUtils]: 169: Hoare triple {37048#(<= ~counter~0 18)} assume !(0 == ~cond); {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,116 INFO L290 TraceCheckUtils]: 170: Hoare triple {37048#(<= ~counter~0 18)} assume true; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,116 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {37048#(<= ~counter~0 18)} {37048#(<= ~counter~0 18)} #71#return; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,116 INFO L290 TraceCheckUtils]: 172: Hoare triple {37048#(<= ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,117 INFO L290 TraceCheckUtils]: 173: Hoare triple {37048#(<= ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,117 INFO L290 TraceCheckUtils]: 174: Hoare triple {37048#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,117 INFO L290 TraceCheckUtils]: 175: Hoare triple {37076#(<= ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,118 INFO L272 TraceCheckUtils]: 176: Hoare triple {37076#(<= ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,118 INFO L290 TraceCheckUtils]: 177: Hoare triple {37076#(<= ~counter~0 19)} ~cond := #in~cond; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,118 INFO L290 TraceCheckUtils]: 178: Hoare triple {37076#(<= ~counter~0 19)} assume !(0 == ~cond); {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,119 INFO L290 TraceCheckUtils]: 179: Hoare triple {37076#(<= ~counter~0 19)} assume true; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,119 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {37076#(<= ~counter~0 19)} {37076#(<= ~counter~0 19)} #71#return; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,119 INFO L290 TraceCheckUtils]: 181: Hoare triple {37076#(<= ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,120 INFO L290 TraceCheckUtils]: 182: Hoare triple {37076#(<= ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,120 INFO L290 TraceCheckUtils]: 183: Hoare triple {37076#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37104#(<= |main_#t~post6| 19)} is VALID [2022-04-08 14:10:23,120 INFO L290 TraceCheckUtils]: 184: Hoare triple {37104#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {36531#false} is VALID [2022-04-08 14:10:23,120 INFO L272 TraceCheckUtils]: 185: Hoare triple {36531#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {36531#false} is VALID [2022-04-08 14:10:23,120 INFO L290 TraceCheckUtils]: 186: Hoare triple {36531#false} ~cond := #in~cond; {36531#false} is VALID [2022-04-08 14:10:23,121 INFO L290 TraceCheckUtils]: 187: Hoare triple {36531#false} assume 0 == ~cond; {36531#false} is VALID [2022-04-08 14:10:23,121 INFO L290 TraceCheckUtils]: 188: Hoare triple {36531#false} assume !false; {36531#false} is VALID [2022-04-08 14:10:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 38 proven. 1577 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-04-08 14:10:23,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 14:10:23,865 INFO L290 TraceCheckUtils]: 188: Hoare triple {36531#false} assume !false; {36531#false} is VALID [2022-04-08 14:10:23,865 INFO L290 TraceCheckUtils]: 187: Hoare triple {36531#false} assume 0 == ~cond; {36531#false} is VALID [2022-04-08 14:10:23,865 INFO L290 TraceCheckUtils]: 186: Hoare triple {36531#false} ~cond := #in~cond; {36531#false} is VALID [2022-04-08 14:10:23,865 INFO L272 TraceCheckUtils]: 185: Hoare triple {36531#false} call __VERIFIER_assert((if ~q~0 == ~x~0 * ~y~0 then 1 else 0)); {36531#false} is VALID [2022-04-08 14:10:23,866 INFO L290 TraceCheckUtils]: 184: Hoare triple {37104#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {36531#false} is VALID [2022-04-08 14:10:23,866 INFO L290 TraceCheckUtils]: 183: Hoare triple {37076#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37104#(<= |main_#t~post6| 19)} is VALID [2022-04-08 14:10:23,866 INFO L290 TraceCheckUtils]: 182: Hoare triple {37076#(<= ~counter~0 19)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,867 INFO L290 TraceCheckUtils]: 181: Hoare triple {37076#(<= ~counter~0 19)} assume !!(0 != ~a~0 && 0 != ~b~0); {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,867 INFO L284 TraceCheckUtils]: 180: Hoare quadruple {36530#true} {37076#(<= ~counter~0 19)} #71#return; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,867 INFO L290 TraceCheckUtils]: 179: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,867 INFO L290 TraceCheckUtils]: 178: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,867 INFO L290 TraceCheckUtils]: 177: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,867 INFO L272 TraceCheckUtils]: 176: Hoare triple {37076#(<= ~counter~0 19)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,868 INFO L290 TraceCheckUtils]: 175: Hoare triple {37076#(<= ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,868 INFO L290 TraceCheckUtils]: 174: Hoare triple {37048#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37076#(<= ~counter~0 19)} is VALID [2022-04-08 14:10:23,869 INFO L290 TraceCheckUtils]: 173: Hoare triple {37048#(<= ~counter~0 18)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,869 INFO L290 TraceCheckUtils]: 172: Hoare triple {37048#(<= ~counter~0 18)} assume !!(0 != ~a~0 && 0 != ~b~0); {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,869 INFO L284 TraceCheckUtils]: 171: Hoare quadruple {36530#true} {37048#(<= ~counter~0 18)} #71#return; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,870 INFO L290 TraceCheckUtils]: 170: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,870 INFO L290 TraceCheckUtils]: 169: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,870 INFO L290 TraceCheckUtils]: 168: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,870 INFO L272 TraceCheckUtils]: 167: Hoare triple {37048#(<= ~counter~0 18)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,870 INFO L290 TraceCheckUtils]: 166: Hoare triple {37048#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,870 INFO L290 TraceCheckUtils]: 165: Hoare triple {37020#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37048#(<= ~counter~0 18)} is VALID [2022-04-08 14:10:23,871 INFO L290 TraceCheckUtils]: 164: Hoare triple {37020#(<= ~counter~0 17)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,871 INFO L290 TraceCheckUtils]: 163: Hoare triple {37020#(<= ~counter~0 17)} assume !!(0 != ~a~0 && 0 != ~b~0); {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,871 INFO L284 TraceCheckUtils]: 162: Hoare quadruple {36530#true} {37020#(<= ~counter~0 17)} #71#return; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,872 INFO L290 TraceCheckUtils]: 161: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,872 INFO L290 TraceCheckUtils]: 160: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,872 INFO L290 TraceCheckUtils]: 159: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,872 INFO L272 TraceCheckUtils]: 158: Hoare triple {37020#(<= ~counter~0 17)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,872 INFO L290 TraceCheckUtils]: 157: Hoare triple {37020#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,872 INFO L290 TraceCheckUtils]: 156: Hoare triple {36992#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {37020#(<= ~counter~0 17)} is VALID [2022-04-08 14:10:23,873 INFO L290 TraceCheckUtils]: 155: Hoare triple {36992#(<= ~counter~0 16)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,873 INFO L290 TraceCheckUtils]: 154: Hoare triple {36992#(<= ~counter~0 16)} assume !!(0 != ~a~0 && 0 != ~b~0); {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,873 INFO L284 TraceCheckUtils]: 153: Hoare quadruple {36530#true} {36992#(<= ~counter~0 16)} #71#return; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,874 INFO L290 TraceCheckUtils]: 152: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,874 INFO L290 TraceCheckUtils]: 151: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,874 INFO L290 TraceCheckUtils]: 150: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,874 INFO L272 TraceCheckUtils]: 149: Hoare triple {36992#(<= ~counter~0 16)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,874 INFO L290 TraceCheckUtils]: 148: Hoare triple {36992#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,874 INFO L290 TraceCheckUtils]: 147: Hoare triple {36964#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36992#(<= ~counter~0 16)} is VALID [2022-04-08 14:10:23,875 INFO L290 TraceCheckUtils]: 146: Hoare triple {36964#(<= ~counter~0 15)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,875 INFO L290 TraceCheckUtils]: 145: Hoare triple {36964#(<= ~counter~0 15)} assume !!(0 != ~a~0 && 0 != ~b~0); {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,875 INFO L284 TraceCheckUtils]: 144: Hoare quadruple {36530#true} {36964#(<= ~counter~0 15)} #71#return; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,876 INFO L290 TraceCheckUtils]: 143: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,876 INFO L290 TraceCheckUtils]: 142: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,876 INFO L290 TraceCheckUtils]: 141: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,876 INFO L272 TraceCheckUtils]: 140: Hoare triple {36964#(<= ~counter~0 15)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,876 INFO L290 TraceCheckUtils]: 139: Hoare triple {36964#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,876 INFO L290 TraceCheckUtils]: 138: Hoare triple {36936#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36964#(<= ~counter~0 15)} is VALID [2022-04-08 14:10:23,877 INFO L290 TraceCheckUtils]: 137: Hoare triple {36936#(<= ~counter~0 14)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,877 INFO L290 TraceCheckUtils]: 136: Hoare triple {36936#(<= ~counter~0 14)} assume !!(0 != ~a~0 && 0 != ~b~0); {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,878 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {36530#true} {36936#(<= ~counter~0 14)} #71#return; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,878 INFO L290 TraceCheckUtils]: 134: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,878 INFO L290 TraceCheckUtils]: 133: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,878 INFO L290 TraceCheckUtils]: 132: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,878 INFO L272 TraceCheckUtils]: 131: Hoare triple {36936#(<= ~counter~0 14)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,878 INFO L290 TraceCheckUtils]: 130: Hoare triple {36936#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,879 INFO L290 TraceCheckUtils]: 129: Hoare triple {36908#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36936#(<= ~counter~0 14)} is VALID [2022-04-08 14:10:23,879 INFO L290 TraceCheckUtils]: 128: Hoare triple {36908#(<= ~counter~0 13)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,879 INFO L290 TraceCheckUtils]: 127: Hoare triple {36908#(<= ~counter~0 13)} assume !!(0 != ~a~0 && 0 != ~b~0); {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,880 INFO L284 TraceCheckUtils]: 126: Hoare quadruple {36530#true} {36908#(<= ~counter~0 13)} #71#return; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,880 INFO L290 TraceCheckUtils]: 125: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,880 INFO L290 TraceCheckUtils]: 124: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,880 INFO L290 TraceCheckUtils]: 123: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,880 INFO L272 TraceCheckUtils]: 122: Hoare triple {36908#(<= ~counter~0 13)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,880 INFO L290 TraceCheckUtils]: 121: Hoare triple {36908#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,881 INFO L290 TraceCheckUtils]: 120: Hoare triple {36880#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36908#(<= ~counter~0 13)} is VALID [2022-04-08 14:10:23,881 INFO L290 TraceCheckUtils]: 119: Hoare triple {36880#(<= ~counter~0 12)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,881 INFO L290 TraceCheckUtils]: 118: Hoare triple {36880#(<= ~counter~0 12)} assume !!(0 != ~a~0 && 0 != ~b~0); {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,882 INFO L284 TraceCheckUtils]: 117: Hoare quadruple {36530#true} {36880#(<= ~counter~0 12)} #71#return; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,882 INFO L290 TraceCheckUtils]: 116: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,882 INFO L290 TraceCheckUtils]: 115: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,882 INFO L290 TraceCheckUtils]: 114: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,882 INFO L272 TraceCheckUtils]: 113: Hoare triple {36880#(<= ~counter~0 12)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,882 INFO L290 TraceCheckUtils]: 112: Hoare triple {36880#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,883 INFO L290 TraceCheckUtils]: 111: Hoare triple {36852#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36880#(<= ~counter~0 12)} is VALID [2022-04-08 14:10:23,883 INFO L290 TraceCheckUtils]: 110: Hoare triple {36852#(<= ~counter~0 11)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,883 INFO L290 TraceCheckUtils]: 109: Hoare triple {36852#(<= ~counter~0 11)} assume !!(0 != ~a~0 && 0 != ~b~0); {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,884 INFO L284 TraceCheckUtils]: 108: Hoare quadruple {36530#true} {36852#(<= ~counter~0 11)} #71#return; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,884 INFO L290 TraceCheckUtils]: 107: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,884 INFO L290 TraceCheckUtils]: 106: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,884 INFO L290 TraceCheckUtils]: 105: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,884 INFO L272 TraceCheckUtils]: 104: Hoare triple {36852#(<= ~counter~0 11)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,884 INFO L290 TraceCheckUtils]: 103: Hoare triple {36852#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,885 INFO L290 TraceCheckUtils]: 102: Hoare triple {36824#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36852#(<= ~counter~0 11)} is VALID [2022-04-08 14:10:23,885 INFO L290 TraceCheckUtils]: 101: Hoare triple {36824#(<= ~counter~0 10)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,885 INFO L290 TraceCheckUtils]: 100: Hoare triple {36824#(<= ~counter~0 10)} assume !!(0 != ~a~0 && 0 != ~b~0); {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,886 INFO L284 TraceCheckUtils]: 99: Hoare quadruple {36530#true} {36824#(<= ~counter~0 10)} #71#return; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,886 INFO L290 TraceCheckUtils]: 98: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,886 INFO L290 TraceCheckUtils]: 97: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,886 INFO L290 TraceCheckUtils]: 96: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,886 INFO L272 TraceCheckUtils]: 95: Hoare triple {36824#(<= ~counter~0 10)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,886 INFO L290 TraceCheckUtils]: 94: Hoare triple {36824#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,887 INFO L290 TraceCheckUtils]: 93: Hoare triple {36796#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36824#(<= ~counter~0 10)} is VALID [2022-04-08 14:10:23,887 INFO L290 TraceCheckUtils]: 92: Hoare triple {36796#(<= ~counter~0 9)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,887 INFO L290 TraceCheckUtils]: 91: Hoare triple {36796#(<= ~counter~0 9)} assume !!(0 != ~a~0 && 0 != ~b~0); {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,888 INFO L284 TraceCheckUtils]: 90: Hoare quadruple {36530#true} {36796#(<= ~counter~0 9)} #71#return; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,888 INFO L290 TraceCheckUtils]: 89: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,888 INFO L290 TraceCheckUtils]: 88: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,888 INFO L290 TraceCheckUtils]: 87: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,888 INFO L272 TraceCheckUtils]: 86: Hoare triple {36796#(<= ~counter~0 9)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,888 INFO L290 TraceCheckUtils]: 85: Hoare triple {36796#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,889 INFO L290 TraceCheckUtils]: 84: Hoare triple {36768#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36796#(<= ~counter~0 9)} is VALID [2022-04-08 14:10:23,889 INFO L290 TraceCheckUtils]: 83: Hoare triple {36768#(<= ~counter~0 8)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,889 INFO L290 TraceCheckUtils]: 82: Hoare triple {36768#(<= ~counter~0 8)} assume !!(0 != ~a~0 && 0 != ~b~0); {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,890 INFO L284 TraceCheckUtils]: 81: Hoare quadruple {36530#true} {36768#(<= ~counter~0 8)} #71#return; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,890 INFO L290 TraceCheckUtils]: 80: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,890 INFO L290 TraceCheckUtils]: 79: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,890 INFO L290 TraceCheckUtils]: 78: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,890 INFO L272 TraceCheckUtils]: 77: Hoare triple {36768#(<= ~counter~0 8)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,890 INFO L290 TraceCheckUtils]: 76: Hoare triple {36768#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,891 INFO L290 TraceCheckUtils]: 75: Hoare triple {36740#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36768#(<= ~counter~0 8)} is VALID [2022-04-08 14:10:23,891 INFO L290 TraceCheckUtils]: 74: Hoare triple {36740#(<= ~counter~0 7)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,891 INFO L290 TraceCheckUtils]: 73: Hoare triple {36740#(<= ~counter~0 7)} assume !!(0 != ~a~0 && 0 != ~b~0); {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,892 INFO L284 TraceCheckUtils]: 72: Hoare quadruple {36530#true} {36740#(<= ~counter~0 7)} #71#return; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,892 INFO L290 TraceCheckUtils]: 71: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,892 INFO L290 TraceCheckUtils]: 70: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,892 INFO L290 TraceCheckUtils]: 69: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,892 INFO L272 TraceCheckUtils]: 68: Hoare triple {36740#(<= ~counter~0 7)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,892 INFO L290 TraceCheckUtils]: 67: Hoare triple {36740#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,893 INFO L290 TraceCheckUtils]: 66: Hoare triple {36712#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36740#(<= ~counter~0 7)} is VALID [2022-04-08 14:10:23,893 INFO L290 TraceCheckUtils]: 65: Hoare triple {36712#(<= ~counter~0 6)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,893 INFO L290 TraceCheckUtils]: 64: Hoare triple {36712#(<= ~counter~0 6)} assume !!(0 != ~a~0 && 0 != ~b~0); {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,894 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {36530#true} {36712#(<= ~counter~0 6)} #71#return; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,894 INFO L290 TraceCheckUtils]: 62: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,894 INFO L290 TraceCheckUtils]: 61: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,894 INFO L290 TraceCheckUtils]: 60: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,894 INFO L272 TraceCheckUtils]: 59: Hoare triple {36712#(<= ~counter~0 6)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,894 INFO L290 TraceCheckUtils]: 58: Hoare triple {36712#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,895 INFO L290 TraceCheckUtils]: 57: Hoare triple {36684#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36712#(<= ~counter~0 6)} is VALID [2022-04-08 14:10:23,895 INFO L290 TraceCheckUtils]: 56: Hoare triple {36684#(<= ~counter~0 5)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,895 INFO L290 TraceCheckUtils]: 55: Hoare triple {36684#(<= ~counter~0 5)} assume !!(0 != ~a~0 && 0 != ~b~0); {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,896 INFO L284 TraceCheckUtils]: 54: Hoare quadruple {36530#true} {36684#(<= ~counter~0 5)} #71#return; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,896 INFO L290 TraceCheckUtils]: 53: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,896 INFO L290 TraceCheckUtils]: 52: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,896 INFO L290 TraceCheckUtils]: 51: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,896 INFO L272 TraceCheckUtils]: 50: Hoare triple {36684#(<= ~counter~0 5)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {36684#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,897 INFO L290 TraceCheckUtils]: 48: Hoare triple {36656#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36684#(<= ~counter~0 5)} is VALID [2022-04-08 14:10:23,897 INFO L290 TraceCheckUtils]: 47: Hoare triple {36656#(<= ~counter~0 4)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,897 INFO L290 TraceCheckUtils]: 46: Hoare triple {36656#(<= ~counter~0 4)} assume !!(0 != ~a~0 && 0 != ~b~0); {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,898 INFO L284 TraceCheckUtils]: 45: Hoare quadruple {36530#true} {36656#(<= ~counter~0 4)} #71#return; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,898 INFO L290 TraceCheckUtils]: 44: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,898 INFO L290 TraceCheckUtils]: 43: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,898 INFO L290 TraceCheckUtils]: 42: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,898 INFO L272 TraceCheckUtils]: 41: Hoare triple {36656#(<= ~counter~0 4)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,898 INFO L290 TraceCheckUtils]: 40: Hoare triple {36656#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,899 INFO L290 TraceCheckUtils]: 39: Hoare triple {36628#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36656#(<= ~counter~0 4)} is VALID [2022-04-08 14:10:23,899 INFO L290 TraceCheckUtils]: 38: Hoare triple {36628#(<= ~counter~0 3)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,899 INFO L290 TraceCheckUtils]: 37: Hoare triple {36628#(<= ~counter~0 3)} assume !!(0 != ~a~0 && 0 != ~b~0); {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,900 INFO L284 TraceCheckUtils]: 36: Hoare quadruple {36530#true} {36628#(<= ~counter~0 3)} #71#return; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,900 INFO L290 TraceCheckUtils]: 35: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,900 INFO L290 TraceCheckUtils]: 34: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,900 INFO L290 TraceCheckUtils]: 33: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,900 INFO L272 TraceCheckUtils]: 32: Hoare triple {36628#(<= ~counter~0 3)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,900 INFO L290 TraceCheckUtils]: 31: Hoare triple {36628#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,901 INFO L290 TraceCheckUtils]: 30: Hoare triple {36600#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36628#(<= ~counter~0 3)} is VALID [2022-04-08 14:10:23,901 INFO L290 TraceCheckUtils]: 29: Hoare triple {36600#(<= ~counter~0 2)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {36600#(<= ~counter~0 2)} assume !!(0 != ~a~0 && 0 != ~b~0); {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,902 INFO L284 TraceCheckUtils]: 27: Hoare quadruple {36530#true} {36600#(<= ~counter~0 2)} #71#return; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,902 INFO L290 TraceCheckUtils]: 25: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,902 INFO L290 TraceCheckUtils]: 24: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,902 INFO L272 TraceCheckUtils]: 23: Hoare triple {36600#(<= ~counter~0 2)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {36600#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,903 INFO L290 TraceCheckUtils]: 21: Hoare triple {36572#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36600#(<= ~counter~0 2)} is VALID [2022-04-08 14:10:23,903 INFO L290 TraceCheckUtils]: 20: Hoare triple {36572#(<= ~counter~0 1)} assume 0 == (if ~a~0 < 0 && 0 != ~a~0 % 2 then ~a~0 % 2 - 2 else ~a~0 % 2) && 0 == (if ~b~0 < 0 && 0 != ~b~0 % 2 then ~b~0 % 2 - 2 else ~b~0 % 2);~a~0 := (if ~a~0 < 0 && 0 != ~a~0 % 2 then 1 + ~a~0 / 2 else ~a~0 / 2);~b~0 := (if ~b~0 < 0 && 0 != ~b~0 % 2 then 1 + ~b~0 / 2 else ~b~0 / 2);~p~0 := 4 * ~p~0; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {36572#(<= ~counter~0 1)} assume !!(0 != ~a~0 && 0 != ~b~0); {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,904 INFO L284 TraceCheckUtils]: 18: Hoare quadruple {36530#true} {36572#(<= ~counter~0 1)} #71#return; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,904 INFO L290 TraceCheckUtils]: 15: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,904 INFO L272 TraceCheckUtils]: 14: Hoare triple {36572#(<= ~counter~0 1)} call __VERIFIER_assert((if ~q~0 + ~a~0 * ~b~0 * ~p~0 == ~x~0 * ~y~0 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,904 INFO L290 TraceCheckUtils]: 13: Hoare triple {36572#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,905 INFO L290 TraceCheckUtils]: 12: Hoare triple {36538#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {36572#(<= ~counter~0 1)} is VALID [2022-04-08 14:10:23,905 INFO L290 TraceCheckUtils]: 11: Hoare triple {36538#(<= ~counter~0 0)} ~a~0 := ~x~0;~b~0 := ~y~0;~p~0 := 1;~q~0 := 0; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,905 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36530#true} {36538#(<= ~counter~0 0)} #69#return; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {36530#true} assume true; {36530#true} is VALID [2022-04-08 14:10:23,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {36530#true} assume !(0 == ~cond); {36530#true} is VALID [2022-04-08 14:10:23,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {36530#true} ~cond := #in~cond; {36530#true} is VALID [2022-04-08 14:10:23,906 INFO L272 TraceCheckUtils]: 6: Hoare triple {36538#(<= ~counter~0 0)} call assume_abort_if_not((if ~y~0 >= 1 then 1 else 0)); {36530#true} is VALID [2022-04-08 14:10:23,906 INFO L290 TraceCheckUtils]: 5: Hoare triple {36538#(<= ~counter~0 0)} havoc ~x~0;havoc ~y~0;havoc ~a~0;havoc ~b~0;havoc ~p~0;havoc ~q~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~x~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~y~0 := #t~nondet5;havoc #t~nondet5; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,906 INFO L272 TraceCheckUtils]: 4: Hoare triple {36538#(<= ~counter~0 0)} call #t~ret7 := main(); {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,906 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36538#(<= ~counter~0 0)} {36530#true} #77#return; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,907 INFO L290 TraceCheckUtils]: 2: Hoare triple {36538#(<= ~counter~0 0)} assume true; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,907 INFO L290 TraceCheckUtils]: 1: Hoare triple {36530#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(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {36538#(<= ~counter~0 0)} is VALID [2022-04-08 14:10:23,907 INFO L272 TraceCheckUtils]: 0: Hoare triple {36530#true} call ULTIMATE.init(); {36530#true} is VALID [2022-04-08 14:10:23,908 INFO L134 CoverageAnalysis]: Checked inductivity of 1615 backedges. 38 proven. 893 refuted. 0 times theorem prover too weak. 684 trivial. 0 not checked. [2022-04-08 14:10:23,908 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 14:10:23,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1672528008] [2022-04-08 14:10:23,908 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 14:10:23,908 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1119859449] [2022-04-08 14:10:23,908 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1119859449] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 14:10:23,908 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 14:10:23,908 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2022-04-08 14:10:23,909 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 14:10:23,909 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [466489170] [2022-04-08 14:10:23,909 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [466489170] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 14:10:23,909 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 14:10:23,909 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 14:10:23,909 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [472635131] [2022-04-08 14:10:23,909 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 14:10:23,909 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Word has length 189 [2022-04-08 14:10:23,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 14:10:23,910 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 14:10:24,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:10:24,056 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 14:10:24,056 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 14:10:24,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 14:10:24,057 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2022-04-08 14:10:24,057 INFO L87 Difference]: Start difference. First operand 241 states and 300 transitions. Second operand has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 14:10:25,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:10:25,191 INFO L93 Difference]: Finished difference Result 260 states and 323 transitions. [2022-04-08 14:10:25,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 14:10:25,191 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) Word has length 189 [2022-04-08 14:10:25,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 14:10:25,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 14:10:25,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 309 transitions. [2022-04-08 14:10:25,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 14:10:25,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 309 transitions. [2022-04-08 14:10:25,198 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 309 transitions. [2022-04-08 14:10:25,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 14:10:25,451 INFO L225 Difference]: With dead ends: 260 [2022-04-08 14:10:25,451 INFO L226 Difference]: Without dead ends: 252 [2022-04-08 14:10:25,451 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 396 GetRequests, 355 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=651, Invalid=1071, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 14:10:25,452 INFO L913 BasicCegarLoop]: 49 mSDtfsCounter, 274 mSDsluCounter, 273 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 274 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-08 14:10:25,452 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [274 Valid, 322 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-08 14:10:25,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-04-08 14:10:25,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 252. [2022-04-08 14:10:25,859 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 14:10:25,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand has 252 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 26 states have call successors, (26), 25 states have call predecessors, (26), 24 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 14:10:25,860 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand has 252 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 26 states have call successors, (26), 25 states have call predecessors, (26), 24 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 14:10:25,860 INFO L87 Difference]: Start difference. First operand 252 states. Second operand has 252 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 26 states have call successors, (26), 25 states have call predecessors, (26), 24 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 14:10:25,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:10:25,863 INFO L93 Difference]: Finished difference Result 252 states and 314 transitions. [2022-04-08 14:10:25,863 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 314 transitions. [2022-04-08 14:10:25,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:10:25,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:10:25,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 26 states have call successors, (26), 25 states have call predecessors, (26), 24 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 252 states. [2022-04-08 14:10:25,864 INFO L87 Difference]: Start difference. First operand has 252 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 26 states have call successors, (26), 25 states have call predecessors, (26), 24 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) Second operand 252 states. [2022-04-08 14:10:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 14:10:25,866 INFO L93 Difference]: Finished difference Result 252 states and 314 transitions. [2022-04-08 14:10:25,866 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 314 transitions. [2022-04-08 14:10:25,867 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 14:10:25,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 14:10:25,867 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 14:10:25,867 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 14:10:25,867 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 201 states have (on average 1.3134328358208955) internal successors, (264), 202 states have internal predecessors, (264), 26 states have call successors, (26), 25 states have call predecessors, (26), 24 states have return successors, (24), 24 states have call predecessors, (24), 24 states have call successors, (24) [2022-04-08 14:10:25,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 314 transitions. [2022-04-08 14:10:25,870 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 314 transitions. Word has length 189 [2022-04-08 14:10:25,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 14:10:25,871 INFO L478 AbstractCegarLoop]: Abstraction has 252 states and 314 transitions. [2022-04-08 14:10:25,871 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 20 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-08 14:10:25,871 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 252 states and 314 transitions.