/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-fb4f59a-m [2022-04-28 06:02:16,628 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-28 06:02:16,630 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-28 06:02:16,663 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-28 06:02:16,663 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-28 06:02:16,665 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-28 06:02:16,668 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-28 06:02:16,673 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-28 06:02:16,675 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-28 06:02:16,679 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-28 06:02:16,680 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-28 06:02:16,681 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-28 06:02:16,681 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-28 06:02:16,683 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-28 06:02:16,684 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-28 06:02:16,687 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-28 06:02:16,687 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-28 06:02:16,688 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-28 06:02:16,690 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-28 06:02:16,695 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-28 06:02:16,697 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-28 06:02:16,698 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-28 06:02:16,699 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-28 06:02:16,699 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-28 06:02:16,701 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-28 06:02:16,707 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-28 06:02:16,707 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-28 06:02:16,708 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-28 06:02:16,709 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-28 06:02:16,710 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-28 06:02:16,710 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-28 06:02:16,711 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-28 06:02:16,712 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-28 06:02:16,713 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-28 06:02:16,713 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-28 06:02:16,714 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-28 06:02:16,714 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-28 06:02:16,715 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-28 06:02:16,715 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-28 06:02:16,715 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-28 06:02:16,716 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-28 06:02:16,717 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-28 06:02:16,718 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationJordan_32.epf [2022-04-28 06:02:16,731 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-28 06:02:16,732 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-28 06:02:16,733 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-28 06:02:16,733 INFO L138 SettingsManager]: * sizeof long=4 [2022-04-28 06:02:16,733 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-28 06:02:16,733 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-04-28 06:02:16,733 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-28 06:02:16,734 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-28 06:02:16,734 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-28 06:02:16,735 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-28 06:02:16,735 INFO L138 SettingsManager]: * sizeof long double=12 [2022-04-28 06:02:16,735 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-28 06:02:16,735 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-28 06:02:16,735 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-28 06:02:16,735 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-28 06:02:16,735 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-28 06:02:16,736 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-28 06:02:16,736 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-28 06:02:16,736 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:02:16,736 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-28 06:02:16,736 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-28 06:02:16,736 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-28 06:02:16,736 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-28 06:02:16,736 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-28 06:02:16,737 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=JORDAN [2022-04-28 06:02:16,737 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-28 06:02:16,966 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-28 06:02:16,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-28 06:02:16,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-28 06:02:16,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-28 06:02:16,995 INFO L275 PluginConnector]: CDTParser initialized [2022-04-28 06:02:16,996 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2022-04-28 06:02:17,063 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509072982/4b44c1623f7041769c52c164883a0916/FLAGe3e37d275 [2022-04-28 06:02:17,481 INFO L306 CDTParser]: Found 1 translation units. [2022-04-28 06:02:17,481 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2022-04-28 06:02:17,488 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509072982/4b44c1623f7041769c52c164883a0916/FLAGe3e37d275 [2022-04-28 06:02:17,871 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/509072982/4b44c1623f7041769c52c164883a0916 [2022-04-28 06:02:17,873 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-28 06:02:17,875 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-28 06:02:17,877 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-28 06:02:17,878 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-28 06:02:17,881 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-28 06:02:17,882 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:02:17" (1/1) ... [2022-04-28 06:02:17,882 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@167c85a7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:17, skipping insertion in model container [2022-04-28 06:02:17,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.04 06:02:17" (1/1) ... [2022-04-28 06:02:17,888 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-28 06:02:17,900 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-28 06:02:18,053 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/fermat2-ll_unwindbound20.c[524,537] [2022-04-28 06:02:18,087 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:02:18,096 INFO L203 MainTranslator]: Completed pre-run [2022-04-28 06:02:18,111 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/fermat2-ll_unwindbound20.c[524,537] [2022-04-28 06:02:18,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-28 06:02:18,142 INFO L208 MainTranslator]: Completed translation [2022-04-28 06:02:18,143 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18 WrapperNode [2022-04-28 06:02:18,143 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-28 06:02:18,144 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-28 06:02:18,144 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-28 06:02:18,144 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-28 06:02:18,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18" (1/1) ... [2022-04-28 06:02:18,154 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18" (1/1) ... [2022-04-28 06:02:18,160 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18" (1/1) ... [2022-04-28 06:02:18,161 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18" (1/1) ... [2022-04-28 06:02:18,174 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18" (1/1) ... [2022-04-28 06:02:18,179 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18" (1/1) ... [2022-04-28 06:02:18,183 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18" (1/1) ... [2022-04-28 06:02:18,185 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-28 06:02:18,186 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-28 06:02:18,186 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-28 06:02:18,186 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-28 06:02:18,187 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18" (1/1) ... [2022-04-28 06:02:18,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-28 06:02:18,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:18,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-28 06:02:18,230 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-28 06:02:18,261 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-28 06:02:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-28 06:02:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-28 06:02:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-28 06:02:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-28 06:02:18,262 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-28 06:02:18,262 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-28 06:02:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-28 06:02:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-28 06:02:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-28 06:02:18,263 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-28 06:02:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-28 06:02:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-28 06:02:18,264 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-28 06:02:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-28 06:02:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-28 06:02:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-28 06:02:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-28 06:02:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-28 06:02:18,265 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-28 06:02:18,322 INFO L234 CfgBuilder]: Building ICFG [2022-04-28 06:02:18,324 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-28 06:02:18,504 INFO L275 CfgBuilder]: Performing block encoding [2022-04-28 06:02:18,510 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-28 06:02:18,511 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-28 06:02:18,512 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:02:18 BoogieIcfgContainer [2022-04-28 06:02:18,512 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-28 06:02:18,514 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-28 06:02:18,514 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-28 06:02:18,530 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-28 06:02:18,530 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.04 06:02:17" (1/3) ... [2022-04-28 06:02:18,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0fcbf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:02:18, skipping insertion in model container [2022-04-28 06:02:18,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.04 06:02:18" (2/3) ... [2022-04-28 06:02:18,531 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b0fcbf4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.04 06:02:18, skipping insertion in model container [2022-04-28 06:02:18,531 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.04 06:02:18" (3/3) ... [2022-04-28 06:02:18,532 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2022-04-28 06:02:18,560 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-28 06:02:18,560 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-28 06:02:18,609 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-28 06:02:18,627 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@4785f49d, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@8a7aa36 [2022-04-28 06:02:18,628 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-28 06:02:18,634 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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-28 06:02:18,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-28 06:02:18,642 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:18,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:18,643 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:18,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:18,649 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-28 06:02:18,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:18,657 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [208520353] [2022-04-28 06:02:18,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:18,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times [2022-04-28 06:02:18,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:18,672 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2123619439] [2022-04-28 06:02:18,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:18,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:18,786 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:18,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1084430388] [2022-04-28 06:02:18,787 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:02:18,787 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:18,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:18,795 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:18,804 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-28 06:02:18,879 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:02:18,880 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:18,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-28 06:02:18,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:18,899 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:18,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-28 06:02:18,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#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; {33#true} is VALID [2022-04-28 06:02:18,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 06:02:18,996 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-28 06:02:18,996 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-28 06:02:18,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {33#true} is VALID [2022-04-28 06:02:18,996 INFO L272 TraceCheckUtils]: 6: Hoare triple {33#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {33#true} is VALID [2022-04-28 06:02:18,997 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 06:02:18,997 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {33#true} is VALID [2022-04-28 06:02:18,997 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-28 06:02:18,997 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#true} {33#true} #59#return; {33#true} is VALID [2022-04-28 06:02:18,998 INFO L272 TraceCheckUtils]: 11: Hoare triple {33#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {33#true} is VALID [2022-04-28 06:02:18,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-28 06:02:18,999 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-28 06:02:18,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-28 06:02:18,999 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {33#true} #61#return; {34#false} is VALID [2022-04-28 06:02:18,999 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {34#false} is VALID [2022-04-28 06:02:19,000 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-28 06:02:19,000 INFO L272 TraceCheckUtils]: 18: Hoare triple {34#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {34#false} is VALID [2022-04-28 06:02:19,000 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-28 06:02:19,000 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-28 06:02:19,001 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-28 06:02:19,002 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-04-28 06:02:19,002 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:02:19,002 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:19,002 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2123619439] [2022-04-28 06:02:19,002 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:19,003 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1084430388] [2022-04-28 06:02:19,003 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1084430388] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:19,003 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:19,003 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 06:02:19,006 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:19,006 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [208520353] [2022-04-28 06:02:19,007 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [208520353] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:19,007 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:19,007 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-28 06:02:19,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041198551] [2022-04-28 06:02:19,008 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:19,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 06:02:19,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:19,016 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:19,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:19,038 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-28 06:02:19,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:19,055 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-28 06:02:19,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 06:02:19,057 INFO L87 Difference]: Start difference. First operand has 30 states, 18 states have (on average 1.3888888888888888) internal successors, (25), 19 states have internal predecessors, (25), 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 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:19,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:19,148 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-28 06:02:19,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-28 06:02:19,149 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 22 [2022-04-28 06:02:19,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:19,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:19,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-28 06:02:19,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:19,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-28 06:02:19,171 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-28 06:02:19,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:19,284 INFO L225 Difference]: With dead ends: 53 [2022-04-28 06:02:19,284 INFO L226 Difference]: Without dead ends: 25 [2022-04-28 06:02:19,300 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-28 06:02:19,303 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 34 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:02:19,304 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:02:19,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-28 06:02:19,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-28 06:02:19,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:19,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-28 06:02:19,342 INFO L74 IsIncluded]: Start isIncluded. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-28 06:02:19,343 INFO L87 Difference]: Start difference. First operand 25 states. Second operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-28 06:02:19,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:19,355 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 06:02:19,355 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 06:02:19,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:19,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:19,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 25 states. [2022-04-28 06:02:19,360 INFO L87 Difference]: Start difference. First operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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 25 states. [2022-04-28 06:02:19,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:19,362 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-28 06:02:19,362 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 06:02:19,363 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:19,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:19,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:19,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:19,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 15 states have (on average 1.2666666666666666) internal successors, (19), 16 states have internal predecessors, (19), 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-28 06:02:19,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-28 06:02:19,369 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-28 06:02:19,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:19,370 INFO L495 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-28 06:02:19,373 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.5) internal successors, (13), 2 states have internal predecessors, (13), 2 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:19,373 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-28 06:02:19,408 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-28 06:02:19,408 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-28 06:02:19,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 06:02:19,409 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:19,409 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:19,435 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-28 06:02:19,631 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-04-28 06:02:19,632 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:19,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:19,632 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-28 06:02:19,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:19,633 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [102398826] [2022-04-28 06:02:19,633 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:19,634 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times [2022-04-28 06:02:19,634 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:19,634 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835446107] [2022-04-28 06:02:19,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:19,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:19,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:19,651 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1450819464] [2022-04-28 06:02:19,651 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:02:19,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:19,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:19,657 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:19,658 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-28 06:02:19,711 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:02:19,711 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:19,712 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-28 06:02:19,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:19,726 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:19,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {306#true} is VALID [2022-04-28 06:02:19,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {306#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; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,912 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#(<= ~counter~0 0)} {306#true} #67#return; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#(<= ~counter~0 0)} call #t~ret7 := main(); {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,913 INFO L290 TraceCheckUtils]: 5: Hoare triple {314#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,914 INFO L272 TraceCheckUtils]: 6: Hoare triple {314#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#(<= ~counter~0 0)} ~cond := #in~cond; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,915 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(<= ~counter~0 0)} assume !(0 == ~cond); {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#(<= ~counter~0 0)} {314#(<= ~counter~0 0)} #59#return; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,917 INFO L272 TraceCheckUtils]: 11: Hoare triple {314#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(<= ~counter~0 0)} ~cond := #in~cond; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#(<= ~counter~0 0)} assume !(0 == ~cond); {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,918 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,919 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {314#(<= ~counter~0 0)} {314#(<= ~counter~0 0)} #61#return; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {314#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {314#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:19,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {314#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {363#(<= |main_#t~post6| 0)} is VALID [2022-04-28 06:02:19,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {363#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {307#false} is VALID [2022-04-28 06:02:19,921 INFO L272 TraceCheckUtils]: 19: Hoare triple {307#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {307#false} is VALID [2022-04-28 06:02:19,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2022-04-28 06:02:19,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2022-04-28 06:02:19,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2022-04-28 06:02:19,921 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:19,922 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:02:19,922 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:19,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835446107] [2022-04-28 06:02:19,922 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:19,922 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1450819464] [2022-04-28 06:02:19,922 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1450819464] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:19,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:19,923 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:02:19,923 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:19,923 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [102398826] [2022-04-28 06:02:19,923 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [102398826] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:19,923 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:19,924 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-28 06:02:19,924 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176694929] [2022-04-28 06:02:19,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:19,925 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 06:02:19,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:19,925 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:02:19,943 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:19,944 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-28 06:02:19,944 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:19,945 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-28 06:02:19,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-28 06:02:19,945 INFO L87 Difference]: Start difference. First operand 25 states and 29 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:02:20,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:20,014 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-28 06:02:20,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-28 06:02:20,014 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) Word has length 23 [2022-04-28 06:02:20,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:20,015 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:02:20,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 06:02:20,017 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:02:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-28 06:02:20,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-28 06:02:20,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:20,057 INFO L225 Difference]: With dead ends: 34 [2022-04-28 06:02:20,057 INFO L226 Difference]: Without dead ends: 27 [2022-04-28 06:02:20,057 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 20 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-28 06:02:20,063 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 0 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 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-28 06:02:20,063 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:02:20,065 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-28 06:02:20,084 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-28 06:02:20,084 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:20,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 06:02:20,084 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 06:02:20,085 INFO L87 Difference]: Start difference. First operand 27 states. Second operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 06:02:20,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:20,090 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 06:02:20,090 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 06:02:20,090 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:20,090 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:20,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 27 states. [2022-04-28 06:02:20,093 INFO L87 Difference]: Start difference. First operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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 27 states. [2022-04-28 06:02:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:20,099 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-28 06:02:20,099 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 06:02:20,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:20,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:20,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:20,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:20,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 18 states have internal predecessors, (21), 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-28 06:02:20,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-28 06:02:20,107 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-28 06:02:20,107 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:20,107 INFO L495 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-28 06:02:20,108 INFO L496 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, (5), 3 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 2 states have call successors, (3) [2022-04-28 06:02:20,108 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-28 06:02:20,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:20,135 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-28 06:02:20,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-28 06:02:20,137 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:20,137 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:20,163 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-28 06:02:20,351 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-28 06:02:20,352 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:20,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:20,352 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-28 06:02:20,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:20,352 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1306881171] [2022-04-28 06:02:20,353 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:20,353 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times [2022-04-28 06:02:20,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:20,353 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [372962501] [2022-04-28 06:02:20,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:20,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:20,375 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:20,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1406554182] [2022-04-28 06:02:20,375 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:02:20,375 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:20,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:20,381 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:20,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-28 06:02:20,440 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-28 06:02:20,441 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:20,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 06:02:20,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:20,463 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:20,791 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-28 06:02:20,791 INFO L290 TraceCheckUtils]: 1: Hoare triple {554#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; {554#true} is VALID [2022-04-28 06:02:20,791 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 06:02:20,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #67#return; {554#true} is VALID [2022-04-28 06:02:20,792 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret7 := main(); {554#true} is VALID [2022-04-28 06:02:20,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {554#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {554#true} is VALID [2022-04-28 06:02:20,792 INFO L272 TraceCheckUtils]: 6: Hoare triple {554#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {554#true} is VALID [2022-04-28 06:02:20,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-28 06:02:20,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-28 06:02:20,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 06:02:20,793 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #59#return; {554#true} is VALID [2022-04-28 06:02:20,793 INFO L272 TraceCheckUtils]: 11: Hoare triple {554#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {554#true} is VALID [2022-04-28 06:02:20,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-28 06:02:20,793 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-28 06:02:20,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-28 06:02:20,794 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #61#return; {554#true} is VALID [2022-04-28 06:02:20,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {554#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 06:02:20,868 INFO L290 TraceCheckUtils]: 17: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 06:02:20,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} assume !!(#t~post6 < 20);havoc #t~post6; {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} is VALID [2022-04-28 06:02:22,130 INFO L272 TraceCheckUtils]: 19: Hoare triple {607#(and (= (+ (* (- 1) main_~A~0) (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) main_~r~0) (= (mod (+ main_~u~0 1) 2) 0) (= main_~v~0 1))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {617#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:02:22,131 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:02:22,131 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-28 06:02:22,131 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-28 06:02:22,132 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:22,132 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-28 06:02:22,132 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:22,132 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [372962501] [2022-04-28 06:02:22,132 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:22,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406554182] [2022-04-28 06:02:22,133 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406554182] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:22,133 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:22,133 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:02:22,133 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:22,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1306881171] [2022-04-28 06:02:22,134 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1306881171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:22,134 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:22,134 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:02:22,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622696583] [2022-04-28 06:02:22,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:22,134 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 06:02:22,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:22,135 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:24,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:24,658 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:02:24,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:24,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:02:24,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-28 06:02:24,659 INFO L87 Difference]: Start difference. First operand 27 states and 31 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:26,844 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.35s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:02:30,685 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.69s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-28 06:02:30,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:30,741 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-28 06:02:30,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-28 06:02:30,742 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) Word has length 23 [2022-04-28 06:02:30,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:30,742 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:30,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-28 06:02:30,744 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, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:30,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-28 06:02:30,745 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-28 06:02:35,744 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-28 06:02:35,746 INFO L225 Difference]: With dead ends: 39 [2022-04-28 06:02:35,746 INFO L226 Difference]: Without dead ends: 37 [2022-04-28 06:02:35,746 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-04-28 06:02:35,747 INFO L413 NwaCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.9s IncrementalHoareTripleChecker+Time [2022-04-28 06:02:35,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 3.9s Time] [2022-04-28 06:02:35,750 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-28 06:02:35,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-28 06:02:35,767 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:35,767 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:02:35,771 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:02:35,772 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:02:35,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:35,774 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-28 06:02:35,774 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-28 06:02:35,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:35,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:35,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-28 06:02:35,775 INFO L87 Difference]: Start difference. First operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 37 states. [2022-04-28 06:02:35,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:35,777 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-28 06:02:35,777 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-28 06:02:35,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:35,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:35,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:35,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:35,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.2916666666666667) internal successors, (31), 25 states have internal predecessors, (31), 7 states have call successors, (7), 5 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:02:35,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-28 06:02:35,780 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-04-28 06:02:35,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:35,781 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-28 06:02:35,781 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (5), 2 states have call predecessors, (5), 1 states have return successors, (3), 1 states have call predecessors, (3), 1 states have call successors, (3) [2022-04-28 06:02:35,781 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-28 06:02:39,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 42 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:39,843 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-28 06:02:39,844 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-28 06:02:39,844 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:39,844 INFO L195 NwaCegarLoop]: 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-28 06:02:39,869 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-28 06:02:40,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:40,045 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:40,045 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-28 06:02:40,046 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:40,046 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1427234952] [2022-04-28 06:02:40,046 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:40,046 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times [2022-04-28 06:02:40,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:40,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1458900807] [2022-04-28 06:02:40,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:40,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:40,069 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:40,069 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [758300475] [2022-04-28 06:02:40,069 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:02:40,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:40,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:40,072 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:40,083 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-28 06:02:40,133 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:02:40,134 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:40,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-28 06:02:40,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:40,156 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:40,363 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2022-04-28 06:02:40,364 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#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; {853#true} is VALID [2022-04-28 06:02:40,364 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-28 06:02:40,364 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #67#return; {853#true} is VALID [2022-04-28 06:02:40,364 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret7 := main(); {853#true} is VALID [2022-04-28 06:02:40,364 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {853#true} is VALID [2022-04-28 06:02:40,365 INFO L272 TraceCheckUtils]: 6: Hoare triple {853#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {853#true} is VALID [2022-04-28 06:02:40,365 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-28 06:02:40,365 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-28 06:02:40,365 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-28 06:02:40,365 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {853#true} {853#true} #59#return; {853#true} is VALID [2022-04-28 06:02:40,366 INFO L272 TraceCheckUtils]: 11: Hoare triple {853#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {853#true} is VALID [2022-04-28 06:02:40,366 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-28 06:02:40,366 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-28 06:02:40,366 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-28 06:02:40,366 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {853#true} {853#true} #61#return; {853#true} is VALID [2022-04-28 06:02:40,367 INFO L290 TraceCheckUtils]: 16: Hoare triple {853#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {853#true} is VALID [2022-04-28 06:02:40,367 INFO L290 TraceCheckUtils]: 17: Hoare triple {853#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {853#true} is VALID [2022-04-28 06:02:40,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {853#true} assume !!(#t~post6 < 20);havoc #t~post6; {853#true} is VALID [2022-04-28 06:02:40,367 INFO L272 TraceCheckUtils]: 19: Hoare triple {853#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {853#true} is VALID [2022-04-28 06:02:40,368 INFO L290 TraceCheckUtils]: 20: Hoare triple {853#true} ~cond := #in~cond; {918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:02:40,368 INFO L290 TraceCheckUtils]: 21: Hoare triple {918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:02:40,369 INFO L290 TraceCheckUtils]: 22: Hoare triple {922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:02:40,370 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {922#(not (= |__VERIFIER_assert_#in~cond| 0))} {853#true} #63#return; {929#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} is VALID [2022-04-28 06:02:40,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {929#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4) (* main_~r~0 4)))} assume !(0 != ~r~0); {933#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 06:02:40,371 INFO L272 TraceCheckUtils]: 25: Hoare triple {933#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:02:40,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:02:40,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {854#false} is VALID [2022-04-28 06:02:40,372 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-28 06:02:40,373 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:40,373 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:02:40,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-28 06:02:40,854 INFO L290 TraceCheckUtils]: 27: Hoare triple {941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {854#false} is VALID [2022-04-28 06:02:40,855 INFO L290 TraceCheckUtils]: 26: Hoare triple {937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-28 06:02:40,856 INFO L272 TraceCheckUtils]: 25: Hoare triple {933#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {937#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-28 06:02:40,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {960#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} assume !(0 != ~r~0); {933#(= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4)))} is VALID [2022-04-28 06:02:40,857 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {922#(not (= |__VERIFIER_assert_#in~cond| 0))} {853#true} #63#return; {960#(or (not (= main_~r~0 0)) (= (+ (* main_~v~0 2) (* main_~u~0 main_~u~0)) (+ (* main_~v~0 main_~v~0) (* main_~u~0 2) (* main_~A~0 4))))} is VALID [2022-04-28 06:02:40,859 INFO L290 TraceCheckUtils]: 22: Hoare triple {922#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:02:40,860 INFO L290 TraceCheckUtils]: 21: Hoare triple {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {922#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-28 06:02:40,860 INFO L290 TraceCheckUtils]: 20: Hoare triple {853#true} ~cond := #in~cond; {973#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-28 06:02:40,861 INFO L272 TraceCheckUtils]: 19: Hoare triple {853#true} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {853#true} is VALID [2022-04-28 06:02:40,861 INFO L290 TraceCheckUtils]: 18: Hoare triple {853#true} assume !!(#t~post6 < 20);havoc #t~post6; {853#true} is VALID [2022-04-28 06:02:40,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {853#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {853#true} is VALID [2022-04-28 06:02:40,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {853#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {853#true} is VALID [2022-04-28 06:02:40,861 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {853#true} {853#true} #61#return; {853#true} is VALID [2022-04-28 06:02:40,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-28 06:02:40,861 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-28 06:02:40,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-28 06:02:40,862 INFO L272 TraceCheckUtils]: 11: Hoare triple {853#true} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {853#true} is VALID [2022-04-28 06:02:40,862 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {853#true} {853#true} #59#return; {853#true} is VALID [2022-04-28 06:02:40,862 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-28 06:02:40,862 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-28 06:02:40,862 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-28 06:02:40,862 INFO L272 TraceCheckUtils]: 6: Hoare triple {853#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {853#true} is VALID [2022-04-28 06:02:40,863 INFO L290 TraceCheckUtils]: 5: Hoare triple {853#true} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {853#true} is VALID [2022-04-28 06:02:40,863 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret7 := main(); {853#true} is VALID [2022-04-28 06:02:40,863 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #67#return; {853#true} is VALID [2022-04-28 06:02:40,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-28 06:02:40,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {853#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; {853#true} is VALID [2022-04-28 06:02:40,863 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2022-04-28 06:02:40,864 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:40,864 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:40,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1458900807] [2022-04-28 06:02:40,864 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:40,864 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [758300475] [2022-04-28 06:02:40,864 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [758300475] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:02:40,865 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:02:40,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-28 06:02:40,865 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:40,865 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1427234952] [2022-04-28 06:02:40,865 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1427234952] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:40,865 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:40,865 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 06:02:40,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1443744608] [2022-04-28 06:02:40,865 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:40,866 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 06:02:40,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:40,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 06:02:40,894 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-28 06:02:40,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 06:02:40,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:40,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 06:02:40,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:02:40,895 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 06:02:41,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:41,308 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-28 06:02:41,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:02:41,308 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) Word has length 29 [2022-04-28 06:02:41,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:41,309 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 06:02:41,311 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 06:02:41,311 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 06:02:41,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-28 06:02:41,312 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-28 06:02:41,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:41,346 INFO L225 Difference]: With dead ends: 43 [2022-04-28 06:02:41,346 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 06:02:41,347 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=115, Unknown=0, NotChecked=0, Total=156 [2022-04-28 06:02:41,348 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 17 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:02:41,348 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 103 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:02:41,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 06:02:41,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-04-28 06:02:41,367 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:41,367 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-28 06:02:41,368 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-28 06:02:41,368 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-28 06:02:41,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:41,370 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-28 06:02:41,370 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 06:02:41,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:41,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:41,371 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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 38 states. [2022-04-28 06:02:41,371 INFO L87 Difference]: Start difference. First operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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 38 states. [2022-04-28 06:02:41,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:41,373 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-28 06:02:41,373 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-28 06:02:41,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:41,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:41,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:41,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:41,374 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 19 states have (on average 1.105263157894737) internal successors, (21), 19 states have internal predecessors, (21), 6 states have call successors, (6), 5 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-28 06:02:41,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-28 06:02:41,375 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-28 06:02:41,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:41,375 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-28 06:02:41,375 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 6 states have internal predecessors, (16), 2 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 1 states have call successors, (4) [2022-04-28 06:02:41,376 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-28 06:02:42,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:42,755 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-28 06:02:42,756 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-28 06:02:42,756 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:42,756 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:42,781 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-28 06:02:42,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:42,957 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:42,957 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-28 06:02:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:42,958 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1831595016] [2022-04-28 06:02:42,958 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:42,958 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times [2022-04-28 06:02:42,958 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:42,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503436808] [2022-04-28 06:02:42,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:42,959 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:42,976 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:42,976 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [294992510] [2022-04-28 06:02:42,976 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:02:42,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:42,977 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:42,986 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:42,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-28 06:02:43,039 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:02:43,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:43,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-28 06:02:43,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:43,050 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:43,197 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-28 06:02:43,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#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; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,210 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#(<= ~counter~0 0)} assume true; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,211 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#(<= ~counter~0 0)} {1262#true} #67#return; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,212 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#(<= ~counter~0 0)} call #t~ret7 := main(); {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,212 INFO L290 TraceCheckUtils]: 5: Hoare triple {1270#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {1270#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#(<= ~counter~0 0)} ~cond := #in~cond; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,214 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#(<= ~counter~0 0)} assume !(0 == ~cond); {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,214 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#(<= ~counter~0 0)} assume true; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,214 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1270#(<= ~counter~0 0)} {1270#(<= ~counter~0 0)} #59#return; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,215 INFO L272 TraceCheckUtils]: 11: Hoare triple {1270#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#(<= ~counter~0 0)} ~cond := #in~cond; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,216 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#(<= ~counter~0 0)} assume !(0 == ~cond); {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,216 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#(<= ~counter~0 0)} assume true; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,217 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1270#(<= ~counter~0 0)} {1270#(<= ~counter~0 0)} #61#return; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,217 INFO L290 TraceCheckUtils]: 16: Hoare triple {1270#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1270#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:43,218 INFO L290 TraceCheckUtils]: 17: Hoare triple {1270#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1319#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:43,218 INFO L290 TraceCheckUtils]: 18: Hoare triple {1319#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1319#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:43,219 INFO L272 TraceCheckUtils]: 19: Hoare triple {1319#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1319#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:43,219 INFO L290 TraceCheckUtils]: 20: Hoare triple {1319#(<= ~counter~0 1)} ~cond := #in~cond; {1319#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:43,219 INFO L290 TraceCheckUtils]: 21: Hoare triple {1319#(<= ~counter~0 1)} assume !(0 == ~cond); {1319#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:43,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {1319#(<= ~counter~0 1)} assume true; {1319#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:43,220 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1319#(<= ~counter~0 1)} {1319#(<= ~counter~0 1)} #63#return; {1319#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:43,221 INFO L290 TraceCheckUtils]: 24: Hoare triple {1319#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1319#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:43,221 INFO L290 TraceCheckUtils]: 25: Hoare triple {1319#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1319#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:43,222 INFO L290 TraceCheckUtils]: 26: Hoare triple {1319#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1347#(<= |main_#t~post6| 1)} is VALID [2022-04-28 06:02:43,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {1347#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1263#false} is VALID [2022-04-28 06:02:43,222 INFO L272 TraceCheckUtils]: 28: Hoare triple {1263#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1263#false} is VALID [2022-04-28 06:02:43,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {1263#false} ~cond := #in~cond; {1263#false} is VALID [2022-04-28 06:02:43,223 INFO L290 TraceCheckUtils]: 30: Hoare triple {1263#false} assume 0 == ~cond; {1263#false} is VALID [2022-04-28 06:02:43,223 INFO L290 TraceCheckUtils]: 31: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-28 06:02:43,223 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:43,223 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:02:43,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-28 06:02:43,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {1263#false} assume 0 == ~cond; {1263#false} is VALID [2022-04-28 06:02:43,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {1263#false} ~cond := #in~cond; {1263#false} is VALID [2022-04-28 06:02:43,385 INFO L272 TraceCheckUtils]: 28: Hoare triple {1263#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1263#false} is VALID [2022-04-28 06:02:43,386 INFO L290 TraceCheckUtils]: 27: Hoare triple {1375#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1263#false} is VALID [2022-04-28 06:02:43,386 INFO L290 TraceCheckUtils]: 26: Hoare triple {1379#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1375#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:02:43,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {1379#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1379#(< ~counter~0 20)} is VALID [2022-04-28 06:02:43,387 INFO L290 TraceCheckUtils]: 24: Hoare triple {1379#(< ~counter~0 20)} assume !!(0 != ~r~0); {1379#(< ~counter~0 20)} is VALID [2022-04-28 06:02:43,388 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1262#true} {1379#(< ~counter~0 20)} #63#return; {1379#(< ~counter~0 20)} is VALID [2022-04-28 06:02:43,388 INFO L290 TraceCheckUtils]: 22: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-28 06:02:43,388 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-28 06:02:43,388 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-28 06:02:43,388 INFO L272 TraceCheckUtils]: 19: Hoare triple {1379#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1262#true} is VALID [2022-04-28 06:02:43,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {1379#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {1379#(< ~counter~0 20)} is VALID [2022-04-28 06:02:43,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {1407#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1379#(< ~counter~0 20)} is VALID [2022-04-28 06:02:43,390 INFO L290 TraceCheckUtils]: 16: Hoare triple {1407#(< ~counter~0 19)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1407#(< ~counter~0 19)} is VALID [2022-04-28 06:02:43,390 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1262#true} {1407#(< ~counter~0 19)} #61#return; {1407#(< ~counter~0 19)} is VALID [2022-04-28 06:02:43,390 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-28 06:02:43,391 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-28 06:02:43,392 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-28 06:02:43,392 INFO L272 TraceCheckUtils]: 11: Hoare triple {1407#(< ~counter~0 19)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1262#true} is VALID [2022-04-28 06:02:43,392 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1262#true} {1407#(< ~counter~0 19)} #59#return; {1407#(< ~counter~0 19)} is VALID [2022-04-28 06:02:43,392 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-28 06:02:43,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-28 06:02:43,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-28 06:02:43,393 INFO L272 TraceCheckUtils]: 6: Hoare triple {1407#(< ~counter~0 19)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1262#true} is VALID [2022-04-28 06:02:43,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {1407#(< ~counter~0 19)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1407#(< ~counter~0 19)} is VALID [2022-04-28 06:02:43,394 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#(< ~counter~0 19)} call #t~ret7 := main(); {1407#(< ~counter~0 19)} is VALID [2022-04-28 06:02:43,394 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#(< ~counter~0 19)} {1262#true} #67#return; {1407#(< ~counter~0 19)} is VALID [2022-04-28 06:02:43,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#(< ~counter~0 19)} assume true; {1407#(< ~counter~0 19)} is VALID [2022-04-28 06:02:43,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {1262#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; {1407#(< ~counter~0 19)} is VALID [2022-04-28 06:02:43,399 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-28 06:02:43,400 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:43,400 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503436808] [2022-04-28 06:02:43,400 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:43,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [294992510] [2022-04-28 06:02:43,400 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [294992510] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:02:43,400 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:02:43,400 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-28 06:02:43,401 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:43,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1831595016] [2022-04-28 06:02:43,401 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1831595016] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:43,401 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:43,401 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-28 06:02:43,401 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286260703] [2022-04-28 06:02:43,401 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:43,401 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 06:02:43,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:43,403 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 06:02:43,426 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-28 06:02:43,426 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-28 06:02:43,426 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:43,427 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-28 06:02:43,427 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-28 06:02:43,427 INFO L87 Difference]: Start difference. First operand 29 states and 31 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 06:02:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:43,548 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-28 06:02:43,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-28 06:02:43,549 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 32 [2022-04-28 06:02:43,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:43,549 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 06:02:43,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 06:02:43,553 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 06:02:43,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-28 06:02:43,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-28 06:02:43,587 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:43,590 INFO L225 Difference]: With dead ends: 43 [2022-04-28 06:02:43,590 INFO L226 Difference]: Without dead ends: 38 [2022-04-28 06:02:43,590 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 57 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-04-28 06:02:43,591 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:02:43,592 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 78 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:02:43,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-28 06:02:43,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-28 06:02:43,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:43,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:02:43,619 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:02:43,619 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:02:43,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:43,622 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 06:02:43,622 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 06:02:43,625 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:43,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:43,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 06:02:43,625 INFO L87 Difference]: Start difference. First operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Second operand 38 states. [2022-04-28 06:02:43,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:43,627 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-28 06:02:43,627 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 06:02:43,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:43,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:43,628 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:43,628 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 26 states have (on average 1.1153846153846154) internal successors, (29), 26 states have internal predecessors, (29), 7 states have call successors, (7), 6 states have call predecessors, (7), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2022-04-28 06:02:43,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-28 06:02:43,631 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-28 06:02:43,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:43,634 INFO L495 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-28 06:02:43,634 INFO L496 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, (6), 4 states have call predecessors, (6), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2022-04-28 06:02:43,634 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-28 06:02:45,697 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 40 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:45,698 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-28 06:02:45,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-28 06:02:45,698 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:45,699 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:45,724 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-28 06:02:45,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:45,900 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:45,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:45,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 3 times [2022-04-28 06:02:45,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:45,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2009140929] [2022-04-28 06:02:45,901 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:45,901 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 4 times [2022-04-28 06:02:45,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:45,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1853684070] [2022-04-28 06:02:45,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:45,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:45,917 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:45,918 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1355722525] [2022-04-28 06:02:45,918 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:02:45,918 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:45,918 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:45,921 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:45,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-28 06:02:45,987 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:02:45,987 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:45,988 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-28 06:02:45,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:46,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:46,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2022-04-28 06:02:46,216 INFO L290 TraceCheckUtils]: 1: Hoare triple {1701#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; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {1709#(<= ~counter~0 0)} assume true; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1709#(<= ~counter~0 0)} {1701#true} #67#return; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,218 INFO L272 TraceCheckUtils]: 4: Hoare triple {1709#(<= ~counter~0 0)} call #t~ret7 := main(); {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {1709#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,219 INFO L272 TraceCheckUtils]: 6: Hoare triple {1709#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {1709#(<= ~counter~0 0)} ~cond := #in~cond; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,224 INFO L290 TraceCheckUtils]: 8: Hoare triple {1709#(<= ~counter~0 0)} assume !(0 == ~cond); {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,224 INFO L290 TraceCheckUtils]: 9: Hoare triple {1709#(<= ~counter~0 0)} assume true; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,225 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1709#(<= ~counter~0 0)} {1709#(<= ~counter~0 0)} #59#return; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,226 INFO L272 TraceCheckUtils]: 11: Hoare triple {1709#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {1709#(<= ~counter~0 0)} ~cond := #in~cond; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {1709#(<= ~counter~0 0)} assume !(0 == ~cond); {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {1709#(<= ~counter~0 0)} assume true; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,227 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1709#(<= ~counter~0 0)} {1709#(<= ~counter~0 0)} #61#return; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,228 INFO L290 TraceCheckUtils]: 16: Hoare triple {1709#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1709#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:46,228 INFO L290 TraceCheckUtils]: 17: Hoare triple {1709#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1758#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:46,229 INFO L290 TraceCheckUtils]: 18: Hoare triple {1758#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {1758#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:46,230 INFO L272 TraceCheckUtils]: 19: Hoare triple {1758#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1758#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:46,230 INFO L290 TraceCheckUtils]: 20: Hoare triple {1758#(<= ~counter~0 1)} ~cond := #in~cond; {1758#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:46,230 INFO L290 TraceCheckUtils]: 21: Hoare triple {1758#(<= ~counter~0 1)} assume !(0 == ~cond); {1758#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:46,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {1758#(<= ~counter~0 1)} assume true; {1758#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:46,231 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1758#(<= ~counter~0 1)} {1758#(<= ~counter~0 1)} #63#return; {1758#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:46,232 INFO L290 TraceCheckUtils]: 24: Hoare triple {1758#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1758#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:46,232 INFO L290 TraceCheckUtils]: 25: Hoare triple {1758#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1758#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:46,233 INFO L290 TraceCheckUtils]: 26: Hoare triple {1758#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1786#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:46,233 INFO L290 TraceCheckUtils]: 27: Hoare triple {1786#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {1786#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:46,234 INFO L272 TraceCheckUtils]: 28: Hoare triple {1786#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1786#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:46,234 INFO L290 TraceCheckUtils]: 29: Hoare triple {1786#(<= ~counter~0 2)} ~cond := #in~cond; {1786#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:46,235 INFO L290 TraceCheckUtils]: 30: Hoare triple {1786#(<= ~counter~0 2)} assume !(0 == ~cond); {1786#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:46,235 INFO L290 TraceCheckUtils]: 31: Hoare triple {1786#(<= ~counter~0 2)} assume true; {1786#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:46,236 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1786#(<= ~counter~0 2)} {1786#(<= ~counter~0 2)} #63#return; {1786#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:46,236 INFO L290 TraceCheckUtils]: 33: Hoare triple {1786#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1786#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:46,236 INFO L290 TraceCheckUtils]: 34: Hoare triple {1786#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1786#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:46,237 INFO L290 TraceCheckUtils]: 35: Hoare triple {1786#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1814#(<= |main_#t~post6| 2)} is VALID [2022-04-28 06:02:46,237 INFO L290 TraceCheckUtils]: 36: Hoare triple {1814#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {1702#false} is VALID [2022-04-28 06:02:46,238 INFO L272 TraceCheckUtils]: 37: Hoare triple {1702#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1702#false} is VALID [2022-04-28 06:02:46,238 INFO L290 TraceCheckUtils]: 38: Hoare triple {1702#false} ~cond := #in~cond; {1702#false} is VALID [2022-04-28 06:02:46,238 INFO L290 TraceCheckUtils]: 39: Hoare triple {1702#false} assume 0 == ~cond; {1702#false} is VALID [2022-04-28 06:02:46,238 INFO L290 TraceCheckUtils]: 40: Hoare triple {1702#false} assume !false; {1702#false} is VALID [2022-04-28 06:02:46,240 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 13 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:46,240 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:02:46,521 INFO L290 TraceCheckUtils]: 40: Hoare triple {1702#false} assume !false; {1702#false} is VALID [2022-04-28 06:02:46,522 INFO L290 TraceCheckUtils]: 39: Hoare triple {1702#false} assume 0 == ~cond; {1702#false} is VALID [2022-04-28 06:02:46,522 INFO L290 TraceCheckUtils]: 38: Hoare triple {1702#false} ~cond := #in~cond; {1702#false} is VALID [2022-04-28 06:02:46,522 INFO L272 TraceCheckUtils]: 37: Hoare triple {1702#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1702#false} is VALID [2022-04-28 06:02:46,522 INFO L290 TraceCheckUtils]: 36: Hoare triple {1842#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1702#false} is VALID [2022-04-28 06:02:46,523 INFO L290 TraceCheckUtils]: 35: Hoare triple {1846#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1842#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:02:46,523 INFO L290 TraceCheckUtils]: 34: Hoare triple {1846#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1846#(< ~counter~0 20)} is VALID [2022-04-28 06:02:46,524 INFO L290 TraceCheckUtils]: 33: Hoare triple {1846#(< ~counter~0 20)} assume !!(0 != ~r~0); {1846#(< ~counter~0 20)} is VALID [2022-04-28 06:02:46,525 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1701#true} {1846#(< ~counter~0 20)} #63#return; {1846#(< ~counter~0 20)} is VALID [2022-04-28 06:02:46,525 INFO L290 TraceCheckUtils]: 31: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-28 06:02:46,525 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-28 06:02:46,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-28 06:02:46,525 INFO L272 TraceCheckUtils]: 28: Hoare triple {1846#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1701#true} is VALID [2022-04-28 06:02:46,526 INFO L290 TraceCheckUtils]: 27: Hoare triple {1846#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {1846#(< ~counter~0 20)} is VALID [2022-04-28 06:02:46,526 INFO L290 TraceCheckUtils]: 26: Hoare triple {1874#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1846#(< ~counter~0 20)} is VALID [2022-04-28 06:02:46,527 INFO L290 TraceCheckUtils]: 25: Hoare triple {1874#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {1874#(< ~counter~0 19)} is VALID [2022-04-28 06:02:46,527 INFO L290 TraceCheckUtils]: 24: Hoare triple {1874#(< ~counter~0 19)} assume !!(0 != ~r~0); {1874#(< ~counter~0 19)} is VALID [2022-04-28 06:02:46,528 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1701#true} {1874#(< ~counter~0 19)} #63#return; {1874#(< ~counter~0 19)} is VALID [2022-04-28 06:02:46,528 INFO L290 TraceCheckUtils]: 22: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-28 06:02:46,528 INFO L290 TraceCheckUtils]: 21: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-28 06:02:46,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-28 06:02:46,528 INFO L272 TraceCheckUtils]: 19: Hoare triple {1874#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {1701#true} is VALID [2022-04-28 06:02:46,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {1874#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {1874#(< ~counter~0 19)} is VALID [2022-04-28 06:02:46,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {1902#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1874#(< ~counter~0 19)} is VALID [2022-04-28 06:02:46,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {1902#(< ~counter~0 18)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1902#(< ~counter~0 18)} is VALID [2022-04-28 06:02:46,538 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1701#true} {1902#(< ~counter~0 18)} #61#return; {1902#(< ~counter~0 18)} is VALID [2022-04-28 06:02:46,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-28 06:02:46,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-28 06:02:46,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-28 06:02:46,539 INFO L272 TraceCheckUtils]: 11: Hoare triple {1902#(< ~counter~0 18)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {1701#true} is VALID [2022-04-28 06:02:46,540 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1701#true} {1902#(< ~counter~0 18)} #59#return; {1902#(< ~counter~0 18)} is VALID [2022-04-28 06:02:46,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-28 06:02:46,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-28 06:02:46,541 INFO L290 TraceCheckUtils]: 7: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-28 06:02:46,541 INFO L272 TraceCheckUtils]: 6: Hoare triple {1902#(< ~counter~0 18)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1701#true} is VALID [2022-04-28 06:02:46,541 INFO L290 TraceCheckUtils]: 5: Hoare triple {1902#(< ~counter~0 18)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {1902#(< ~counter~0 18)} is VALID [2022-04-28 06:02:46,541 INFO L272 TraceCheckUtils]: 4: Hoare triple {1902#(< ~counter~0 18)} call #t~ret7 := main(); {1902#(< ~counter~0 18)} is VALID [2022-04-28 06:02:46,542 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1902#(< ~counter~0 18)} {1701#true} #67#return; {1902#(< ~counter~0 18)} is VALID [2022-04-28 06:02:46,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {1902#(< ~counter~0 18)} assume true; {1902#(< ~counter~0 18)} is VALID [2022-04-28 06:02:46,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {1701#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; {1902#(< ~counter~0 18)} is VALID [2022-04-28 06:02:46,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2022-04-28 06:02:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-28 06:02:46,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1853684070] [2022-04-28 06:02:46,546 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:46,546 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1355722525] [2022-04-28 06:02:46,546 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1355722525] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:02:46,546 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:02:46,546 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-28 06:02:46,547 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:46,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2009140929] [2022-04-28 06:02:46,547 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2009140929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:46,547 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:46,547 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-28 06:02:46,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915995019] [2022-04-28 06:02:46,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:46,548 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, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 06:02:46,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:46,550 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, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 06:02:46,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:46,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-28 06:02:46,579 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:46,580 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-28 06:02:46,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-28 06:02:46,581 INFO L87 Difference]: Start difference. First operand 38 states and 41 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, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 06:02:46,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:46,737 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-28 06:02:46,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-28 06:02:46,737 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, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-28 06:02:46,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:46,738 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, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 06:02:46,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 06:02:46,739 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, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 06:02:46,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-28 06:02:46,741 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-28 06:02:46,789 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:46,790 INFO L225 Difference]: With dead ends: 52 [2022-04-28 06:02:46,791 INFO L226 Difference]: Without dead ends: 47 [2022-04-28 06:02:46,791 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-28 06:02:46,792 INFO L413 NwaCegarLoop]: 28 mSDtfsCounter, 8 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:02:46,793 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 92 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:02:46,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-28 06:02:46,839 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-28 06:02:46,839 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:46,839 INFO L82 GeneralOperation]: Start isEquivalent. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 06:02:46,839 INFO L74 IsIncluded]: Start isIncluded. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 06:02:46,840 INFO L87 Difference]: Start difference. First operand 47 states. Second operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 06:02:46,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:46,844 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 06:02:46,845 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 06:02:46,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:46,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:46,845 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 06:02:46,846 INFO L87 Difference]: Start difference. First operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 47 states. [2022-04-28 06:02:46,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:46,850 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-28 06:02:46,850 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 06:02:46,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:46,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:46,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:46,851 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:46,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 8 states have call successors, (8), 7 states have call predecessors, (8), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-28 06:02:46,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-28 06:02:46,853 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2022-04-28 06:02:46,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:46,854 INFO L495 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-28 06:02:46,854 INFO L496 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, (7), 5 states have call predecessors, (7), 3 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-28 06:02:46,854 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-28 06:02:48,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 50 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:48,929 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-28 06:02:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-28 06:02:48,929 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:48,930 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:48,947 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-28 06:02:49,131 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:49,132 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:49,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:49,132 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 5 times [2022-04-28 06:02:49,132 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:49,132 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1245783654] [2022-04-28 06:02:49,133 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:49,133 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 6 times [2022-04-28 06:02:49,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:49,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863504280] [2022-04-28 06:02:49,133 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:49,133 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:49,160 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:49,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1310938237] [2022-04-28 06:02:49,160 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:02:49,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:49,161 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:49,163 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:49,165 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-28 06:02:49,231 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-28 06:02:49,232 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:49,233 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-28 06:02:49,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:49,252 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:49,557 INFO L272 TraceCheckUtils]: 0: Hoare triple {2252#true} call ULTIMATE.init(); {2252#true} is VALID [2022-04-28 06:02:49,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {2252#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; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {2260#(<= ~counter~0 0)} assume true; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,558 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2260#(<= ~counter~0 0)} {2252#true} #67#return; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,559 INFO L272 TraceCheckUtils]: 4: Hoare triple {2260#(<= ~counter~0 0)} call #t~ret7 := main(); {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,559 INFO L290 TraceCheckUtils]: 5: Hoare triple {2260#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,560 INFO L272 TraceCheckUtils]: 6: Hoare triple {2260#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(<= ~counter~0 0)} ~cond := #in~cond; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(<= ~counter~0 0)} assume !(0 == ~cond); {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,561 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(<= ~counter~0 0)} assume true; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,563 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2260#(<= ~counter~0 0)} {2260#(<= ~counter~0 0)} #59#return; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,564 INFO L272 TraceCheckUtils]: 11: Hoare triple {2260#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,564 INFO L290 TraceCheckUtils]: 12: Hoare triple {2260#(<= ~counter~0 0)} ~cond := #in~cond; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,564 INFO L290 TraceCheckUtils]: 13: Hoare triple {2260#(<= ~counter~0 0)} assume !(0 == ~cond); {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,565 INFO L290 TraceCheckUtils]: 14: Hoare triple {2260#(<= ~counter~0 0)} assume true; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,565 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2260#(<= ~counter~0 0)} {2260#(<= ~counter~0 0)} #61#return; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,565 INFO L290 TraceCheckUtils]: 16: Hoare triple {2260#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2260#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:49,566 INFO L290 TraceCheckUtils]: 17: Hoare triple {2260#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2309#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:49,566 INFO L290 TraceCheckUtils]: 18: Hoare triple {2309#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2309#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:49,567 INFO L272 TraceCheckUtils]: 19: Hoare triple {2309#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2309#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:49,567 INFO L290 TraceCheckUtils]: 20: Hoare triple {2309#(<= ~counter~0 1)} ~cond := #in~cond; {2309#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:49,568 INFO L290 TraceCheckUtils]: 21: Hoare triple {2309#(<= ~counter~0 1)} assume !(0 == ~cond); {2309#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:49,568 INFO L290 TraceCheckUtils]: 22: Hoare triple {2309#(<= ~counter~0 1)} assume true; {2309#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:49,569 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2309#(<= ~counter~0 1)} {2309#(<= ~counter~0 1)} #63#return; {2309#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:49,570 INFO L290 TraceCheckUtils]: 24: Hoare triple {2309#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2309#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:49,570 INFO L290 TraceCheckUtils]: 25: Hoare triple {2309#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2309#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:49,571 INFO L290 TraceCheckUtils]: 26: Hoare triple {2309#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2337#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:49,571 INFO L290 TraceCheckUtils]: 27: Hoare triple {2337#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {2337#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:49,572 INFO L272 TraceCheckUtils]: 28: Hoare triple {2337#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2337#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:49,572 INFO L290 TraceCheckUtils]: 29: Hoare triple {2337#(<= ~counter~0 2)} ~cond := #in~cond; {2337#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:49,573 INFO L290 TraceCheckUtils]: 30: Hoare triple {2337#(<= ~counter~0 2)} assume !(0 == ~cond); {2337#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:49,573 INFO L290 TraceCheckUtils]: 31: Hoare triple {2337#(<= ~counter~0 2)} assume true; {2337#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:49,574 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2337#(<= ~counter~0 2)} {2337#(<= ~counter~0 2)} #63#return; {2337#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:49,574 INFO L290 TraceCheckUtils]: 33: Hoare triple {2337#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2337#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:49,575 INFO L290 TraceCheckUtils]: 34: Hoare triple {2337#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2337#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:49,575 INFO L290 TraceCheckUtils]: 35: Hoare triple {2337#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2365#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:49,576 INFO L290 TraceCheckUtils]: 36: Hoare triple {2365#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {2365#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:49,576 INFO L272 TraceCheckUtils]: 37: Hoare triple {2365#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2365#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:49,577 INFO L290 TraceCheckUtils]: 38: Hoare triple {2365#(<= ~counter~0 3)} ~cond := #in~cond; {2365#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:49,577 INFO L290 TraceCheckUtils]: 39: Hoare triple {2365#(<= ~counter~0 3)} assume !(0 == ~cond); {2365#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:49,578 INFO L290 TraceCheckUtils]: 40: Hoare triple {2365#(<= ~counter~0 3)} assume true; {2365#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:49,579 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2365#(<= ~counter~0 3)} {2365#(<= ~counter~0 3)} #63#return; {2365#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:49,579 INFO L290 TraceCheckUtils]: 42: Hoare triple {2365#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2365#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:49,579 INFO L290 TraceCheckUtils]: 43: Hoare triple {2365#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2365#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:49,580 INFO L290 TraceCheckUtils]: 44: Hoare triple {2365#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2393#(<= |main_#t~post6| 3)} is VALID [2022-04-28 06:02:49,580 INFO L290 TraceCheckUtils]: 45: Hoare triple {2393#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {2253#false} is VALID [2022-04-28 06:02:49,580 INFO L272 TraceCheckUtils]: 46: Hoare triple {2253#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2253#false} is VALID [2022-04-28 06:02:49,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {2253#false} ~cond := #in~cond; {2253#false} is VALID [2022-04-28 06:02:49,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {2253#false} assume 0 == ~cond; {2253#false} is VALID [2022-04-28 06:02:49,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {2253#false} assume !false; {2253#false} is VALID [2022-04-28 06:02:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:49,581 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:02:49,869 INFO L290 TraceCheckUtils]: 49: Hoare triple {2253#false} assume !false; {2253#false} is VALID [2022-04-28 06:02:49,870 INFO L290 TraceCheckUtils]: 48: Hoare triple {2253#false} assume 0 == ~cond; {2253#false} is VALID [2022-04-28 06:02:49,870 INFO L290 TraceCheckUtils]: 47: Hoare triple {2253#false} ~cond := #in~cond; {2253#false} is VALID [2022-04-28 06:02:49,870 INFO L272 TraceCheckUtils]: 46: Hoare triple {2253#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2253#false} is VALID [2022-04-28 06:02:49,870 INFO L290 TraceCheckUtils]: 45: Hoare triple {2421#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {2253#false} is VALID [2022-04-28 06:02:49,871 INFO L290 TraceCheckUtils]: 44: Hoare triple {2425#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2421#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:02:49,871 INFO L290 TraceCheckUtils]: 43: Hoare triple {2425#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2425#(< ~counter~0 20)} is VALID [2022-04-28 06:02:49,871 INFO L290 TraceCheckUtils]: 42: Hoare triple {2425#(< ~counter~0 20)} assume !!(0 != ~r~0); {2425#(< ~counter~0 20)} is VALID [2022-04-28 06:02:49,874 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2252#true} {2425#(< ~counter~0 20)} #63#return; {2425#(< ~counter~0 20)} is VALID [2022-04-28 06:02:49,874 INFO L290 TraceCheckUtils]: 40: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-28 06:02:49,874 INFO L290 TraceCheckUtils]: 39: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-28 06:02:49,874 INFO L290 TraceCheckUtils]: 38: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-28 06:02:49,874 INFO L272 TraceCheckUtils]: 37: Hoare triple {2425#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2252#true} is VALID [2022-04-28 06:02:49,874 INFO L290 TraceCheckUtils]: 36: Hoare triple {2425#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {2425#(< ~counter~0 20)} is VALID [2022-04-28 06:02:49,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {2453#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2425#(< ~counter~0 20)} is VALID [2022-04-28 06:02:49,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {2453#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2453#(< ~counter~0 19)} is VALID [2022-04-28 06:02:49,875 INFO L290 TraceCheckUtils]: 33: Hoare triple {2453#(< ~counter~0 19)} assume !!(0 != ~r~0); {2453#(< ~counter~0 19)} is VALID [2022-04-28 06:02:49,879 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2252#true} {2453#(< ~counter~0 19)} #63#return; {2453#(< ~counter~0 19)} is VALID [2022-04-28 06:02:49,879 INFO L290 TraceCheckUtils]: 31: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-28 06:02:49,879 INFO L290 TraceCheckUtils]: 30: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-28 06:02:49,880 INFO L290 TraceCheckUtils]: 29: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-28 06:02:49,880 INFO L272 TraceCheckUtils]: 28: Hoare triple {2453#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2252#true} is VALID [2022-04-28 06:02:49,880 INFO L290 TraceCheckUtils]: 27: Hoare triple {2453#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {2453#(< ~counter~0 19)} is VALID [2022-04-28 06:02:49,881 INFO L290 TraceCheckUtils]: 26: Hoare triple {2481#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2453#(< ~counter~0 19)} is VALID [2022-04-28 06:02:49,881 INFO L290 TraceCheckUtils]: 25: Hoare triple {2481#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2481#(< ~counter~0 18)} is VALID [2022-04-28 06:02:49,881 INFO L290 TraceCheckUtils]: 24: Hoare triple {2481#(< ~counter~0 18)} assume !!(0 != ~r~0); {2481#(< ~counter~0 18)} is VALID [2022-04-28 06:02:49,882 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2252#true} {2481#(< ~counter~0 18)} #63#return; {2481#(< ~counter~0 18)} is VALID [2022-04-28 06:02:49,882 INFO L290 TraceCheckUtils]: 22: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-28 06:02:49,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-28 06:02:49,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-28 06:02:49,883 INFO L272 TraceCheckUtils]: 19: Hoare triple {2481#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2252#true} is VALID [2022-04-28 06:02:49,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {2481#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {2481#(< ~counter~0 18)} is VALID [2022-04-28 06:02:49,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {2509#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2481#(< ~counter~0 18)} is VALID [2022-04-28 06:02:49,884 INFO L290 TraceCheckUtils]: 16: Hoare triple {2509#(< ~counter~0 17)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2509#(< ~counter~0 17)} is VALID [2022-04-28 06:02:49,884 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2252#true} {2509#(< ~counter~0 17)} #61#return; {2509#(< ~counter~0 17)} is VALID [2022-04-28 06:02:49,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-28 06:02:49,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-28 06:02:49,885 INFO L290 TraceCheckUtils]: 12: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-28 06:02:49,885 INFO L272 TraceCheckUtils]: 11: Hoare triple {2509#(< ~counter~0 17)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2252#true} is VALID [2022-04-28 06:02:49,885 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2252#true} {2509#(< ~counter~0 17)} #59#return; {2509#(< ~counter~0 17)} is VALID [2022-04-28 06:02:49,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-28 06:02:49,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-28 06:02:49,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-28 06:02:49,886 INFO L272 TraceCheckUtils]: 6: Hoare triple {2509#(< ~counter~0 17)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2252#true} is VALID [2022-04-28 06:02:49,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {2509#(< ~counter~0 17)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2509#(< ~counter~0 17)} is VALID [2022-04-28 06:02:49,886 INFO L272 TraceCheckUtils]: 4: Hoare triple {2509#(< ~counter~0 17)} call #t~ret7 := main(); {2509#(< ~counter~0 17)} is VALID [2022-04-28 06:02:49,887 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2509#(< ~counter~0 17)} {2252#true} #67#return; {2509#(< ~counter~0 17)} is VALID [2022-04-28 06:02:49,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {2509#(< ~counter~0 17)} assume true; {2509#(< ~counter~0 17)} is VALID [2022-04-28 06:02:49,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {2252#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; {2509#(< ~counter~0 17)} is VALID [2022-04-28 06:02:49,887 INFO L272 TraceCheckUtils]: 0: Hoare triple {2252#true} call ULTIMATE.init(); {2252#true} is VALID [2022-04-28 06:02:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 6 proven. 21 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-28 06:02:49,888 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863504280] [2022-04-28 06:02:49,888 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:49,888 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1310938237] [2022-04-28 06:02:49,888 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1310938237] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:02:49,888 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:02:49,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-28 06:02:49,889 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:49,889 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1245783654] [2022-04-28 06:02:49,889 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1245783654] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:49,889 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:49,889 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-28 06:02:49,889 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932401899] [2022-04-28 06:02:49,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:49,890 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 06:02:49,890 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:49,890 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:02:49,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:49,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-28 06:02:49,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:49,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-28 06:02:49,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-28 06:02:49,929 INFO L87 Difference]: Start difference. First operand 47 states and 51 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:02:50,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:50,112 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-28 06:02:50,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-28 06:02:50,113 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2022-04-28 06:02:50,113 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:50,113 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:02:50,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 06:02:50,115 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:02:50,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-28 06:02:50,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-28 06:02:50,172 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-28 06:02:50,173 INFO L225 Difference]: With dead ends: 61 [2022-04-28 06:02:50,173 INFO L226 Difference]: Without dead ends: 56 [2022-04-28 06:02:50,174 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 89 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-28 06:02:50,174 INFO L413 NwaCegarLoop]: 29 mSDtfsCounter, 9 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 106 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:02:50,174 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 106 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:02:50,175 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-28 06:02:50,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-28 06:02:50,226 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:50,226 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:02:50,226 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:02:50,226 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:02:50,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:50,228 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 06:02:50,228 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 06:02:50,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:50,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:50,229 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 06:02:50,229 INFO L87 Difference]: Start difference. First operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) Second operand 56 states. [2022-04-28 06:02:50,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:50,231 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-28 06:02:50,231 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 06:02:50,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:50,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:50,231 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:50,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:50,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 40 states have (on average 1.125) internal successors, (45), 40 states have internal predecessors, (45), 9 states have call successors, (9), 8 states have call predecessors, (9), 6 states have return successors, (7), 7 states have call predecessors, (7), 7 states have call successors, (7) [2022-04-28 06:02:50,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-28 06:02:50,234 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2022-04-28 06:02:50,234 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:50,234 INFO L495 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-28 06:02:50,234 INFO L496 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, (8), 6 states have call predecessors, (8), 4 states have return successors, (6), 4 states have call predecessors, (6), 5 states have call successors, (6) [2022-04-28 06:02:50,234 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-28 06:02:50,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:50,357 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-28 06:02:50,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-28 06:02:50,358 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:50,358 INFO L195 NwaCegarLoop]: trace histogram [5, 5, 4, 4, 4, 4, 4, 4, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:50,375 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-28 06:02:50,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:50,559 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:50,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:50,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 7 times [2022-04-28 06:02:50,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:50,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [332264309] [2022-04-28 06:02:50,560 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:50,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 8 times [2022-04-28 06:02:50,560 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:50,560 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814565068] [2022-04-28 06:02:50,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:50,560 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:50,574 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:50,574 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744800149] [2022-04-28 06:02:50,574 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:02:50,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:50,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:50,576 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:50,599 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-28 06:02:50,641 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:02:50,641 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:50,642 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-28 06:02:50,655 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:50,660 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:50,943 INFO L272 TraceCheckUtils]: 0: Hoare triple {2915#true} call ULTIMATE.init(); {2915#true} is VALID [2022-04-28 06:02:50,943 INFO L290 TraceCheckUtils]: 1: Hoare triple {2915#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; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {2923#(<= ~counter~0 0)} assume true; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,944 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2923#(<= ~counter~0 0)} {2915#true} #67#return; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,945 INFO L272 TraceCheckUtils]: 4: Hoare triple {2923#(<= ~counter~0 0)} call #t~ret7 := main(); {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {2923#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,947 INFO L272 TraceCheckUtils]: 6: Hoare triple {2923#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,949 INFO L290 TraceCheckUtils]: 7: Hoare triple {2923#(<= ~counter~0 0)} ~cond := #in~cond; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,955 INFO L290 TraceCheckUtils]: 8: Hoare triple {2923#(<= ~counter~0 0)} assume !(0 == ~cond); {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {2923#(<= ~counter~0 0)} assume true; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2923#(<= ~counter~0 0)} {2923#(<= ~counter~0 0)} #59#return; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,957 INFO L272 TraceCheckUtils]: 11: Hoare triple {2923#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {2923#(<= ~counter~0 0)} ~cond := #in~cond; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {2923#(<= ~counter~0 0)} assume !(0 == ~cond); {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {2923#(<= ~counter~0 0)} assume true; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,958 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2923#(<= ~counter~0 0)} {2923#(<= ~counter~0 0)} #61#return; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {2923#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2923#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:50,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {2923#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2972#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:50,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {2972#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {2972#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:50,960 INFO L272 TraceCheckUtils]: 19: Hoare triple {2972#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2972#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:50,961 INFO L290 TraceCheckUtils]: 20: Hoare triple {2972#(<= ~counter~0 1)} ~cond := #in~cond; {2972#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:50,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {2972#(<= ~counter~0 1)} assume !(0 == ~cond); {2972#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:50,961 INFO L290 TraceCheckUtils]: 22: Hoare triple {2972#(<= ~counter~0 1)} assume true; {2972#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:50,962 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2972#(<= ~counter~0 1)} {2972#(<= ~counter~0 1)} #63#return; {2972#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:50,962 INFO L290 TraceCheckUtils]: 24: Hoare triple {2972#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2972#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:50,963 INFO L290 TraceCheckUtils]: 25: Hoare triple {2972#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2972#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:50,963 INFO L290 TraceCheckUtils]: 26: Hoare triple {2972#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3000#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:50,963 INFO L290 TraceCheckUtils]: 27: Hoare triple {3000#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {3000#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:50,964 INFO L272 TraceCheckUtils]: 28: Hoare triple {3000#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3000#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:50,964 INFO L290 TraceCheckUtils]: 29: Hoare triple {3000#(<= ~counter~0 2)} ~cond := #in~cond; {3000#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:50,965 INFO L290 TraceCheckUtils]: 30: Hoare triple {3000#(<= ~counter~0 2)} assume !(0 == ~cond); {3000#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:50,965 INFO L290 TraceCheckUtils]: 31: Hoare triple {3000#(<= ~counter~0 2)} assume true; {3000#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:50,966 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3000#(<= ~counter~0 2)} {3000#(<= ~counter~0 2)} #63#return; {3000#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:50,966 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3000#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:50,966 INFO L290 TraceCheckUtils]: 34: Hoare triple {3000#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3000#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:50,967 INFO L290 TraceCheckUtils]: 35: Hoare triple {3000#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3028#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:50,967 INFO L290 TraceCheckUtils]: 36: Hoare triple {3028#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {3028#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:50,968 INFO L272 TraceCheckUtils]: 37: Hoare triple {3028#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3028#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:50,968 INFO L290 TraceCheckUtils]: 38: Hoare triple {3028#(<= ~counter~0 3)} ~cond := #in~cond; {3028#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:50,968 INFO L290 TraceCheckUtils]: 39: Hoare triple {3028#(<= ~counter~0 3)} assume !(0 == ~cond); {3028#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:50,969 INFO L290 TraceCheckUtils]: 40: Hoare triple {3028#(<= ~counter~0 3)} assume true; {3028#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:50,969 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3028#(<= ~counter~0 3)} {3028#(<= ~counter~0 3)} #63#return; {3028#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:50,970 INFO L290 TraceCheckUtils]: 42: Hoare triple {3028#(<= ~counter~0 3)} assume !!(0 != ~r~0); {3028#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:50,970 INFO L290 TraceCheckUtils]: 43: Hoare triple {3028#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3028#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:50,971 INFO L290 TraceCheckUtils]: 44: Hoare triple {3028#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3056#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:50,971 INFO L290 TraceCheckUtils]: 45: Hoare triple {3056#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {3056#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:50,972 INFO L272 TraceCheckUtils]: 46: Hoare triple {3056#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3056#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:50,972 INFO L290 TraceCheckUtils]: 47: Hoare triple {3056#(<= ~counter~0 4)} ~cond := #in~cond; {3056#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:50,972 INFO L290 TraceCheckUtils]: 48: Hoare triple {3056#(<= ~counter~0 4)} assume !(0 == ~cond); {3056#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:50,973 INFO L290 TraceCheckUtils]: 49: Hoare triple {3056#(<= ~counter~0 4)} assume true; {3056#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:50,973 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3056#(<= ~counter~0 4)} {3056#(<= ~counter~0 4)} #63#return; {3056#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:50,973 INFO L290 TraceCheckUtils]: 51: Hoare triple {3056#(<= ~counter~0 4)} assume !!(0 != ~r~0); {3056#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:50,974 INFO L290 TraceCheckUtils]: 52: Hoare triple {3056#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3056#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:50,974 INFO L290 TraceCheckUtils]: 53: Hoare triple {3056#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3084#(<= |main_#t~post6| 4)} is VALID [2022-04-28 06:02:50,975 INFO L290 TraceCheckUtils]: 54: Hoare triple {3084#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {2916#false} is VALID [2022-04-28 06:02:50,975 INFO L272 TraceCheckUtils]: 55: Hoare triple {2916#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2916#false} is VALID [2022-04-28 06:02:50,975 INFO L290 TraceCheckUtils]: 56: Hoare triple {2916#false} ~cond := #in~cond; {2916#false} is VALID [2022-04-28 06:02:50,975 INFO L290 TraceCheckUtils]: 57: Hoare triple {2916#false} assume 0 == ~cond; {2916#false} is VALID [2022-04-28 06:02:50,975 INFO L290 TraceCheckUtils]: 58: Hoare triple {2916#false} assume !false; {2916#false} is VALID [2022-04-28 06:02:50,975 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 62 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:50,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:02:51,307 INFO L290 TraceCheckUtils]: 58: Hoare triple {2916#false} assume !false; {2916#false} is VALID [2022-04-28 06:02:51,308 INFO L290 TraceCheckUtils]: 57: Hoare triple {2916#false} assume 0 == ~cond; {2916#false} is VALID [2022-04-28 06:02:51,308 INFO L290 TraceCheckUtils]: 56: Hoare triple {2916#false} ~cond := #in~cond; {2916#false} is VALID [2022-04-28 06:02:51,308 INFO L272 TraceCheckUtils]: 55: Hoare triple {2916#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2916#false} is VALID [2022-04-28 06:02:51,308 INFO L290 TraceCheckUtils]: 54: Hoare triple {3112#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {2916#false} is VALID [2022-04-28 06:02:51,309 INFO L290 TraceCheckUtils]: 53: Hoare triple {3116#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3112#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:02:51,309 INFO L290 TraceCheckUtils]: 52: Hoare triple {3116#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3116#(< ~counter~0 20)} is VALID [2022-04-28 06:02:51,309 INFO L290 TraceCheckUtils]: 51: Hoare triple {3116#(< ~counter~0 20)} assume !!(0 != ~r~0); {3116#(< ~counter~0 20)} is VALID [2022-04-28 06:02:51,310 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2915#true} {3116#(< ~counter~0 20)} #63#return; {3116#(< ~counter~0 20)} is VALID [2022-04-28 06:02:51,310 INFO L290 TraceCheckUtils]: 49: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-28 06:02:51,310 INFO L290 TraceCheckUtils]: 48: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-28 06:02:51,310 INFO L290 TraceCheckUtils]: 47: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-28 06:02:51,311 INFO L272 TraceCheckUtils]: 46: Hoare triple {3116#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2915#true} is VALID [2022-04-28 06:02:51,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {3116#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {3116#(< ~counter~0 20)} is VALID [2022-04-28 06:02:51,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {3144#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3116#(< ~counter~0 20)} is VALID [2022-04-28 06:02:51,312 INFO L290 TraceCheckUtils]: 43: Hoare triple {3144#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3144#(< ~counter~0 19)} is VALID [2022-04-28 06:02:51,312 INFO L290 TraceCheckUtils]: 42: Hoare triple {3144#(< ~counter~0 19)} assume !!(0 != ~r~0); {3144#(< ~counter~0 19)} is VALID [2022-04-28 06:02:51,313 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2915#true} {3144#(< ~counter~0 19)} #63#return; {3144#(< ~counter~0 19)} is VALID [2022-04-28 06:02:51,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-28 06:02:51,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-28 06:02:51,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-28 06:02:51,313 INFO L272 TraceCheckUtils]: 37: Hoare triple {3144#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2915#true} is VALID [2022-04-28 06:02:51,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {3144#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {3144#(< ~counter~0 19)} is VALID [2022-04-28 06:02:51,314 INFO L290 TraceCheckUtils]: 35: Hoare triple {3172#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3144#(< ~counter~0 19)} is VALID [2022-04-28 06:02:51,314 INFO L290 TraceCheckUtils]: 34: Hoare triple {3172#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3172#(< ~counter~0 18)} is VALID [2022-04-28 06:02:51,314 INFO L290 TraceCheckUtils]: 33: Hoare triple {3172#(< ~counter~0 18)} assume !!(0 != ~r~0); {3172#(< ~counter~0 18)} is VALID [2022-04-28 06:02:51,315 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2915#true} {3172#(< ~counter~0 18)} #63#return; {3172#(< ~counter~0 18)} is VALID [2022-04-28 06:02:51,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-28 06:02:51,315 INFO L290 TraceCheckUtils]: 30: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-28 06:02:51,315 INFO L290 TraceCheckUtils]: 29: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-28 06:02:51,315 INFO L272 TraceCheckUtils]: 28: Hoare triple {3172#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2915#true} is VALID [2022-04-28 06:02:51,316 INFO L290 TraceCheckUtils]: 27: Hoare triple {3172#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {3172#(< ~counter~0 18)} is VALID [2022-04-28 06:02:51,316 INFO L290 TraceCheckUtils]: 26: Hoare triple {3200#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3172#(< ~counter~0 18)} is VALID [2022-04-28 06:02:51,316 INFO L290 TraceCheckUtils]: 25: Hoare triple {3200#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3200#(< ~counter~0 17)} is VALID [2022-04-28 06:02:51,317 INFO L290 TraceCheckUtils]: 24: Hoare triple {3200#(< ~counter~0 17)} assume !!(0 != ~r~0); {3200#(< ~counter~0 17)} is VALID [2022-04-28 06:02:51,317 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2915#true} {3200#(< ~counter~0 17)} #63#return; {3200#(< ~counter~0 17)} is VALID [2022-04-28 06:02:51,318 INFO L290 TraceCheckUtils]: 22: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-28 06:02:51,318 INFO L290 TraceCheckUtils]: 21: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-28 06:02:51,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-28 06:02:51,318 INFO L272 TraceCheckUtils]: 19: Hoare triple {3200#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2915#true} is VALID [2022-04-28 06:02:51,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {3200#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {3200#(< ~counter~0 17)} is VALID [2022-04-28 06:02:51,319 INFO L290 TraceCheckUtils]: 17: Hoare triple {3228#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3200#(< ~counter~0 17)} is VALID [2022-04-28 06:02:51,319 INFO L290 TraceCheckUtils]: 16: Hoare triple {3228#(< ~counter~0 16)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3228#(< ~counter~0 16)} is VALID [2022-04-28 06:02:51,319 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2915#true} {3228#(< ~counter~0 16)} #61#return; {3228#(< ~counter~0 16)} is VALID [2022-04-28 06:02:51,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-28 06:02:51,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-28 06:02:51,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-28 06:02:51,320 INFO L272 TraceCheckUtils]: 11: Hoare triple {3228#(< ~counter~0 16)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {2915#true} is VALID [2022-04-28 06:02:51,320 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2915#true} {3228#(< ~counter~0 16)} #59#return; {3228#(< ~counter~0 16)} is VALID [2022-04-28 06:02:51,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-28 06:02:51,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-28 06:02:51,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-28 06:02:51,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {3228#(< ~counter~0 16)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2915#true} is VALID [2022-04-28 06:02:51,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {3228#(< ~counter~0 16)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3228#(< ~counter~0 16)} is VALID [2022-04-28 06:02:51,321 INFO L272 TraceCheckUtils]: 4: Hoare triple {3228#(< ~counter~0 16)} call #t~ret7 := main(); {3228#(< ~counter~0 16)} is VALID [2022-04-28 06:02:51,322 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3228#(< ~counter~0 16)} {2915#true} #67#return; {3228#(< ~counter~0 16)} is VALID [2022-04-28 06:02:51,322 INFO L290 TraceCheckUtils]: 2: Hoare triple {3228#(< ~counter~0 16)} assume true; {3228#(< ~counter~0 16)} is VALID [2022-04-28 06:02:51,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {2915#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; {3228#(< ~counter~0 16)} is VALID [2022-04-28 06:02:51,323 INFO L272 TraceCheckUtils]: 0: Hoare triple {2915#true} call ULTIMATE.init(); {2915#true} is VALID [2022-04-28 06:02:51,323 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 8 proven. 38 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-28 06:02:51,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:51,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814565068] [2022-04-28 06:02:51,323 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:51,323 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [744800149] [2022-04-28 06:02:51,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [744800149] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:02:51,324 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:02:51,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-28 06:02:51,324 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:51,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [332264309] [2022-04-28 06:02:51,324 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [332264309] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:51,324 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:51,324 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-28 06:02:51,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1487903340] [2022-04-28 06:02:51,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:51,325 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, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 06:02:51,325 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:51,325 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, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 06:02:51,366 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:51,366 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-28 06:02:51,366 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:51,366 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-28 06:02:51,367 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-28 06:02:51,367 INFO L87 Difference]: Start difference. First operand 56 states and 61 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, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 06:02:51,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:51,608 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-28 06:02:51,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-28 06:02:51,608 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, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) Word has length 59 [2022-04-28 06:02:51,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:51,609 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, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 06:02:51,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 06:02:51,611 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, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 06:02:51,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-28 06:02:51,613 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-28 06:02:51,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:51,679 INFO L225 Difference]: With dead ends: 70 [2022-04-28 06:02:51,679 INFO L226 Difference]: Without dead ends: 65 [2022-04-28 06:02:51,680 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:02:51,680 INFO L413 NwaCegarLoop]: 30 mSDtfsCounter, 25 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:02:51,681 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 108 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:02:51,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-28 06:02:51,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-28 06:02:51,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:51,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:02:51,745 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:02:51,746 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:02:51,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:51,748 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 06:02:51,748 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 06:02:51,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:51,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:51,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 06:02:51,749 INFO L87 Difference]: Start difference. First operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) Second operand 65 states. [2022-04-28 06:02:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:51,750 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-28 06:02:51,751 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 06:02:51,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:51,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:51,751 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:51,751 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:51,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 47 states have (on average 1.127659574468085) internal successors, (53), 47 states have internal predecessors, (53), 10 states have call successors, (10), 9 states have call predecessors, (10), 7 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-28 06:02:51,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-28 06:02:51,753 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-28 06:02:51,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:51,753 INFO L495 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-28 06:02:51,754 INFO L496 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, (9), 7 states have call predecessors, (9), 5 states have return successors, (7), 5 states have call predecessors, (7), 6 states have call successors, (7) [2022-04-28 06:02:51,754 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 71 transitions. [2022-04-28 06:02:53,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:53,580 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-28 06:02:53,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-28 06:02:53,581 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:53,581 INFO L195 NwaCegarLoop]: trace histogram [6, 6, 5, 5, 5, 5, 5, 5, 5, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:53,597 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-28 06:02:53,781 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-28 06:02:53,782 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:53,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:53,782 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 9 times [2022-04-28 06:02:53,782 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:53,782 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [412468271] [2022-04-28 06:02:53,783 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:53,783 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 10 times [2022-04-28 06:02:53,783 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:53,783 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931366544] [2022-04-28 06:02:53,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:53,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:53,811 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:53,811 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1210778266] [2022-04-28 06:02:53,811 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:02:53,811 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:53,811 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:53,813 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:53,814 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-28 06:02:53,983 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:02:53,983 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:53,984 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-28 06:02:53,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:53,999 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:54,381 INFO L272 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2022-04-28 06:02:54,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {3690#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; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,382 INFO L290 TraceCheckUtils]: 2: Hoare triple {3698#(<= ~counter~0 0)} assume true; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3698#(<= ~counter~0 0)} {3690#true} #67#return; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {3698#(<= ~counter~0 0)} call #t~ret7 := main(); {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,383 INFO L290 TraceCheckUtils]: 5: Hoare triple {3698#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {3698#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {3698#(<= ~counter~0 0)} ~cond := #in~cond; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {3698#(<= ~counter~0 0)} assume !(0 == ~cond); {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {3698#(<= ~counter~0 0)} assume true; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,384 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3698#(<= ~counter~0 0)} {3698#(<= ~counter~0 0)} #59#return; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,385 INFO L272 TraceCheckUtils]: 11: Hoare triple {3698#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {3698#(<= ~counter~0 0)} ~cond := #in~cond; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {3698#(<= ~counter~0 0)} assume !(0 == ~cond); {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,386 INFO L290 TraceCheckUtils]: 14: Hoare triple {3698#(<= ~counter~0 0)} assume true; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,386 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3698#(<= ~counter~0 0)} {3698#(<= ~counter~0 0)} #61#return; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,386 INFO L290 TraceCheckUtils]: 16: Hoare triple {3698#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3698#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:54,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {3698#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3747#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:54,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {3747#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {3747#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:54,390 INFO L272 TraceCheckUtils]: 19: Hoare triple {3747#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3747#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:54,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {3747#(<= ~counter~0 1)} ~cond := #in~cond; {3747#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:54,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {3747#(<= ~counter~0 1)} assume !(0 == ~cond); {3747#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:54,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {3747#(<= ~counter~0 1)} assume true; {3747#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:54,391 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3747#(<= ~counter~0 1)} {3747#(<= ~counter~0 1)} #63#return; {3747#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:54,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {3747#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3747#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:54,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {3747#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3747#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:54,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {3747#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3775#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:54,393 INFO L290 TraceCheckUtils]: 27: Hoare triple {3775#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {3775#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:54,393 INFO L272 TraceCheckUtils]: 28: Hoare triple {3775#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3775#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:54,394 INFO L290 TraceCheckUtils]: 29: Hoare triple {3775#(<= ~counter~0 2)} ~cond := #in~cond; {3775#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:54,394 INFO L290 TraceCheckUtils]: 30: Hoare triple {3775#(<= ~counter~0 2)} assume !(0 == ~cond); {3775#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:54,394 INFO L290 TraceCheckUtils]: 31: Hoare triple {3775#(<= ~counter~0 2)} assume true; {3775#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:54,395 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3775#(<= ~counter~0 2)} {3775#(<= ~counter~0 2)} #63#return; {3775#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:54,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {3775#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3775#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:54,395 INFO L290 TraceCheckUtils]: 34: Hoare triple {3775#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3775#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:54,396 INFO L290 TraceCheckUtils]: 35: Hoare triple {3775#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3803#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:54,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {3803#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {3803#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:54,396 INFO L272 TraceCheckUtils]: 37: Hoare triple {3803#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3803#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:54,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {3803#(<= ~counter~0 3)} ~cond := #in~cond; {3803#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:54,397 INFO L290 TraceCheckUtils]: 39: Hoare triple {3803#(<= ~counter~0 3)} assume !(0 == ~cond); {3803#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:54,397 INFO L290 TraceCheckUtils]: 40: Hoare triple {3803#(<= ~counter~0 3)} assume true; {3803#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:54,398 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3803#(<= ~counter~0 3)} {3803#(<= ~counter~0 3)} #63#return; {3803#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:54,398 INFO L290 TraceCheckUtils]: 42: Hoare triple {3803#(<= ~counter~0 3)} assume !!(0 != ~r~0); {3803#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:54,398 INFO L290 TraceCheckUtils]: 43: Hoare triple {3803#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3803#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:54,399 INFO L290 TraceCheckUtils]: 44: Hoare triple {3803#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3831#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:54,399 INFO L290 TraceCheckUtils]: 45: Hoare triple {3831#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {3831#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:54,400 INFO L272 TraceCheckUtils]: 46: Hoare triple {3831#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3831#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:54,400 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#(<= ~counter~0 4)} ~cond := #in~cond; {3831#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:54,400 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#(<= ~counter~0 4)} assume !(0 == ~cond); {3831#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:54,400 INFO L290 TraceCheckUtils]: 49: Hoare triple {3831#(<= ~counter~0 4)} assume true; {3831#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:54,401 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3831#(<= ~counter~0 4)} {3831#(<= ~counter~0 4)} #63#return; {3831#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:54,401 INFO L290 TraceCheckUtils]: 51: Hoare triple {3831#(<= ~counter~0 4)} assume !!(0 != ~r~0); {3831#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:54,402 INFO L290 TraceCheckUtils]: 52: Hoare triple {3831#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3831#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:54,402 INFO L290 TraceCheckUtils]: 53: Hoare triple {3831#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3859#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:54,402 INFO L290 TraceCheckUtils]: 54: Hoare triple {3859#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {3859#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:54,403 INFO L272 TraceCheckUtils]: 55: Hoare triple {3859#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3859#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:54,403 INFO L290 TraceCheckUtils]: 56: Hoare triple {3859#(<= ~counter~0 5)} ~cond := #in~cond; {3859#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:54,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {3859#(<= ~counter~0 5)} assume !(0 == ~cond); {3859#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:54,404 INFO L290 TraceCheckUtils]: 58: Hoare triple {3859#(<= ~counter~0 5)} assume true; {3859#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:54,404 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3859#(<= ~counter~0 5)} {3859#(<= ~counter~0 5)} #63#return; {3859#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:54,405 INFO L290 TraceCheckUtils]: 60: Hoare triple {3859#(<= ~counter~0 5)} assume !!(0 != ~r~0); {3859#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:54,405 INFO L290 TraceCheckUtils]: 61: Hoare triple {3859#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3859#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:54,405 INFO L290 TraceCheckUtils]: 62: Hoare triple {3859#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3887#(<= |main_#t~post6| 5)} is VALID [2022-04-28 06:02:54,406 INFO L290 TraceCheckUtils]: 63: Hoare triple {3887#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {3691#false} is VALID [2022-04-28 06:02:54,406 INFO L272 TraceCheckUtils]: 64: Hoare triple {3691#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3691#false} is VALID [2022-04-28 06:02:54,406 INFO L290 TraceCheckUtils]: 65: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2022-04-28 06:02:54,406 INFO L290 TraceCheckUtils]: 66: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2022-04-28 06:02:54,406 INFO L290 TraceCheckUtils]: 67: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2022-04-28 06:02:54,406 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 100 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:54,406 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:02:54,804 INFO L290 TraceCheckUtils]: 67: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2022-04-28 06:02:54,804 INFO L290 TraceCheckUtils]: 66: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2022-04-28 06:02:54,804 INFO L290 TraceCheckUtils]: 65: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2022-04-28 06:02:54,804 INFO L272 TraceCheckUtils]: 64: Hoare triple {3691#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3691#false} is VALID [2022-04-28 06:02:54,804 INFO L290 TraceCheckUtils]: 63: Hoare triple {3915#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3691#false} is VALID [2022-04-28 06:02:54,805 INFO L290 TraceCheckUtils]: 62: Hoare triple {3919#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3915#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:02:54,805 INFO L290 TraceCheckUtils]: 61: Hoare triple {3919#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3919#(< ~counter~0 20)} is VALID [2022-04-28 06:02:54,805 INFO L290 TraceCheckUtils]: 60: Hoare triple {3919#(< ~counter~0 20)} assume !!(0 != ~r~0); {3919#(< ~counter~0 20)} is VALID [2022-04-28 06:02:54,806 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3690#true} {3919#(< ~counter~0 20)} #63#return; {3919#(< ~counter~0 20)} is VALID [2022-04-28 06:02:54,806 INFO L290 TraceCheckUtils]: 58: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-28 06:02:54,806 INFO L290 TraceCheckUtils]: 57: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-28 06:02:54,806 INFO L290 TraceCheckUtils]: 56: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-28 06:02:54,806 INFO L272 TraceCheckUtils]: 55: Hoare triple {3919#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3690#true} is VALID [2022-04-28 06:02:54,810 INFO L290 TraceCheckUtils]: 54: Hoare triple {3919#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {3919#(< ~counter~0 20)} is VALID [2022-04-28 06:02:54,810 INFO L290 TraceCheckUtils]: 53: Hoare triple {3947#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3919#(< ~counter~0 20)} is VALID [2022-04-28 06:02:54,811 INFO L290 TraceCheckUtils]: 52: Hoare triple {3947#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3947#(< ~counter~0 19)} is VALID [2022-04-28 06:02:54,811 INFO L290 TraceCheckUtils]: 51: Hoare triple {3947#(< ~counter~0 19)} assume !!(0 != ~r~0); {3947#(< ~counter~0 19)} is VALID [2022-04-28 06:02:54,811 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3690#true} {3947#(< ~counter~0 19)} #63#return; {3947#(< ~counter~0 19)} is VALID [2022-04-28 06:02:54,811 INFO L290 TraceCheckUtils]: 49: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-28 06:02:54,812 INFO L290 TraceCheckUtils]: 48: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-28 06:02:54,812 INFO L290 TraceCheckUtils]: 47: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-28 06:02:54,812 INFO L272 TraceCheckUtils]: 46: Hoare triple {3947#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3690#true} is VALID [2022-04-28 06:02:54,812 INFO L290 TraceCheckUtils]: 45: Hoare triple {3947#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {3947#(< ~counter~0 19)} is VALID [2022-04-28 06:02:54,812 INFO L290 TraceCheckUtils]: 44: Hoare triple {3975#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3947#(< ~counter~0 19)} is VALID [2022-04-28 06:02:54,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {3975#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3975#(< ~counter~0 18)} is VALID [2022-04-28 06:02:54,813 INFO L290 TraceCheckUtils]: 42: Hoare triple {3975#(< ~counter~0 18)} assume !!(0 != ~r~0); {3975#(< ~counter~0 18)} is VALID [2022-04-28 06:02:54,813 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3690#true} {3975#(< ~counter~0 18)} #63#return; {3975#(< ~counter~0 18)} is VALID [2022-04-28 06:02:54,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-28 06:02:54,814 INFO L290 TraceCheckUtils]: 39: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-28 06:02:54,814 INFO L290 TraceCheckUtils]: 38: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-28 06:02:54,814 INFO L272 TraceCheckUtils]: 37: Hoare triple {3975#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3690#true} is VALID [2022-04-28 06:02:54,814 INFO L290 TraceCheckUtils]: 36: Hoare triple {3975#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {3975#(< ~counter~0 18)} is VALID [2022-04-28 06:02:54,820 INFO L290 TraceCheckUtils]: 35: Hoare triple {4003#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3975#(< ~counter~0 18)} is VALID [2022-04-28 06:02:54,820 INFO L290 TraceCheckUtils]: 34: Hoare triple {4003#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4003#(< ~counter~0 17)} is VALID [2022-04-28 06:02:54,820 INFO L290 TraceCheckUtils]: 33: Hoare triple {4003#(< ~counter~0 17)} assume !!(0 != ~r~0); {4003#(< ~counter~0 17)} is VALID [2022-04-28 06:02:54,821 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3690#true} {4003#(< ~counter~0 17)} #63#return; {4003#(< ~counter~0 17)} is VALID [2022-04-28 06:02:54,821 INFO L290 TraceCheckUtils]: 31: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-28 06:02:54,821 INFO L290 TraceCheckUtils]: 30: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-28 06:02:54,821 INFO L290 TraceCheckUtils]: 29: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-28 06:02:54,821 INFO L272 TraceCheckUtils]: 28: Hoare triple {4003#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3690#true} is VALID [2022-04-28 06:02:54,822 INFO L290 TraceCheckUtils]: 27: Hoare triple {4003#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {4003#(< ~counter~0 17)} is VALID [2022-04-28 06:02:54,822 INFO L290 TraceCheckUtils]: 26: Hoare triple {4031#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4003#(< ~counter~0 17)} is VALID [2022-04-28 06:02:54,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {4031#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4031#(< ~counter~0 16)} is VALID [2022-04-28 06:02:54,823 INFO L290 TraceCheckUtils]: 24: Hoare triple {4031#(< ~counter~0 16)} assume !!(0 != ~r~0); {4031#(< ~counter~0 16)} is VALID [2022-04-28 06:02:54,824 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3690#true} {4031#(< ~counter~0 16)} #63#return; {4031#(< ~counter~0 16)} is VALID [2022-04-28 06:02:54,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-28 06:02:54,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-28 06:02:54,824 INFO L290 TraceCheckUtils]: 20: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-28 06:02:54,824 INFO L272 TraceCheckUtils]: 19: Hoare triple {4031#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3690#true} is VALID [2022-04-28 06:02:54,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {4031#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {4031#(< ~counter~0 16)} is VALID [2022-04-28 06:02:54,825 INFO L290 TraceCheckUtils]: 17: Hoare triple {4059#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4031#(< ~counter~0 16)} is VALID [2022-04-28 06:02:54,825 INFO L290 TraceCheckUtils]: 16: Hoare triple {4059#(< ~counter~0 15)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4059#(< ~counter~0 15)} is VALID [2022-04-28 06:02:54,825 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3690#true} {4059#(< ~counter~0 15)} #61#return; {4059#(< ~counter~0 15)} is VALID [2022-04-28 06:02:54,825 INFO L290 TraceCheckUtils]: 14: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-28 06:02:54,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-28 06:02:54,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-28 06:02:54,826 INFO L272 TraceCheckUtils]: 11: Hoare triple {4059#(< ~counter~0 15)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {3690#true} is VALID [2022-04-28 06:02:54,826 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3690#true} {4059#(< ~counter~0 15)} #59#return; {4059#(< ~counter~0 15)} is VALID [2022-04-28 06:02:54,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-28 06:02:54,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-28 06:02:54,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-28 06:02:54,826 INFO L272 TraceCheckUtils]: 6: Hoare triple {4059#(< ~counter~0 15)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3690#true} is VALID [2022-04-28 06:02:54,827 INFO L290 TraceCheckUtils]: 5: Hoare triple {4059#(< ~counter~0 15)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4059#(< ~counter~0 15)} is VALID [2022-04-28 06:02:54,827 INFO L272 TraceCheckUtils]: 4: Hoare triple {4059#(< ~counter~0 15)} call #t~ret7 := main(); {4059#(< ~counter~0 15)} is VALID [2022-04-28 06:02:54,827 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4059#(< ~counter~0 15)} {3690#true} #67#return; {4059#(< ~counter~0 15)} is VALID [2022-04-28 06:02:54,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {4059#(< ~counter~0 15)} assume true; {4059#(< ~counter~0 15)} is VALID [2022-04-28 06:02:54,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {3690#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; {4059#(< ~counter~0 15)} is VALID [2022-04-28 06:02:54,828 INFO L272 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2022-04-28 06:02:54,829 INFO L134 CoverageAnalysis]: Checked inductivity of 114 backedges. 10 proven. 60 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-28 06:02:54,829 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:54,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931366544] [2022-04-28 06:02:54,829 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:54,829 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1210778266] [2022-04-28 06:02:54,829 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1210778266] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:02:54,829 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:02:54,829 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-28 06:02:54,829 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:54,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [412468271] [2022-04-28 06:02:54,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [412468271] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:54,830 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:54,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-28 06:02:54,830 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775147660] [2022-04-28 06:02:54,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:54,831 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, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-04-28 06:02:54,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:54,832 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, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 06:02:54,882 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-28 06:02:54,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-28 06:02:54,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:54,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-28 06:02:54,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-28 06:02:54,883 INFO L87 Difference]: Start difference. First operand 65 states and 71 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, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 06:02:55,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:55,136 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-04-28 06:02:55,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-28 06:02:55,136 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, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) Word has length 68 [2022-04-28 06:02:55,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:55,137 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, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 06:02:55,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 06:02:55,139 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, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 06:02:55,141 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-28 06:02:55,141 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 85 transitions. [2022-04-28 06:02:55,226 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-28 06:02:55,227 INFO L225 Difference]: With dead ends: 79 [2022-04-28 06:02:55,227 INFO L226 Difference]: Without dead ends: 74 [2022-04-28 06:02:55,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 121 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-28 06:02:55,228 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 13 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:02:55,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 116 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:02:55,229 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-28 06:02:55,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-28 06:02:55,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:55,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 06:02:55,307 INFO L74 IsIncluded]: Start isIncluded. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 06:02:55,307 INFO L87 Difference]: Start difference. First operand 74 states. Second operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 06:02:55,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:55,309 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-28 06:02:55,309 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 06:02:55,310 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:55,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:55,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 06:02:55,310 INFO L87 Difference]: Start difference. First operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 74 states. [2022-04-28 06:02:55,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:55,312 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-28 06:02:55,312 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 06:02:55,312 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:55,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:55,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:55,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:55,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 54 states have (on average 1.1296296296296295) internal successors, (61), 54 states have internal predecessors, (61), 11 states have call successors, (11), 10 states have call predecessors, (11), 8 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-28 06:02:55,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-04-28 06:02:55,315 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 68 [2022-04-28 06:02:55,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:55,315 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-04-28 06:02:55,316 INFO L496 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, (10), 8 states have call predecessors, (10), 6 states have return successors, (8), 6 states have call predecessors, (8), 7 states have call successors, (8) [2022-04-28 06:02:55,316 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 81 transitions. [2022-04-28 06:02:55,945 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:55,945 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-28 06:02:55,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-28 06:02:55,946 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:55,946 INFO L195 NwaCegarLoop]: trace histogram [7, 7, 6, 6, 6, 6, 6, 6, 6, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:55,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-28 06:02:56,147 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:56,147 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:56,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:56,148 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 11 times [2022-04-28 06:02:56,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:56,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [960526548] [2022-04-28 06:02:56,148 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:56,149 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 12 times [2022-04-28 06:02:56,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:56,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196327982] [2022-04-28 06:02:56,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:56,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:56,168 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:56,168 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [283755683] [2022-04-28 06:02:56,168 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:02:56,168 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:56,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:56,170 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:56,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-28 06:02:56,310 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-28 06:02:56,310 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:56,311 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-28 06:02:56,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:56,328 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:02:56,694 INFO L272 TraceCheckUtils]: 0: Hoare triple {4577#true} call ULTIMATE.init(); {4577#true} is VALID [2022-04-28 06:02:56,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {4577#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; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {4585#(<= ~counter~0 0)} assume true; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,696 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4585#(<= ~counter~0 0)} {4577#true} #67#return; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,696 INFO L272 TraceCheckUtils]: 4: Hoare triple {4585#(<= ~counter~0 0)} call #t~ret7 := main(); {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {4585#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,697 INFO L272 TraceCheckUtils]: 6: Hoare triple {4585#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,697 INFO L290 TraceCheckUtils]: 7: Hoare triple {4585#(<= ~counter~0 0)} ~cond := #in~cond; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {4585#(<= ~counter~0 0)} assume !(0 == ~cond); {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,698 INFO L290 TraceCheckUtils]: 9: Hoare triple {4585#(<= ~counter~0 0)} assume true; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,699 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4585#(<= ~counter~0 0)} {4585#(<= ~counter~0 0)} #59#return; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,699 INFO L272 TraceCheckUtils]: 11: Hoare triple {4585#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {4585#(<= ~counter~0 0)} ~cond := #in~cond; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {4585#(<= ~counter~0 0)} assume !(0 == ~cond); {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {4585#(<= ~counter~0 0)} assume true; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,700 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4585#(<= ~counter~0 0)} {4585#(<= ~counter~0 0)} #61#return; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,701 INFO L290 TraceCheckUtils]: 16: Hoare triple {4585#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4585#(<= ~counter~0 0)} is VALID [2022-04-28 06:02:56,701 INFO L290 TraceCheckUtils]: 17: Hoare triple {4585#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4634#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:56,701 INFO L290 TraceCheckUtils]: 18: Hoare triple {4634#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {4634#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:56,702 INFO L272 TraceCheckUtils]: 19: Hoare triple {4634#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4634#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:56,702 INFO L290 TraceCheckUtils]: 20: Hoare triple {4634#(<= ~counter~0 1)} ~cond := #in~cond; {4634#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:56,702 INFO L290 TraceCheckUtils]: 21: Hoare triple {4634#(<= ~counter~0 1)} assume !(0 == ~cond); {4634#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:56,703 INFO L290 TraceCheckUtils]: 22: Hoare triple {4634#(<= ~counter~0 1)} assume true; {4634#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:56,704 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4634#(<= ~counter~0 1)} {4634#(<= ~counter~0 1)} #63#return; {4634#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:56,704 INFO L290 TraceCheckUtils]: 24: Hoare triple {4634#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4634#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:56,705 INFO L290 TraceCheckUtils]: 25: Hoare triple {4634#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4634#(<= ~counter~0 1)} is VALID [2022-04-28 06:02:56,705 INFO L290 TraceCheckUtils]: 26: Hoare triple {4634#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4662#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:56,705 INFO L290 TraceCheckUtils]: 27: Hoare triple {4662#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {4662#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:56,706 INFO L272 TraceCheckUtils]: 28: Hoare triple {4662#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4662#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:56,706 INFO L290 TraceCheckUtils]: 29: Hoare triple {4662#(<= ~counter~0 2)} ~cond := #in~cond; {4662#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:56,706 INFO L290 TraceCheckUtils]: 30: Hoare triple {4662#(<= ~counter~0 2)} assume !(0 == ~cond); {4662#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:56,707 INFO L290 TraceCheckUtils]: 31: Hoare triple {4662#(<= ~counter~0 2)} assume true; {4662#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:56,707 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4662#(<= ~counter~0 2)} {4662#(<= ~counter~0 2)} #63#return; {4662#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:56,708 INFO L290 TraceCheckUtils]: 33: Hoare triple {4662#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4662#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:56,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {4662#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4662#(<= ~counter~0 2)} is VALID [2022-04-28 06:02:56,710 INFO L290 TraceCheckUtils]: 35: Hoare triple {4662#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4690#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:56,710 INFO L290 TraceCheckUtils]: 36: Hoare triple {4690#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {4690#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:56,711 INFO L272 TraceCheckUtils]: 37: Hoare triple {4690#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4690#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:56,711 INFO L290 TraceCheckUtils]: 38: Hoare triple {4690#(<= ~counter~0 3)} ~cond := #in~cond; {4690#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:56,712 INFO L290 TraceCheckUtils]: 39: Hoare triple {4690#(<= ~counter~0 3)} assume !(0 == ~cond); {4690#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:56,712 INFO L290 TraceCheckUtils]: 40: Hoare triple {4690#(<= ~counter~0 3)} assume true; {4690#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:56,712 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4690#(<= ~counter~0 3)} {4690#(<= ~counter~0 3)} #63#return; {4690#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:56,713 INFO L290 TraceCheckUtils]: 42: Hoare triple {4690#(<= ~counter~0 3)} assume !!(0 != ~r~0); {4690#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:56,713 INFO L290 TraceCheckUtils]: 43: Hoare triple {4690#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4690#(<= ~counter~0 3)} is VALID [2022-04-28 06:02:56,713 INFO L290 TraceCheckUtils]: 44: Hoare triple {4690#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4718#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:56,714 INFO L290 TraceCheckUtils]: 45: Hoare triple {4718#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {4718#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:56,714 INFO L272 TraceCheckUtils]: 46: Hoare triple {4718#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4718#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:56,714 INFO L290 TraceCheckUtils]: 47: Hoare triple {4718#(<= ~counter~0 4)} ~cond := #in~cond; {4718#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:56,715 INFO L290 TraceCheckUtils]: 48: Hoare triple {4718#(<= ~counter~0 4)} assume !(0 == ~cond); {4718#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:56,715 INFO L290 TraceCheckUtils]: 49: Hoare triple {4718#(<= ~counter~0 4)} assume true; {4718#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:56,716 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4718#(<= ~counter~0 4)} {4718#(<= ~counter~0 4)} #63#return; {4718#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:56,716 INFO L290 TraceCheckUtils]: 51: Hoare triple {4718#(<= ~counter~0 4)} assume !!(0 != ~r~0); {4718#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:56,716 INFO L290 TraceCheckUtils]: 52: Hoare triple {4718#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4718#(<= ~counter~0 4)} is VALID [2022-04-28 06:02:56,717 INFO L290 TraceCheckUtils]: 53: Hoare triple {4718#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4746#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:56,717 INFO L290 TraceCheckUtils]: 54: Hoare triple {4746#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {4746#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:56,717 INFO L272 TraceCheckUtils]: 55: Hoare triple {4746#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4746#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:56,718 INFO L290 TraceCheckUtils]: 56: Hoare triple {4746#(<= ~counter~0 5)} ~cond := #in~cond; {4746#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:56,718 INFO L290 TraceCheckUtils]: 57: Hoare triple {4746#(<= ~counter~0 5)} assume !(0 == ~cond); {4746#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:56,718 INFO L290 TraceCheckUtils]: 58: Hoare triple {4746#(<= ~counter~0 5)} assume true; {4746#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:56,719 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4746#(<= ~counter~0 5)} {4746#(<= ~counter~0 5)} #63#return; {4746#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:56,719 INFO L290 TraceCheckUtils]: 60: Hoare triple {4746#(<= ~counter~0 5)} assume !!(0 != ~r~0); {4746#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:56,719 INFO L290 TraceCheckUtils]: 61: Hoare triple {4746#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4746#(<= ~counter~0 5)} is VALID [2022-04-28 06:02:56,720 INFO L290 TraceCheckUtils]: 62: Hoare triple {4746#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4774#(<= ~counter~0 6)} is VALID [2022-04-28 06:02:56,720 INFO L290 TraceCheckUtils]: 63: Hoare triple {4774#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {4774#(<= ~counter~0 6)} is VALID [2022-04-28 06:02:56,721 INFO L272 TraceCheckUtils]: 64: Hoare triple {4774#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4774#(<= ~counter~0 6)} is VALID [2022-04-28 06:02:56,721 INFO L290 TraceCheckUtils]: 65: Hoare triple {4774#(<= ~counter~0 6)} ~cond := #in~cond; {4774#(<= ~counter~0 6)} is VALID [2022-04-28 06:02:56,721 INFO L290 TraceCheckUtils]: 66: Hoare triple {4774#(<= ~counter~0 6)} assume !(0 == ~cond); {4774#(<= ~counter~0 6)} is VALID [2022-04-28 06:02:56,722 INFO L290 TraceCheckUtils]: 67: Hoare triple {4774#(<= ~counter~0 6)} assume true; {4774#(<= ~counter~0 6)} is VALID [2022-04-28 06:02:56,722 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4774#(<= ~counter~0 6)} {4774#(<= ~counter~0 6)} #63#return; {4774#(<= ~counter~0 6)} is VALID [2022-04-28 06:02:56,722 INFO L290 TraceCheckUtils]: 69: Hoare triple {4774#(<= ~counter~0 6)} assume !!(0 != ~r~0); {4774#(<= ~counter~0 6)} is VALID [2022-04-28 06:02:56,723 INFO L290 TraceCheckUtils]: 70: Hoare triple {4774#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4774#(<= ~counter~0 6)} is VALID [2022-04-28 06:02:56,723 INFO L290 TraceCheckUtils]: 71: Hoare triple {4774#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4802#(<= |main_#t~post6| 6)} is VALID [2022-04-28 06:02:56,723 INFO L290 TraceCheckUtils]: 72: Hoare triple {4802#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {4578#false} is VALID [2022-04-28 06:02:56,723 INFO L272 TraceCheckUtils]: 73: Hoare triple {4578#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4578#false} is VALID [2022-04-28 06:02:56,724 INFO L290 TraceCheckUtils]: 74: Hoare triple {4578#false} ~cond := #in~cond; {4578#false} is VALID [2022-04-28 06:02:56,724 INFO L290 TraceCheckUtils]: 75: Hoare triple {4578#false} assume 0 == ~cond; {4578#false} is VALID [2022-04-28 06:02:56,724 INFO L290 TraceCheckUtils]: 76: Hoare triple {4578#false} assume !false; {4578#false} is VALID [2022-04-28 06:02:56,724 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 147 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:02:56,724 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:02:57,187 INFO L290 TraceCheckUtils]: 76: Hoare triple {4578#false} assume !false; {4578#false} is VALID [2022-04-28 06:02:57,187 INFO L290 TraceCheckUtils]: 75: Hoare triple {4578#false} assume 0 == ~cond; {4578#false} is VALID [2022-04-28 06:02:57,187 INFO L290 TraceCheckUtils]: 74: Hoare triple {4578#false} ~cond := #in~cond; {4578#false} is VALID [2022-04-28 06:02:57,188 INFO L272 TraceCheckUtils]: 73: Hoare triple {4578#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4578#false} is VALID [2022-04-28 06:02:57,188 INFO L290 TraceCheckUtils]: 72: Hoare triple {4830#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {4578#false} is VALID [2022-04-28 06:02:57,188 INFO L290 TraceCheckUtils]: 71: Hoare triple {4834#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4830#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:02:57,188 INFO L290 TraceCheckUtils]: 70: Hoare triple {4834#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4834#(< ~counter~0 20)} is VALID [2022-04-28 06:02:57,189 INFO L290 TraceCheckUtils]: 69: Hoare triple {4834#(< ~counter~0 20)} assume !!(0 != ~r~0); {4834#(< ~counter~0 20)} is VALID [2022-04-28 06:02:57,189 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4577#true} {4834#(< ~counter~0 20)} #63#return; {4834#(< ~counter~0 20)} is VALID [2022-04-28 06:02:57,189 INFO L290 TraceCheckUtils]: 67: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-28 06:02:57,189 INFO L290 TraceCheckUtils]: 66: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-28 06:02:57,190 INFO L290 TraceCheckUtils]: 65: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-28 06:02:57,190 INFO L272 TraceCheckUtils]: 64: Hoare triple {4834#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4577#true} is VALID [2022-04-28 06:02:57,190 INFO L290 TraceCheckUtils]: 63: Hoare triple {4834#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {4834#(< ~counter~0 20)} is VALID [2022-04-28 06:02:57,190 INFO L290 TraceCheckUtils]: 62: Hoare triple {4862#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4834#(< ~counter~0 20)} is VALID [2022-04-28 06:02:57,191 INFO L290 TraceCheckUtils]: 61: Hoare triple {4862#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4862#(< ~counter~0 19)} is VALID [2022-04-28 06:02:57,191 INFO L290 TraceCheckUtils]: 60: Hoare triple {4862#(< ~counter~0 19)} assume !!(0 != ~r~0); {4862#(< ~counter~0 19)} is VALID [2022-04-28 06:02:57,191 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4577#true} {4862#(< ~counter~0 19)} #63#return; {4862#(< ~counter~0 19)} is VALID [2022-04-28 06:02:57,192 INFO L290 TraceCheckUtils]: 58: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-28 06:02:57,192 INFO L290 TraceCheckUtils]: 57: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-28 06:02:57,192 INFO L290 TraceCheckUtils]: 56: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-28 06:02:57,192 INFO L272 TraceCheckUtils]: 55: Hoare triple {4862#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4577#true} is VALID [2022-04-28 06:02:57,192 INFO L290 TraceCheckUtils]: 54: Hoare triple {4862#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {4862#(< ~counter~0 19)} is VALID [2022-04-28 06:02:57,192 INFO L290 TraceCheckUtils]: 53: Hoare triple {4890#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4862#(< ~counter~0 19)} is VALID [2022-04-28 06:02:57,193 INFO L290 TraceCheckUtils]: 52: Hoare triple {4890#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4890#(< ~counter~0 18)} is VALID [2022-04-28 06:02:57,193 INFO L290 TraceCheckUtils]: 51: Hoare triple {4890#(< ~counter~0 18)} assume !!(0 != ~r~0); {4890#(< ~counter~0 18)} is VALID [2022-04-28 06:02:57,194 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4577#true} {4890#(< ~counter~0 18)} #63#return; {4890#(< ~counter~0 18)} is VALID [2022-04-28 06:02:57,194 INFO L290 TraceCheckUtils]: 49: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-28 06:02:57,194 INFO L290 TraceCheckUtils]: 48: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-28 06:02:57,194 INFO L290 TraceCheckUtils]: 47: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-28 06:02:57,194 INFO L272 TraceCheckUtils]: 46: Hoare triple {4890#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4577#true} is VALID [2022-04-28 06:02:57,194 INFO L290 TraceCheckUtils]: 45: Hoare triple {4890#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {4890#(< ~counter~0 18)} is VALID [2022-04-28 06:02:57,195 INFO L290 TraceCheckUtils]: 44: Hoare triple {4918#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4890#(< ~counter~0 18)} is VALID [2022-04-28 06:02:57,195 INFO L290 TraceCheckUtils]: 43: Hoare triple {4918#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4918#(< ~counter~0 17)} is VALID [2022-04-28 06:02:57,195 INFO L290 TraceCheckUtils]: 42: Hoare triple {4918#(< ~counter~0 17)} assume !!(0 != ~r~0); {4918#(< ~counter~0 17)} is VALID [2022-04-28 06:02:57,196 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4577#true} {4918#(< ~counter~0 17)} #63#return; {4918#(< ~counter~0 17)} is VALID [2022-04-28 06:02:57,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-28 06:02:57,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-28 06:02:57,196 INFO L290 TraceCheckUtils]: 38: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-28 06:02:57,196 INFO L272 TraceCheckUtils]: 37: Hoare triple {4918#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4577#true} is VALID [2022-04-28 06:02:57,196 INFO L290 TraceCheckUtils]: 36: Hoare triple {4918#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {4918#(< ~counter~0 17)} is VALID [2022-04-28 06:02:57,197 INFO L290 TraceCheckUtils]: 35: Hoare triple {4946#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4918#(< ~counter~0 17)} is VALID [2022-04-28 06:02:57,197 INFO L290 TraceCheckUtils]: 34: Hoare triple {4946#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4946#(< ~counter~0 16)} is VALID [2022-04-28 06:02:57,197 INFO L290 TraceCheckUtils]: 33: Hoare triple {4946#(< ~counter~0 16)} assume !!(0 != ~r~0); {4946#(< ~counter~0 16)} is VALID [2022-04-28 06:02:57,198 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4577#true} {4946#(< ~counter~0 16)} #63#return; {4946#(< ~counter~0 16)} is VALID [2022-04-28 06:02:57,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-28 06:02:57,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-28 06:02:57,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-28 06:02:57,198 INFO L272 TraceCheckUtils]: 28: Hoare triple {4946#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4577#true} is VALID [2022-04-28 06:02:57,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {4946#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {4946#(< ~counter~0 16)} is VALID [2022-04-28 06:02:57,199 INFO L290 TraceCheckUtils]: 26: Hoare triple {4974#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4946#(< ~counter~0 16)} is VALID [2022-04-28 06:02:57,199 INFO L290 TraceCheckUtils]: 25: Hoare triple {4974#(< ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {4974#(< ~counter~0 15)} is VALID [2022-04-28 06:02:57,199 INFO L290 TraceCheckUtils]: 24: Hoare triple {4974#(< ~counter~0 15)} assume !!(0 != ~r~0); {4974#(< ~counter~0 15)} is VALID [2022-04-28 06:02:57,200 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4577#true} {4974#(< ~counter~0 15)} #63#return; {4974#(< ~counter~0 15)} is VALID [2022-04-28 06:02:57,200 INFO L290 TraceCheckUtils]: 22: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-28 06:02:57,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-28 06:02:57,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-28 06:02:57,200 INFO L272 TraceCheckUtils]: 19: Hoare triple {4974#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4577#true} is VALID [2022-04-28 06:02:57,200 INFO L290 TraceCheckUtils]: 18: Hoare triple {4974#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {4974#(< ~counter~0 15)} is VALID [2022-04-28 06:02:57,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {5002#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4974#(< ~counter~0 15)} is VALID [2022-04-28 06:02:57,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {5002#(< ~counter~0 14)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5002#(< ~counter~0 14)} is VALID [2022-04-28 06:02:57,201 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4577#true} {5002#(< ~counter~0 14)} #61#return; {5002#(< ~counter~0 14)} is VALID [2022-04-28 06:02:57,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-28 06:02:57,202 INFO L290 TraceCheckUtils]: 13: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-28 06:02:57,202 INFO L290 TraceCheckUtils]: 12: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-28 06:02:57,202 INFO L272 TraceCheckUtils]: 11: Hoare triple {5002#(< ~counter~0 14)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {4577#true} is VALID [2022-04-28 06:02:57,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4577#true} {5002#(< ~counter~0 14)} #59#return; {5002#(< ~counter~0 14)} is VALID [2022-04-28 06:02:57,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-28 06:02:57,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-28 06:02:57,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-28 06:02:57,203 INFO L272 TraceCheckUtils]: 6: Hoare triple {5002#(< ~counter~0 14)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4577#true} is VALID [2022-04-28 06:02:57,203 INFO L290 TraceCheckUtils]: 5: Hoare triple {5002#(< ~counter~0 14)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5002#(< ~counter~0 14)} is VALID [2022-04-28 06:02:57,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {5002#(< ~counter~0 14)} call #t~ret7 := main(); {5002#(< ~counter~0 14)} is VALID [2022-04-28 06:02:57,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5002#(< ~counter~0 14)} {4577#true} #67#return; {5002#(< ~counter~0 14)} is VALID [2022-04-28 06:02:57,204 INFO L290 TraceCheckUtils]: 2: Hoare triple {5002#(< ~counter~0 14)} assume true; {5002#(< ~counter~0 14)} is VALID [2022-04-28 06:02:57,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {4577#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; {5002#(< ~counter~0 14)} is VALID [2022-04-28 06:02:57,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {4577#true} call ULTIMATE.init(); {4577#true} is VALID [2022-04-28 06:02:57,205 INFO L134 CoverageAnalysis]: Checked inductivity of 163 backedges. 12 proven. 87 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-28 06:02:57,205 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:02:57,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196327982] [2022-04-28 06:02:57,205 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:02:57,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [283755683] [2022-04-28 06:02:57,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [283755683] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:02:57,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:02:57,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-28 06:02:57,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:02:57,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [960526548] [2022-04-28 06:02:57,206 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [960526548] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:02:57,206 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:02:57,206 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-28 06:02:57,206 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650728704] [2022-04-28 06:02:57,206 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:02:57,206 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, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 77 [2022-04-28 06:02:57,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:02:57,207 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, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 06:02:57,271 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:57,271 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-28 06:02:57,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:57,272 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-28 06:02:57,272 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-28 06:02:57,272 INFO L87 Difference]: Start difference. First operand 74 states and 81 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, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 06:02:57,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:57,563 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-04-28 06:02:57,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-28 06:02:57,563 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, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) Word has length 77 [2022-04-28 06:02:57,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:02:57,564 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, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 06:02:57,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-28 06:02:57,566 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, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 06:02:57,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-28 06:02:57,568 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 95 transitions. [2022-04-28 06:02:57,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:57,649 INFO L225 Difference]: With dead ends: 88 [2022-04-28 06:02:57,649 INFO L226 Difference]: Without dead ends: 83 [2022-04-28 06:02:57,649 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:02:57,650 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 21 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:02:57,650 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 130 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:02:57,650 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-28 06:02:57,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-28 06:02:57,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:02:57,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 06:02:57,740 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 06:02:57,741 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 06:02:57,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:57,743 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 06:02:57,743 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 06:02:57,743 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:57,743 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:57,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-04-28 06:02:57,744 INFO L87 Difference]: Start difference. First operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 83 states. [2022-04-28 06:02:57,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:02:57,746 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-28 06:02:57,746 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 06:02:57,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:02:57,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:02:57,747 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:02:57,747 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:02:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 61 states have (on average 1.1311475409836065) internal successors, (69), 61 states have internal predecessors, (69), 12 states have call successors, (12), 11 states have call predecessors, (12), 9 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-28 06:02:57,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-04-28 06:02:57,749 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 77 [2022-04-28 06:02:57,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:02:57,749 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-04-28 06:02:57,749 INFO L496 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, (11), 9 states have call predecessors, (11), 7 states have return successors, (9), 7 states have call predecessors, (9), 8 states have call successors, (9) [2022-04-28 06:02:57,749 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 91 transitions. [2022-04-28 06:02:59,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:02:59,385 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-28 06:02:59,385 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-28 06:02:59,386 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:02:59,386 INFO L195 NwaCegarLoop]: trace histogram [8, 8, 7, 7, 7, 7, 7, 7, 7, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:02:59,392 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-04-28 06:02:59,590 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-28 06:02:59,591 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:02:59,591 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:02:59,591 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 13 times [2022-04-28 06:02:59,591 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:02:59,591 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1117750163] [2022-04-28 06:02:59,591 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:02:59,592 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 14 times [2022-04-28 06:02:59,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:02:59,592 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275404723] [2022-04-28 06:02:59,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:02:59,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:02:59,604 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:02:59,605 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [335974039] [2022-04-28 06:02:59,605 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:02:59,605 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:02:59,605 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:02:59,606 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:02:59,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-28 06:02:59,669 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:02:59,670 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:02:59,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-28 06:02:59,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:02:59,692 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:00,179 INFO L272 TraceCheckUtils]: 0: Hoare triple {5576#true} call ULTIMATE.init(); {5576#true} is VALID [2022-04-28 06:03:00,179 INFO L290 TraceCheckUtils]: 1: Hoare triple {5576#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; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,180 INFO L290 TraceCheckUtils]: 2: Hoare triple {5584#(<= ~counter~0 0)} assume true; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,180 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5584#(<= ~counter~0 0)} {5576#true} #67#return; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,180 INFO L272 TraceCheckUtils]: 4: Hoare triple {5584#(<= ~counter~0 0)} call #t~ret7 := main(); {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,181 INFO L290 TraceCheckUtils]: 5: Hoare triple {5584#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,181 INFO L272 TraceCheckUtils]: 6: Hoare triple {5584#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,181 INFO L290 TraceCheckUtils]: 7: Hoare triple {5584#(<= ~counter~0 0)} ~cond := #in~cond; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,182 INFO L290 TraceCheckUtils]: 8: Hoare triple {5584#(<= ~counter~0 0)} assume !(0 == ~cond); {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {5584#(<= ~counter~0 0)} assume true; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,182 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5584#(<= ~counter~0 0)} {5584#(<= ~counter~0 0)} #59#return; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,183 INFO L272 TraceCheckUtils]: 11: Hoare triple {5584#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {5584#(<= ~counter~0 0)} ~cond := #in~cond; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {5584#(<= ~counter~0 0)} assume !(0 == ~cond); {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,184 INFO L290 TraceCheckUtils]: 14: Hoare triple {5584#(<= ~counter~0 0)} assume true; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,184 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5584#(<= ~counter~0 0)} {5584#(<= ~counter~0 0)} #61#return; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,184 INFO L290 TraceCheckUtils]: 16: Hoare triple {5584#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5584#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:00,185 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5633#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:00,185 INFO L290 TraceCheckUtils]: 18: Hoare triple {5633#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {5633#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:00,186 INFO L272 TraceCheckUtils]: 19: Hoare triple {5633#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5633#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:00,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {5633#(<= ~counter~0 1)} ~cond := #in~cond; {5633#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:00,186 INFO L290 TraceCheckUtils]: 21: Hoare triple {5633#(<= ~counter~0 1)} assume !(0 == ~cond); {5633#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:00,186 INFO L290 TraceCheckUtils]: 22: Hoare triple {5633#(<= ~counter~0 1)} assume true; {5633#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:00,187 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5633#(<= ~counter~0 1)} {5633#(<= ~counter~0 1)} #63#return; {5633#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:00,187 INFO L290 TraceCheckUtils]: 24: Hoare triple {5633#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5633#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:00,187 INFO L290 TraceCheckUtils]: 25: Hoare triple {5633#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5633#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:00,188 INFO L290 TraceCheckUtils]: 26: Hoare triple {5633#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:00,188 INFO L290 TraceCheckUtils]: 27: Hoare triple {5661#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:00,189 INFO L272 TraceCheckUtils]: 28: Hoare triple {5661#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:00,192 INFO L290 TraceCheckUtils]: 29: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:00,192 INFO L290 TraceCheckUtils]: 30: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:00,193 INFO L290 TraceCheckUtils]: 31: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:00,193 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #63#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:00,194 INFO L290 TraceCheckUtils]: 33: Hoare triple {5661#(<= ~counter~0 2)} assume !!(0 != ~r~0); {5661#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:00,194 INFO L290 TraceCheckUtils]: 34: Hoare triple {5661#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5661#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:00,194 INFO L290 TraceCheckUtils]: 35: Hoare triple {5661#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:00,195 INFO L290 TraceCheckUtils]: 36: Hoare triple {5689#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:00,195 INFO L272 TraceCheckUtils]: 37: Hoare triple {5689#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5689#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:00,195 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:00,196 INFO L290 TraceCheckUtils]: 39: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:00,196 INFO L290 TraceCheckUtils]: 40: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:00,196 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #63#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:00,197 INFO L290 TraceCheckUtils]: 42: Hoare triple {5689#(<= ~counter~0 3)} assume !!(0 != ~r~0); {5689#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:00,197 INFO L290 TraceCheckUtils]: 43: Hoare triple {5689#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5689#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:00,197 INFO L290 TraceCheckUtils]: 44: Hoare triple {5689#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5717#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:00,198 INFO L290 TraceCheckUtils]: 45: Hoare triple {5717#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {5717#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:00,200 INFO L272 TraceCheckUtils]: 46: Hoare triple {5717#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5717#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:00,200 INFO L290 TraceCheckUtils]: 47: Hoare triple {5717#(<= ~counter~0 4)} ~cond := #in~cond; {5717#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:00,200 INFO L290 TraceCheckUtils]: 48: Hoare triple {5717#(<= ~counter~0 4)} assume !(0 == ~cond); {5717#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:00,201 INFO L290 TraceCheckUtils]: 49: Hoare triple {5717#(<= ~counter~0 4)} assume true; {5717#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:00,201 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5717#(<= ~counter~0 4)} {5717#(<= ~counter~0 4)} #63#return; {5717#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:00,201 INFO L290 TraceCheckUtils]: 51: Hoare triple {5717#(<= ~counter~0 4)} assume !!(0 != ~r~0); {5717#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:00,202 INFO L290 TraceCheckUtils]: 52: Hoare triple {5717#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5717#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:00,202 INFO L290 TraceCheckUtils]: 53: Hoare triple {5717#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5745#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:00,202 INFO L290 TraceCheckUtils]: 54: Hoare triple {5745#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {5745#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:00,203 INFO L272 TraceCheckUtils]: 55: Hoare triple {5745#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5745#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:00,203 INFO L290 TraceCheckUtils]: 56: Hoare triple {5745#(<= ~counter~0 5)} ~cond := #in~cond; {5745#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:00,204 INFO L290 TraceCheckUtils]: 57: Hoare triple {5745#(<= ~counter~0 5)} assume !(0 == ~cond); {5745#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:00,204 INFO L290 TraceCheckUtils]: 58: Hoare triple {5745#(<= ~counter~0 5)} assume true; {5745#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:00,204 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5745#(<= ~counter~0 5)} {5745#(<= ~counter~0 5)} #63#return; {5745#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:00,205 INFO L290 TraceCheckUtils]: 60: Hoare triple {5745#(<= ~counter~0 5)} assume !!(0 != ~r~0); {5745#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:00,211 INFO L290 TraceCheckUtils]: 61: Hoare triple {5745#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5745#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:00,212 INFO L290 TraceCheckUtils]: 62: Hoare triple {5745#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5773#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:00,212 INFO L290 TraceCheckUtils]: 63: Hoare triple {5773#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {5773#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:00,213 INFO L272 TraceCheckUtils]: 64: Hoare triple {5773#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5773#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:00,213 INFO L290 TraceCheckUtils]: 65: Hoare triple {5773#(<= ~counter~0 6)} ~cond := #in~cond; {5773#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:00,214 INFO L290 TraceCheckUtils]: 66: Hoare triple {5773#(<= ~counter~0 6)} assume !(0 == ~cond); {5773#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:00,214 INFO L290 TraceCheckUtils]: 67: Hoare triple {5773#(<= ~counter~0 6)} assume true; {5773#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:00,215 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5773#(<= ~counter~0 6)} {5773#(<= ~counter~0 6)} #63#return; {5773#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:00,215 INFO L290 TraceCheckUtils]: 69: Hoare triple {5773#(<= ~counter~0 6)} assume !!(0 != ~r~0); {5773#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:00,216 INFO L290 TraceCheckUtils]: 70: Hoare triple {5773#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5773#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:00,216 INFO L290 TraceCheckUtils]: 71: Hoare triple {5773#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5801#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:00,217 INFO L290 TraceCheckUtils]: 72: Hoare triple {5801#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {5801#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:00,217 INFO L272 TraceCheckUtils]: 73: Hoare triple {5801#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5801#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:00,218 INFO L290 TraceCheckUtils]: 74: Hoare triple {5801#(<= ~counter~0 7)} ~cond := #in~cond; {5801#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:00,218 INFO L290 TraceCheckUtils]: 75: Hoare triple {5801#(<= ~counter~0 7)} assume !(0 == ~cond); {5801#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:00,219 INFO L290 TraceCheckUtils]: 76: Hoare triple {5801#(<= ~counter~0 7)} assume true; {5801#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:00,219 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5801#(<= ~counter~0 7)} {5801#(<= ~counter~0 7)} #63#return; {5801#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:00,220 INFO L290 TraceCheckUtils]: 78: Hoare triple {5801#(<= ~counter~0 7)} assume !!(0 != ~r~0); {5801#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:00,220 INFO L290 TraceCheckUtils]: 79: Hoare triple {5801#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5801#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:00,221 INFO L290 TraceCheckUtils]: 80: Hoare triple {5801#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5829#(<= |main_#t~post6| 7)} is VALID [2022-04-28 06:03:00,221 INFO L290 TraceCheckUtils]: 81: Hoare triple {5829#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {5577#false} is VALID [2022-04-28 06:03:00,221 INFO L272 TraceCheckUtils]: 82: Hoare triple {5577#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5577#false} is VALID [2022-04-28 06:03:00,221 INFO L290 TraceCheckUtils]: 83: Hoare triple {5577#false} ~cond := #in~cond; {5577#false} is VALID [2022-04-28 06:03:00,221 INFO L290 TraceCheckUtils]: 84: Hoare triple {5577#false} assume 0 == ~cond; {5577#false} is VALID [2022-04-28 06:03:00,221 INFO L290 TraceCheckUtils]: 85: Hoare triple {5577#false} assume !false; {5577#false} is VALID [2022-04-28 06:03:00,222 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 14 proven. 203 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:00,222 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:00,664 INFO L290 TraceCheckUtils]: 85: Hoare triple {5577#false} assume !false; {5577#false} is VALID [2022-04-28 06:03:00,665 INFO L290 TraceCheckUtils]: 84: Hoare triple {5577#false} assume 0 == ~cond; {5577#false} is VALID [2022-04-28 06:03:00,665 INFO L290 TraceCheckUtils]: 83: Hoare triple {5577#false} ~cond := #in~cond; {5577#false} is VALID [2022-04-28 06:03:00,665 INFO L272 TraceCheckUtils]: 82: Hoare triple {5577#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5577#false} is VALID [2022-04-28 06:03:00,665 INFO L290 TraceCheckUtils]: 81: Hoare triple {5857#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {5577#false} is VALID [2022-04-28 06:03:00,667 INFO L290 TraceCheckUtils]: 80: Hoare triple {5861#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5857#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:03:00,667 INFO L290 TraceCheckUtils]: 79: Hoare triple {5861#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5861#(< ~counter~0 20)} is VALID [2022-04-28 06:03:00,671 INFO L290 TraceCheckUtils]: 78: Hoare triple {5861#(< ~counter~0 20)} assume !!(0 != ~r~0); {5861#(< ~counter~0 20)} is VALID [2022-04-28 06:03:00,672 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5576#true} {5861#(< ~counter~0 20)} #63#return; {5861#(< ~counter~0 20)} is VALID [2022-04-28 06:03:00,672 INFO L290 TraceCheckUtils]: 76: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-28 06:03:00,672 INFO L290 TraceCheckUtils]: 75: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-28 06:03:00,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-28 06:03:00,672 INFO L272 TraceCheckUtils]: 73: Hoare triple {5861#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5576#true} is VALID [2022-04-28 06:03:00,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {5861#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {5861#(< ~counter~0 20)} is VALID [2022-04-28 06:03:00,673 INFO L290 TraceCheckUtils]: 71: Hoare triple {5889#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5861#(< ~counter~0 20)} is VALID [2022-04-28 06:03:00,673 INFO L290 TraceCheckUtils]: 70: Hoare triple {5889#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:03:00,673 INFO L290 TraceCheckUtils]: 69: Hoare triple {5889#(< ~counter~0 19)} assume !!(0 != ~r~0); {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:03:00,674 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5576#true} {5889#(< ~counter~0 19)} #63#return; {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:03:00,674 INFO L290 TraceCheckUtils]: 67: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-28 06:03:00,674 INFO L290 TraceCheckUtils]: 66: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-28 06:03:00,674 INFO L290 TraceCheckUtils]: 65: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-28 06:03:00,674 INFO L272 TraceCheckUtils]: 64: Hoare triple {5889#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5576#true} is VALID [2022-04-28 06:03:00,679 INFO L290 TraceCheckUtils]: 63: Hoare triple {5889#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:03:00,679 INFO L290 TraceCheckUtils]: 62: Hoare triple {5917#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5889#(< ~counter~0 19)} is VALID [2022-04-28 06:03:00,680 INFO L290 TraceCheckUtils]: 61: Hoare triple {5917#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5917#(< ~counter~0 18)} is VALID [2022-04-28 06:03:00,680 INFO L290 TraceCheckUtils]: 60: Hoare triple {5917#(< ~counter~0 18)} assume !!(0 != ~r~0); {5917#(< ~counter~0 18)} is VALID [2022-04-28 06:03:00,680 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5576#true} {5917#(< ~counter~0 18)} #63#return; {5917#(< ~counter~0 18)} is VALID [2022-04-28 06:03:00,681 INFO L290 TraceCheckUtils]: 58: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-28 06:03:00,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-28 06:03:00,681 INFO L290 TraceCheckUtils]: 56: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-28 06:03:00,681 INFO L272 TraceCheckUtils]: 55: Hoare triple {5917#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5576#true} is VALID [2022-04-28 06:03:00,681 INFO L290 TraceCheckUtils]: 54: Hoare triple {5917#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {5917#(< ~counter~0 18)} is VALID [2022-04-28 06:03:00,681 INFO L290 TraceCheckUtils]: 53: Hoare triple {5945#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5917#(< ~counter~0 18)} is VALID [2022-04-28 06:03:00,682 INFO L290 TraceCheckUtils]: 52: Hoare triple {5945#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5945#(< ~counter~0 17)} is VALID [2022-04-28 06:03:00,682 INFO L290 TraceCheckUtils]: 51: Hoare triple {5945#(< ~counter~0 17)} assume !!(0 != ~r~0); {5945#(< ~counter~0 17)} is VALID [2022-04-28 06:03:00,683 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5576#true} {5945#(< ~counter~0 17)} #63#return; {5945#(< ~counter~0 17)} is VALID [2022-04-28 06:03:00,683 INFO L290 TraceCheckUtils]: 49: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-28 06:03:00,683 INFO L290 TraceCheckUtils]: 48: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-28 06:03:00,683 INFO L290 TraceCheckUtils]: 47: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-28 06:03:00,683 INFO L272 TraceCheckUtils]: 46: Hoare triple {5945#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5576#true} is VALID [2022-04-28 06:03:00,683 INFO L290 TraceCheckUtils]: 45: Hoare triple {5945#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {5945#(< ~counter~0 17)} is VALID [2022-04-28 06:03:00,684 INFO L290 TraceCheckUtils]: 44: Hoare triple {5973#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5945#(< ~counter~0 17)} is VALID [2022-04-28 06:03:00,684 INFO L290 TraceCheckUtils]: 43: Hoare triple {5973#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5973#(< ~counter~0 16)} is VALID [2022-04-28 06:03:00,684 INFO L290 TraceCheckUtils]: 42: Hoare triple {5973#(< ~counter~0 16)} assume !!(0 != ~r~0); {5973#(< ~counter~0 16)} is VALID [2022-04-28 06:03:00,685 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5576#true} {5973#(< ~counter~0 16)} #63#return; {5973#(< ~counter~0 16)} is VALID [2022-04-28 06:03:00,685 INFO L290 TraceCheckUtils]: 40: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-28 06:03:00,685 INFO L290 TraceCheckUtils]: 39: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-28 06:03:00,685 INFO L290 TraceCheckUtils]: 38: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-28 06:03:00,685 INFO L272 TraceCheckUtils]: 37: Hoare triple {5973#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5576#true} is VALID [2022-04-28 06:03:00,685 INFO L290 TraceCheckUtils]: 36: Hoare triple {5973#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {5973#(< ~counter~0 16)} is VALID [2022-04-28 06:03:00,686 INFO L290 TraceCheckUtils]: 35: Hoare triple {6001#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5973#(< ~counter~0 16)} is VALID [2022-04-28 06:03:00,686 INFO L290 TraceCheckUtils]: 34: Hoare triple {6001#(< ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6001#(< ~counter~0 15)} is VALID [2022-04-28 06:03:00,686 INFO L290 TraceCheckUtils]: 33: Hoare triple {6001#(< ~counter~0 15)} assume !!(0 != ~r~0); {6001#(< ~counter~0 15)} is VALID [2022-04-28 06:03:00,687 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5576#true} {6001#(< ~counter~0 15)} #63#return; {6001#(< ~counter~0 15)} is VALID [2022-04-28 06:03:00,687 INFO L290 TraceCheckUtils]: 31: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-28 06:03:00,687 INFO L290 TraceCheckUtils]: 30: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-28 06:03:00,687 INFO L290 TraceCheckUtils]: 29: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-28 06:03:00,687 INFO L272 TraceCheckUtils]: 28: Hoare triple {6001#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5576#true} is VALID [2022-04-28 06:03:00,687 INFO L290 TraceCheckUtils]: 27: Hoare triple {6001#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {6001#(< ~counter~0 15)} is VALID [2022-04-28 06:03:00,688 INFO L290 TraceCheckUtils]: 26: Hoare triple {6029#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6001#(< ~counter~0 15)} is VALID [2022-04-28 06:03:00,688 INFO L290 TraceCheckUtils]: 25: Hoare triple {6029#(< ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6029#(< ~counter~0 14)} is VALID [2022-04-28 06:03:00,688 INFO L290 TraceCheckUtils]: 24: Hoare triple {6029#(< ~counter~0 14)} assume !!(0 != ~r~0); {6029#(< ~counter~0 14)} is VALID [2022-04-28 06:03:00,689 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5576#true} {6029#(< ~counter~0 14)} #63#return; {6029#(< ~counter~0 14)} is VALID [2022-04-28 06:03:00,689 INFO L290 TraceCheckUtils]: 22: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-28 06:03:00,689 INFO L290 TraceCheckUtils]: 21: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-28 06:03:00,689 INFO L290 TraceCheckUtils]: 20: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-28 06:03:00,689 INFO L272 TraceCheckUtils]: 19: Hoare triple {6029#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5576#true} is VALID [2022-04-28 06:03:00,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {6029#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {6029#(< ~counter~0 14)} is VALID [2022-04-28 06:03:00,690 INFO L290 TraceCheckUtils]: 17: Hoare triple {6057#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6029#(< ~counter~0 14)} is VALID [2022-04-28 06:03:00,690 INFO L290 TraceCheckUtils]: 16: Hoare triple {6057#(< ~counter~0 13)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6057#(< ~counter~0 13)} is VALID [2022-04-28 06:03:00,690 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5576#true} {6057#(< ~counter~0 13)} #61#return; {6057#(< ~counter~0 13)} is VALID [2022-04-28 06:03:00,690 INFO L290 TraceCheckUtils]: 14: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-28 06:03:00,691 INFO L290 TraceCheckUtils]: 13: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-28 06:03:00,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-28 06:03:00,691 INFO L272 TraceCheckUtils]: 11: Hoare triple {6057#(< ~counter~0 13)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {5576#true} is VALID [2022-04-28 06:03:00,691 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5576#true} {6057#(< ~counter~0 13)} #59#return; {6057#(< ~counter~0 13)} is VALID [2022-04-28 06:03:00,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-28 06:03:00,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-28 06:03:00,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-28 06:03:00,691 INFO L272 TraceCheckUtils]: 6: Hoare triple {6057#(< ~counter~0 13)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5576#true} is VALID [2022-04-28 06:03:00,692 INFO L290 TraceCheckUtils]: 5: Hoare triple {6057#(< ~counter~0 13)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6057#(< ~counter~0 13)} is VALID [2022-04-28 06:03:00,692 INFO L272 TraceCheckUtils]: 4: Hoare triple {6057#(< ~counter~0 13)} call #t~ret7 := main(); {6057#(< ~counter~0 13)} is VALID [2022-04-28 06:03:00,692 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6057#(< ~counter~0 13)} {5576#true} #67#return; {6057#(< ~counter~0 13)} is VALID [2022-04-28 06:03:00,693 INFO L290 TraceCheckUtils]: 2: Hoare triple {6057#(< ~counter~0 13)} assume true; {6057#(< ~counter~0 13)} is VALID [2022-04-28 06:03:00,693 INFO L290 TraceCheckUtils]: 1: Hoare triple {5576#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; {6057#(< ~counter~0 13)} is VALID [2022-04-28 06:03:00,693 INFO L272 TraceCheckUtils]: 0: Hoare triple {5576#true} call ULTIMATE.init(); {5576#true} is VALID [2022-04-28 06:03:00,693 INFO L134 CoverageAnalysis]: Checked inductivity of 221 backedges. 14 proven. 119 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-28 06:03:00,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:00,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275404723] [2022-04-28 06:03:00,694 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:00,694 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [335974039] [2022-04-28 06:03:00,694 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [335974039] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:00,694 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:00,694 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-28 06:03:00,695 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:00,695 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1117750163] [2022-04-28 06:03:00,695 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1117750163] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:00,695 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:00,695 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-28 06:03:00,695 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1628534822] [2022-04-28 06:03:00,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:00,698 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, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 86 [2022-04-28 06:03:00,700 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:00,700 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, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 06:03:00,754 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:00,754 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-28 06:03:00,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:00,755 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-28 06:03:00,755 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-28 06:03:00,755 INFO L87 Difference]: Start difference. First operand 83 states and 91 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, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 06:03:01,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:01,058 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-04-28 06:03:01,058 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-28 06:03:01,059 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, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) Word has length 86 [2022-04-28 06:03:01,059 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:01,059 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, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 06:03:01,061 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-28 06:03:01,061 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, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 06:03:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-28 06:03:01,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 105 transitions. [2022-04-28 06:03:01,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:01,146 INFO L225 Difference]: With dead ends: 97 [2022-04-28 06:03:01,146 INFO L226 Difference]: Without dead ends: 92 [2022-04-28 06:03:01,147 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-28 06:03:01,147 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 24 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:01,148 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 132 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-28 06:03:01,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-28 06:03:01,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-28 06:03:01,241 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:01,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 06:03:01,242 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 06:03:01,242 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 06:03:01,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:01,244 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-28 06:03:01,244 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 06:03:01,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:01,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:01,244 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-04-28 06:03:01,245 INFO L87 Difference]: Start difference. First operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 92 states. [2022-04-28 06:03:01,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:01,246 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-28 06:03:01,247 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 06:03:01,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:01,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:01,247 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:01,247 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:01,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 68 states have (on average 1.1323529411764706) internal successors, (77), 68 states have internal predecessors, (77), 13 states have call successors, (13), 12 states have call predecessors, (13), 10 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-28 06:03:01,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-04-28 06:03:01,251 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 86 [2022-04-28 06:03:01,251 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:01,251 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-04-28 06:03:01,252 INFO L496 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, (12), 10 states have call predecessors, (12), 8 states have return successors, (10), 8 states have call predecessors, (10), 9 states have call successors, (10) [2022-04-28 06:03:01,252 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 101 transitions. [2022-04-28 06:03:03,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 100 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:03,384 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-28 06:03:03,384 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-28 06:03:03,384 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:03,384 INFO L195 NwaCegarLoop]: trace histogram [9, 9, 8, 8, 8, 8, 8, 8, 8, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:03,401 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-04-28 06:03:03,587 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-28 06:03:03,587 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:03,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 15 times [2022-04-28 06:03:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:03,588 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [576168912] [2022-04-28 06:03:03,588 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:03,588 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 16 times [2022-04-28 06:03:03,588 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:03,589 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [915231930] [2022-04-28 06:03:03,589 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:03,589 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:03,608 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:03,609 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1789315612] [2022-04-28 06:03:03,609 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:03:03,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:03,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:03,610 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:03,638 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-28 06:03:03,733 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:03:03,733 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:03,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-28 06:03:03,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:03,756 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:04,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {6687#true} call ULTIMATE.init(); {6687#true} is VALID [2022-04-28 06:03:04,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {6687#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; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {6695#(<= ~counter~0 0)} assume true; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6695#(<= ~counter~0 0)} {6687#true} #67#return; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {6695#(<= ~counter~0 0)} call #t~ret7 := main(); {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,201 INFO L290 TraceCheckUtils]: 5: Hoare triple {6695#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,201 INFO L272 TraceCheckUtils]: 6: Hoare triple {6695#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {6695#(<= ~counter~0 0)} ~cond := #in~cond; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {6695#(<= ~counter~0 0)} assume !(0 == ~cond); {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {6695#(<= ~counter~0 0)} assume true; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6695#(<= ~counter~0 0)} {6695#(<= ~counter~0 0)} #59#return; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,203 INFO L272 TraceCheckUtils]: 11: Hoare triple {6695#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {6695#(<= ~counter~0 0)} ~cond := #in~cond; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {6695#(<= ~counter~0 0)} assume !(0 == ~cond); {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,204 INFO L290 TraceCheckUtils]: 14: Hoare triple {6695#(<= ~counter~0 0)} assume true; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,204 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6695#(<= ~counter~0 0)} {6695#(<= ~counter~0 0)} #61#return; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,205 INFO L290 TraceCheckUtils]: 16: Hoare triple {6695#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6695#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:04,206 INFO L290 TraceCheckUtils]: 17: Hoare triple {6695#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6744#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:04,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {6744#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {6744#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:04,207 INFO L272 TraceCheckUtils]: 19: Hoare triple {6744#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6744#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:04,207 INFO L290 TraceCheckUtils]: 20: Hoare triple {6744#(<= ~counter~0 1)} ~cond := #in~cond; {6744#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:04,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {6744#(<= ~counter~0 1)} assume !(0 == ~cond); {6744#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:04,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {6744#(<= ~counter~0 1)} assume true; {6744#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:04,208 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6744#(<= ~counter~0 1)} {6744#(<= ~counter~0 1)} #63#return; {6744#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:04,208 INFO L290 TraceCheckUtils]: 24: Hoare triple {6744#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6744#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:04,208 INFO L290 TraceCheckUtils]: 25: Hoare triple {6744#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6744#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:04,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {6744#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6772#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:04,209 INFO L290 TraceCheckUtils]: 27: Hoare triple {6772#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {6772#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:04,210 INFO L272 TraceCheckUtils]: 28: Hoare triple {6772#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6772#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:04,210 INFO L290 TraceCheckUtils]: 29: Hoare triple {6772#(<= ~counter~0 2)} ~cond := #in~cond; {6772#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:04,210 INFO L290 TraceCheckUtils]: 30: Hoare triple {6772#(<= ~counter~0 2)} assume !(0 == ~cond); {6772#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:04,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {6772#(<= ~counter~0 2)} assume true; {6772#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:04,212 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6772#(<= ~counter~0 2)} {6772#(<= ~counter~0 2)} #63#return; {6772#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:04,212 INFO L290 TraceCheckUtils]: 33: Hoare triple {6772#(<= ~counter~0 2)} assume !!(0 != ~r~0); {6772#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:04,213 INFO L290 TraceCheckUtils]: 34: Hoare triple {6772#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6772#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:04,213 INFO L290 TraceCheckUtils]: 35: Hoare triple {6772#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6800#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:04,213 INFO L290 TraceCheckUtils]: 36: Hoare triple {6800#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {6800#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:04,214 INFO L272 TraceCheckUtils]: 37: Hoare triple {6800#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6800#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:04,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {6800#(<= ~counter~0 3)} ~cond := #in~cond; {6800#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:04,215 INFO L290 TraceCheckUtils]: 39: Hoare triple {6800#(<= ~counter~0 3)} assume !(0 == ~cond); {6800#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:04,215 INFO L290 TraceCheckUtils]: 40: Hoare triple {6800#(<= ~counter~0 3)} assume true; {6800#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:04,215 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6800#(<= ~counter~0 3)} {6800#(<= ~counter~0 3)} #63#return; {6800#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:04,216 INFO L290 TraceCheckUtils]: 42: Hoare triple {6800#(<= ~counter~0 3)} assume !!(0 != ~r~0); {6800#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:04,216 INFO L290 TraceCheckUtils]: 43: Hoare triple {6800#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6800#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:04,216 INFO L290 TraceCheckUtils]: 44: Hoare triple {6800#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6828#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:04,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {6828#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {6828#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:04,217 INFO L272 TraceCheckUtils]: 46: Hoare triple {6828#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6828#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:04,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {6828#(<= ~counter~0 4)} ~cond := #in~cond; {6828#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:04,218 INFO L290 TraceCheckUtils]: 48: Hoare triple {6828#(<= ~counter~0 4)} assume !(0 == ~cond); {6828#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:04,218 INFO L290 TraceCheckUtils]: 49: Hoare triple {6828#(<= ~counter~0 4)} assume true; {6828#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:04,219 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6828#(<= ~counter~0 4)} {6828#(<= ~counter~0 4)} #63#return; {6828#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:04,219 INFO L290 TraceCheckUtils]: 51: Hoare triple {6828#(<= ~counter~0 4)} assume !!(0 != ~r~0); {6828#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:04,219 INFO L290 TraceCheckUtils]: 52: Hoare triple {6828#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6828#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:04,220 INFO L290 TraceCheckUtils]: 53: Hoare triple {6828#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6856#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:04,220 INFO L290 TraceCheckUtils]: 54: Hoare triple {6856#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {6856#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:04,220 INFO L272 TraceCheckUtils]: 55: Hoare triple {6856#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6856#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:04,221 INFO L290 TraceCheckUtils]: 56: Hoare triple {6856#(<= ~counter~0 5)} ~cond := #in~cond; {6856#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:04,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {6856#(<= ~counter~0 5)} assume !(0 == ~cond); {6856#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:04,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {6856#(<= ~counter~0 5)} assume true; {6856#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:04,222 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6856#(<= ~counter~0 5)} {6856#(<= ~counter~0 5)} #63#return; {6856#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:04,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {6856#(<= ~counter~0 5)} assume !!(0 != ~r~0); {6856#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:04,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {6856#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6856#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:04,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {6856#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6884#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:04,223 INFO L290 TraceCheckUtils]: 63: Hoare triple {6884#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {6884#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:04,224 INFO L272 TraceCheckUtils]: 64: Hoare triple {6884#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6884#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:04,224 INFO L290 TraceCheckUtils]: 65: Hoare triple {6884#(<= ~counter~0 6)} ~cond := #in~cond; {6884#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:04,224 INFO L290 TraceCheckUtils]: 66: Hoare triple {6884#(<= ~counter~0 6)} assume !(0 == ~cond); {6884#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:04,226 INFO L290 TraceCheckUtils]: 67: Hoare triple {6884#(<= ~counter~0 6)} assume true; {6884#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:04,226 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6884#(<= ~counter~0 6)} {6884#(<= ~counter~0 6)} #63#return; {6884#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:04,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {6884#(<= ~counter~0 6)} assume !!(0 != ~r~0); {6884#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:04,227 INFO L290 TraceCheckUtils]: 70: Hoare triple {6884#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6884#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:04,227 INFO L290 TraceCheckUtils]: 71: Hoare triple {6884#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6912#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:04,228 INFO L290 TraceCheckUtils]: 72: Hoare triple {6912#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {6912#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:04,228 INFO L272 TraceCheckUtils]: 73: Hoare triple {6912#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6912#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:04,228 INFO L290 TraceCheckUtils]: 74: Hoare triple {6912#(<= ~counter~0 7)} ~cond := #in~cond; {6912#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:04,229 INFO L290 TraceCheckUtils]: 75: Hoare triple {6912#(<= ~counter~0 7)} assume !(0 == ~cond); {6912#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:04,229 INFO L290 TraceCheckUtils]: 76: Hoare triple {6912#(<= ~counter~0 7)} assume true; {6912#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:04,230 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6912#(<= ~counter~0 7)} {6912#(<= ~counter~0 7)} #63#return; {6912#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:04,230 INFO L290 TraceCheckUtils]: 78: Hoare triple {6912#(<= ~counter~0 7)} assume !!(0 != ~r~0); {6912#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:04,230 INFO L290 TraceCheckUtils]: 79: Hoare triple {6912#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6912#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:04,231 INFO L290 TraceCheckUtils]: 80: Hoare triple {6912#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6940#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:04,231 INFO L290 TraceCheckUtils]: 81: Hoare triple {6940#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {6940#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:04,232 INFO L272 TraceCheckUtils]: 82: Hoare triple {6940#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6940#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:04,232 INFO L290 TraceCheckUtils]: 83: Hoare triple {6940#(<= ~counter~0 8)} ~cond := #in~cond; {6940#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:04,233 INFO L290 TraceCheckUtils]: 84: Hoare triple {6940#(<= ~counter~0 8)} assume !(0 == ~cond); {6940#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:04,234 INFO L290 TraceCheckUtils]: 85: Hoare triple {6940#(<= ~counter~0 8)} assume true; {6940#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:04,234 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6940#(<= ~counter~0 8)} {6940#(<= ~counter~0 8)} #63#return; {6940#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:04,234 INFO L290 TraceCheckUtils]: 87: Hoare triple {6940#(<= ~counter~0 8)} assume !!(0 != ~r~0); {6940#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:04,235 INFO L290 TraceCheckUtils]: 88: Hoare triple {6940#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {6940#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:04,235 INFO L290 TraceCheckUtils]: 89: Hoare triple {6940#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6968#(<= |main_#t~post6| 8)} is VALID [2022-04-28 06:03:04,235 INFO L290 TraceCheckUtils]: 90: Hoare triple {6968#(<= |main_#t~post6| 8)} assume !(#t~post6 < 20);havoc #t~post6; {6688#false} is VALID [2022-04-28 06:03:04,236 INFO L272 TraceCheckUtils]: 91: Hoare triple {6688#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6688#false} is VALID [2022-04-28 06:03:04,236 INFO L290 TraceCheckUtils]: 92: Hoare triple {6688#false} ~cond := #in~cond; {6688#false} is VALID [2022-04-28 06:03:04,236 INFO L290 TraceCheckUtils]: 93: Hoare triple {6688#false} assume 0 == ~cond; {6688#false} is VALID [2022-04-28 06:03:04,236 INFO L290 TraceCheckUtils]: 94: Hoare triple {6688#false} assume !false; {6688#false} is VALID [2022-04-28 06:03:04,236 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 16 proven. 268 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:04,236 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:04,761 INFO L290 TraceCheckUtils]: 94: Hoare triple {6688#false} assume !false; {6688#false} is VALID [2022-04-28 06:03:04,761 INFO L290 TraceCheckUtils]: 93: Hoare triple {6688#false} assume 0 == ~cond; {6688#false} is VALID [2022-04-28 06:03:04,761 INFO L290 TraceCheckUtils]: 92: Hoare triple {6688#false} ~cond := #in~cond; {6688#false} is VALID [2022-04-28 06:03:04,761 INFO L272 TraceCheckUtils]: 91: Hoare triple {6688#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6688#false} is VALID [2022-04-28 06:03:04,762 INFO L290 TraceCheckUtils]: 90: Hoare triple {6996#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {6688#false} is VALID [2022-04-28 06:03:04,762 INFO L290 TraceCheckUtils]: 89: Hoare triple {7000#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6996#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:03:04,762 INFO L290 TraceCheckUtils]: 88: Hoare triple {7000#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7000#(< ~counter~0 20)} is VALID [2022-04-28 06:03:04,763 INFO L290 TraceCheckUtils]: 87: Hoare triple {7000#(< ~counter~0 20)} assume !!(0 != ~r~0); {7000#(< ~counter~0 20)} is VALID [2022-04-28 06:03:04,763 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6687#true} {7000#(< ~counter~0 20)} #63#return; {7000#(< ~counter~0 20)} is VALID [2022-04-28 06:03:04,763 INFO L290 TraceCheckUtils]: 85: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,763 INFO L290 TraceCheckUtils]: 84: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,763 INFO L290 TraceCheckUtils]: 83: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,763 INFO L272 TraceCheckUtils]: 82: Hoare triple {7000#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,764 INFO L290 TraceCheckUtils]: 81: Hoare triple {7000#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {7000#(< ~counter~0 20)} is VALID [2022-04-28 06:03:04,764 INFO L290 TraceCheckUtils]: 80: Hoare triple {7028#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7000#(< ~counter~0 20)} is VALID [2022-04-28 06:03:04,765 INFO L290 TraceCheckUtils]: 79: Hoare triple {7028#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7028#(< ~counter~0 19)} is VALID [2022-04-28 06:03:04,765 INFO L290 TraceCheckUtils]: 78: Hoare triple {7028#(< ~counter~0 19)} assume !!(0 != ~r~0); {7028#(< ~counter~0 19)} is VALID [2022-04-28 06:03:04,765 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6687#true} {7028#(< ~counter~0 19)} #63#return; {7028#(< ~counter~0 19)} is VALID [2022-04-28 06:03:04,765 INFO L290 TraceCheckUtils]: 76: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,765 INFO L290 TraceCheckUtils]: 75: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,766 INFO L290 TraceCheckUtils]: 74: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,766 INFO L272 TraceCheckUtils]: 73: Hoare triple {7028#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {7028#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {7028#(< ~counter~0 19)} is VALID [2022-04-28 06:03:04,766 INFO L290 TraceCheckUtils]: 71: Hoare triple {7056#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7028#(< ~counter~0 19)} is VALID [2022-04-28 06:03:04,767 INFO L290 TraceCheckUtils]: 70: Hoare triple {7056#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7056#(< ~counter~0 18)} is VALID [2022-04-28 06:03:04,767 INFO L290 TraceCheckUtils]: 69: Hoare triple {7056#(< ~counter~0 18)} assume !!(0 != ~r~0); {7056#(< ~counter~0 18)} is VALID [2022-04-28 06:03:04,767 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6687#true} {7056#(< ~counter~0 18)} #63#return; {7056#(< ~counter~0 18)} is VALID [2022-04-28 06:03:04,768 INFO L290 TraceCheckUtils]: 67: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,768 INFO L290 TraceCheckUtils]: 66: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,768 INFO L290 TraceCheckUtils]: 65: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,768 INFO L272 TraceCheckUtils]: 64: Hoare triple {7056#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,768 INFO L290 TraceCheckUtils]: 63: Hoare triple {7056#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {7056#(< ~counter~0 18)} is VALID [2022-04-28 06:03:04,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {7084#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7056#(< ~counter~0 18)} is VALID [2022-04-28 06:03:04,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {7084#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7084#(< ~counter~0 17)} is VALID [2022-04-28 06:03:04,769 INFO L290 TraceCheckUtils]: 60: Hoare triple {7084#(< ~counter~0 17)} assume !!(0 != ~r~0); {7084#(< ~counter~0 17)} is VALID [2022-04-28 06:03:04,770 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6687#true} {7084#(< ~counter~0 17)} #63#return; {7084#(< ~counter~0 17)} is VALID [2022-04-28 06:03:04,770 INFO L290 TraceCheckUtils]: 58: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,770 INFO L290 TraceCheckUtils]: 57: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,770 INFO L290 TraceCheckUtils]: 56: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,770 INFO L272 TraceCheckUtils]: 55: Hoare triple {7084#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,770 INFO L290 TraceCheckUtils]: 54: Hoare triple {7084#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {7084#(< ~counter~0 17)} is VALID [2022-04-28 06:03:04,771 INFO L290 TraceCheckUtils]: 53: Hoare triple {7112#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7084#(< ~counter~0 17)} is VALID [2022-04-28 06:03:04,771 INFO L290 TraceCheckUtils]: 52: Hoare triple {7112#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7112#(< ~counter~0 16)} is VALID [2022-04-28 06:03:04,771 INFO L290 TraceCheckUtils]: 51: Hoare triple {7112#(< ~counter~0 16)} assume !!(0 != ~r~0); {7112#(< ~counter~0 16)} is VALID [2022-04-28 06:03:04,772 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6687#true} {7112#(< ~counter~0 16)} #63#return; {7112#(< ~counter~0 16)} is VALID [2022-04-28 06:03:04,772 INFO L290 TraceCheckUtils]: 49: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,772 INFO L290 TraceCheckUtils]: 48: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,772 INFO L290 TraceCheckUtils]: 47: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,772 INFO L272 TraceCheckUtils]: 46: Hoare triple {7112#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,787 INFO L290 TraceCheckUtils]: 45: Hoare triple {7112#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {7112#(< ~counter~0 16)} is VALID [2022-04-28 06:03:04,788 INFO L290 TraceCheckUtils]: 44: Hoare triple {7140#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7112#(< ~counter~0 16)} is VALID [2022-04-28 06:03:04,788 INFO L290 TraceCheckUtils]: 43: Hoare triple {7140#(< ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7140#(< ~counter~0 15)} is VALID [2022-04-28 06:03:04,788 INFO L290 TraceCheckUtils]: 42: Hoare triple {7140#(< ~counter~0 15)} assume !!(0 != ~r~0); {7140#(< ~counter~0 15)} is VALID [2022-04-28 06:03:04,789 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6687#true} {7140#(< ~counter~0 15)} #63#return; {7140#(< ~counter~0 15)} is VALID [2022-04-28 06:03:04,789 INFO L290 TraceCheckUtils]: 40: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,789 INFO L290 TraceCheckUtils]: 39: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,789 INFO L290 TraceCheckUtils]: 38: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,789 INFO L272 TraceCheckUtils]: 37: Hoare triple {7140#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,789 INFO L290 TraceCheckUtils]: 36: Hoare triple {7140#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {7140#(< ~counter~0 15)} is VALID [2022-04-28 06:03:04,790 INFO L290 TraceCheckUtils]: 35: Hoare triple {7168#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7140#(< ~counter~0 15)} is VALID [2022-04-28 06:03:04,790 INFO L290 TraceCheckUtils]: 34: Hoare triple {7168#(< ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7168#(< ~counter~0 14)} is VALID [2022-04-28 06:03:04,790 INFO L290 TraceCheckUtils]: 33: Hoare triple {7168#(< ~counter~0 14)} assume !!(0 != ~r~0); {7168#(< ~counter~0 14)} is VALID [2022-04-28 06:03:04,791 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6687#true} {7168#(< ~counter~0 14)} #63#return; {7168#(< ~counter~0 14)} is VALID [2022-04-28 06:03:04,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,791 INFO L272 TraceCheckUtils]: 28: Hoare triple {7168#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,792 INFO L290 TraceCheckUtils]: 27: Hoare triple {7168#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {7168#(< ~counter~0 14)} is VALID [2022-04-28 06:03:04,792 INFO L290 TraceCheckUtils]: 26: Hoare triple {7196#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7168#(< ~counter~0 14)} is VALID [2022-04-28 06:03:04,792 INFO L290 TraceCheckUtils]: 25: Hoare triple {7196#(< ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7196#(< ~counter~0 13)} is VALID [2022-04-28 06:03:04,793 INFO L290 TraceCheckUtils]: 24: Hoare triple {7196#(< ~counter~0 13)} assume !!(0 != ~r~0); {7196#(< ~counter~0 13)} is VALID [2022-04-28 06:03:04,793 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6687#true} {7196#(< ~counter~0 13)} #63#return; {7196#(< ~counter~0 13)} is VALID [2022-04-28 06:03:04,793 INFO L290 TraceCheckUtils]: 22: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,793 INFO L290 TraceCheckUtils]: 21: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,793 INFO L290 TraceCheckUtils]: 20: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,793 INFO L272 TraceCheckUtils]: 19: Hoare triple {7196#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,794 INFO L290 TraceCheckUtils]: 18: Hoare triple {7196#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {7196#(< ~counter~0 13)} is VALID [2022-04-28 06:03:04,794 INFO L290 TraceCheckUtils]: 17: Hoare triple {7224#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7196#(< ~counter~0 13)} is VALID [2022-04-28 06:03:04,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {7224#(< ~counter~0 12)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7224#(< ~counter~0 12)} is VALID [2022-04-28 06:03:04,795 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6687#true} {7224#(< ~counter~0 12)} #61#return; {7224#(< ~counter~0 12)} is VALID [2022-04-28 06:03:04,795 INFO L290 TraceCheckUtils]: 14: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,795 INFO L290 TraceCheckUtils]: 13: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,795 INFO L290 TraceCheckUtils]: 12: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,795 INFO L272 TraceCheckUtils]: 11: Hoare triple {7224#(< ~counter~0 12)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,795 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6687#true} {7224#(< ~counter~0 12)} #59#return; {7224#(< ~counter~0 12)} is VALID [2022-04-28 06:03:04,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-28 06:03:04,796 INFO L290 TraceCheckUtils]: 8: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-28 06:03:04,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-28 06:03:04,796 INFO L272 TraceCheckUtils]: 6: Hoare triple {7224#(< ~counter~0 12)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6687#true} is VALID [2022-04-28 06:03:04,796 INFO L290 TraceCheckUtils]: 5: Hoare triple {7224#(< ~counter~0 12)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {7224#(< ~counter~0 12)} is VALID [2022-04-28 06:03:04,796 INFO L272 TraceCheckUtils]: 4: Hoare triple {7224#(< ~counter~0 12)} call #t~ret7 := main(); {7224#(< ~counter~0 12)} is VALID [2022-04-28 06:03:04,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7224#(< ~counter~0 12)} {6687#true} #67#return; {7224#(< ~counter~0 12)} is VALID [2022-04-28 06:03:04,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {7224#(< ~counter~0 12)} assume true; {7224#(< ~counter~0 12)} is VALID [2022-04-28 06:03:04,797 INFO L290 TraceCheckUtils]: 1: Hoare triple {6687#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; {7224#(< ~counter~0 12)} is VALID [2022-04-28 06:03:04,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {6687#true} call ULTIMATE.init(); {6687#true} is VALID [2022-04-28 06:03:04,798 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 16 proven. 156 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-28 06:03:04,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:04,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [915231930] [2022-04-28 06:03:04,798 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:04,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1789315612] [2022-04-28 06:03:04,798 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1789315612] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:04,799 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:04,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-28 06:03:04,799 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:04,799 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [576168912] [2022-04-28 06:03:04,799 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [576168912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:04,799 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:04,799 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-28 06:03:04,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251239118] [2022-04-28 06:03:04,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:04,800 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, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 95 [2022-04-28 06:03:04,800 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:04,801 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, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 06:03:04,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 92 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:04,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-28 06:03:04,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:04,871 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-28 06:03:04,871 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-28 06:03:04,871 INFO L87 Difference]: Start difference. First operand 92 states and 101 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, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 06:03:05,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:05,263 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-04-28 06:03:05,264 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-28 06:03:05,264 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, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) Word has length 95 [2022-04-28 06:03:05,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:05,264 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, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 06:03:05,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-28 06:03:05,267 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, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 06:03:05,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-28 06:03:05,269 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 115 transitions. [2022-04-28 06:03:05,358 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:05,360 INFO L225 Difference]: With dead ends: 106 [2022-04-28 06:03:05,360 INFO L226 Difference]: Without dead ends: 101 [2022-04-28 06:03:05,361 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 169 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-28 06:03:05,362 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:05,363 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 146 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:03:05,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-28 06:03:05,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-28 06:03:05,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:05,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:03:05,463 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:03:05,463 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:03:05,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:05,465 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-28 06:03:05,465 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 06:03:05,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:05,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:05,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 101 states. [2022-04-28 06:03:05,466 INFO L87 Difference]: Start difference. First operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) Second operand 101 states. [2022-04-28 06:03:05,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:05,468 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-28 06:03:05,468 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 06:03:05,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:05,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:05,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:05,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:05,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 75 states have (on average 1.1333333333333333) internal successors, (85), 75 states have internal predecessors, (85), 14 states have call successors, (14), 13 states have call predecessors, (14), 11 states have return successors, (12), 12 states have call predecessors, (12), 12 states have call successors, (12) [2022-04-28 06:03:05,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-28 06:03:05,471 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 95 [2022-04-28 06:03:05,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:05,471 INFO L495 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-28 06:03:05,471 INFO L496 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, (13), 11 states have call predecessors, (13), 9 states have return successors, (11), 9 states have call predecessors, (11), 10 states have call successors, (11) [2022-04-28 06:03:05,471 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-28 06:03:06,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:06,526 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-28 06:03:06,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-28 06:03:06,527 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:06,527 INFO L195 NwaCegarLoop]: trace histogram [10, 10, 9, 9, 9, 9, 9, 9, 9, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:06,544 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-28 06:03:06,731 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-28 06:03:06,731 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:06,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 17 times [2022-04-28 06:03:06,732 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:06,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1323137246] [2022-04-28 06:03:06,732 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:06,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 18 times [2022-04-28 06:03:06,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:06,733 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1198353567] [2022-04-28 06:03:06,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:06,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:06,746 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:06,747 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1457551235] [2022-04-28 06:03:06,747 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:03:06,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:06,747 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:06,748 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:06,753 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-28 06:03:06,932 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-28 06:03:06,932 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:06,934 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-28 06:03:06,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:06,954 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:07,499 INFO L272 TraceCheckUtils]: 0: Hoare triple {7910#true} call ULTIMATE.init(); {7910#true} is VALID [2022-04-28 06:03:07,499 INFO L290 TraceCheckUtils]: 1: Hoare triple {7910#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; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,500 INFO L290 TraceCheckUtils]: 2: Hoare triple {7918#(<= ~counter~0 0)} assume true; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,500 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7918#(<= ~counter~0 0)} {7910#true} #67#return; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,500 INFO L272 TraceCheckUtils]: 4: Hoare triple {7918#(<= ~counter~0 0)} call #t~ret7 := main(); {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,501 INFO L290 TraceCheckUtils]: 5: Hoare triple {7918#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,501 INFO L272 TraceCheckUtils]: 6: Hoare triple {7918#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,502 INFO L290 TraceCheckUtils]: 7: Hoare triple {7918#(<= ~counter~0 0)} ~cond := #in~cond; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,502 INFO L290 TraceCheckUtils]: 8: Hoare triple {7918#(<= ~counter~0 0)} assume !(0 == ~cond); {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,502 INFO L290 TraceCheckUtils]: 9: Hoare triple {7918#(<= ~counter~0 0)} assume true; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,503 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7918#(<= ~counter~0 0)} {7918#(<= ~counter~0 0)} #59#return; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,503 INFO L272 TraceCheckUtils]: 11: Hoare triple {7918#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,504 INFO L290 TraceCheckUtils]: 12: Hoare triple {7918#(<= ~counter~0 0)} ~cond := #in~cond; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,504 INFO L290 TraceCheckUtils]: 13: Hoare triple {7918#(<= ~counter~0 0)} assume !(0 == ~cond); {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,504 INFO L290 TraceCheckUtils]: 14: Hoare triple {7918#(<= ~counter~0 0)} assume true; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,505 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7918#(<= ~counter~0 0)} {7918#(<= ~counter~0 0)} #61#return; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,505 INFO L290 TraceCheckUtils]: 16: Hoare triple {7918#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:07,505 INFO L290 TraceCheckUtils]: 17: Hoare triple {7918#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:07,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {7967#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {7967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:07,506 INFO L272 TraceCheckUtils]: 19: Hoare triple {7967#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:07,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {7967#(<= ~counter~0 1)} ~cond := #in~cond; {7967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:07,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {7967#(<= ~counter~0 1)} assume !(0 == ~cond); {7967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:07,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {7967#(<= ~counter~0 1)} assume true; {7967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:07,508 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7967#(<= ~counter~0 1)} {7967#(<= ~counter~0 1)} #63#return; {7967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:07,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {7967#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:07,508 INFO L290 TraceCheckUtils]: 25: Hoare triple {7967#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:07,509 INFO L290 TraceCheckUtils]: 26: Hoare triple {7967#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:07,509 INFO L290 TraceCheckUtils]: 27: Hoare triple {7995#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {7995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:07,509 INFO L272 TraceCheckUtils]: 28: Hoare triple {7995#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:07,510 INFO L290 TraceCheckUtils]: 29: Hoare triple {7995#(<= ~counter~0 2)} ~cond := #in~cond; {7995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:07,510 INFO L290 TraceCheckUtils]: 30: Hoare triple {7995#(<= ~counter~0 2)} assume !(0 == ~cond); {7995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:07,510 INFO L290 TraceCheckUtils]: 31: Hoare triple {7995#(<= ~counter~0 2)} assume true; {7995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:07,511 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7995#(<= ~counter~0 2)} {7995#(<= ~counter~0 2)} #63#return; {7995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:07,511 INFO L290 TraceCheckUtils]: 33: Hoare triple {7995#(<= ~counter~0 2)} assume !!(0 != ~r~0); {7995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:07,511 INFO L290 TraceCheckUtils]: 34: Hoare triple {7995#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {7995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:07,512 INFO L290 TraceCheckUtils]: 35: Hoare triple {7995#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:07,512 INFO L290 TraceCheckUtils]: 36: Hoare triple {8023#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {8023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:07,512 INFO L272 TraceCheckUtils]: 37: Hoare triple {8023#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:07,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {8023#(<= ~counter~0 3)} ~cond := #in~cond; {8023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:07,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {8023#(<= ~counter~0 3)} assume !(0 == ~cond); {8023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:07,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {8023#(<= ~counter~0 3)} assume true; {8023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:07,514 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8023#(<= ~counter~0 3)} {8023#(<= ~counter~0 3)} #63#return; {8023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:07,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {8023#(<= ~counter~0 3)} assume !!(0 != ~r~0); {8023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:07,514 INFO L290 TraceCheckUtils]: 43: Hoare triple {8023#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:07,515 INFO L290 TraceCheckUtils]: 44: Hoare triple {8023#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:07,515 INFO L290 TraceCheckUtils]: 45: Hoare triple {8051#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {8051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:07,516 INFO L272 TraceCheckUtils]: 46: Hoare triple {8051#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:07,516 INFO L290 TraceCheckUtils]: 47: Hoare triple {8051#(<= ~counter~0 4)} ~cond := #in~cond; {8051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:07,516 INFO L290 TraceCheckUtils]: 48: Hoare triple {8051#(<= ~counter~0 4)} assume !(0 == ~cond); {8051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:07,516 INFO L290 TraceCheckUtils]: 49: Hoare triple {8051#(<= ~counter~0 4)} assume true; {8051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:07,517 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8051#(<= ~counter~0 4)} {8051#(<= ~counter~0 4)} #63#return; {8051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:07,517 INFO L290 TraceCheckUtils]: 51: Hoare triple {8051#(<= ~counter~0 4)} assume !!(0 != ~r~0); {8051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:07,517 INFO L290 TraceCheckUtils]: 52: Hoare triple {8051#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:07,518 INFO L290 TraceCheckUtils]: 53: Hoare triple {8051#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:07,518 INFO L290 TraceCheckUtils]: 54: Hoare triple {8079#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {8079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:07,519 INFO L272 TraceCheckUtils]: 55: Hoare triple {8079#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:07,519 INFO L290 TraceCheckUtils]: 56: Hoare triple {8079#(<= ~counter~0 5)} ~cond := #in~cond; {8079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:07,519 INFO L290 TraceCheckUtils]: 57: Hoare triple {8079#(<= ~counter~0 5)} assume !(0 == ~cond); {8079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:07,519 INFO L290 TraceCheckUtils]: 58: Hoare triple {8079#(<= ~counter~0 5)} assume true; {8079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:07,520 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8079#(<= ~counter~0 5)} {8079#(<= ~counter~0 5)} #63#return; {8079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:07,520 INFO L290 TraceCheckUtils]: 60: Hoare triple {8079#(<= ~counter~0 5)} assume !!(0 != ~r~0); {8079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:07,520 INFO L290 TraceCheckUtils]: 61: Hoare triple {8079#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:07,521 INFO L290 TraceCheckUtils]: 62: Hoare triple {8079#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:07,521 INFO L290 TraceCheckUtils]: 63: Hoare triple {8107#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {8107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:07,522 INFO L272 TraceCheckUtils]: 64: Hoare triple {8107#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:07,522 INFO L290 TraceCheckUtils]: 65: Hoare triple {8107#(<= ~counter~0 6)} ~cond := #in~cond; {8107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:07,522 INFO L290 TraceCheckUtils]: 66: Hoare triple {8107#(<= ~counter~0 6)} assume !(0 == ~cond); {8107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:07,523 INFO L290 TraceCheckUtils]: 67: Hoare triple {8107#(<= ~counter~0 6)} assume true; {8107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:07,523 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8107#(<= ~counter~0 6)} {8107#(<= ~counter~0 6)} #63#return; {8107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:07,523 INFO L290 TraceCheckUtils]: 69: Hoare triple {8107#(<= ~counter~0 6)} assume !!(0 != ~r~0); {8107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:07,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {8107#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:07,524 INFO L290 TraceCheckUtils]: 71: Hoare triple {8107#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:07,524 INFO L290 TraceCheckUtils]: 72: Hoare triple {8135#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {8135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:07,525 INFO L272 TraceCheckUtils]: 73: Hoare triple {8135#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:07,525 INFO L290 TraceCheckUtils]: 74: Hoare triple {8135#(<= ~counter~0 7)} ~cond := #in~cond; {8135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:07,525 INFO L290 TraceCheckUtils]: 75: Hoare triple {8135#(<= ~counter~0 7)} assume !(0 == ~cond); {8135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:07,526 INFO L290 TraceCheckUtils]: 76: Hoare triple {8135#(<= ~counter~0 7)} assume true; {8135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:07,526 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8135#(<= ~counter~0 7)} {8135#(<= ~counter~0 7)} #63#return; {8135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:07,526 INFO L290 TraceCheckUtils]: 78: Hoare triple {8135#(<= ~counter~0 7)} assume !!(0 != ~r~0); {8135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:07,527 INFO L290 TraceCheckUtils]: 79: Hoare triple {8135#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:07,527 INFO L290 TraceCheckUtils]: 80: Hoare triple {8135#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:07,527 INFO L290 TraceCheckUtils]: 81: Hoare triple {8163#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {8163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:07,528 INFO L272 TraceCheckUtils]: 82: Hoare triple {8163#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:07,528 INFO L290 TraceCheckUtils]: 83: Hoare triple {8163#(<= ~counter~0 8)} ~cond := #in~cond; {8163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:07,528 INFO L290 TraceCheckUtils]: 84: Hoare triple {8163#(<= ~counter~0 8)} assume !(0 == ~cond); {8163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:07,529 INFO L290 TraceCheckUtils]: 85: Hoare triple {8163#(<= ~counter~0 8)} assume true; {8163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:07,529 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8163#(<= ~counter~0 8)} {8163#(<= ~counter~0 8)} #63#return; {8163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:07,530 INFO L290 TraceCheckUtils]: 87: Hoare triple {8163#(<= ~counter~0 8)} assume !!(0 != ~r~0); {8163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:07,530 INFO L290 TraceCheckUtils]: 88: Hoare triple {8163#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:07,530 INFO L290 TraceCheckUtils]: 89: Hoare triple {8163#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:07,530 INFO L290 TraceCheckUtils]: 90: Hoare triple {8191#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {8191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:07,531 INFO L272 TraceCheckUtils]: 91: Hoare triple {8191#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:07,531 INFO L290 TraceCheckUtils]: 92: Hoare triple {8191#(<= ~counter~0 9)} ~cond := #in~cond; {8191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:07,532 INFO L290 TraceCheckUtils]: 93: Hoare triple {8191#(<= ~counter~0 9)} assume !(0 == ~cond); {8191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:07,532 INFO L290 TraceCheckUtils]: 94: Hoare triple {8191#(<= ~counter~0 9)} assume true; {8191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:07,532 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8191#(<= ~counter~0 9)} {8191#(<= ~counter~0 9)} #63#return; {8191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:07,533 INFO L290 TraceCheckUtils]: 96: Hoare triple {8191#(<= ~counter~0 9)} assume !!(0 != ~r~0); {8191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:07,533 INFO L290 TraceCheckUtils]: 97: Hoare triple {8191#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:07,534 INFO L290 TraceCheckUtils]: 98: Hoare triple {8191#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8219#(<= |main_#t~post6| 9)} is VALID [2022-04-28 06:03:07,534 INFO L290 TraceCheckUtils]: 99: Hoare triple {8219#(<= |main_#t~post6| 9)} assume !(#t~post6 < 20);havoc #t~post6; {7911#false} is VALID [2022-04-28 06:03:07,534 INFO L272 TraceCheckUtils]: 100: Hoare triple {7911#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7911#false} is VALID [2022-04-28 06:03:07,534 INFO L290 TraceCheckUtils]: 101: Hoare triple {7911#false} ~cond := #in~cond; {7911#false} is VALID [2022-04-28 06:03:07,534 INFO L290 TraceCheckUtils]: 102: Hoare triple {7911#false} assume 0 == ~cond; {7911#false} is VALID [2022-04-28 06:03:07,535 INFO L290 TraceCheckUtils]: 103: Hoare triple {7911#false} assume !false; {7911#false} is VALID [2022-04-28 06:03:07,535 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 342 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:07,535 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:08,089 INFO L290 TraceCheckUtils]: 103: Hoare triple {7911#false} assume !false; {7911#false} is VALID [2022-04-28 06:03:08,089 INFO L290 TraceCheckUtils]: 102: Hoare triple {7911#false} assume 0 == ~cond; {7911#false} is VALID [2022-04-28 06:03:08,089 INFO L290 TraceCheckUtils]: 101: Hoare triple {7911#false} ~cond := #in~cond; {7911#false} is VALID [2022-04-28 06:03:08,089 INFO L272 TraceCheckUtils]: 100: Hoare triple {7911#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7911#false} is VALID [2022-04-28 06:03:08,090 INFO L290 TraceCheckUtils]: 99: Hoare triple {8247#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {7911#false} is VALID [2022-04-28 06:03:08,090 INFO L290 TraceCheckUtils]: 98: Hoare triple {8251#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8247#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:03:08,090 INFO L290 TraceCheckUtils]: 97: Hoare triple {8251#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8251#(< ~counter~0 20)} is VALID [2022-04-28 06:03:08,091 INFO L290 TraceCheckUtils]: 96: Hoare triple {8251#(< ~counter~0 20)} assume !!(0 != ~r~0); {8251#(< ~counter~0 20)} is VALID [2022-04-28 06:03:08,091 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7910#true} {8251#(< ~counter~0 20)} #63#return; {8251#(< ~counter~0 20)} is VALID [2022-04-28 06:03:08,091 INFO L290 TraceCheckUtils]: 94: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,091 INFO L290 TraceCheckUtils]: 93: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,092 INFO L290 TraceCheckUtils]: 92: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,092 INFO L272 TraceCheckUtils]: 91: Hoare triple {8251#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,092 INFO L290 TraceCheckUtils]: 90: Hoare triple {8251#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {8251#(< ~counter~0 20)} is VALID [2022-04-28 06:03:08,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {8279#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8251#(< ~counter~0 20)} is VALID [2022-04-28 06:03:08,093 INFO L290 TraceCheckUtils]: 88: Hoare triple {8279#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8279#(< ~counter~0 19)} is VALID [2022-04-28 06:03:08,093 INFO L290 TraceCheckUtils]: 87: Hoare triple {8279#(< ~counter~0 19)} assume !!(0 != ~r~0); {8279#(< ~counter~0 19)} is VALID [2022-04-28 06:03:08,094 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7910#true} {8279#(< ~counter~0 19)} #63#return; {8279#(< ~counter~0 19)} is VALID [2022-04-28 06:03:08,094 INFO L290 TraceCheckUtils]: 85: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,094 INFO L290 TraceCheckUtils]: 84: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,094 INFO L290 TraceCheckUtils]: 83: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,094 INFO L272 TraceCheckUtils]: 82: Hoare triple {8279#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,094 INFO L290 TraceCheckUtils]: 81: Hoare triple {8279#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {8279#(< ~counter~0 19)} is VALID [2022-04-28 06:03:08,095 INFO L290 TraceCheckUtils]: 80: Hoare triple {8307#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8279#(< ~counter~0 19)} is VALID [2022-04-28 06:03:08,095 INFO L290 TraceCheckUtils]: 79: Hoare triple {8307#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8307#(< ~counter~0 18)} is VALID [2022-04-28 06:03:08,095 INFO L290 TraceCheckUtils]: 78: Hoare triple {8307#(< ~counter~0 18)} assume !!(0 != ~r~0); {8307#(< ~counter~0 18)} is VALID [2022-04-28 06:03:08,096 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7910#true} {8307#(< ~counter~0 18)} #63#return; {8307#(< ~counter~0 18)} is VALID [2022-04-28 06:03:08,096 INFO L290 TraceCheckUtils]: 76: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,096 INFO L290 TraceCheckUtils]: 75: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,096 INFO L290 TraceCheckUtils]: 74: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,096 INFO L272 TraceCheckUtils]: 73: Hoare triple {8307#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,096 INFO L290 TraceCheckUtils]: 72: Hoare triple {8307#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {8307#(< ~counter~0 18)} is VALID [2022-04-28 06:03:08,097 INFO L290 TraceCheckUtils]: 71: Hoare triple {8335#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8307#(< ~counter~0 18)} is VALID [2022-04-28 06:03:08,097 INFO L290 TraceCheckUtils]: 70: Hoare triple {8335#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8335#(< ~counter~0 17)} is VALID [2022-04-28 06:03:08,097 INFO L290 TraceCheckUtils]: 69: Hoare triple {8335#(< ~counter~0 17)} assume !!(0 != ~r~0); {8335#(< ~counter~0 17)} is VALID [2022-04-28 06:03:08,098 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7910#true} {8335#(< ~counter~0 17)} #63#return; {8335#(< ~counter~0 17)} is VALID [2022-04-28 06:03:08,098 INFO L290 TraceCheckUtils]: 67: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,098 INFO L290 TraceCheckUtils]: 66: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,098 INFO L290 TraceCheckUtils]: 65: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,098 INFO L272 TraceCheckUtils]: 64: Hoare triple {8335#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,098 INFO L290 TraceCheckUtils]: 63: Hoare triple {8335#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {8335#(< ~counter~0 17)} is VALID [2022-04-28 06:03:08,099 INFO L290 TraceCheckUtils]: 62: Hoare triple {8363#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8335#(< ~counter~0 17)} is VALID [2022-04-28 06:03:08,099 INFO L290 TraceCheckUtils]: 61: Hoare triple {8363#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8363#(< ~counter~0 16)} is VALID [2022-04-28 06:03:08,099 INFO L290 TraceCheckUtils]: 60: Hoare triple {8363#(< ~counter~0 16)} assume !!(0 != ~r~0); {8363#(< ~counter~0 16)} is VALID [2022-04-28 06:03:08,100 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7910#true} {8363#(< ~counter~0 16)} #63#return; {8363#(< ~counter~0 16)} is VALID [2022-04-28 06:03:08,100 INFO L290 TraceCheckUtils]: 58: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,100 INFO L290 TraceCheckUtils]: 57: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,100 INFO L290 TraceCheckUtils]: 56: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,100 INFO L272 TraceCheckUtils]: 55: Hoare triple {8363#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,100 INFO L290 TraceCheckUtils]: 54: Hoare triple {8363#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {8363#(< ~counter~0 16)} is VALID [2022-04-28 06:03:08,101 INFO L290 TraceCheckUtils]: 53: Hoare triple {8391#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8363#(< ~counter~0 16)} is VALID [2022-04-28 06:03:08,101 INFO L290 TraceCheckUtils]: 52: Hoare triple {8391#(< ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8391#(< ~counter~0 15)} is VALID [2022-04-28 06:03:08,101 INFO L290 TraceCheckUtils]: 51: Hoare triple {8391#(< ~counter~0 15)} assume !!(0 != ~r~0); {8391#(< ~counter~0 15)} is VALID [2022-04-28 06:03:08,102 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7910#true} {8391#(< ~counter~0 15)} #63#return; {8391#(< ~counter~0 15)} is VALID [2022-04-28 06:03:08,102 INFO L290 TraceCheckUtils]: 49: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,102 INFO L290 TraceCheckUtils]: 48: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,102 INFO L290 TraceCheckUtils]: 47: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,102 INFO L272 TraceCheckUtils]: 46: Hoare triple {8391#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,103 INFO L290 TraceCheckUtils]: 45: Hoare triple {8391#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {8391#(< ~counter~0 15)} is VALID [2022-04-28 06:03:08,103 INFO L290 TraceCheckUtils]: 44: Hoare triple {8419#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8391#(< ~counter~0 15)} is VALID [2022-04-28 06:03:08,103 INFO L290 TraceCheckUtils]: 43: Hoare triple {8419#(< ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8419#(< ~counter~0 14)} is VALID [2022-04-28 06:03:08,104 INFO L290 TraceCheckUtils]: 42: Hoare triple {8419#(< ~counter~0 14)} assume !!(0 != ~r~0); {8419#(< ~counter~0 14)} is VALID [2022-04-28 06:03:08,104 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7910#true} {8419#(< ~counter~0 14)} #63#return; {8419#(< ~counter~0 14)} is VALID [2022-04-28 06:03:08,104 INFO L290 TraceCheckUtils]: 40: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,104 INFO L290 TraceCheckUtils]: 39: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,104 INFO L272 TraceCheckUtils]: 37: Hoare triple {8419#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {8419#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {8419#(< ~counter~0 14)} is VALID [2022-04-28 06:03:08,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {8447#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8419#(< ~counter~0 14)} is VALID [2022-04-28 06:03:08,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {8447#(< ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8447#(< ~counter~0 13)} is VALID [2022-04-28 06:03:08,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {8447#(< ~counter~0 13)} assume !!(0 != ~r~0); {8447#(< ~counter~0 13)} is VALID [2022-04-28 06:03:08,106 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7910#true} {8447#(< ~counter~0 13)} #63#return; {8447#(< ~counter~0 13)} is VALID [2022-04-28 06:03:08,106 INFO L290 TraceCheckUtils]: 31: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,106 INFO L290 TraceCheckUtils]: 30: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,106 INFO L290 TraceCheckUtils]: 29: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,106 INFO L272 TraceCheckUtils]: 28: Hoare triple {8447#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,107 INFO L290 TraceCheckUtils]: 27: Hoare triple {8447#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {8447#(< ~counter~0 13)} is VALID [2022-04-28 06:03:08,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {8475#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8447#(< ~counter~0 13)} is VALID [2022-04-28 06:03:08,120 INFO L290 TraceCheckUtils]: 25: Hoare triple {8475#(< ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8475#(< ~counter~0 12)} is VALID [2022-04-28 06:03:08,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {8475#(< ~counter~0 12)} assume !!(0 != ~r~0); {8475#(< ~counter~0 12)} is VALID [2022-04-28 06:03:08,122 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7910#true} {8475#(< ~counter~0 12)} #63#return; {8475#(< ~counter~0 12)} is VALID [2022-04-28 06:03:08,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,123 INFO L272 TraceCheckUtils]: 19: Hoare triple {8475#(< ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {8475#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {8475#(< ~counter~0 12)} is VALID [2022-04-28 06:03:08,124 INFO L290 TraceCheckUtils]: 17: Hoare triple {8503#(< ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8475#(< ~counter~0 12)} is VALID [2022-04-28 06:03:08,124 INFO L290 TraceCheckUtils]: 16: Hoare triple {8503#(< ~counter~0 11)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8503#(< ~counter~0 11)} is VALID [2022-04-28 06:03:08,125 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7910#true} {8503#(< ~counter~0 11)} #61#return; {8503#(< ~counter~0 11)} is VALID [2022-04-28 06:03:08,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,126 INFO L272 TraceCheckUtils]: 11: Hoare triple {8503#(< ~counter~0 11)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,126 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7910#true} {8503#(< ~counter~0 11)} #59#return; {8503#(< ~counter~0 11)} is VALID [2022-04-28 06:03:08,127 INFO L290 TraceCheckUtils]: 9: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-28 06:03:08,127 INFO L290 TraceCheckUtils]: 8: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-28 06:03:08,127 INFO L290 TraceCheckUtils]: 7: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-28 06:03:08,127 INFO L272 TraceCheckUtils]: 6: Hoare triple {8503#(< ~counter~0 11)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7910#true} is VALID [2022-04-28 06:03:08,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {8503#(< ~counter~0 11)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {8503#(< ~counter~0 11)} is VALID [2022-04-28 06:03:08,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {8503#(< ~counter~0 11)} call #t~ret7 := main(); {8503#(< ~counter~0 11)} is VALID [2022-04-28 06:03:08,129 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8503#(< ~counter~0 11)} {7910#true} #67#return; {8503#(< ~counter~0 11)} is VALID [2022-04-28 06:03:08,129 INFO L290 TraceCheckUtils]: 2: Hoare triple {8503#(< ~counter~0 11)} assume true; {8503#(< ~counter~0 11)} is VALID [2022-04-28 06:03:08,130 INFO L290 TraceCheckUtils]: 1: Hoare triple {7910#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; {8503#(< ~counter~0 11)} is VALID [2022-04-28 06:03:08,130 INFO L272 TraceCheckUtils]: 0: Hoare triple {7910#true} call ULTIMATE.init(); {7910#true} is VALID [2022-04-28 06:03:08,130 INFO L134 CoverageAnalysis]: Checked inductivity of 364 backedges. 18 proven. 198 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-28 06:03:08,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:08,130 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1198353567] [2022-04-28 06:03:08,131 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:08,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457551235] [2022-04-28 06:03:08,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1457551235] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:08,131 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:08,131 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-28 06:03:08,131 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:08,131 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1323137246] [2022-04-28 06:03:08,131 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1323137246] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:08,131 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:08,132 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-28 06:03:08,132 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559063698] [2022-04-28 06:03:08,132 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:08,132 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, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 104 [2022-04-28 06:03:08,132 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:08,133 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, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 06:03:08,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:08,204 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-28 06:03:08,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:08,205 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-28 06:03:08,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:03:08,205 INFO L87 Difference]: Start difference. First operand 101 states and 111 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, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 06:03:08,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:08,601 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2022-04-28 06:03:08,601 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-28 06:03:08,602 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, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) Word has length 104 [2022-04-28 06:03:08,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:08,602 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, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 06:03:08,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-28 06:03:08,605 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, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 06:03:08,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-28 06:03:08,608 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 125 transitions. [2022-04-28 06:03:08,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:08,709 INFO L225 Difference]: With dead ends: 115 [2022-04-28 06:03:08,709 INFO L226 Difference]: Without dead ends: 110 [2022-04-28 06:03:08,710 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 216 GetRequests, 185 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-28 06:03:08,710 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 26 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 69 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:08,711 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 154 Invalid, 69 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:03:08,711 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-28 06:03:08,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-28 06:03:08,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:08,818 INFO L82 GeneralOperation]: Start isEquivalent. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:03:08,818 INFO L74 IsIncluded]: Start isIncluded. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:03:08,819 INFO L87 Difference]: Start difference. First operand 110 states. Second operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:03:08,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:08,820 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 06:03:08,820 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 06:03:08,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:08,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:08,821 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 06:03:08,821 INFO L87 Difference]: Start difference. First operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) Second operand 110 states. [2022-04-28 06:03:08,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:08,823 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-28 06:03:08,823 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 06:03:08,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:08,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:08,824 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:08,824 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:08,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 82 states have (on average 1.1341463414634145) internal successors, (93), 82 states have internal predecessors, (93), 15 states have call successors, (15), 14 states have call predecessors, (15), 12 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-28 06:03:08,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-28 06:03:08,826 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 104 [2022-04-28 06:03:08,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:08,827 INFO L495 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-28 06:03:08,827 INFO L496 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, (14), 12 states have call predecessors, (14), 10 states have return successors, (12), 10 states have call predecessors, (12), 11 states have call successors, (12) [2022-04-28 06:03:08,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 121 transitions. [2022-04-28 06:03:10,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:10,597 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-28 06:03:10,598 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-28 06:03:10,598 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:10,598 INFO L195 NwaCegarLoop]: trace histogram [11, 11, 10, 10, 10, 10, 10, 10, 10, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:10,603 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-28 06:03:10,803 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-28 06:03:10,804 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:10,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:10,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 19 times [2022-04-28 06:03:10,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:10,804 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1080869483] [2022-04-28 06:03:10,805 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:10,805 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 20 times [2022-04-28 06:03:10,805 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:10,805 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616856554] [2022-04-28 06:03:10,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:10,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:10,829 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:10,829 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [994307166] [2022-04-28 06:03:10,829 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:03:10,829 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:10,829 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:10,830 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:10,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-28 06:03:10,890 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:03:10,890 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:10,892 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-28 06:03:10,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:10,913 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:11,527 INFO L272 TraceCheckUtils]: 0: Hoare triple {9245#true} call ULTIMATE.init(); {9245#true} is VALID [2022-04-28 06:03:11,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {9245#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; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {9253#(<= ~counter~0 0)} assume true; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,529 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9253#(<= ~counter~0 0)} {9245#true} #67#return; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,529 INFO L272 TraceCheckUtils]: 4: Hoare triple {9253#(<= ~counter~0 0)} call #t~ret7 := main(); {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {9253#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,530 INFO L272 TraceCheckUtils]: 6: Hoare triple {9253#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {9253#(<= ~counter~0 0)} ~cond := #in~cond; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {9253#(<= ~counter~0 0)} assume !(0 == ~cond); {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,531 INFO L290 TraceCheckUtils]: 9: Hoare triple {9253#(<= ~counter~0 0)} assume true; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9253#(<= ~counter~0 0)} {9253#(<= ~counter~0 0)} #59#return; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,532 INFO L272 TraceCheckUtils]: 11: Hoare triple {9253#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {9253#(<= ~counter~0 0)} ~cond := #in~cond; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {9253#(<= ~counter~0 0)} assume !(0 == ~cond); {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {9253#(<= ~counter~0 0)} assume true; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,533 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9253#(<= ~counter~0 0)} {9253#(<= ~counter~0 0)} #61#return; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {9253#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:11,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {9253#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:11,534 INFO L290 TraceCheckUtils]: 18: Hoare triple {9302#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {9302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:11,535 INFO L272 TraceCheckUtils]: 19: Hoare triple {9302#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:11,535 INFO L290 TraceCheckUtils]: 20: Hoare triple {9302#(<= ~counter~0 1)} ~cond := #in~cond; {9302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:11,535 INFO L290 TraceCheckUtils]: 21: Hoare triple {9302#(<= ~counter~0 1)} assume !(0 == ~cond); {9302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:11,535 INFO L290 TraceCheckUtils]: 22: Hoare triple {9302#(<= ~counter~0 1)} assume true; {9302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:11,536 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9302#(<= ~counter~0 1)} {9302#(<= ~counter~0 1)} #63#return; {9302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:11,536 INFO L290 TraceCheckUtils]: 24: Hoare triple {9302#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:11,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {9302#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:11,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {9302#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:11,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {9330#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {9330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:11,538 INFO L272 TraceCheckUtils]: 28: Hoare triple {9330#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:11,538 INFO L290 TraceCheckUtils]: 29: Hoare triple {9330#(<= ~counter~0 2)} ~cond := #in~cond; {9330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:11,538 INFO L290 TraceCheckUtils]: 30: Hoare triple {9330#(<= ~counter~0 2)} assume !(0 == ~cond); {9330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:11,539 INFO L290 TraceCheckUtils]: 31: Hoare triple {9330#(<= ~counter~0 2)} assume true; {9330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:11,539 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9330#(<= ~counter~0 2)} {9330#(<= ~counter~0 2)} #63#return; {9330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:11,539 INFO L290 TraceCheckUtils]: 33: Hoare triple {9330#(<= ~counter~0 2)} assume !!(0 != ~r~0); {9330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:11,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {9330#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:11,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {9330#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:11,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {9358#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {9358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:11,541 INFO L272 TraceCheckUtils]: 37: Hoare triple {9358#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:11,541 INFO L290 TraceCheckUtils]: 38: Hoare triple {9358#(<= ~counter~0 3)} ~cond := #in~cond; {9358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:11,541 INFO L290 TraceCheckUtils]: 39: Hoare triple {9358#(<= ~counter~0 3)} assume !(0 == ~cond); {9358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:11,542 INFO L290 TraceCheckUtils]: 40: Hoare triple {9358#(<= ~counter~0 3)} assume true; {9358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:11,542 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9358#(<= ~counter~0 3)} {9358#(<= ~counter~0 3)} #63#return; {9358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:11,543 INFO L290 TraceCheckUtils]: 42: Hoare triple {9358#(<= ~counter~0 3)} assume !!(0 != ~r~0); {9358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:11,543 INFO L290 TraceCheckUtils]: 43: Hoare triple {9358#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:11,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {9358#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:11,544 INFO L290 TraceCheckUtils]: 45: Hoare triple {9386#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {9386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:11,544 INFO L272 TraceCheckUtils]: 46: Hoare triple {9386#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:11,544 INFO L290 TraceCheckUtils]: 47: Hoare triple {9386#(<= ~counter~0 4)} ~cond := #in~cond; {9386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:11,545 INFO L290 TraceCheckUtils]: 48: Hoare triple {9386#(<= ~counter~0 4)} assume !(0 == ~cond); {9386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:11,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {9386#(<= ~counter~0 4)} assume true; {9386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:11,546 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9386#(<= ~counter~0 4)} {9386#(<= ~counter~0 4)} #63#return; {9386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:11,547 INFO L290 TraceCheckUtils]: 51: Hoare triple {9386#(<= ~counter~0 4)} assume !!(0 != ~r~0); {9386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:11,547 INFO L290 TraceCheckUtils]: 52: Hoare triple {9386#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:11,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {9386#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:11,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {9414#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {9414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:11,549 INFO L272 TraceCheckUtils]: 55: Hoare triple {9414#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:11,550 INFO L290 TraceCheckUtils]: 56: Hoare triple {9414#(<= ~counter~0 5)} ~cond := #in~cond; {9414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:11,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {9414#(<= ~counter~0 5)} assume !(0 == ~cond); {9414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:11,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {9414#(<= ~counter~0 5)} assume true; {9414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:11,551 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9414#(<= ~counter~0 5)} {9414#(<= ~counter~0 5)} #63#return; {9414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:11,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {9414#(<= ~counter~0 5)} assume !!(0 != ~r~0); {9414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:11,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {9414#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:11,553 INFO L290 TraceCheckUtils]: 62: Hoare triple {9414#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:11,553 INFO L290 TraceCheckUtils]: 63: Hoare triple {9442#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {9442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:11,554 INFO L272 TraceCheckUtils]: 64: Hoare triple {9442#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:11,554 INFO L290 TraceCheckUtils]: 65: Hoare triple {9442#(<= ~counter~0 6)} ~cond := #in~cond; {9442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:11,555 INFO L290 TraceCheckUtils]: 66: Hoare triple {9442#(<= ~counter~0 6)} assume !(0 == ~cond); {9442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:11,555 INFO L290 TraceCheckUtils]: 67: Hoare triple {9442#(<= ~counter~0 6)} assume true; {9442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:11,556 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9442#(<= ~counter~0 6)} {9442#(<= ~counter~0 6)} #63#return; {9442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:11,556 INFO L290 TraceCheckUtils]: 69: Hoare triple {9442#(<= ~counter~0 6)} assume !!(0 != ~r~0); {9442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:11,557 INFO L290 TraceCheckUtils]: 70: Hoare triple {9442#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:11,557 INFO L290 TraceCheckUtils]: 71: Hoare triple {9442#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:11,558 INFO L290 TraceCheckUtils]: 72: Hoare triple {9470#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {9470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:11,558 INFO L272 TraceCheckUtils]: 73: Hoare triple {9470#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:11,559 INFO L290 TraceCheckUtils]: 74: Hoare triple {9470#(<= ~counter~0 7)} ~cond := #in~cond; {9470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:11,559 INFO L290 TraceCheckUtils]: 75: Hoare triple {9470#(<= ~counter~0 7)} assume !(0 == ~cond); {9470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:11,560 INFO L290 TraceCheckUtils]: 76: Hoare triple {9470#(<= ~counter~0 7)} assume true; {9470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:11,560 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {9470#(<= ~counter~0 7)} {9470#(<= ~counter~0 7)} #63#return; {9470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:11,561 INFO L290 TraceCheckUtils]: 78: Hoare triple {9470#(<= ~counter~0 7)} assume !!(0 != ~r~0); {9470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:11,561 INFO L290 TraceCheckUtils]: 79: Hoare triple {9470#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:11,562 INFO L290 TraceCheckUtils]: 80: Hoare triple {9470#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:11,562 INFO L290 TraceCheckUtils]: 81: Hoare triple {9498#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {9498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:11,563 INFO L272 TraceCheckUtils]: 82: Hoare triple {9498#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:11,563 INFO L290 TraceCheckUtils]: 83: Hoare triple {9498#(<= ~counter~0 8)} ~cond := #in~cond; {9498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:11,564 INFO L290 TraceCheckUtils]: 84: Hoare triple {9498#(<= ~counter~0 8)} assume !(0 == ~cond); {9498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:11,564 INFO L290 TraceCheckUtils]: 85: Hoare triple {9498#(<= ~counter~0 8)} assume true; {9498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:11,565 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9498#(<= ~counter~0 8)} {9498#(<= ~counter~0 8)} #63#return; {9498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:11,565 INFO L290 TraceCheckUtils]: 87: Hoare triple {9498#(<= ~counter~0 8)} assume !!(0 != ~r~0); {9498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:11,566 INFO L290 TraceCheckUtils]: 88: Hoare triple {9498#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:11,566 INFO L290 TraceCheckUtils]: 89: Hoare triple {9498#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:11,567 INFO L290 TraceCheckUtils]: 90: Hoare triple {9526#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:11,567 INFO L272 TraceCheckUtils]: 91: Hoare triple {9526#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:11,568 INFO L290 TraceCheckUtils]: 92: Hoare triple {9526#(<= ~counter~0 9)} ~cond := #in~cond; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:11,568 INFO L290 TraceCheckUtils]: 93: Hoare triple {9526#(<= ~counter~0 9)} assume !(0 == ~cond); {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:11,568 INFO L290 TraceCheckUtils]: 94: Hoare triple {9526#(<= ~counter~0 9)} assume true; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:11,569 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9526#(<= ~counter~0 9)} {9526#(<= ~counter~0 9)} #63#return; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:11,569 INFO L290 TraceCheckUtils]: 96: Hoare triple {9526#(<= ~counter~0 9)} assume !!(0 != ~r~0); {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:11,570 INFO L290 TraceCheckUtils]: 97: Hoare triple {9526#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:11,570 INFO L290 TraceCheckUtils]: 98: Hoare triple {9526#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:11,571 INFO L290 TraceCheckUtils]: 99: Hoare triple {9554#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:11,571 INFO L272 TraceCheckUtils]: 100: Hoare triple {9554#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:11,572 INFO L290 TraceCheckUtils]: 101: Hoare triple {9554#(<= ~counter~0 10)} ~cond := #in~cond; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:11,572 INFO L290 TraceCheckUtils]: 102: Hoare triple {9554#(<= ~counter~0 10)} assume !(0 == ~cond); {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:11,572 INFO L290 TraceCheckUtils]: 103: Hoare triple {9554#(<= ~counter~0 10)} assume true; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:11,573 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {9554#(<= ~counter~0 10)} {9554#(<= ~counter~0 10)} #63#return; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:11,574 INFO L290 TraceCheckUtils]: 105: Hoare triple {9554#(<= ~counter~0 10)} assume !!(0 != ~r~0); {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:11,574 INFO L290 TraceCheckUtils]: 106: Hoare triple {9554#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:11,574 INFO L290 TraceCheckUtils]: 107: Hoare triple {9554#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9582#(<= |main_#t~post6| 10)} is VALID [2022-04-28 06:03:11,575 INFO L290 TraceCheckUtils]: 108: Hoare triple {9582#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {9246#false} is VALID [2022-04-28 06:03:11,575 INFO L272 TraceCheckUtils]: 109: Hoare triple {9246#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9246#false} is VALID [2022-04-28 06:03:11,575 INFO L290 TraceCheckUtils]: 110: Hoare triple {9246#false} ~cond := #in~cond; {9246#false} is VALID [2022-04-28 06:03:11,575 INFO L290 TraceCheckUtils]: 111: Hoare triple {9246#false} assume 0 == ~cond; {9246#false} is VALID [2022-04-28 06:03:11,575 INFO L290 TraceCheckUtils]: 112: Hoare triple {9246#false} assume !false; {9246#false} is VALID [2022-04-28 06:03:11,576 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 425 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:11,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:12,279 INFO L290 TraceCheckUtils]: 112: Hoare triple {9246#false} assume !false; {9246#false} is VALID [2022-04-28 06:03:12,279 INFO L290 TraceCheckUtils]: 111: Hoare triple {9246#false} assume 0 == ~cond; {9246#false} is VALID [2022-04-28 06:03:12,279 INFO L290 TraceCheckUtils]: 110: Hoare triple {9246#false} ~cond := #in~cond; {9246#false} is VALID [2022-04-28 06:03:12,279 INFO L272 TraceCheckUtils]: 109: Hoare triple {9246#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9246#false} is VALID [2022-04-28 06:03:12,280 INFO L290 TraceCheckUtils]: 108: Hoare triple {9610#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {9246#false} is VALID [2022-04-28 06:03:12,280 INFO L290 TraceCheckUtils]: 107: Hoare triple {9614#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9610#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:03:12,281 INFO L290 TraceCheckUtils]: 106: Hoare triple {9614#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9614#(< ~counter~0 20)} is VALID [2022-04-28 06:03:12,281 INFO L290 TraceCheckUtils]: 105: Hoare triple {9614#(< ~counter~0 20)} assume !!(0 != ~r~0); {9614#(< ~counter~0 20)} is VALID [2022-04-28 06:03:12,282 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {9245#true} {9614#(< ~counter~0 20)} #63#return; {9614#(< ~counter~0 20)} is VALID [2022-04-28 06:03:12,282 INFO L290 TraceCheckUtils]: 103: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,282 INFO L290 TraceCheckUtils]: 102: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,282 INFO L290 TraceCheckUtils]: 101: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,282 INFO L272 TraceCheckUtils]: 100: Hoare triple {9614#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,283 INFO L290 TraceCheckUtils]: 99: Hoare triple {9614#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {9614#(< ~counter~0 20)} is VALID [2022-04-28 06:03:12,283 INFO L290 TraceCheckUtils]: 98: Hoare triple {9642#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9614#(< ~counter~0 20)} is VALID [2022-04-28 06:03:12,284 INFO L290 TraceCheckUtils]: 97: Hoare triple {9642#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9642#(< ~counter~0 19)} is VALID [2022-04-28 06:03:12,284 INFO L290 TraceCheckUtils]: 96: Hoare triple {9642#(< ~counter~0 19)} assume !!(0 != ~r~0); {9642#(< ~counter~0 19)} is VALID [2022-04-28 06:03:12,285 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9245#true} {9642#(< ~counter~0 19)} #63#return; {9642#(< ~counter~0 19)} is VALID [2022-04-28 06:03:12,285 INFO L290 TraceCheckUtils]: 94: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,285 INFO L290 TraceCheckUtils]: 93: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,285 INFO L290 TraceCheckUtils]: 92: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,285 INFO L272 TraceCheckUtils]: 91: Hoare triple {9642#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,286 INFO L290 TraceCheckUtils]: 90: Hoare triple {9642#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {9642#(< ~counter~0 19)} is VALID [2022-04-28 06:03:12,286 INFO L290 TraceCheckUtils]: 89: Hoare triple {9670#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9642#(< ~counter~0 19)} is VALID [2022-04-28 06:03:12,287 INFO L290 TraceCheckUtils]: 88: Hoare triple {9670#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9670#(< ~counter~0 18)} is VALID [2022-04-28 06:03:12,287 INFO L290 TraceCheckUtils]: 87: Hoare triple {9670#(< ~counter~0 18)} assume !!(0 != ~r~0); {9670#(< ~counter~0 18)} is VALID [2022-04-28 06:03:12,288 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9245#true} {9670#(< ~counter~0 18)} #63#return; {9670#(< ~counter~0 18)} is VALID [2022-04-28 06:03:12,288 INFO L290 TraceCheckUtils]: 85: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,288 INFO L290 TraceCheckUtils]: 84: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,288 INFO L290 TraceCheckUtils]: 83: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,288 INFO L272 TraceCheckUtils]: 82: Hoare triple {9670#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,289 INFO L290 TraceCheckUtils]: 81: Hoare triple {9670#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {9670#(< ~counter~0 18)} is VALID [2022-04-28 06:03:12,289 INFO L290 TraceCheckUtils]: 80: Hoare triple {9698#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9670#(< ~counter~0 18)} is VALID [2022-04-28 06:03:12,290 INFO L290 TraceCheckUtils]: 79: Hoare triple {9698#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9698#(< ~counter~0 17)} is VALID [2022-04-28 06:03:12,290 INFO L290 TraceCheckUtils]: 78: Hoare triple {9698#(< ~counter~0 17)} assume !!(0 != ~r~0); {9698#(< ~counter~0 17)} is VALID [2022-04-28 06:03:12,291 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {9245#true} {9698#(< ~counter~0 17)} #63#return; {9698#(< ~counter~0 17)} is VALID [2022-04-28 06:03:12,291 INFO L290 TraceCheckUtils]: 76: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,291 INFO L290 TraceCheckUtils]: 75: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,291 INFO L290 TraceCheckUtils]: 74: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,291 INFO L272 TraceCheckUtils]: 73: Hoare triple {9698#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,291 INFO L290 TraceCheckUtils]: 72: Hoare triple {9698#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {9698#(< ~counter~0 17)} is VALID [2022-04-28 06:03:12,292 INFO L290 TraceCheckUtils]: 71: Hoare triple {9726#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9698#(< ~counter~0 17)} is VALID [2022-04-28 06:03:12,292 INFO L290 TraceCheckUtils]: 70: Hoare triple {9726#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9726#(< ~counter~0 16)} is VALID [2022-04-28 06:03:12,293 INFO L290 TraceCheckUtils]: 69: Hoare triple {9726#(< ~counter~0 16)} assume !!(0 != ~r~0); {9726#(< ~counter~0 16)} is VALID [2022-04-28 06:03:12,294 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9245#true} {9726#(< ~counter~0 16)} #63#return; {9726#(< ~counter~0 16)} is VALID [2022-04-28 06:03:12,294 INFO L290 TraceCheckUtils]: 67: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,294 INFO L290 TraceCheckUtils]: 66: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,294 INFO L290 TraceCheckUtils]: 65: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,294 INFO L272 TraceCheckUtils]: 64: Hoare triple {9726#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,294 INFO L290 TraceCheckUtils]: 63: Hoare triple {9726#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {9726#(< ~counter~0 16)} is VALID [2022-04-28 06:03:12,295 INFO L290 TraceCheckUtils]: 62: Hoare triple {9754#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9726#(< ~counter~0 16)} is VALID [2022-04-28 06:03:12,295 INFO L290 TraceCheckUtils]: 61: Hoare triple {9754#(< ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9754#(< ~counter~0 15)} is VALID [2022-04-28 06:03:12,296 INFO L290 TraceCheckUtils]: 60: Hoare triple {9754#(< ~counter~0 15)} assume !!(0 != ~r~0); {9754#(< ~counter~0 15)} is VALID [2022-04-28 06:03:12,297 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9245#true} {9754#(< ~counter~0 15)} #63#return; {9754#(< ~counter~0 15)} is VALID [2022-04-28 06:03:12,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,297 INFO L290 TraceCheckUtils]: 56: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,297 INFO L272 TraceCheckUtils]: 55: Hoare triple {9754#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {9754#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {9754#(< ~counter~0 15)} is VALID [2022-04-28 06:03:12,298 INFO L290 TraceCheckUtils]: 53: Hoare triple {9782#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9754#(< ~counter~0 15)} is VALID [2022-04-28 06:03:12,298 INFO L290 TraceCheckUtils]: 52: Hoare triple {9782#(< ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9782#(< ~counter~0 14)} is VALID [2022-04-28 06:03:12,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {9782#(< ~counter~0 14)} assume !!(0 != ~r~0); {9782#(< ~counter~0 14)} is VALID [2022-04-28 06:03:12,299 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9245#true} {9782#(< ~counter~0 14)} #63#return; {9782#(< ~counter~0 14)} is VALID [2022-04-28 06:03:12,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,300 INFO L290 TraceCheckUtils]: 47: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,300 INFO L272 TraceCheckUtils]: 46: Hoare triple {9782#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,300 INFO L290 TraceCheckUtils]: 45: Hoare triple {9782#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {9782#(< ~counter~0 14)} is VALID [2022-04-28 06:03:12,300 INFO L290 TraceCheckUtils]: 44: Hoare triple {9810#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9782#(< ~counter~0 14)} is VALID [2022-04-28 06:03:12,301 INFO L290 TraceCheckUtils]: 43: Hoare triple {9810#(< ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9810#(< ~counter~0 13)} is VALID [2022-04-28 06:03:12,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {9810#(< ~counter~0 13)} assume !!(0 != ~r~0); {9810#(< ~counter~0 13)} is VALID [2022-04-28 06:03:12,301 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9245#true} {9810#(< ~counter~0 13)} #63#return; {9810#(< ~counter~0 13)} is VALID [2022-04-28 06:03:12,302 INFO L290 TraceCheckUtils]: 40: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,302 INFO L290 TraceCheckUtils]: 39: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,302 INFO L290 TraceCheckUtils]: 38: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,302 INFO L272 TraceCheckUtils]: 37: Hoare triple {9810#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,302 INFO L290 TraceCheckUtils]: 36: Hoare triple {9810#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {9810#(< ~counter~0 13)} is VALID [2022-04-28 06:03:12,302 INFO L290 TraceCheckUtils]: 35: Hoare triple {9838#(< ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9810#(< ~counter~0 13)} is VALID [2022-04-28 06:03:12,303 INFO L290 TraceCheckUtils]: 34: Hoare triple {9838#(< ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9838#(< ~counter~0 12)} is VALID [2022-04-28 06:03:12,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {9838#(< ~counter~0 12)} assume !!(0 != ~r~0); {9838#(< ~counter~0 12)} is VALID [2022-04-28 06:03:12,304 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9245#true} {9838#(< ~counter~0 12)} #63#return; {9838#(< ~counter~0 12)} is VALID [2022-04-28 06:03:12,304 INFO L290 TraceCheckUtils]: 31: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,304 INFO L272 TraceCheckUtils]: 28: Hoare triple {9838#(< ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,304 INFO L290 TraceCheckUtils]: 27: Hoare triple {9838#(< ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {9838#(< ~counter~0 12)} is VALID [2022-04-28 06:03:12,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {9554#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9838#(< ~counter~0 12)} is VALID [2022-04-28 06:03:12,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {9554#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:12,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {9554#(<= ~counter~0 10)} assume !!(0 != ~r~0); {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:12,306 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9245#true} {9554#(<= ~counter~0 10)} #63#return; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:12,306 INFO L290 TraceCheckUtils]: 22: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,306 INFO L290 TraceCheckUtils]: 21: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,306 INFO L290 TraceCheckUtils]: 20: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,306 INFO L272 TraceCheckUtils]: 19: Hoare triple {9554#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,306 INFO L290 TraceCheckUtils]: 18: Hoare triple {9554#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:12,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {9526#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:12,307 INFO L290 TraceCheckUtils]: 16: Hoare triple {9526#(<= ~counter~0 9)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:12,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9245#true} {9526#(<= ~counter~0 9)} #61#return; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:12,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,308 INFO L290 TraceCheckUtils]: 12: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,308 INFO L272 TraceCheckUtils]: 11: Hoare triple {9526#(<= ~counter~0 9)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,308 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9245#true} {9526#(<= ~counter~0 9)} #59#return; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:12,308 INFO L290 TraceCheckUtils]: 9: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-28 06:03:12,308 INFO L290 TraceCheckUtils]: 8: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-28 06:03:12,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-28 06:03:12,308 INFO L272 TraceCheckUtils]: 6: Hoare triple {9526#(<= ~counter~0 9)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9245#true} is VALID [2022-04-28 06:03:12,309 INFO L290 TraceCheckUtils]: 5: Hoare triple {9526#(<= ~counter~0 9)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:12,309 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#(<= ~counter~0 9)} call #t~ret7 := main(); {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:12,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#(<= ~counter~0 9)} {9245#true} #67#return; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:12,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#(<= ~counter~0 9)} assume true; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:12,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {9245#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; {9526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:12,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {9245#true} call ULTIMATE.init(); {9245#true} is VALID [2022-04-28 06:03:12,310 INFO L134 CoverageAnalysis]: Checked inductivity of 449 backedges. 20 proven. 245 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-28 06:03:12,311 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:12,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616856554] [2022-04-28 06:03:12,311 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:12,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [994307166] [2022-04-28 06:03:12,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [994307166] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:12,311 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:12,311 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-28 06:03:12,311 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:12,311 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1080869483] [2022-04-28 06:03:12,311 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1080869483] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:12,312 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:12,312 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-28 06:03:12,312 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041232168] [2022-04-28 06:03:12,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:12,312 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, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 113 [2022-04-28 06:03:12,313 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:12,313 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, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 06:03:12,389 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:12,390 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-28 06:03:12,390 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:12,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-28 06:03:12,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:03:12,390 INFO L87 Difference]: Start difference. First operand 110 states and 121 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, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 06:03:12,827 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:12,828 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2022-04-28 06:03:12,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-28 06:03:12,828 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, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) Word has length 113 [2022-04-28 06:03:12,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:12,829 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, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 06:03:12,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 135 transitions. [2022-04-28 06:03:12,832 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, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 06:03:12,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 135 transitions. [2022-04-28 06:03:12,835 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 135 transitions. [2022-04-28 06:03:12,928 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-28 06:03:12,929 INFO L225 Difference]: With dead ends: 124 [2022-04-28 06:03:12,930 INFO L226 Difference]: Without dead ends: 119 [2022-04-28 06:03:12,930 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=466, Invalid=656, Unknown=0, NotChecked=0, Total=1122 [2022-04-28 06:03:12,931 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 35 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:12,931 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 168 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:03:12,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-28 06:03:13,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-04-28 06:03:13,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:13,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 06:03:13,059 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 06:03:13,060 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 06:03:13,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:13,061 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-04-28 06:03:13,062 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-04-28 06:03:13,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:13,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:13,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 119 states. [2022-04-28 06:03:13,063 INFO L87 Difference]: Start difference. First operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 119 states. [2022-04-28 06:03:13,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:13,065 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-04-28 06:03:13,065 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-04-28 06:03:13,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:13,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:13,066 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:13,066 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:13,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 89 states have (on average 1.1348314606741574) internal successors, (101), 89 states have internal predecessors, (101), 16 states have call successors, (16), 15 states have call predecessors, (16), 13 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-28 06:03:13,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2022-04-28 06:03:13,068 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 113 [2022-04-28 06:03:13,068 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:13,069 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2022-04-28 06:03:13,069 INFO L496 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, (15), 13 states have call predecessors, (15), 11 states have return successors, (13), 11 states have call predecessors, (13), 12 states have call successors, (13) [2022-04-28 06:03:13,069 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 131 transitions. [2022-04-28 06:03:14,654 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:14,655 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-04-28 06:03:14,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-28 06:03:14,655 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:14,656 INFO L195 NwaCegarLoop]: trace histogram [12, 12, 11, 11, 11, 11, 11, 11, 11, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:14,678 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-28 06:03:14,878 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:14,879 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:14,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:14,879 INFO L85 PathProgramCache]: Analyzing trace with hash 1999651676, now seen corresponding path program 21 times [2022-04-28 06:03:14,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:14,879 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1715800631] [2022-04-28 06:03:14,880 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:14,880 INFO L85 PathProgramCache]: Analyzing trace with hash 1999651676, now seen corresponding path program 22 times [2022-04-28 06:03:14,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:14,880 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [829302469] [2022-04-28 06:03:14,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:14,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:14,896 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:14,896 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [946010151] [2022-04-28 06:03:14,896 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:03:14,896 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:14,896 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:14,897 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:14,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-28 06:03:14,973 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:03:14,974 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:14,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-28 06:03:14,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:15,001 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:15,590 INFO L272 TraceCheckUtils]: 0: Hoare triple {10690#true} call ULTIMATE.init(); {10690#true} is VALID [2022-04-28 06:03:15,590 INFO L290 TraceCheckUtils]: 1: Hoare triple {10690#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; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,591 INFO L290 TraceCheckUtils]: 2: Hoare triple {10698#(<= ~counter~0 0)} assume true; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,591 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10698#(<= ~counter~0 0)} {10690#true} #67#return; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,591 INFO L272 TraceCheckUtils]: 4: Hoare triple {10698#(<= ~counter~0 0)} call #t~ret7 := main(); {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,592 INFO L290 TraceCheckUtils]: 5: Hoare triple {10698#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,592 INFO L272 TraceCheckUtils]: 6: Hoare triple {10698#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,592 INFO L290 TraceCheckUtils]: 7: Hoare triple {10698#(<= ~counter~0 0)} ~cond := #in~cond; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,593 INFO L290 TraceCheckUtils]: 8: Hoare triple {10698#(<= ~counter~0 0)} assume !(0 == ~cond); {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,593 INFO L290 TraceCheckUtils]: 9: Hoare triple {10698#(<= ~counter~0 0)} assume true; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,593 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10698#(<= ~counter~0 0)} {10698#(<= ~counter~0 0)} #59#return; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,594 INFO L272 TraceCheckUtils]: 11: Hoare triple {10698#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {10698#(<= ~counter~0 0)} ~cond := #in~cond; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,599 INFO L290 TraceCheckUtils]: 13: Hoare triple {10698#(<= ~counter~0 0)} assume !(0 == ~cond); {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,599 INFO L290 TraceCheckUtils]: 14: Hoare triple {10698#(<= ~counter~0 0)} assume true; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,600 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10698#(<= ~counter~0 0)} {10698#(<= ~counter~0 0)} #61#return; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {10698#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10698#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:15,601 INFO L290 TraceCheckUtils]: 17: Hoare triple {10698#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10747#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:15,601 INFO L290 TraceCheckUtils]: 18: Hoare triple {10747#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {10747#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:15,602 INFO L272 TraceCheckUtils]: 19: Hoare triple {10747#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10747#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:15,602 INFO L290 TraceCheckUtils]: 20: Hoare triple {10747#(<= ~counter~0 1)} ~cond := #in~cond; {10747#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:15,602 INFO L290 TraceCheckUtils]: 21: Hoare triple {10747#(<= ~counter~0 1)} assume !(0 == ~cond); {10747#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:15,603 INFO L290 TraceCheckUtils]: 22: Hoare triple {10747#(<= ~counter~0 1)} assume true; {10747#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:15,603 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10747#(<= ~counter~0 1)} {10747#(<= ~counter~0 1)} #63#return; {10747#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:15,604 INFO L290 TraceCheckUtils]: 24: Hoare triple {10747#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10747#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:15,604 INFO L290 TraceCheckUtils]: 25: Hoare triple {10747#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10747#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:15,605 INFO L290 TraceCheckUtils]: 26: Hoare triple {10747#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10775#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:15,605 INFO L290 TraceCheckUtils]: 27: Hoare triple {10775#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {10775#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:15,606 INFO L272 TraceCheckUtils]: 28: Hoare triple {10775#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10775#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:15,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {10775#(<= ~counter~0 2)} ~cond := #in~cond; {10775#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:15,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {10775#(<= ~counter~0 2)} assume !(0 == ~cond); {10775#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:15,607 INFO L290 TraceCheckUtils]: 31: Hoare triple {10775#(<= ~counter~0 2)} assume true; {10775#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:15,607 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10775#(<= ~counter~0 2)} {10775#(<= ~counter~0 2)} #63#return; {10775#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:15,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {10775#(<= ~counter~0 2)} assume !!(0 != ~r~0); {10775#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:15,608 INFO L290 TraceCheckUtils]: 34: Hoare triple {10775#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10775#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:15,608 INFO L290 TraceCheckUtils]: 35: Hoare triple {10775#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10803#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:15,609 INFO L290 TraceCheckUtils]: 36: Hoare triple {10803#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {10803#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:15,609 INFO L272 TraceCheckUtils]: 37: Hoare triple {10803#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10803#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:15,610 INFO L290 TraceCheckUtils]: 38: Hoare triple {10803#(<= ~counter~0 3)} ~cond := #in~cond; {10803#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:15,610 INFO L290 TraceCheckUtils]: 39: Hoare triple {10803#(<= ~counter~0 3)} assume !(0 == ~cond); {10803#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:15,610 INFO L290 TraceCheckUtils]: 40: Hoare triple {10803#(<= ~counter~0 3)} assume true; {10803#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:15,611 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10803#(<= ~counter~0 3)} {10803#(<= ~counter~0 3)} #63#return; {10803#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:15,611 INFO L290 TraceCheckUtils]: 42: Hoare triple {10803#(<= ~counter~0 3)} assume !!(0 != ~r~0); {10803#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:15,612 INFO L290 TraceCheckUtils]: 43: Hoare triple {10803#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10803#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:15,612 INFO L290 TraceCheckUtils]: 44: Hoare triple {10803#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10831#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:15,612 INFO L290 TraceCheckUtils]: 45: Hoare triple {10831#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {10831#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:15,613 INFO L272 TraceCheckUtils]: 46: Hoare triple {10831#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10831#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:15,613 INFO L290 TraceCheckUtils]: 47: Hoare triple {10831#(<= ~counter~0 4)} ~cond := #in~cond; {10831#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:15,614 INFO L290 TraceCheckUtils]: 48: Hoare triple {10831#(<= ~counter~0 4)} assume !(0 == ~cond); {10831#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:15,614 INFO L290 TraceCheckUtils]: 49: Hoare triple {10831#(<= ~counter~0 4)} assume true; {10831#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:15,615 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10831#(<= ~counter~0 4)} {10831#(<= ~counter~0 4)} #63#return; {10831#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:15,615 INFO L290 TraceCheckUtils]: 51: Hoare triple {10831#(<= ~counter~0 4)} assume !!(0 != ~r~0); {10831#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:15,615 INFO L290 TraceCheckUtils]: 52: Hoare triple {10831#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10831#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:15,616 INFO L290 TraceCheckUtils]: 53: Hoare triple {10831#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10859#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:15,616 INFO L290 TraceCheckUtils]: 54: Hoare triple {10859#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {10859#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:15,617 INFO L272 TraceCheckUtils]: 55: Hoare triple {10859#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10859#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:15,618 INFO L290 TraceCheckUtils]: 56: Hoare triple {10859#(<= ~counter~0 5)} ~cond := #in~cond; {10859#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:15,618 INFO L290 TraceCheckUtils]: 57: Hoare triple {10859#(<= ~counter~0 5)} assume !(0 == ~cond); {10859#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:15,618 INFO L290 TraceCheckUtils]: 58: Hoare triple {10859#(<= ~counter~0 5)} assume true; {10859#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:15,619 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10859#(<= ~counter~0 5)} {10859#(<= ~counter~0 5)} #63#return; {10859#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:15,619 INFO L290 TraceCheckUtils]: 60: Hoare triple {10859#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10859#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:15,619 INFO L290 TraceCheckUtils]: 61: Hoare triple {10859#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10859#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:15,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {10859#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10887#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:15,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {10887#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {10887#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:15,621 INFO L272 TraceCheckUtils]: 64: Hoare triple {10887#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10887#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:15,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {10887#(<= ~counter~0 6)} ~cond := #in~cond; {10887#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:15,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {10887#(<= ~counter~0 6)} assume !(0 == ~cond); {10887#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:15,622 INFO L290 TraceCheckUtils]: 67: Hoare triple {10887#(<= ~counter~0 6)} assume true; {10887#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:15,622 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10887#(<= ~counter~0 6)} {10887#(<= ~counter~0 6)} #63#return; {10887#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:15,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {10887#(<= ~counter~0 6)} assume !!(0 != ~r~0); {10887#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:15,623 INFO L290 TraceCheckUtils]: 70: Hoare triple {10887#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10887#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:15,623 INFO L290 TraceCheckUtils]: 71: Hoare triple {10887#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10915#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:15,623 INFO L290 TraceCheckUtils]: 72: Hoare triple {10915#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {10915#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:15,624 INFO L272 TraceCheckUtils]: 73: Hoare triple {10915#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10915#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:15,624 INFO L290 TraceCheckUtils]: 74: Hoare triple {10915#(<= ~counter~0 7)} ~cond := #in~cond; {10915#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:15,624 INFO L290 TraceCheckUtils]: 75: Hoare triple {10915#(<= ~counter~0 7)} assume !(0 == ~cond); {10915#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:15,625 INFO L290 TraceCheckUtils]: 76: Hoare triple {10915#(<= ~counter~0 7)} assume true; {10915#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:15,625 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {10915#(<= ~counter~0 7)} {10915#(<= ~counter~0 7)} #63#return; {10915#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:15,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {10915#(<= ~counter~0 7)} assume !!(0 != ~r~0); {10915#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:15,626 INFO L290 TraceCheckUtils]: 79: Hoare triple {10915#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10915#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:15,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {10915#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:15,626 INFO L290 TraceCheckUtils]: 81: Hoare triple {10943#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:15,627 INFO L272 TraceCheckUtils]: 82: Hoare triple {10943#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:15,627 INFO L290 TraceCheckUtils]: 83: Hoare triple {10943#(<= ~counter~0 8)} ~cond := #in~cond; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:15,627 INFO L290 TraceCheckUtils]: 84: Hoare triple {10943#(<= ~counter~0 8)} assume !(0 == ~cond); {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:15,628 INFO L290 TraceCheckUtils]: 85: Hoare triple {10943#(<= ~counter~0 8)} assume true; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:15,628 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10943#(<= ~counter~0 8)} {10943#(<= ~counter~0 8)} #63#return; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:15,628 INFO L290 TraceCheckUtils]: 87: Hoare triple {10943#(<= ~counter~0 8)} assume !!(0 != ~r~0); {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:15,629 INFO L290 TraceCheckUtils]: 88: Hoare triple {10943#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:15,629 INFO L290 TraceCheckUtils]: 89: Hoare triple {10943#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:15,629 INFO L290 TraceCheckUtils]: 90: Hoare triple {10971#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:15,630 INFO L272 TraceCheckUtils]: 91: Hoare triple {10971#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:15,630 INFO L290 TraceCheckUtils]: 92: Hoare triple {10971#(<= ~counter~0 9)} ~cond := #in~cond; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:15,631 INFO L290 TraceCheckUtils]: 93: Hoare triple {10971#(<= ~counter~0 9)} assume !(0 == ~cond); {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:15,631 INFO L290 TraceCheckUtils]: 94: Hoare triple {10971#(<= ~counter~0 9)} assume true; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:15,631 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {10971#(<= ~counter~0 9)} {10971#(<= ~counter~0 9)} #63#return; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:15,632 INFO L290 TraceCheckUtils]: 96: Hoare triple {10971#(<= ~counter~0 9)} assume !!(0 != ~r~0); {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:15,632 INFO L290 TraceCheckUtils]: 97: Hoare triple {10971#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:15,632 INFO L290 TraceCheckUtils]: 98: Hoare triple {10971#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:15,633 INFO L290 TraceCheckUtils]: 99: Hoare triple {10999#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:15,633 INFO L272 TraceCheckUtils]: 100: Hoare triple {10999#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:15,633 INFO L290 TraceCheckUtils]: 101: Hoare triple {10999#(<= ~counter~0 10)} ~cond := #in~cond; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:15,634 INFO L290 TraceCheckUtils]: 102: Hoare triple {10999#(<= ~counter~0 10)} assume !(0 == ~cond); {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:15,634 INFO L290 TraceCheckUtils]: 103: Hoare triple {10999#(<= ~counter~0 10)} assume true; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:15,634 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10999#(<= ~counter~0 10)} {10999#(<= ~counter~0 10)} #63#return; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:15,635 INFO L290 TraceCheckUtils]: 105: Hoare triple {10999#(<= ~counter~0 10)} assume !!(0 != ~r~0); {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:15,635 INFO L290 TraceCheckUtils]: 106: Hoare triple {10999#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:15,635 INFO L290 TraceCheckUtils]: 107: Hoare triple {10999#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:15,636 INFO L290 TraceCheckUtils]: 108: Hoare triple {11027#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:15,636 INFO L272 TraceCheckUtils]: 109: Hoare triple {11027#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:15,637 INFO L290 TraceCheckUtils]: 110: Hoare triple {11027#(<= ~counter~0 11)} ~cond := #in~cond; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:15,637 INFO L290 TraceCheckUtils]: 111: Hoare triple {11027#(<= ~counter~0 11)} assume !(0 == ~cond); {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:15,637 INFO L290 TraceCheckUtils]: 112: Hoare triple {11027#(<= ~counter~0 11)} assume true; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:15,638 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {11027#(<= ~counter~0 11)} {11027#(<= ~counter~0 11)} #63#return; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:15,638 INFO L290 TraceCheckUtils]: 114: Hoare triple {11027#(<= ~counter~0 11)} assume !!(0 != ~r~0); {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:15,638 INFO L290 TraceCheckUtils]: 115: Hoare triple {11027#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:15,639 INFO L290 TraceCheckUtils]: 116: Hoare triple {11027#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11055#(<= |main_#t~post6| 11)} is VALID [2022-04-28 06:03:15,639 INFO L290 TraceCheckUtils]: 117: Hoare triple {11055#(<= |main_#t~post6| 11)} assume !(#t~post6 < 20);havoc #t~post6; {10691#false} is VALID [2022-04-28 06:03:15,639 INFO L272 TraceCheckUtils]: 118: Hoare triple {10691#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10691#false} is VALID [2022-04-28 06:03:15,639 INFO L290 TraceCheckUtils]: 119: Hoare triple {10691#false} ~cond := #in~cond; {10691#false} is VALID [2022-04-28 06:03:15,639 INFO L290 TraceCheckUtils]: 120: Hoare triple {10691#false} assume 0 == ~cond; {10691#false} is VALID [2022-04-28 06:03:15,639 INFO L290 TraceCheckUtils]: 121: Hoare triple {10691#false} assume !false; {10691#false} is VALID [2022-04-28 06:03:15,640 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 22 proven. 517 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:15,640 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:16,267 INFO L290 TraceCheckUtils]: 121: Hoare triple {10691#false} assume !false; {10691#false} is VALID [2022-04-28 06:03:16,267 INFO L290 TraceCheckUtils]: 120: Hoare triple {10691#false} assume 0 == ~cond; {10691#false} is VALID [2022-04-28 06:03:16,267 INFO L290 TraceCheckUtils]: 119: Hoare triple {10691#false} ~cond := #in~cond; {10691#false} is VALID [2022-04-28 06:03:16,267 INFO L272 TraceCheckUtils]: 118: Hoare triple {10691#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10691#false} is VALID [2022-04-28 06:03:16,268 INFO L290 TraceCheckUtils]: 117: Hoare triple {11083#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {10691#false} is VALID [2022-04-28 06:03:16,268 INFO L290 TraceCheckUtils]: 116: Hoare triple {11087#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11083#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:03:16,268 INFO L290 TraceCheckUtils]: 115: Hoare triple {11087#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11087#(< ~counter~0 20)} is VALID [2022-04-28 06:03:16,269 INFO L290 TraceCheckUtils]: 114: Hoare triple {11087#(< ~counter~0 20)} assume !!(0 != ~r~0); {11087#(< ~counter~0 20)} is VALID [2022-04-28 06:03:16,269 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {10690#true} {11087#(< ~counter~0 20)} #63#return; {11087#(< ~counter~0 20)} is VALID [2022-04-28 06:03:16,269 INFO L290 TraceCheckUtils]: 112: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,269 INFO L290 TraceCheckUtils]: 111: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,269 INFO L290 TraceCheckUtils]: 110: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,269 INFO L272 TraceCheckUtils]: 109: Hoare triple {11087#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,270 INFO L290 TraceCheckUtils]: 108: Hoare triple {11087#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {11087#(< ~counter~0 20)} is VALID [2022-04-28 06:03:16,270 INFO L290 TraceCheckUtils]: 107: Hoare triple {11115#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11087#(< ~counter~0 20)} is VALID [2022-04-28 06:03:16,271 INFO L290 TraceCheckUtils]: 106: Hoare triple {11115#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11115#(< ~counter~0 19)} is VALID [2022-04-28 06:03:16,271 INFO L290 TraceCheckUtils]: 105: Hoare triple {11115#(< ~counter~0 19)} assume !!(0 != ~r~0); {11115#(< ~counter~0 19)} is VALID [2022-04-28 06:03:16,271 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10690#true} {11115#(< ~counter~0 19)} #63#return; {11115#(< ~counter~0 19)} is VALID [2022-04-28 06:03:16,271 INFO L290 TraceCheckUtils]: 103: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,271 INFO L290 TraceCheckUtils]: 102: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,272 INFO L290 TraceCheckUtils]: 101: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,272 INFO L272 TraceCheckUtils]: 100: Hoare triple {11115#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,272 INFO L290 TraceCheckUtils]: 99: Hoare triple {11115#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {11115#(< ~counter~0 19)} is VALID [2022-04-28 06:03:16,273 INFO L290 TraceCheckUtils]: 98: Hoare triple {11143#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11115#(< ~counter~0 19)} is VALID [2022-04-28 06:03:16,273 INFO L290 TraceCheckUtils]: 97: Hoare triple {11143#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11143#(< ~counter~0 18)} is VALID [2022-04-28 06:03:16,273 INFO L290 TraceCheckUtils]: 96: Hoare triple {11143#(< ~counter~0 18)} assume !!(0 != ~r~0); {11143#(< ~counter~0 18)} is VALID [2022-04-28 06:03:16,274 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {10690#true} {11143#(< ~counter~0 18)} #63#return; {11143#(< ~counter~0 18)} is VALID [2022-04-28 06:03:16,274 INFO L290 TraceCheckUtils]: 94: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,274 INFO L290 TraceCheckUtils]: 93: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,274 INFO L290 TraceCheckUtils]: 92: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,274 INFO L272 TraceCheckUtils]: 91: Hoare triple {11143#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,275 INFO L290 TraceCheckUtils]: 90: Hoare triple {11143#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {11143#(< ~counter~0 18)} is VALID [2022-04-28 06:03:16,275 INFO L290 TraceCheckUtils]: 89: Hoare triple {11171#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11143#(< ~counter~0 18)} is VALID [2022-04-28 06:03:16,275 INFO L290 TraceCheckUtils]: 88: Hoare triple {11171#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11171#(< ~counter~0 17)} is VALID [2022-04-28 06:03:16,276 INFO L290 TraceCheckUtils]: 87: Hoare triple {11171#(< ~counter~0 17)} assume !!(0 != ~r~0); {11171#(< ~counter~0 17)} is VALID [2022-04-28 06:03:16,276 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10690#true} {11171#(< ~counter~0 17)} #63#return; {11171#(< ~counter~0 17)} is VALID [2022-04-28 06:03:16,276 INFO L290 TraceCheckUtils]: 85: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,276 INFO L290 TraceCheckUtils]: 84: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,276 INFO L290 TraceCheckUtils]: 83: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,276 INFO L272 TraceCheckUtils]: 82: Hoare triple {11171#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,277 INFO L290 TraceCheckUtils]: 81: Hoare triple {11171#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {11171#(< ~counter~0 17)} is VALID [2022-04-28 06:03:16,277 INFO L290 TraceCheckUtils]: 80: Hoare triple {11199#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11171#(< ~counter~0 17)} is VALID [2022-04-28 06:03:16,277 INFO L290 TraceCheckUtils]: 79: Hoare triple {11199#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11199#(< ~counter~0 16)} is VALID [2022-04-28 06:03:16,278 INFO L290 TraceCheckUtils]: 78: Hoare triple {11199#(< ~counter~0 16)} assume !!(0 != ~r~0); {11199#(< ~counter~0 16)} is VALID [2022-04-28 06:03:16,278 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {10690#true} {11199#(< ~counter~0 16)} #63#return; {11199#(< ~counter~0 16)} is VALID [2022-04-28 06:03:16,278 INFO L290 TraceCheckUtils]: 76: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,278 INFO L290 TraceCheckUtils]: 75: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,278 INFO L290 TraceCheckUtils]: 74: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,278 INFO L272 TraceCheckUtils]: 73: Hoare triple {11199#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,279 INFO L290 TraceCheckUtils]: 72: Hoare triple {11199#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {11199#(< ~counter~0 16)} is VALID [2022-04-28 06:03:16,279 INFO L290 TraceCheckUtils]: 71: Hoare triple {11227#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11199#(< ~counter~0 16)} is VALID [2022-04-28 06:03:16,279 INFO L290 TraceCheckUtils]: 70: Hoare triple {11227#(< ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11227#(< ~counter~0 15)} is VALID [2022-04-28 06:03:16,280 INFO L290 TraceCheckUtils]: 69: Hoare triple {11227#(< ~counter~0 15)} assume !!(0 != ~r~0); {11227#(< ~counter~0 15)} is VALID [2022-04-28 06:03:16,280 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10690#true} {11227#(< ~counter~0 15)} #63#return; {11227#(< ~counter~0 15)} is VALID [2022-04-28 06:03:16,280 INFO L290 TraceCheckUtils]: 67: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,280 INFO L290 TraceCheckUtils]: 66: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,280 INFO L290 TraceCheckUtils]: 65: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,280 INFO L272 TraceCheckUtils]: 64: Hoare triple {11227#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,281 INFO L290 TraceCheckUtils]: 63: Hoare triple {11227#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {11227#(< ~counter~0 15)} is VALID [2022-04-28 06:03:16,281 INFO L290 TraceCheckUtils]: 62: Hoare triple {11255#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11227#(< ~counter~0 15)} is VALID [2022-04-28 06:03:16,281 INFO L290 TraceCheckUtils]: 61: Hoare triple {11255#(< ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11255#(< ~counter~0 14)} is VALID [2022-04-28 06:03:16,282 INFO L290 TraceCheckUtils]: 60: Hoare triple {11255#(< ~counter~0 14)} assume !!(0 != ~r~0); {11255#(< ~counter~0 14)} is VALID [2022-04-28 06:03:16,282 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10690#true} {11255#(< ~counter~0 14)} #63#return; {11255#(< ~counter~0 14)} is VALID [2022-04-28 06:03:16,282 INFO L290 TraceCheckUtils]: 58: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,282 INFO L290 TraceCheckUtils]: 57: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,282 INFO L290 TraceCheckUtils]: 56: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,283 INFO L272 TraceCheckUtils]: 55: Hoare triple {11255#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,283 INFO L290 TraceCheckUtils]: 54: Hoare triple {11255#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {11255#(< ~counter~0 14)} is VALID [2022-04-28 06:03:16,283 INFO L290 TraceCheckUtils]: 53: Hoare triple {11283#(< ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11255#(< ~counter~0 14)} is VALID [2022-04-28 06:03:16,284 INFO L290 TraceCheckUtils]: 52: Hoare triple {11283#(< ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11283#(< ~counter~0 13)} is VALID [2022-04-28 06:03:16,284 INFO L290 TraceCheckUtils]: 51: Hoare triple {11283#(< ~counter~0 13)} assume !!(0 != ~r~0); {11283#(< ~counter~0 13)} is VALID [2022-04-28 06:03:16,284 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10690#true} {11283#(< ~counter~0 13)} #63#return; {11283#(< ~counter~0 13)} is VALID [2022-04-28 06:03:16,284 INFO L290 TraceCheckUtils]: 49: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,284 INFO L290 TraceCheckUtils]: 48: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,285 INFO L290 TraceCheckUtils]: 47: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,285 INFO L272 TraceCheckUtils]: 46: Hoare triple {11283#(< ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,285 INFO L290 TraceCheckUtils]: 45: Hoare triple {11283#(< ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {11283#(< ~counter~0 13)} is VALID [2022-04-28 06:03:16,285 INFO L290 TraceCheckUtils]: 44: Hoare triple {11027#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11283#(< ~counter~0 13)} is VALID [2022-04-28 06:03:16,286 INFO L290 TraceCheckUtils]: 43: Hoare triple {11027#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:16,286 INFO L290 TraceCheckUtils]: 42: Hoare triple {11027#(<= ~counter~0 11)} assume !!(0 != ~r~0); {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:16,286 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10690#true} {11027#(<= ~counter~0 11)} #63#return; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:16,286 INFO L290 TraceCheckUtils]: 40: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,287 INFO L290 TraceCheckUtils]: 39: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,287 INFO L290 TraceCheckUtils]: 38: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,287 INFO L272 TraceCheckUtils]: 37: Hoare triple {11027#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,287 INFO L290 TraceCheckUtils]: 36: Hoare triple {11027#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:16,287 INFO L290 TraceCheckUtils]: 35: Hoare triple {10999#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11027#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:16,288 INFO L290 TraceCheckUtils]: 34: Hoare triple {10999#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:16,288 INFO L290 TraceCheckUtils]: 33: Hoare triple {10999#(<= ~counter~0 10)} assume !!(0 != ~r~0); {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:16,295 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10690#true} {10999#(<= ~counter~0 10)} #63#return; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:16,296 INFO L290 TraceCheckUtils]: 31: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,296 INFO L290 TraceCheckUtils]: 30: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,296 INFO L272 TraceCheckUtils]: 28: Hoare triple {10999#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {10999#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:16,297 INFO L290 TraceCheckUtils]: 26: Hoare triple {10971#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10999#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:16,298 INFO L290 TraceCheckUtils]: 25: Hoare triple {10971#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:16,298 INFO L290 TraceCheckUtils]: 24: Hoare triple {10971#(<= ~counter~0 9)} assume !!(0 != ~r~0); {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:16,299 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10690#true} {10971#(<= ~counter~0 9)} #63#return; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:16,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,299 INFO L272 TraceCheckUtils]: 19: Hoare triple {10971#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,299 INFO L290 TraceCheckUtils]: 18: Hoare triple {10971#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:16,300 INFO L290 TraceCheckUtils]: 17: Hoare triple {10943#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10971#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:16,300 INFO L290 TraceCheckUtils]: 16: Hoare triple {10943#(<= ~counter~0 8)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:16,301 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10690#true} {10943#(<= ~counter~0 8)} #61#return; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:16,301 INFO L290 TraceCheckUtils]: 14: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,301 INFO L290 TraceCheckUtils]: 13: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,301 INFO L290 TraceCheckUtils]: 12: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,301 INFO L272 TraceCheckUtils]: 11: Hoare triple {10943#(<= ~counter~0 8)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,302 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10690#true} {10943#(<= ~counter~0 8)} #59#return; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:16,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-28 06:03:16,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-28 06:03:16,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-28 06:03:16,302 INFO L272 TraceCheckUtils]: 6: Hoare triple {10943#(<= ~counter~0 8)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10690#true} is VALID [2022-04-28 06:03:16,302 INFO L290 TraceCheckUtils]: 5: Hoare triple {10943#(<= ~counter~0 8)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:16,303 INFO L272 TraceCheckUtils]: 4: Hoare triple {10943#(<= ~counter~0 8)} call #t~ret7 := main(); {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:16,303 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10943#(<= ~counter~0 8)} {10690#true} #67#return; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:16,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {10943#(<= ~counter~0 8)} assume true; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:16,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {10690#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; {10943#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:16,304 INFO L272 TraceCheckUtils]: 0: Hoare triple {10690#true} call ULTIMATE.init(); {10690#true} is VALID [2022-04-28 06:03:16,305 INFO L134 CoverageAnalysis]: Checked inductivity of 543 backedges. 22 proven. 297 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-28 06:03:16,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:16,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [829302469] [2022-04-28 06:03:16,305 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:16,305 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [946010151] [2022-04-28 06:03:16,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [946010151] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:16,306 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:16,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-28 06:03:16,306 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:16,306 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1715800631] [2022-04-28 06:03:16,306 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1715800631] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:16,306 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:16,306 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-28 06:03:16,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [829106779] [2022-04-28 06:03:16,307 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:16,307 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, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 122 [2022-04-28 06:03:16,308 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:16,308 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, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 06:03:16,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:16,388 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-28 06:03:16,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:16,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-28 06:03:16,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:03:16,389 INFO L87 Difference]: Start difference. First operand 119 states and 131 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, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 06:03:16,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:16,823 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2022-04-28 06:03:16,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-28 06:03:16,823 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, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) Word has length 122 [2022-04-28 06:03:16,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:16,824 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, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 06:03:16,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2022-04-28 06:03:16,827 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, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 06:03:16,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2022-04-28 06:03:16,830 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 145 transitions. [2022-04-28 06:03:16,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:16,931 INFO L225 Difference]: With dead ends: 133 [2022-04-28 06:03:16,931 INFO L226 Difference]: Without dead ends: 128 [2022-04-28 06:03:16,932 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 254 GetRequests, 220 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-28 06:03:16,932 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 26 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:16,933 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 176 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:03:16,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-28 06:03:17,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-04-28 06:03:17,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:17,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:03:17,067 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:03:17,068 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:03:17,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:17,070 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-04-28 06:03:17,070 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-04-28 06:03:17,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:17,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:17,070 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 128 states. [2022-04-28 06:03:17,071 INFO L87 Difference]: Start difference. First operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) Second operand 128 states. [2022-04-28 06:03:17,073 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:17,073 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-04-28 06:03:17,073 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-04-28 06:03:17,074 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:17,074 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:17,074 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:17,074 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:17,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 96 states have (on average 1.1354166666666667) internal successors, (109), 96 states have internal predecessors, (109), 17 states have call successors, (17), 16 states have call predecessors, (17), 14 states have return successors, (15), 15 states have call predecessors, (15), 15 states have call successors, (15) [2022-04-28 06:03:17,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2022-04-28 06:03:17,077 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 122 [2022-04-28 06:03:17,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:17,077 INFO L495 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2022-04-28 06:03:17,078 INFO L496 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, (16), 14 states have call predecessors, (16), 12 states have return successors, (14), 12 states have call predecessors, (14), 13 states have call successors, (14) [2022-04-28 06:03:17,078 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 141 transitions. [2022-04-28 06:03:18,228 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-28 06:03:18,229 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-04-28 06:03:18,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-28 06:03:18,229 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:18,229 INFO L195 NwaCegarLoop]: trace histogram [13, 13, 12, 12, 12, 12, 12, 12, 12, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:18,248 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2022-04-28 06:03:18,439 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-28 06:03:18,439 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:18,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:18,440 INFO L85 PathProgramCache]: Analyzing trace with hash 881443734, now seen corresponding path program 23 times [2022-04-28 06:03:18,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:18,440 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [538534213] [2022-04-28 06:03:18,440 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:18,441 INFO L85 PathProgramCache]: Analyzing trace with hash 881443734, now seen corresponding path program 24 times [2022-04-28 06:03:18,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:18,441 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [483674912] [2022-04-28 06:03:18,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:18,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:18,465 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:18,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1924769662] [2022-04-28 06:03:18,465 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:03:18,466 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:18,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:18,467 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:18,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-28 06:03:20,131 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-28 06:03:20,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:20,135 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-28 06:03:20,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:20,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:20,796 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-28 06:03:20,797 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-28 06:03:20,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,797 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#(<= ~counter~0 0)} {12245#true} #67#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,798 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#(<= ~counter~0 0)} call #t~ret7 := main(); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {12253#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,798 INFO L272 TraceCheckUtils]: 6: Hoare triple {12253#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#(<= ~counter~0 0)} ~cond := #in~cond; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#(<= ~counter~0 0)} assume !(0 == ~cond); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,800 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12253#(<= ~counter~0 0)} {12253#(<= ~counter~0 0)} #59#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,800 INFO L272 TraceCheckUtils]: 11: Hoare triple {12253#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,800 INFO L290 TraceCheckUtils]: 12: Hoare triple {12253#(<= ~counter~0 0)} ~cond := #in~cond; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,801 INFO L290 TraceCheckUtils]: 13: Hoare triple {12253#(<= ~counter~0 0)} assume !(0 == ~cond); {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,801 INFO L290 TraceCheckUtils]: 14: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,801 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12253#(<= ~counter~0 0)} {12253#(<= ~counter~0 0)} #61#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,802 INFO L290 TraceCheckUtils]: 16: Hoare triple {12253#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12253#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:20,803 INFO L290 TraceCheckUtils]: 17: Hoare triple {12253#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:20,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {12302#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {12302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:20,804 INFO L272 TraceCheckUtils]: 19: Hoare triple {12302#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:20,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {12302#(<= ~counter~0 1)} ~cond := #in~cond; {12302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:20,805 INFO L290 TraceCheckUtils]: 21: Hoare triple {12302#(<= ~counter~0 1)} assume !(0 == ~cond); {12302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:20,805 INFO L290 TraceCheckUtils]: 22: Hoare triple {12302#(<= ~counter~0 1)} assume true; {12302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:20,806 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12302#(<= ~counter~0 1)} {12302#(<= ~counter~0 1)} #63#return; {12302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:20,806 INFO L290 TraceCheckUtils]: 24: Hoare triple {12302#(<= ~counter~0 1)} assume !!(0 != ~r~0); {12302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:20,806 INFO L290 TraceCheckUtils]: 25: Hoare triple {12302#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12302#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:20,807 INFO L290 TraceCheckUtils]: 26: Hoare triple {12302#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:20,807 INFO L290 TraceCheckUtils]: 27: Hoare triple {12330#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {12330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:20,807 INFO L272 TraceCheckUtils]: 28: Hoare triple {12330#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:20,808 INFO L290 TraceCheckUtils]: 29: Hoare triple {12330#(<= ~counter~0 2)} ~cond := #in~cond; {12330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:20,808 INFO L290 TraceCheckUtils]: 30: Hoare triple {12330#(<= ~counter~0 2)} assume !(0 == ~cond); {12330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:20,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {12330#(<= ~counter~0 2)} assume true; {12330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:20,809 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12330#(<= ~counter~0 2)} {12330#(<= ~counter~0 2)} #63#return; {12330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:20,809 INFO L290 TraceCheckUtils]: 33: Hoare triple {12330#(<= ~counter~0 2)} assume !!(0 != ~r~0); {12330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:20,809 INFO L290 TraceCheckUtils]: 34: Hoare triple {12330#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12330#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:20,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {12330#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:20,810 INFO L290 TraceCheckUtils]: 36: Hoare triple {12358#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {12358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:20,811 INFO L272 TraceCheckUtils]: 37: Hoare triple {12358#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:20,811 INFO L290 TraceCheckUtils]: 38: Hoare triple {12358#(<= ~counter~0 3)} ~cond := #in~cond; {12358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:20,811 INFO L290 TraceCheckUtils]: 39: Hoare triple {12358#(<= ~counter~0 3)} assume !(0 == ~cond); {12358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:20,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {12358#(<= ~counter~0 3)} assume true; {12358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:20,812 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12358#(<= ~counter~0 3)} {12358#(<= ~counter~0 3)} #63#return; {12358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:20,812 INFO L290 TraceCheckUtils]: 42: Hoare triple {12358#(<= ~counter~0 3)} assume !!(0 != ~r~0); {12358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:20,813 INFO L290 TraceCheckUtils]: 43: Hoare triple {12358#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12358#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:20,813 INFO L290 TraceCheckUtils]: 44: Hoare triple {12358#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:20,813 INFO L290 TraceCheckUtils]: 45: Hoare triple {12386#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {12386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:20,814 INFO L272 TraceCheckUtils]: 46: Hoare triple {12386#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:20,815 INFO L290 TraceCheckUtils]: 47: Hoare triple {12386#(<= ~counter~0 4)} ~cond := #in~cond; {12386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:20,815 INFO L290 TraceCheckUtils]: 48: Hoare triple {12386#(<= ~counter~0 4)} assume !(0 == ~cond); {12386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:20,816 INFO L290 TraceCheckUtils]: 49: Hoare triple {12386#(<= ~counter~0 4)} assume true; {12386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:20,816 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12386#(<= ~counter~0 4)} {12386#(<= ~counter~0 4)} #63#return; {12386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:20,817 INFO L290 TraceCheckUtils]: 51: Hoare triple {12386#(<= ~counter~0 4)} assume !!(0 != ~r~0); {12386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:20,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {12386#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12386#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:20,818 INFO L290 TraceCheckUtils]: 53: Hoare triple {12386#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:20,818 INFO L290 TraceCheckUtils]: 54: Hoare triple {12414#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {12414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:20,819 INFO L272 TraceCheckUtils]: 55: Hoare triple {12414#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:20,819 INFO L290 TraceCheckUtils]: 56: Hoare triple {12414#(<= ~counter~0 5)} ~cond := #in~cond; {12414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:20,819 INFO L290 TraceCheckUtils]: 57: Hoare triple {12414#(<= ~counter~0 5)} assume !(0 == ~cond); {12414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:20,820 INFO L290 TraceCheckUtils]: 58: Hoare triple {12414#(<= ~counter~0 5)} assume true; {12414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:20,820 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12414#(<= ~counter~0 5)} {12414#(<= ~counter~0 5)} #63#return; {12414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:20,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {12414#(<= ~counter~0 5)} assume !!(0 != ~r~0); {12414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:20,821 INFO L290 TraceCheckUtils]: 61: Hoare triple {12414#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12414#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:20,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {12414#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:20,822 INFO L290 TraceCheckUtils]: 63: Hoare triple {12442#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {12442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:20,823 INFO L272 TraceCheckUtils]: 64: Hoare triple {12442#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:20,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {12442#(<= ~counter~0 6)} ~cond := #in~cond; {12442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:20,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {12442#(<= ~counter~0 6)} assume !(0 == ~cond); {12442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:20,824 INFO L290 TraceCheckUtils]: 67: Hoare triple {12442#(<= ~counter~0 6)} assume true; {12442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:20,825 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12442#(<= ~counter~0 6)} {12442#(<= ~counter~0 6)} #63#return; {12442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:20,825 INFO L290 TraceCheckUtils]: 69: Hoare triple {12442#(<= ~counter~0 6)} assume !!(0 != ~r~0); {12442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:20,825 INFO L290 TraceCheckUtils]: 70: Hoare triple {12442#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12442#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:20,826 INFO L290 TraceCheckUtils]: 71: Hoare triple {12442#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:20,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {12470#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:20,827 INFO L272 TraceCheckUtils]: 73: Hoare triple {12470#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:20,827 INFO L290 TraceCheckUtils]: 74: Hoare triple {12470#(<= ~counter~0 7)} ~cond := #in~cond; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:20,828 INFO L290 TraceCheckUtils]: 75: Hoare triple {12470#(<= ~counter~0 7)} assume !(0 == ~cond); {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:20,828 INFO L290 TraceCheckUtils]: 76: Hoare triple {12470#(<= ~counter~0 7)} assume true; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:20,829 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12470#(<= ~counter~0 7)} {12470#(<= ~counter~0 7)} #63#return; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:20,829 INFO L290 TraceCheckUtils]: 78: Hoare triple {12470#(<= ~counter~0 7)} assume !!(0 != ~r~0); {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:20,830 INFO L290 TraceCheckUtils]: 79: Hoare triple {12470#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:20,830 INFO L290 TraceCheckUtils]: 80: Hoare triple {12470#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:20,830 INFO L290 TraceCheckUtils]: 81: Hoare triple {12498#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:20,831 INFO L272 TraceCheckUtils]: 82: Hoare triple {12498#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:20,831 INFO L290 TraceCheckUtils]: 83: Hoare triple {12498#(<= ~counter~0 8)} ~cond := #in~cond; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:20,832 INFO L290 TraceCheckUtils]: 84: Hoare triple {12498#(<= ~counter~0 8)} assume !(0 == ~cond); {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:20,832 INFO L290 TraceCheckUtils]: 85: Hoare triple {12498#(<= ~counter~0 8)} assume true; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:20,833 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12498#(<= ~counter~0 8)} {12498#(<= ~counter~0 8)} #63#return; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:20,833 INFO L290 TraceCheckUtils]: 87: Hoare triple {12498#(<= ~counter~0 8)} assume !!(0 != ~r~0); {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:20,833 INFO L290 TraceCheckUtils]: 88: Hoare triple {12498#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:20,834 INFO L290 TraceCheckUtils]: 89: Hoare triple {12498#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:20,834 INFO L290 TraceCheckUtils]: 90: Hoare triple {12526#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:20,834 INFO L272 TraceCheckUtils]: 91: Hoare triple {12526#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:20,835 INFO L290 TraceCheckUtils]: 92: Hoare triple {12526#(<= ~counter~0 9)} ~cond := #in~cond; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:20,835 INFO L290 TraceCheckUtils]: 93: Hoare triple {12526#(<= ~counter~0 9)} assume !(0 == ~cond); {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:20,835 INFO L290 TraceCheckUtils]: 94: Hoare triple {12526#(<= ~counter~0 9)} assume true; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:20,836 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {12526#(<= ~counter~0 9)} {12526#(<= ~counter~0 9)} #63#return; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:20,838 INFO L290 TraceCheckUtils]: 96: Hoare triple {12526#(<= ~counter~0 9)} assume !!(0 != ~r~0); {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:20,838 INFO L290 TraceCheckUtils]: 97: Hoare triple {12526#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:20,838 INFO L290 TraceCheckUtils]: 98: Hoare triple {12526#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:20,839 INFO L290 TraceCheckUtils]: 99: Hoare triple {12554#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:20,839 INFO L272 TraceCheckUtils]: 100: Hoare triple {12554#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:20,840 INFO L290 TraceCheckUtils]: 101: Hoare triple {12554#(<= ~counter~0 10)} ~cond := #in~cond; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:20,840 INFO L290 TraceCheckUtils]: 102: Hoare triple {12554#(<= ~counter~0 10)} assume !(0 == ~cond); {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:20,840 INFO L290 TraceCheckUtils]: 103: Hoare triple {12554#(<= ~counter~0 10)} assume true; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:20,841 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12554#(<= ~counter~0 10)} {12554#(<= ~counter~0 10)} #63#return; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:20,841 INFO L290 TraceCheckUtils]: 105: Hoare triple {12554#(<= ~counter~0 10)} assume !!(0 != ~r~0); {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:20,841 INFO L290 TraceCheckUtils]: 106: Hoare triple {12554#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:20,842 INFO L290 TraceCheckUtils]: 107: Hoare triple {12554#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:20,842 INFO L290 TraceCheckUtils]: 108: Hoare triple {12582#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:20,842 INFO L272 TraceCheckUtils]: 109: Hoare triple {12582#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:20,843 INFO L290 TraceCheckUtils]: 110: Hoare triple {12582#(<= ~counter~0 11)} ~cond := #in~cond; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:20,843 INFO L290 TraceCheckUtils]: 111: Hoare triple {12582#(<= ~counter~0 11)} assume !(0 == ~cond); {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:20,843 INFO L290 TraceCheckUtils]: 112: Hoare triple {12582#(<= ~counter~0 11)} assume true; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:20,844 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {12582#(<= ~counter~0 11)} {12582#(<= ~counter~0 11)} #63#return; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:20,844 INFO L290 TraceCheckUtils]: 114: Hoare triple {12582#(<= ~counter~0 11)} assume !!(0 != ~r~0); {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:20,844 INFO L290 TraceCheckUtils]: 115: Hoare triple {12582#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:20,845 INFO L290 TraceCheckUtils]: 116: Hoare triple {12582#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:20,845 INFO L290 TraceCheckUtils]: 117: Hoare triple {12610#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:20,846 INFO L272 TraceCheckUtils]: 118: Hoare triple {12610#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:20,846 INFO L290 TraceCheckUtils]: 119: Hoare triple {12610#(<= ~counter~0 12)} ~cond := #in~cond; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:20,846 INFO L290 TraceCheckUtils]: 120: Hoare triple {12610#(<= ~counter~0 12)} assume !(0 == ~cond); {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:20,847 INFO L290 TraceCheckUtils]: 121: Hoare triple {12610#(<= ~counter~0 12)} assume true; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:20,847 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12610#(<= ~counter~0 12)} {12610#(<= ~counter~0 12)} #63#return; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:20,847 INFO L290 TraceCheckUtils]: 123: Hoare triple {12610#(<= ~counter~0 12)} assume !!(0 != ~r~0); {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:20,848 INFO L290 TraceCheckUtils]: 124: Hoare triple {12610#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:20,848 INFO L290 TraceCheckUtils]: 125: Hoare triple {12610#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12638#(<= |main_#t~post6| 12)} is VALID [2022-04-28 06:03:20,848 INFO L290 TraceCheckUtils]: 126: Hoare triple {12638#(<= |main_#t~post6| 12)} assume !(#t~post6 < 20);havoc #t~post6; {12246#false} is VALID [2022-04-28 06:03:20,848 INFO L272 TraceCheckUtils]: 127: Hoare triple {12246#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12246#false} is VALID [2022-04-28 06:03:20,848 INFO L290 TraceCheckUtils]: 128: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-28 06:03:20,849 INFO L290 TraceCheckUtils]: 129: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-28 06:03:20,849 INFO L290 TraceCheckUtils]: 130: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 06:03:20,849 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 24 proven. 618 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:20,849 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:21,518 INFO L290 TraceCheckUtils]: 130: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-28 06:03:21,518 INFO L290 TraceCheckUtils]: 129: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-28 06:03:21,518 INFO L290 TraceCheckUtils]: 128: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-28 06:03:21,518 INFO L272 TraceCheckUtils]: 127: Hoare triple {12246#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12246#false} is VALID [2022-04-28 06:03:21,518 INFO L290 TraceCheckUtils]: 126: Hoare triple {12666#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {12246#false} is VALID [2022-04-28 06:03:21,519 INFO L290 TraceCheckUtils]: 125: Hoare triple {12670#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12666#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:03:21,519 INFO L290 TraceCheckUtils]: 124: Hoare triple {12670#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12670#(< ~counter~0 20)} is VALID [2022-04-28 06:03:21,519 INFO L290 TraceCheckUtils]: 123: Hoare triple {12670#(< ~counter~0 20)} assume !!(0 != ~r~0); {12670#(< ~counter~0 20)} is VALID [2022-04-28 06:03:21,520 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12245#true} {12670#(< ~counter~0 20)} #63#return; {12670#(< ~counter~0 20)} is VALID [2022-04-28 06:03:21,520 INFO L290 TraceCheckUtils]: 121: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,520 INFO L290 TraceCheckUtils]: 120: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,520 INFO L290 TraceCheckUtils]: 119: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,520 INFO L272 TraceCheckUtils]: 118: Hoare triple {12670#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,520 INFO L290 TraceCheckUtils]: 117: Hoare triple {12670#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {12670#(< ~counter~0 20)} is VALID [2022-04-28 06:03:21,521 INFO L290 TraceCheckUtils]: 116: Hoare triple {12698#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12670#(< ~counter~0 20)} is VALID [2022-04-28 06:03:21,521 INFO L290 TraceCheckUtils]: 115: Hoare triple {12698#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12698#(< ~counter~0 19)} is VALID [2022-04-28 06:03:21,522 INFO L290 TraceCheckUtils]: 114: Hoare triple {12698#(< ~counter~0 19)} assume !!(0 != ~r~0); {12698#(< ~counter~0 19)} is VALID [2022-04-28 06:03:21,522 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {12245#true} {12698#(< ~counter~0 19)} #63#return; {12698#(< ~counter~0 19)} is VALID [2022-04-28 06:03:21,522 INFO L290 TraceCheckUtils]: 112: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,522 INFO L290 TraceCheckUtils]: 111: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,522 INFO L290 TraceCheckUtils]: 110: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,522 INFO L272 TraceCheckUtils]: 109: Hoare triple {12698#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,523 INFO L290 TraceCheckUtils]: 108: Hoare triple {12698#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {12698#(< ~counter~0 19)} is VALID [2022-04-28 06:03:21,523 INFO L290 TraceCheckUtils]: 107: Hoare triple {12726#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12698#(< ~counter~0 19)} is VALID [2022-04-28 06:03:21,523 INFO L290 TraceCheckUtils]: 106: Hoare triple {12726#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12726#(< ~counter~0 18)} is VALID [2022-04-28 06:03:21,524 INFO L290 TraceCheckUtils]: 105: Hoare triple {12726#(< ~counter~0 18)} assume !!(0 != ~r~0); {12726#(< ~counter~0 18)} is VALID [2022-04-28 06:03:21,524 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12245#true} {12726#(< ~counter~0 18)} #63#return; {12726#(< ~counter~0 18)} is VALID [2022-04-28 06:03:21,524 INFO L290 TraceCheckUtils]: 103: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,524 INFO L290 TraceCheckUtils]: 102: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,524 INFO L290 TraceCheckUtils]: 101: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,524 INFO L272 TraceCheckUtils]: 100: Hoare triple {12726#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,525 INFO L290 TraceCheckUtils]: 99: Hoare triple {12726#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {12726#(< ~counter~0 18)} is VALID [2022-04-28 06:03:21,525 INFO L290 TraceCheckUtils]: 98: Hoare triple {12754#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12726#(< ~counter~0 18)} is VALID [2022-04-28 06:03:21,525 INFO L290 TraceCheckUtils]: 97: Hoare triple {12754#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12754#(< ~counter~0 17)} is VALID [2022-04-28 06:03:21,526 INFO L290 TraceCheckUtils]: 96: Hoare triple {12754#(< ~counter~0 17)} assume !!(0 != ~r~0); {12754#(< ~counter~0 17)} is VALID [2022-04-28 06:03:21,526 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {12245#true} {12754#(< ~counter~0 17)} #63#return; {12754#(< ~counter~0 17)} is VALID [2022-04-28 06:03:21,526 INFO L290 TraceCheckUtils]: 94: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,527 INFO L290 TraceCheckUtils]: 92: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,527 INFO L272 TraceCheckUtils]: 91: Hoare triple {12754#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,527 INFO L290 TraceCheckUtils]: 90: Hoare triple {12754#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {12754#(< ~counter~0 17)} is VALID [2022-04-28 06:03:21,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {12782#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12754#(< ~counter~0 17)} is VALID [2022-04-28 06:03:21,528 INFO L290 TraceCheckUtils]: 88: Hoare triple {12782#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12782#(< ~counter~0 16)} is VALID [2022-04-28 06:03:21,528 INFO L290 TraceCheckUtils]: 87: Hoare triple {12782#(< ~counter~0 16)} assume !!(0 != ~r~0); {12782#(< ~counter~0 16)} is VALID [2022-04-28 06:03:21,528 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12245#true} {12782#(< ~counter~0 16)} #63#return; {12782#(< ~counter~0 16)} is VALID [2022-04-28 06:03:21,528 INFO L290 TraceCheckUtils]: 85: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,529 INFO L290 TraceCheckUtils]: 84: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,529 INFO L290 TraceCheckUtils]: 83: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,529 INFO L272 TraceCheckUtils]: 82: Hoare triple {12782#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,529 INFO L290 TraceCheckUtils]: 81: Hoare triple {12782#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {12782#(< ~counter~0 16)} is VALID [2022-04-28 06:03:21,529 INFO L290 TraceCheckUtils]: 80: Hoare triple {12810#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12782#(< ~counter~0 16)} is VALID [2022-04-28 06:03:21,530 INFO L290 TraceCheckUtils]: 79: Hoare triple {12810#(< ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12810#(< ~counter~0 15)} is VALID [2022-04-28 06:03:21,530 INFO L290 TraceCheckUtils]: 78: Hoare triple {12810#(< ~counter~0 15)} assume !!(0 != ~r~0); {12810#(< ~counter~0 15)} is VALID [2022-04-28 06:03:21,531 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12245#true} {12810#(< ~counter~0 15)} #63#return; {12810#(< ~counter~0 15)} is VALID [2022-04-28 06:03:21,531 INFO L290 TraceCheckUtils]: 76: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,531 INFO L290 TraceCheckUtils]: 75: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,531 INFO L290 TraceCheckUtils]: 74: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,531 INFO L272 TraceCheckUtils]: 73: Hoare triple {12810#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,531 INFO L290 TraceCheckUtils]: 72: Hoare triple {12810#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {12810#(< ~counter~0 15)} is VALID [2022-04-28 06:03:21,532 INFO L290 TraceCheckUtils]: 71: Hoare triple {12838#(< ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12810#(< ~counter~0 15)} is VALID [2022-04-28 06:03:21,532 INFO L290 TraceCheckUtils]: 70: Hoare triple {12838#(< ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12838#(< ~counter~0 14)} is VALID [2022-04-28 06:03:21,532 INFO L290 TraceCheckUtils]: 69: Hoare triple {12838#(< ~counter~0 14)} assume !!(0 != ~r~0); {12838#(< ~counter~0 14)} is VALID [2022-04-28 06:03:21,533 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12245#true} {12838#(< ~counter~0 14)} #63#return; {12838#(< ~counter~0 14)} is VALID [2022-04-28 06:03:21,533 INFO L290 TraceCheckUtils]: 67: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,533 INFO L290 TraceCheckUtils]: 66: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,533 INFO L290 TraceCheckUtils]: 65: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,533 INFO L272 TraceCheckUtils]: 64: Hoare triple {12838#(< ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,533 INFO L290 TraceCheckUtils]: 63: Hoare triple {12838#(< ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {12838#(< ~counter~0 14)} is VALID [2022-04-28 06:03:21,534 INFO L290 TraceCheckUtils]: 62: Hoare triple {12610#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12838#(< ~counter~0 14)} is VALID [2022-04-28 06:03:21,534 INFO L290 TraceCheckUtils]: 61: Hoare triple {12610#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:21,534 INFO L290 TraceCheckUtils]: 60: Hoare triple {12610#(<= ~counter~0 12)} assume !!(0 != ~r~0); {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:21,535 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12245#true} {12610#(<= ~counter~0 12)} #63#return; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:21,535 INFO L290 TraceCheckUtils]: 58: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,535 INFO L290 TraceCheckUtils]: 57: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,535 INFO L290 TraceCheckUtils]: 56: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,535 INFO L272 TraceCheckUtils]: 55: Hoare triple {12610#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,535 INFO L290 TraceCheckUtils]: 54: Hoare triple {12610#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:21,536 INFO L290 TraceCheckUtils]: 53: Hoare triple {12582#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12610#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:21,536 INFO L290 TraceCheckUtils]: 52: Hoare triple {12582#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:21,536 INFO L290 TraceCheckUtils]: 51: Hoare triple {12582#(<= ~counter~0 11)} assume !!(0 != ~r~0); {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:21,537 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12245#true} {12582#(<= ~counter~0 11)} #63#return; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:21,537 INFO L290 TraceCheckUtils]: 49: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,537 INFO L290 TraceCheckUtils]: 48: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,537 INFO L290 TraceCheckUtils]: 47: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,537 INFO L272 TraceCheckUtils]: 46: Hoare triple {12582#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,537 INFO L290 TraceCheckUtils]: 45: Hoare triple {12582#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:21,538 INFO L290 TraceCheckUtils]: 44: Hoare triple {12554#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12582#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:21,538 INFO L290 TraceCheckUtils]: 43: Hoare triple {12554#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:21,539 INFO L290 TraceCheckUtils]: 42: Hoare triple {12554#(<= ~counter~0 10)} assume !!(0 != ~r~0); {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:21,539 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12245#true} {12554#(<= ~counter~0 10)} #63#return; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:21,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,539 INFO L290 TraceCheckUtils]: 39: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,539 INFO L290 TraceCheckUtils]: 38: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,539 INFO L272 TraceCheckUtils]: 37: Hoare triple {12554#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,540 INFO L290 TraceCheckUtils]: 36: Hoare triple {12554#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:21,540 INFO L290 TraceCheckUtils]: 35: Hoare triple {12526#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12554#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:21,540 INFO L290 TraceCheckUtils]: 34: Hoare triple {12526#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:21,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {12526#(<= ~counter~0 9)} assume !!(0 != ~r~0); {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:21,541 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12245#true} {12526#(<= ~counter~0 9)} #63#return; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:21,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,542 INFO L290 TraceCheckUtils]: 29: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,542 INFO L272 TraceCheckUtils]: 28: Hoare triple {12526#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,542 INFO L290 TraceCheckUtils]: 27: Hoare triple {12526#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:21,542 INFO L290 TraceCheckUtils]: 26: Hoare triple {12498#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12526#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:21,543 INFO L290 TraceCheckUtils]: 25: Hoare triple {12498#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:21,543 INFO L290 TraceCheckUtils]: 24: Hoare triple {12498#(<= ~counter~0 8)} assume !!(0 != ~r~0); {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:21,543 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12245#true} {12498#(<= ~counter~0 8)} #63#return; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:21,543 INFO L290 TraceCheckUtils]: 22: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,544 INFO L290 TraceCheckUtils]: 21: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,544 INFO L290 TraceCheckUtils]: 20: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,544 INFO L272 TraceCheckUtils]: 19: Hoare triple {12498#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {12498#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:21,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {12470#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12498#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:21,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {12470#(<= ~counter~0 7)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:21,545 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12245#true} {12470#(<= ~counter~0 7)} #61#return; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:21,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,545 INFO L290 TraceCheckUtils]: 12: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,545 INFO L272 TraceCheckUtils]: 11: Hoare triple {12470#(<= ~counter~0 7)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,546 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12245#true} {12470#(<= ~counter~0 7)} #59#return; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:21,546 INFO L290 TraceCheckUtils]: 9: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-28 06:03:21,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-28 06:03:21,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-28 06:03:21,546 INFO L272 TraceCheckUtils]: 6: Hoare triple {12470#(<= ~counter~0 7)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {12245#true} is VALID [2022-04-28 06:03:21,546 INFO L290 TraceCheckUtils]: 5: Hoare triple {12470#(<= ~counter~0 7)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:21,547 INFO L272 TraceCheckUtils]: 4: Hoare triple {12470#(<= ~counter~0 7)} call #t~ret7 := main(); {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:21,547 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12470#(<= ~counter~0 7)} {12245#true} #67#return; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:21,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {12470#(<= ~counter~0 7)} assume true; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:21,548 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; {12470#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:21,548 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-28 06:03:21,548 INFO L134 CoverageAnalysis]: Checked inductivity of 646 backedges. 24 proven. 354 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-28 06:03:21,548 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:21,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [483674912] [2022-04-28 06:03:21,549 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:21,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1924769662] [2022-04-28 06:03:21,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1924769662] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:21,549 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:21,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-28 06:03:21,549 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:21,549 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [538534213] [2022-04-28 06:03:21,549 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [538534213] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:21,549 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:21,549 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-28 06:03:21,549 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042170773] [2022-04-28 06:03:21,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:21,550 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, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 131 [2022-04-28 06:03:21,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:21,550 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, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:03:21,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:21,643 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-28 06:03:21,643 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:21,644 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-28 06:03:21,644 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:03:21,644 INFO L87 Difference]: Start difference. First operand 128 states and 141 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, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:03:22,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:22,154 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2022-04-28 06:03:22,154 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-28 06:03:22,154 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, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) Word has length 131 [2022-04-28 06:03:22,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:22,155 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, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:03:22,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 155 transitions. [2022-04-28 06:03:22,158 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, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:03:22,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 155 transitions. [2022-04-28 06:03:22,162 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 155 transitions. [2022-04-28 06:03:22,305 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-28 06:03:22,307 INFO L225 Difference]: With dead ends: 142 [2022-04-28 06:03:22,308 INFO L226 Difference]: Without dead ends: 137 [2022-04-28 06:03:22,309 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=512, Invalid=748, Unknown=0, NotChecked=0, Total=1260 [2022-04-28 06:03:22,309 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 50 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:22,309 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 166 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:03:22,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-28 06:03:22,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-04-28 06:03:22,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:22,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 06:03:22,468 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 06:03:22,469 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 06:03:22,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:22,471 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-04-28 06:03:22,471 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-04-28 06:03:22,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:22,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:22,472 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 137 states. [2022-04-28 06:03:22,472 INFO L87 Difference]: Start difference. First operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 137 states. [2022-04-28 06:03:22,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:22,475 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-04-28 06:03:22,475 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-04-28 06:03:22,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:22,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:22,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:22,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:22,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 103 states have (on average 1.1359223300970873) internal successors, (117), 103 states have internal predecessors, (117), 18 states have call successors, (18), 17 states have call predecessors, (18), 15 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-28 06:03:22,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2022-04-28 06:03:22,478 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 131 [2022-04-28 06:03:22,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:22,479 INFO L495 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2022-04-28 06:03:22,479 INFO L496 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, (17), 15 states have call predecessors, (17), 13 states have return successors, (15), 13 states have call predecessors, (15), 14 states have call successors, (15) [2022-04-28 06:03:22,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 151 transitions. [2022-04-28 06:03:22,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:22,835 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-04-28 06:03:22,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-28 06:03:22,835 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:22,835 INFO L195 NwaCegarLoop]: trace histogram [14, 14, 13, 13, 13, 13, 13, 13, 13, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:22,843 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2022-04-28 06:03:23,036 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-28 06:03:23,036 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:23,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:23,036 INFO L85 PathProgramCache]: Analyzing trace with hash 2089018524, now seen corresponding path program 25 times [2022-04-28 06:03:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:23,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [258192928] [2022-04-28 06:03:23,037 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:23,037 INFO L85 PathProgramCache]: Analyzing trace with hash 2089018524, now seen corresponding path program 26 times [2022-04-28 06:03:23,037 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:23,037 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111621350] [2022-04-28 06:03:23,037 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:23,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:23,053 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:23,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [513242026] [2022-04-28 06:03:23,053 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:03:23,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:23,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:23,054 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:23,063 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-28 06:03:23,131 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:03:23,131 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:23,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-28 06:03:23,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:23,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:23,844 INFO L272 TraceCheckUtils]: 0: Hoare triple {13910#true} call ULTIMATE.init(); {13910#true} is VALID [2022-04-28 06:03:23,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {13910#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; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,845 INFO L290 TraceCheckUtils]: 2: Hoare triple {13918#(<= ~counter~0 0)} assume true; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,845 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13918#(<= ~counter~0 0)} {13910#true} #67#return; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {13918#(<= ~counter~0 0)} call #t~ret7 := main(); {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,846 INFO L290 TraceCheckUtils]: 5: Hoare triple {13918#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,846 INFO L272 TraceCheckUtils]: 6: Hoare triple {13918#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {13918#(<= ~counter~0 0)} ~cond := #in~cond; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,847 INFO L290 TraceCheckUtils]: 8: Hoare triple {13918#(<= ~counter~0 0)} assume !(0 == ~cond); {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,847 INFO L290 TraceCheckUtils]: 9: Hoare triple {13918#(<= ~counter~0 0)} assume true; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13918#(<= ~counter~0 0)} {13918#(<= ~counter~0 0)} #59#return; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,848 INFO L272 TraceCheckUtils]: 11: Hoare triple {13918#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,848 INFO L290 TraceCheckUtils]: 12: Hoare triple {13918#(<= ~counter~0 0)} ~cond := #in~cond; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {13918#(<= ~counter~0 0)} assume !(0 == ~cond); {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,849 INFO L290 TraceCheckUtils]: 14: Hoare triple {13918#(<= ~counter~0 0)} assume true; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,849 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13918#(<= ~counter~0 0)} {13918#(<= ~counter~0 0)} #61#return; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,849 INFO L290 TraceCheckUtils]: 16: Hoare triple {13918#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13918#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:23,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {13918#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:23,850 INFO L290 TraceCheckUtils]: 18: Hoare triple {13967#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {13967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:23,851 INFO L272 TraceCheckUtils]: 19: Hoare triple {13967#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:23,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {13967#(<= ~counter~0 1)} ~cond := #in~cond; {13967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:23,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {13967#(<= ~counter~0 1)} assume !(0 == ~cond); {13967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:23,852 INFO L290 TraceCheckUtils]: 22: Hoare triple {13967#(<= ~counter~0 1)} assume true; {13967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:23,852 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13967#(<= ~counter~0 1)} {13967#(<= ~counter~0 1)} #63#return; {13967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:23,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {13967#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:23,853 INFO L290 TraceCheckUtils]: 25: Hoare triple {13967#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13967#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:23,853 INFO L290 TraceCheckUtils]: 26: Hoare triple {13967#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:23,853 INFO L290 TraceCheckUtils]: 27: Hoare triple {13995#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {13995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:23,854 INFO L272 TraceCheckUtils]: 28: Hoare triple {13995#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:23,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {13995#(<= ~counter~0 2)} ~cond := #in~cond; {13995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:23,855 INFO L290 TraceCheckUtils]: 30: Hoare triple {13995#(<= ~counter~0 2)} assume !(0 == ~cond); {13995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:23,855 INFO L290 TraceCheckUtils]: 31: Hoare triple {13995#(<= ~counter~0 2)} assume true; {13995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:23,855 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13995#(<= ~counter~0 2)} {13995#(<= ~counter~0 2)} #63#return; {13995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:23,856 INFO L290 TraceCheckUtils]: 33: Hoare triple {13995#(<= ~counter~0 2)} assume !!(0 != ~r~0); {13995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:23,856 INFO L290 TraceCheckUtils]: 34: Hoare triple {13995#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {13995#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:23,856 INFO L290 TraceCheckUtils]: 35: Hoare triple {13995#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:23,857 INFO L290 TraceCheckUtils]: 36: Hoare triple {14023#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {14023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:23,857 INFO L272 TraceCheckUtils]: 37: Hoare triple {14023#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:23,858 INFO L290 TraceCheckUtils]: 38: Hoare triple {14023#(<= ~counter~0 3)} ~cond := #in~cond; {14023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:23,858 INFO L290 TraceCheckUtils]: 39: Hoare triple {14023#(<= ~counter~0 3)} assume !(0 == ~cond); {14023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:23,858 INFO L290 TraceCheckUtils]: 40: Hoare triple {14023#(<= ~counter~0 3)} assume true; {14023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:23,859 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14023#(<= ~counter~0 3)} {14023#(<= ~counter~0 3)} #63#return; {14023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:23,859 INFO L290 TraceCheckUtils]: 42: Hoare triple {14023#(<= ~counter~0 3)} assume !!(0 != ~r~0); {14023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:23,859 INFO L290 TraceCheckUtils]: 43: Hoare triple {14023#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14023#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:23,860 INFO L290 TraceCheckUtils]: 44: Hoare triple {14023#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:23,860 INFO L290 TraceCheckUtils]: 45: Hoare triple {14051#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {14051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:23,860 INFO L272 TraceCheckUtils]: 46: Hoare triple {14051#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:23,861 INFO L290 TraceCheckUtils]: 47: Hoare triple {14051#(<= ~counter~0 4)} ~cond := #in~cond; {14051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:23,861 INFO L290 TraceCheckUtils]: 48: Hoare triple {14051#(<= ~counter~0 4)} assume !(0 == ~cond); {14051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:23,861 INFO L290 TraceCheckUtils]: 49: Hoare triple {14051#(<= ~counter~0 4)} assume true; {14051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:23,862 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14051#(<= ~counter~0 4)} {14051#(<= ~counter~0 4)} #63#return; {14051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:23,862 INFO L290 TraceCheckUtils]: 51: Hoare triple {14051#(<= ~counter~0 4)} assume !!(0 != ~r~0); {14051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:23,862 INFO L290 TraceCheckUtils]: 52: Hoare triple {14051#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14051#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:23,863 INFO L290 TraceCheckUtils]: 53: Hoare triple {14051#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:23,863 INFO L290 TraceCheckUtils]: 54: Hoare triple {14079#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {14079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:23,864 INFO L272 TraceCheckUtils]: 55: Hoare triple {14079#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:23,864 INFO L290 TraceCheckUtils]: 56: Hoare triple {14079#(<= ~counter~0 5)} ~cond := #in~cond; {14079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:23,864 INFO L290 TraceCheckUtils]: 57: Hoare triple {14079#(<= ~counter~0 5)} assume !(0 == ~cond); {14079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:23,865 INFO L290 TraceCheckUtils]: 58: Hoare triple {14079#(<= ~counter~0 5)} assume true; {14079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:23,865 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14079#(<= ~counter~0 5)} {14079#(<= ~counter~0 5)} #63#return; {14079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:23,865 INFO L290 TraceCheckUtils]: 60: Hoare triple {14079#(<= ~counter~0 5)} assume !!(0 != ~r~0); {14079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:23,866 INFO L290 TraceCheckUtils]: 61: Hoare triple {14079#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14079#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:23,866 INFO L290 TraceCheckUtils]: 62: Hoare triple {14079#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:23,866 INFO L290 TraceCheckUtils]: 63: Hoare triple {14107#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:23,867 INFO L272 TraceCheckUtils]: 64: Hoare triple {14107#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:23,867 INFO L290 TraceCheckUtils]: 65: Hoare triple {14107#(<= ~counter~0 6)} ~cond := #in~cond; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:23,868 INFO L290 TraceCheckUtils]: 66: Hoare triple {14107#(<= ~counter~0 6)} assume !(0 == ~cond); {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:23,868 INFO L290 TraceCheckUtils]: 67: Hoare triple {14107#(<= ~counter~0 6)} assume true; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:23,868 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14107#(<= ~counter~0 6)} {14107#(<= ~counter~0 6)} #63#return; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:23,869 INFO L290 TraceCheckUtils]: 69: Hoare triple {14107#(<= ~counter~0 6)} assume !!(0 != ~r~0); {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:23,869 INFO L290 TraceCheckUtils]: 70: Hoare triple {14107#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:23,869 INFO L290 TraceCheckUtils]: 71: Hoare triple {14107#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:23,870 INFO L290 TraceCheckUtils]: 72: Hoare triple {14135#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:23,870 INFO L272 TraceCheckUtils]: 73: Hoare triple {14135#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:23,870 INFO L290 TraceCheckUtils]: 74: Hoare triple {14135#(<= ~counter~0 7)} ~cond := #in~cond; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:23,871 INFO L290 TraceCheckUtils]: 75: Hoare triple {14135#(<= ~counter~0 7)} assume !(0 == ~cond); {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:23,871 INFO L290 TraceCheckUtils]: 76: Hoare triple {14135#(<= ~counter~0 7)} assume true; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:23,872 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {14135#(<= ~counter~0 7)} {14135#(<= ~counter~0 7)} #63#return; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:23,872 INFO L290 TraceCheckUtils]: 78: Hoare triple {14135#(<= ~counter~0 7)} assume !!(0 != ~r~0); {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:23,872 INFO L290 TraceCheckUtils]: 79: Hoare triple {14135#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:23,873 INFO L290 TraceCheckUtils]: 80: Hoare triple {14135#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:23,873 INFO L290 TraceCheckUtils]: 81: Hoare triple {14163#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:23,873 INFO L272 TraceCheckUtils]: 82: Hoare triple {14163#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:23,874 INFO L290 TraceCheckUtils]: 83: Hoare triple {14163#(<= ~counter~0 8)} ~cond := #in~cond; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:23,874 INFO L290 TraceCheckUtils]: 84: Hoare triple {14163#(<= ~counter~0 8)} assume !(0 == ~cond); {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:23,874 INFO L290 TraceCheckUtils]: 85: Hoare triple {14163#(<= ~counter~0 8)} assume true; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:23,875 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14163#(<= ~counter~0 8)} {14163#(<= ~counter~0 8)} #63#return; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:23,876 INFO L290 TraceCheckUtils]: 87: Hoare triple {14163#(<= ~counter~0 8)} assume !!(0 != ~r~0); {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:23,876 INFO L290 TraceCheckUtils]: 88: Hoare triple {14163#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:23,877 INFO L290 TraceCheckUtils]: 89: Hoare triple {14163#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:23,877 INFO L290 TraceCheckUtils]: 90: Hoare triple {14191#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:23,877 INFO L272 TraceCheckUtils]: 91: Hoare triple {14191#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:23,878 INFO L290 TraceCheckUtils]: 92: Hoare triple {14191#(<= ~counter~0 9)} ~cond := #in~cond; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:23,878 INFO L290 TraceCheckUtils]: 93: Hoare triple {14191#(<= ~counter~0 9)} assume !(0 == ~cond); {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:23,878 INFO L290 TraceCheckUtils]: 94: Hoare triple {14191#(<= ~counter~0 9)} assume true; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:23,879 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {14191#(<= ~counter~0 9)} {14191#(<= ~counter~0 9)} #63#return; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:23,879 INFO L290 TraceCheckUtils]: 96: Hoare triple {14191#(<= ~counter~0 9)} assume !!(0 != ~r~0); {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:23,879 INFO L290 TraceCheckUtils]: 97: Hoare triple {14191#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:23,880 INFO L290 TraceCheckUtils]: 98: Hoare triple {14191#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:23,880 INFO L290 TraceCheckUtils]: 99: Hoare triple {14219#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:23,881 INFO L272 TraceCheckUtils]: 100: Hoare triple {14219#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:23,881 INFO L290 TraceCheckUtils]: 101: Hoare triple {14219#(<= ~counter~0 10)} ~cond := #in~cond; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:23,881 INFO L290 TraceCheckUtils]: 102: Hoare triple {14219#(<= ~counter~0 10)} assume !(0 == ~cond); {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:23,881 INFO L290 TraceCheckUtils]: 103: Hoare triple {14219#(<= ~counter~0 10)} assume true; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:23,882 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {14219#(<= ~counter~0 10)} {14219#(<= ~counter~0 10)} #63#return; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:23,882 INFO L290 TraceCheckUtils]: 105: Hoare triple {14219#(<= ~counter~0 10)} assume !!(0 != ~r~0); {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:23,883 INFO L290 TraceCheckUtils]: 106: Hoare triple {14219#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:23,883 INFO L290 TraceCheckUtils]: 107: Hoare triple {14219#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:23,883 INFO L290 TraceCheckUtils]: 108: Hoare triple {14247#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:23,884 INFO L272 TraceCheckUtils]: 109: Hoare triple {14247#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:23,884 INFO L290 TraceCheckUtils]: 110: Hoare triple {14247#(<= ~counter~0 11)} ~cond := #in~cond; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:23,884 INFO L290 TraceCheckUtils]: 111: Hoare triple {14247#(<= ~counter~0 11)} assume !(0 == ~cond); {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:23,885 INFO L290 TraceCheckUtils]: 112: Hoare triple {14247#(<= ~counter~0 11)} assume true; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:23,885 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {14247#(<= ~counter~0 11)} {14247#(<= ~counter~0 11)} #63#return; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:23,885 INFO L290 TraceCheckUtils]: 114: Hoare triple {14247#(<= ~counter~0 11)} assume !!(0 != ~r~0); {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:23,886 INFO L290 TraceCheckUtils]: 115: Hoare triple {14247#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:23,886 INFO L290 TraceCheckUtils]: 116: Hoare triple {14247#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:23,886 INFO L290 TraceCheckUtils]: 117: Hoare triple {14275#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:23,887 INFO L272 TraceCheckUtils]: 118: Hoare triple {14275#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:23,887 INFO L290 TraceCheckUtils]: 119: Hoare triple {14275#(<= ~counter~0 12)} ~cond := #in~cond; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:23,888 INFO L290 TraceCheckUtils]: 120: Hoare triple {14275#(<= ~counter~0 12)} assume !(0 == ~cond); {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:23,888 INFO L290 TraceCheckUtils]: 121: Hoare triple {14275#(<= ~counter~0 12)} assume true; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:23,888 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {14275#(<= ~counter~0 12)} {14275#(<= ~counter~0 12)} #63#return; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:23,889 INFO L290 TraceCheckUtils]: 123: Hoare triple {14275#(<= ~counter~0 12)} assume !!(0 != ~r~0); {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:23,889 INFO L290 TraceCheckUtils]: 124: Hoare triple {14275#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:23,889 INFO L290 TraceCheckUtils]: 125: Hoare triple {14275#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:23,897 INFO L290 TraceCheckUtils]: 126: Hoare triple {14303#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:23,897 INFO L272 TraceCheckUtils]: 127: Hoare triple {14303#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:23,898 INFO L290 TraceCheckUtils]: 128: Hoare triple {14303#(<= ~counter~0 13)} ~cond := #in~cond; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:23,898 INFO L290 TraceCheckUtils]: 129: Hoare triple {14303#(<= ~counter~0 13)} assume !(0 == ~cond); {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:23,898 INFO L290 TraceCheckUtils]: 130: Hoare triple {14303#(<= ~counter~0 13)} assume true; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:23,899 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {14303#(<= ~counter~0 13)} {14303#(<= ~counter~0 13)} #63#return; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:23,899 INFO L290 TraceCheckUtils]: 132: Hoare triple {14303#(<= ~counter~0 13)} assume !!(0 != ~r~0); {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:23,899 INFO L290 TraceCheckUtils]: 133: Hoare triple {14303#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:23,900 INFO L290 TraceCheckUtils]: 134: Hoare triple {14303#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14331#(<= |main_#t~post6| 13)} is VALID [2022-04-28 06:03:23,900 INFO L290 TraceCheckUtils]: 135: Hoare triple {14331#(<= |main_#t~post6| 13)} assume !(#t~post6 < 20);havoc #t~post6; {13911#false} is VALID [2022-04-28 06:03:23,900 INFO L272 TraceCheckUtils]: 136: Hoare triple {13911#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13911#false} is VALID [2022-04-28 06:03:23,900 INFO L290 TraceCheckUtils]: 137: Hoare triple {13911#false} ~cond := #in~cond; {13911#false} is VALID [2022-04-28 06:03:23,900 INFO L290 TraceCheckUtils]: 138: Hoare triple {13911#false} assume 0 == ~cond; {13911#false} is VALID [2022-04-28 06:03:23,900 INFO L290 TraceCheckUtils]: 139: Hoare triple {13911#false} assume !false; {13911#false} is VALID [2022-04-28 06:03:23,901 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 26 proven. 728 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:23,901 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:24,608 INFO L290 TraceCheckUtils]: 139: Hoare triple {13911#false} assume !false; {13911#false} is VALID [2022-04-28 06:03:24,608 INFO L290 TraceCheckUtils]: 138: Hoare triple {13911#false} assume 0 == ~cond; {13911#false} is VALID [2022-04-28 06:03:24,608 INFO L290 TraceCheckUtils]: 137: Hoare triple {13911#false} ~cond := #in~cond; {13911#false} is VALID [2022-04-28 06:03:24,608 INFO L272 TraceCheckUtils]: 136: Hoare triple {13911#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13911#false} is VALID [2022-04-28 06:03:24,608 INFO L290 TraceCheckUtils]: 135: Hoare triple {14359#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {13911#false} is VALID [2022-04-28 06:03:24,609 INFO L290 TraceCheckUtils]: 134: Hoare triple {14363#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14359#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:03:24,609 INFO L290 TraceCheckUtils]: 133: Hoare triple {14363#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14363#(< ~counter~0 20)} is VALID [2022-04-28 06:03:24,609 INFO L290 TraceCheckUtils]: 132: Hoare triple {14363#(< ~counter~0 20)} assume !!(0 != ~r~0); {14363#(< ~counter~0 20)} is VALID [2022-04-28 06:03:24,610 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {13910#true} {14363#(< ~counter~0 20)} #63#return; {14363#(< ~counter~0 20)} is VALID [2022-04-28 06:03:24,610 INFO L290 TraceCheckUtils]: 130: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,610 INFO L290 TraceCheckUtils]: 129: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,610 INFO L290 TraceCheckUtils]: 128: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,610 INFO L272 TraceCheckUtils]: 127: Hoare triple {14363#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,610 INFO L290 TraceCheckUtils]: 126: Hoare triple {14363#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {14363#(< ~counter~0 20)} is VALID [2022-04-28 06:03:24,611 INFO L290 TraceCheckUtils]: 125: Hoare triple {14391#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14363#(< ~counter~0 20)} is VALID [2022-04-28 06:03:24,611 INFO L290 TraceCheckUtils]: 124: Hoare triple {14391#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14391#(< ~counter~0 19)} is VALID [2022-04-28 06:03:24,612 INFO L290 TraceCheckUtils]: 123: Hoare triple {14391#(< ~counter~0 19)} assume !!(0 != ~r~0); {14391#(< ~counter~0 19)} is VALID [2022-04-28 06:03:24,612 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13910#true} {14391#(< ~counter~0 19)} #63#return; {14391#(< ~counter~0 19)} is VALID [2022-04-28 06:03:24,612 INFO L290 TraceCheckUtils]: 121: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,612 INFO L290 TraceCheckUtils]: 120: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,612 INFO L290 TraceCheckUtils]: 119: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,612 INFO L272 TraceCheckUtils]: 118: Hoare triple {14391#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,613 INFO L290 TraceCheckUtils]: 117: Hoare triple {14391#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {14391#(< ~counter~0 19)} is VALID [2022-04-28 06:03:24,613 INFO L290 TraceCheckUtils]: 116: Hoare triple {14419#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14391#(< ~counter~0 19)} is VALID [2022-04-28 06:03:24,613 INFO L290 TraceCheckUtils]: 115: Hoare triple {14419#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14419#(< ~counter~0 18)} is VALID [2022-04-28 06:03:24,614 INFO L290 TraceCheckUtils]: 114: Hoare triple {14419#(< ~counter~0 18)} assume !!(0 != ~r~0); {14419#(< ~counter~0 18)} is VALID [2022-04-28 06:03:24,614 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {13910#true} {14419#(< ~counter~0 18)} #63#return; {14419#(< ~counter~0 18)} is VALID [2022-04-28 06:03:24,614 INFO L290 TraceCheckUtils]: 112: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,614 INFO L290 TraceCheckUtils]: 111: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,614 INFO L290 TraceCheckUtils]: 110: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,615 INFO L272 TraceCheckUtils]: 109: Hoare triple {14419#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,615 INFO L290 TraceCheckUtils]: 108: Hoare triple {14419#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {14419#(< ~counter~0 18)} is VALID [2022-04-28 06:03:24,615 INFO L290 TraceCheckUtils]: 107: Hoare triple {14447#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14419#(< ~counter~0 18)} is VALID [2022-04-28 06:03:24,616 INFO L290 TraceCheckUtils]: 106: Hoare triple {14447#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14447#(< ~counter~0 17)} is VALID [2022-04-28 06:03:24,616 INFO L290 TraceCheckUtils]: 105: Hoare triple {14447#(< ~counter~0 17)} assume !!(0 != ~r~0); {14447#(< ~counter~0 17)} is VALID [2022-04-28 06:03:24,616 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {13910#true} {14447#(< ~counter~0 17)} #63#return; {14447#(< ~counter~0 17)} is VALID [2022-04-28 06:03:24,616 INFO L290 TraceCheckUtils]: 103: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,617 INFO L290 TraceCheckUtils]: 102: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,617 INFO L290 TraceCheckUtils]: 101: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,617 INFO L272 TraceCheckUtils]: 100: Hoare triple {14447#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,617 INFO L290 TraceCheckUtils]: 99: Hoare triple {14447#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {14447#(< ~counter~0 17)} is VALID [2022-04-28 06:03:24,620 INFO L290 TraceCheckUtils]: 98: Hoare triple {14475#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14447#(< ~counter~0 17)} is VALID [2022-04-28 06:03:24,621 INFO L290 TraceCheckUtils]: 97: Hoare triple {14475#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14475#(< ~counter~0 16)} is VALID [2022-04-28 06:03:24,621 INFO L290 TraceCheckUtils]: 96: Hoare triple {14475#(< ~counter~0 16)} assume !!(0 != ~r~0); {14475#(< ~counter~0 16)} is VALID [2022-04-28 06:03:24,622 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {13910#true} {14475#(< ~counter~0 16)} #63#return; {14475#(< ~counter~0 16)} is VALID [2022-04-28 06:03:24,622 INFO L290 TraceCheckUtils]: 94: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,622 INFO L290 TraceCheckUtils]: 93: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,622 INFO L290 TraceCheckUtils]: 92: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,622 INFO L272 TraceCheckUtils]: 91: Hoare triple {14475#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,622 INFO L290 TraceCheckUtils]: 90: Hoare triple {14475#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {14475#(< ~counter~0 16)} is VALID [2022-04-28 06:03:24,623 INFO L290 TraceCheckUtils]: 89: Hoare triple {14503#(< ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14475#(< ~counter~0 16)} is VALID [2022-04-28 06:03:24,623 INFO L290 TraceCheckUtils]: 88: Hoare triple {14503#(< ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14503#(< ~counter~0 15)} is VALID [2022-04-28 06:03:24,623 INFO L290 TraceCheckUtils]: 87: Hoare triple {14503#(< ~counter~0 15)} assume !!(0 != ~r~0); {14503#(< ~counter~0 15)} is VALID [2022-04-28 06:03:24,624 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13910#true} {14503#(< ~counter~0 15)} #63#return; {14503#(< ~counter~0 15)} is VALID [2022-04-28 06:03:24,624 INFO L290 TraceCheckUtils]: 85: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,624 INFO L290 TraceCheckUtils]: 84: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,624 INFO L290 TraceCheckUtils]: 83: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,624 INFO L272 TraceCheckUtils]: 82: Hoare triple {14503#(< ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,624 INFO L290 TraceCheckUtils]: 81: Hoare triple {14503#(< ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {14503#(< ~counter~0 15)} is VALID [2022-04-28 06:03:24,625 INFO L290 TraceCheckUtils]: 80: Hoare triple {14303#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14503#(< ~counter~0 15)} is VALID [2022-04-28 06:03:24,625 INFO L290 TraceCheckUtils]: 79: Hoare triple {14303#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:24,625 INFO L290 TraceCheckUtils]: 78: Hoare triple {14303#(<= ~counter~0 13)} assume !!(0 != ~r~0); {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:24,626 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13910#true} {14303#(<= ~counter~0 13)} #63#return; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:24,626 INFO L290 TraceCheckUtils]: 76: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,626 INFO L290 TraceCheckUtils]: 75: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,626 INFO L290 TraceCheckUtils]: 74: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,626 INFO L272 TraceCheckUtils]: 73: Hoare triple {14303#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,626 INFO L290 TraceCheckUtils]: 72: Hoare triple {14303#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:24,627 INFO L290 TraceCheckUtils]: 71: Hoare triple {14275#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14303#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:24,627 INFO L290 TraceCheckUtils]: 70: Hoare triple {14275#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:24,627 INFO L290 TraceCheckUtils]: 69: Hoare triple {14275#(<= ~counter~0 12)} assume !!(0 != ~r~0); {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:24,628 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13910#true} {14275#(<= ~counter~0 12)} #63#return; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:24,628 INFO L290 TraceCheckUtils]: 67: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,628 INFO L290 TraceCheckUtils]: 66: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,628 INFO L290 TraceCheckUtils]: 65: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,628 INFO L272 TraceCheckUtils]: 64: Hoare triple {14275#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,629 INFO L290 TraceCheckUtils]: 63: Hoare triple {14275#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:24,629 INFO L290 TraceCheckUtils]: 62: Hoare triple {14247#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14275#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:24,629 INFO L290 TraceCheckUtils]: 61: Hoare triple {14247#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:24,630 INFO L290 TraceCheckUtils]: 60: Hoare triple {14247#(<= ~counter~0 11)} assume !!(0 != ~r~0); {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:24,630 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13910#true} {14247#(<= ~counter~0 11)} #63#return; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:24,630 INFO L290 TraceCheckUtils]: 58: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,630 INFO L290 TraceCheckUtils]: 57: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,630 INFO L290 TraceCheckUtils]: 56: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,630 INFO L272 TraceCheckUtils]: 55: Hoare triple {14247#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,631 INFO L290 TraceCheckUtils]: 54: Hoare triple {14247#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:24,631 INFO L290 TraceCheckUtils]: 53: Hoare triple {14219#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14247#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:24,631 INFO L290 TraceCheckUtils]: 52: Hoare triple {14219#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:24,632 INFO L290 TraceCheckUtils]: 51: Hoare triple {14219#(<= ~counter~0 10)} assume !!(0 != ~r~0); {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:24,632 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13910#true} {14219#(<= ~counter~0 10)} #63#return; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:24,632 INFO L290 TraceCheckUtils]: 49: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,632 INFO L290 TraceCheckUtils]: 48: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,632 INFO L290 TraceCheckUtils]: 47: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,633 INFO L272 TraceCheckUtils]: 46: Hoare triple {14219#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,633 INFO L290 TraceCheckUtils]: 45: Hoare triple {14219#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:24,633 INFO L290 TraceCheckUtils]: 44: Hoare triple {14191#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14219#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:24,634 INFO L290 TraceCheckUtils]: 43: Hoare triple {14191#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:24,634 INFO L290 TraceCheckUtils]: 42: Hoare triple {14191#(<= ~counter~0 9)} assume !!(0 != ~r~0); {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:24,634 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13910#true} {14191#(<= ~counter~0 9)} #63#return; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:24,634 INFO L290 TraceCheckUtils]: 40: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,635 INFO L290 TraceCheckUtils]: 39: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,635 INFO L290 TraceCheckUtils]: 38: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,635 INFO L272 TraceCheckUtils]: 37: Hoare triple {14191#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,635 INFO L290 TraceCheckUtils]: 36: Hoare triple {14191#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:24,635 INFO L290 TraceCheckUtils]: 35: Hoare triple {14163#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14191#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:24,636 INFO L290 TraceCheckUtils]: 34: Hoare triple {14163#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:24,636 INFO L290 TraceCheckUtils]: 33: Hoare triple {14163#(<= ~counter~0 8)} assume !!(0 != ~r~0); {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:24,637 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13910#true} {14163#(<= ~counter~0 8)} #63#return; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:24,637 INFO L290 TraceCheckUtils]: 31: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,637 INFO L272 TraceCheckUtils]: 28: Hoare triple {14163#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {14163#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:24,638 INFO L290 TraceCheckUtils]: 26: Hoare triple {14135#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14163#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:24,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {14135#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:24,638 INFO L290 TraceCheckUtils]: 24: Hoare triple {14135#(<= ~counter~0 7)} assume !!(0 != ~r~0); {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:24,639 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13910#true} {14135#(<= ~counter~0 7)} #63#return; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:24,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,639 INFO L290 TraceCheckUtils]: 21: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,639 INFO L290 TraceCheckUtils]: 20: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,639 INFO L272 TraceCheckUtils]: 19: Hoare triple {14135#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,639 INFO L290 TraceCheckUtils]: 18: Hoare triple {14135#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:24,640 INFO L290 TraceCheckUtils]: 17: Hoare triple {14107#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14135#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:24,640 INFO L290 TraceCheckUtils]: 16: Hoare triple {14107#(<= ~counter~0 6)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:24,640 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13910#true} {14107#(<= ~counter~0 6)} #61#return; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:24,641 INFO L290 TraceCheckUtils]: 14: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,641 INFO L290 TraceCheckUtils]: 13: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,641 INFO L290 TraceCheckUtils]: 12: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,641 INFO L272 TraceCheckUtils]: 11: Hoare triple {14107#(<= ~counter~0 6)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,641 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13910#true} {14107#(<= ~counter~0 6)} #59#return; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:24,641 INFO L290 TraceCheckUtils]: 9: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-28 06:03:24,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-28 06:03:24,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-28 06:03:24,642 INFO L272 TraceCheckUtils]: 6: Hoare triple {14107#(<= ~counter~0 6)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13910#true} is VALID [2022-04-28 06:03:24,643 INFO L290 TraceCheckUtils]: 5: Hoare triple {14107#(<= ~counter~0 6)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:24,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {14107#(<= ~counter~0 6)} call #t~ret7 := main(); {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:24,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14107#(<= ~counter~0 6)} {13910#true} #67#return; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:24,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {14107#(<= ~counter~0 6)} assume true; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:24,645 INFO L290 TraceCheckUtils]: 1: Hoare triple {13910#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; {14107#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:24,645 INFO L272 TraceCheckUtils]: 0: Hoare triple {13910#true} call ULTIMATE.init(); {13910#true} is VALID [2022-04-28 06:03:24,646 INFO L134 CoverageAnalysis]: Checked inductivity of 758 backedges. 26 proven. 416 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-28 06:03:24,646 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:24,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111621350] [2022-04-28 06:03:24,646 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:24,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [513242026] [2022-04-28 06:03:24,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [513242026] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:24,646 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:24,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-28 06:03:24,647 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:24,647 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [258192928] [2022-04-28 06:03:24,647 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [258192928] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:24,647 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:24,647 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-28 06:03:24,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31109987] [2022-04-28 06:03:24,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:24,648 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, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 140 [2022-04-28 06:03:24,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:24,648 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, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:03:24,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:24,742 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-28 06:03:24,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:24,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-28 06:03:24,743 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:03:24,743 INFO L87 Difference]: Start difference. First operand 137 states and 151 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, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:03:25,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:25,380 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2022-04-28 06:03:25,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-28 06:03:25,381 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, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) Word has length 140 [2022-04-28 06:03:25,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:25,381 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, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:03:25,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 165 transitions. [2022-04-28 06:03:25,385 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, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:03:25,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 165 transitions. [2022-04-28 06:03:25,389 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 165 transitions. [2022-04-28 06:03:25,537 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:25,540 INFO L225 Difference]: With dead ends: 151 [2022-04-28 06:03:25,540 INFO L226 Difference]: Without dead ends: 146 [2022-04-28 06:03:25,541 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 292 GetRequests, 256 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-28 06:03:25,541 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 60 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 174 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:25,541 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 174 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:03:25,542 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-28 06:03:25,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-28 06:03:25,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:25,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 146 states. Second operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 06:03:25,741 INFO L74 IsIncluded]: Start isIncluded. First operand 146 states. Second operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 06:03:25,741 INFO L87 Difference]: Start difference. First operand 146 states. Second operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 06:03:25,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:25,747 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-04-28 06:03:25,747 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2022-04-28 06:03:25,747 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:25,747 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:25,748 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 146 states. [2022-04-28 06:03:25,748 INFO L87 Difference]: Start difference. First operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) Second operand 146 states. [2022-04-28 06:03:25,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:25,751 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-04-28 06:03:25,751 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2022-04-28 06:03:25,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:25,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:25,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:25,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:25,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 110 states have (on average 1.1363636363636365) internal successors, (125), 110 states have internal predecessors, (125), 19 states have call successors, (19), 18 states have call predecessors, (19), 16 states have return successors, (17), 17 states have call predecessors, (17), 17 states have call successors, (17) [2022-04-28 06:03:25,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2022-04-28 06:03:25,755 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 140 [2022-04-28 06:03:25,755 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:25,755 INFO L495 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2022-04-28 06:03:25,756 INFO L496 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, (18), 16 states have call predecessors, (18), 14 states have return successors, (16), 14 states have call predecessors, (16), 15 states have call successors, (16) [2022-04-28 06:03:25,756 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 161 transitions. [2022-04-28 06:03:27,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:27,097 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2022-04-28 06:03:27,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-28 06:03:27,098 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:27,098 INFO L195 NwaCegarLoop]: trace histogram [15, 15, 14, 14, 14, 14, 14, 14, 14, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:27,117 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-28 06:03:27,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-28 06:03:27,308 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:27,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:27,308 INFO L85 PathProgramCache]: Analyzing trace with hash -1088976298, now seen corresponding path program 27 times [2022-04-28 06:03:27,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:27,308 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1153090519] [2022-04-28 06:03:27,309 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:27,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1088976298, now seen corresponding path program 28 times [2022-04-28 06:03:27,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:27,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870118664] [2022-04-28 06:03:27,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:27,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:27,325 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:27,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1188324251] [2022-04-28 06:03:27,325 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:03:27,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:27,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:27,327 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:27,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-28 06:03:27,575 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:03:27,576 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:27,577 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-28 06:03:27,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:27,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:28,315 INFO L272 TraceCheckUtils]: 0: Hoare triple {15685#true} call ULTIMATE.init(); {15685#true} is VALID [2022-04-28 06:03:28,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {15685#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; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,316 INFO L290 TraceCheckUtils]: 2: Hoare triple {15693#(<= ~counter~0 0)} assume true; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,317 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15693#(<= ~counter~0 0)} {15685#true} #67#return; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,317 INFO L272 TraceCheckUtils]: 4: Hoare triple {15693#(<= ~counter~0 0)} call #t~ret7 := main(); {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,317 INFO L290 TraceCheckUtils]: 5: Hoare triple {15693#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,318 INFO L272 TraceCheckUtils]: 6: Hoare triple {15693#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {15693#(<= ~counter~0 0)} ~cond := #in~cond; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {15693#(<= ~counter~0 0)} assume !(0 == ~cond); {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,319 INFO L290 TraceCheckUtils]: 9: Hoare triple {15693#(<= ~counter~0 0)} assume true; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,319 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15693#(<= ~counter~0 0)} {15693#(<= ~counter~0 0)} #59#return; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,319 INFO L272 TraceCheckUtils]: 11: Hoare triple {15693#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,320 INFO L290 TraceCheckUtils]: 12: Hoare triple {15693#(<= ~counter~0 0)} ~cond := #in~cond; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,320 INFO L290 TraceCheckUtils]: 13: Hoare triple {15693#(<= ~counter~0 0)} assume !(0 == ~cond); {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {15693#(<= ~counter~0 0)} assume true; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,321 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15693#(<= ~counter~0 0)} {15693#(<= ~counter~0 0)} #61#return; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {15693#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15693#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:28,321 INFO L290 TraceCheckUtils]: 17: Hoare triple {15693#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15742#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:28,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {15742#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {15742#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:28,322 INFO L272 TraceCheckUtils]: 19: Hoare triple {15742#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15742#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:28,323 INFO L290 TraceCheckUtils]: 20: Hoare triple {15742#(<= ~counter~0 1)} ~cond := #in~cond; {15742#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:28,323 INFO L290 TraceCheckUtils]: 21: Hoare triple {15742#(<= ~counter~0 1)} assume !(0 == ~cond); {15742#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:28,323 INFO L290 TraceCheckUtils]: 22: Hoare triple {15742#(<= ~counter~0 1)} assume true; {15742#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:28,324 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15742#(<= ~counter~0 1)} {15742#(<= ~counter~0 1)} #63#return; {15742#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:28,324 INFO L290 TraceCheckUtils]: 24: Hoare triple {15742#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15742#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:28,324 INFO L290 TraceCheckUtils]: 25: Hoare triple {15742#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15742#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:28,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {15742#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15770#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:28,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {15770#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {15770#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:28,325 INFO L272 TraceCheckUtils]: 28: Hoare triple {15770#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15770#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:28,326 INFO L290 TraceCheckUtils]: 29: Hoare triple {15770#(<= ~counter~0 2)} ~cond := #in~cond; {15770#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:28,326 INFO L290 TraceCheckUtils]: 30: Hoare triple {15770#(<= ~counter~0 2)} assume !(0 == ~cond); {15770#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:28,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {15770#(<= ~counter~0 2)} assume true; {15770#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:28,327 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15770#(<= ~counter~0 2)} {15770#(<= ~counter~0 2)} #63#return; {15770#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:28,327 INFO L290 TraceCheckUtils]: 33: Hoare triple {15770#(<= ~counter~0 2)} assume !!(0 != ~r~0); {15770#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:28,327 INFO L290 TraceCheckUtils]: 34: Hoare triple {15770#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15770#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:28,328 INFO L290 TraceCheckUtils]: 35: Hoare triple {15770#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15798#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:28,328 INFO L290 TraceCheckUtils]: 36: Hoare triple {15798#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {15798#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:28,329 INFO L272 TraceCheckUtils]: 37: Hoare triple {15798#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15798#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:28,329 INFO L290 TraceCheckUtils]: 38: Hoare triple {15798#(<= ~counter~0 3)} ~cond := #in~cond; {15798#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:28,329 INFO L290 TraceCheckUtils]: 39: Hoare triple {15798#(<= ~counter~0 3)} assume !(0 == ~cond); {15798#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:28,329 INFO L290 TraceCheckUtils]: 40: Hoare triple {15798#(<= ~counter~0 3)} assume true; {15798#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:28,330 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15798#(<= ~counter~0 3)} {15798#(<= ~counter~0 3)} #63#return; {15798#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:28,330 INFO L290 TraceCheckUtils]: 42: Hoare triple {15798#(<= ~counter~0 3)} assume !!(0 != ~r~0); {15798#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:28,330 INFO L290 TraceCheckUtils]: 43: Hoare triple {15798#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15798#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:28,331 INFO L290 TraceCheckUtils]: 44: Hoare triple {15798#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15826#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:28,331 INFO L290 TraceCheckUtils]: 45: Hoare triple {15826#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {15826#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:28,332 INFO L272 TraceCheckUtils]: 46: Hoare triple {15826#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15826#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:28,332 INFO L290 TraceCheckUtils]: 47: Hoare triple {15826#(<= ~counter~0 4)} ~cond := #in~cond; {15826#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:28,332 INFO L290 TraceCheckUtils]: 48: Hoare triple {15826#(<= ~counter~0 4)} assume !(0 == ~cond); {15826#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:28,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {15826#(<= ~counter~0 4)} assume true; {15826#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:28,333 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15826#(<= ~counter~0 4)} {15826#(<= ~counter~0 4)} #63#return; {15826#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:28,333 INFO L290 TraceCheckUtils]: 51: Hoare triple {15826#(<= ~counter~0 4)} assume !!(0 != ~r~0); {15826#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:28,334 INFO L290 TraceCheckUtils]: 52: Hoare triple {15826#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15826#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:28,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {15826#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:28,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {15854#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:28,335 INFO L272 TraceCheckUtils]: 55: Hoare triple {15854#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:28,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {15854#(<= ~counter~0 5)} ~cond := #in~cond; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:28,335 INFO L290 TraceCheckUtils]: 57: Hoare triple {15854#(<= ~counter~0 5)} assume !(0 == ~cond); {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:28,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {15854#(<= ~counter~0 5)} assume true; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:28,336 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15854#(<= ~counter~0 5)} {15854#(<= ~counter~0 5)} #63#return; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:28,336 INFO L290 TraceCheckUtils]: 60: Hoare triple {15854#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:28,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {15854#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:28,337 INFO L290 TraceCheckUtils]: 62: Hoare triple {15854#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:28,337 INFO L290 TraceCheckUtils]: 63: Hoare triple {15882#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:28,338 INFO L272 TraceCheckUtils]: 64: Hoare triple {15882#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:28,338 INFO L290 TraceCheckUtils]: 65: Hoare triple {15882#(<= ~counter~0 6)} ~cond := #in~cond; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:28,338 INFO L290 TraceCheckUtils]: 66: Hoare triple {15882#(<= ~counter~0 6)} assume !(0 == ~cond); {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:28,339 INFO L290 TraceCheckUtils]: 67: Hoare triple {15882#(<= ~counter~0 6)} assume true; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:28,339 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15882#(<= ~counter~0 6)} {15882#(<= ~counter~0 6)} #63#return; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:28,340 INFO L290 TraceCheckUtils]: 69: Hoare triple {15882#(<= ~counter~0 6)} assume !!(0 != ~r~0); {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:28,340 INFO L290 TraceCheckUtils]: 70: Hoare triple {15882#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:28,340 INFO L290 TraceCheckUtils]: 71: Hoare triple {15882#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:28,341 INFO L290 TraceCheckUtils]: 72: Hoare triple {15910#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:28,341 INFO L272 TraceCheckUtils]: 73: Hoare triple {15910#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:28,341 INFO L290 TraceCheckUtils]: 74: Hoare triple {15910#(<= ~counter~0 7)} ~cond := #in~cond; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:28,343 INFO L290 TraceCheckUtils]: 75: Hoare triple {15910#(<= ~counter~0 7)} assume !(0 == ~cond); {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:28,343 INFO L290 TraceCheckUtils]: 76: Hoare triple {15910#(<= ~counter~0 7)} assume true; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:28,344 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15910#(<= ~counter~0 7)} {15910#(<= ~counter~0 7)} #63#return; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:28,344 INFO L290 TraceCheckUtils]: 78: Hoare triple {15910#(<= ~counter~0 7)} assume !!(0 != ~r~0); {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:28,345 INFO L290 TraceCheckUtils]: 79: Hoare triple {15910#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:28,345 INFO L290 TraceCheckUtils]: 80: Hoare triple {15910#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:28,345 INFO L290 TraceCheckUtils]: 81: Hoare triple {15938#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:28,346 INFO L272 TraceCheckUtils]: 82: Hoare triple {15938#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:28,346 INFO L290 TraceCheckUtils]: 83: Hoare triple {15938#(<= ~counter~0 8)} ~cond := #in~cond; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:28,346 INFO L290 TraceCheckUtils]: 84: Hoare triple {15938#(<= ~counter~0 8)} assume !(0 == ~cond); {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:28,347 INFO L290 TraceCheckUtils]: 85: Hoare triple {15938#(<= ~counter~0 8)} assume true; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:28,347 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15938#(<= ~counter~0 8)} {15938#(<= ~counter~0 8)} #63#return; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:28,347 INFO L290 TraceCheckUtils]: 87: Hoare triple {15938#(<= ~counter~0 8)} assume !!(0 != ~r~0); {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:28,348 INFO L290 TraceCheckUtils]: 88: Hoare triple {15938#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:28,348 INFO L290 TraceCheckUtils]: 89: Hoare triple {15938#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:28,348 INFO L290 TraceCheckUtils]: 90: Hoare triple {15966#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:28,349 INFO L272 TraceCheckUtils]: 91: Hoare triple {15966#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:28,349 INFO L290 TraceCheckUtils]: 92: Hoare triple {15966#(<= ~counter~0 9)} ~cond := #in~cond; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:28,349 INFO L290 TraceCheckUtils]: 93: Hoare triple {15966#(<= ~counter~0 9)} assume !(0 == ~cond); {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:28,350 INFO L290 TraceCheckUtils]: 94: Hoare triple {15966#(<= ~counter~0 9)} assume true; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:28,350 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {15966#(<= ~counter~0 9)} {15966#(<= ~counter~0 9)} #63#return; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:28,350 INFO L290 TraceCheckUtils]: 96: Hoare triple {15966#(<= ~counter~0 9)} assume !!(0 != ~r~0); {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:28,351 INFO L290 TraceCheckUtils]: 97: Hoare triple {15966#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:28,351 INFO L290 TraceCheckUtils]: 98: Hoare triple {15966#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:28,351 INFO L290 TraceCheckUtils]: 99: Hoare triple {15994#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:28,352 INFO L272 TraceCheckUtils]: 100: Hoare triple {15994#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:28,352 INFO L290 TraceCheckUtils]: 101: Hoare triple {15994#(<= ~counter~0 10)} ~cond := #in~cond; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:28,353 INFO L290 TraceCheckUtils]: 102: Hoare triple {15994#(<= ~counter~0 10)} assume !(0 == ~cond); {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:28,353 INFO L290 TraceCheckUtils]: 103: Hoare triple {15994#(<= ~counter~0 10)} assume true; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:28,353 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {15994#(<= ~counter~0 10)} {15994#(<= ~counter~0 10)} #63#return; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:28,354 INFO L290 TraceCheckUtils]: 105: Hoare triple {15994#(<= ~counter~0 10)} assume !!(0 != ~r~0); {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:28,354 INFO L290 TraceCheckUtils]: 106: Hoare triple {15994#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:28,354 INFO L290 TraceCheckUtils]: 107: Hoare triple {15994#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:28,355 INFO L290 TraceCheckUtils]: 108: Hoare triple {16022#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:28,355 INFO L272 TraceCheckUtils]: 109: Hoare triple {16022#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:28,355 INFO L290 TraceCheckUtils]: 110: Hoare triple {16022#(<= ~counter~0 11)} ~cond := #in~cond; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:28,356 INFO L290 TraceCheckUtils]: 111: Hoare triple {16022#(<= ~counter~0 11)} assume !(0 == ~cond); {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:28,356 INFO L290 TraceCheckUtils]: 112: Hoare triple {16022#(<= ~counter~0 11)} assume true; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:28,356 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {16022#(<= ~counter~0 11)} {16022#(<= ~counter~0 11)} #63#return; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:28,357 INFO L290 TraceCheckUtils]: 114: Hoare triple {16022#(<= ~counter~0 11)} assume !!(0 != ~r~0); {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:28,357 INFO L290 TraceCheckUtils]: 115: Hoare triple {16022#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:28,357 INFO L290 TraceCheckUtils]: 116: Hoare triple {16022#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:28,358 INFO L290 TraceCheckUtils]: 117: Hoare triple {16050#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:28,358 INFO L272 TraceCheckUtils]: 118: Hoare triple {16050#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:28,359 INFO L290 TraceCheckUtils]: 119: Hoare triple {16050#(<= ~counter~0 12)} ~cond := #in~cond; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:28,359 INFO L290 TraceCheckUtils]: 120: Hoare triple {16050#(<= ~counter~0 12)} assume !(0 == ~cond); {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:28,359 INFO L290 TraceCheckUtils]: 121: Hoare triple {16050#(<= ~counter~0 12)} assume true; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:28,360 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16050#(<= ~counter~0 12)} {16050#(<= ~counter~0 12)} #63#return; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:28,360 INFO L290 TraceCheckUtils]: 123: Hoare triple {16050#(<= ~counter~0 12)} assume !!(0 != ~r~0); {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:28,360 INFO L290 TraceCheckUtils]: 124: Hoare triple {16050#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:28,361 INFO L290 TraceCheckUtils]: 125: Hoare triple {16050#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:28,361 INFO L290 TraceCheckUtils]: 126: Hoare triple {16078#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:28,361 INFO L272 TraceCheckUtils]: 127: Hoare triple {16078#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:28,362 INFO L290 TraceCheckUtils]: 128: Hoare triple {16078#(<= ~counter~0 13)} ~cond := #in~cond; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:28,362 INFO L290 TraceCheckUtils]: 129: Hoare triple {16078#(<= ~counter~0 13)} assume !(0 == ~cond); {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:28,362 INFO L290 TraceCheckUtils]: 130: Hoare triple {16078#(<= ~counter~0 13)} assume true; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:28,363 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {16078#(<= ~counter~0 13)} {16078#(<= ~counter~0 13)} #63#return; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:28,363 INFO L290 TraceCheckUtils]: 132: Hoare triple {16078#(<= ~counter~0 13)} assume !!(0 != ~r~0); {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:28,363 INFO L290 TraceCheckUtils]: 133: Hoare triple {16078#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:28,364 INFO L290 TraceCheckUtils]: 134: Hoare triple {16078#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:28,364 INFO L290 TraceCheckUtils]: 135: Hoare triple {16106#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:28,365 INFO L272 TraceCheckUtils]: 136: Hoare triple {16106#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:28,365 INFO L290 TraceCheckUtils]: 137: Hoare triple {16106#(<= ~counter~0 14)} ~cond := #in~cond; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:28,365 INFO L290 TraceCheckUtils]: 138: Hoare triple {16106#(<= ~counter~0 14)} assume !(0 == ~cond); {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:28,365 INFO L290 TraceCheckUtils]: 139: Hoare triple {16106#(<= ~counter~0 14)} assume true; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:28,366 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {16106#(<= ~counter~0 14)} {16106#(<= ~counter~0 14)} #63#return; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:28,366 INFO L290 TraceCheckUtils]: 141: Hoare triple {16106#(<= ~counter~0 14)} assume !!(0 != ~r~0); {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:28,366 INFO L290 TraceCheckUtils]: 142: Hoare triple {16106#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:28,367 INFO L290 TraceCheckUtils]: 143: Hoare triple {16106#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16134#(<= |main_#t~post6| 14)} is VALID [2022-04-28 06:03:28,367 INFO L290 TraceCheckUtils]: 144: Hoare triple {16134#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {15686#false} is VALID [2022-04-28 06:03:28,367 INFO L272 TraceCheckUtils]: 145: Hoare triple {15686#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15686#false} is VALID [2022-04-28 06:03:28,367 INFO L290 TraceCheckUtils]: 146: Hoare triple {15686#false} ~cond := #in~cond; {15686#false} is VALID [2022-04-28 06:03:28,367 INFO L290 TraceCheckUtils]: 147: Hoare triple {15686#false} assume 0 == ~cond; {15686#false} is VALID [2022-04-28 06:03:28,367 INFO L290 TraceCheckUtils]: 148: Hoare triple {15686#false} assume !false; {15686#false} is VALID [2022-04-28 06:03:28,368 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 28 proven. 847 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:28,368 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:29,050 INFO L290 TraceCheckUtils]: 148: Hoare triple {15686#false} assume !false; {15686#false} is VALID [2022-04-28 06:03:29,050 INFO L290 TraceCheckUtils]: 147: Hoare triple {15686#false} assume 0 == ~cond; {15686#false} is VALID [2022-04-28 06:03:29,050 INFO L290 TraceCheckUtils]: 146: Hoare triple {15686#false} ~cond := #in~cond; {15686#false} is VALID [2022-04-28 06:03:29,050 INFO L272 TraceCheckUtils]: 145: Hoare triple {15686#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15686#false} is VALID [2022-04-28 06:03:29,050 INFO L290 TraceCheckUtils]: 144: Hoare triple {16162#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {15686#false} is VALID [2022-04-28 06:03:29,051 INFO L290 TraceCheckUtils]: 143: Hoare triple {16166#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16162#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:03:29,051 INFO L290 TraceCheckUtils]: 142: Hoare triple {16166#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16166#(< ~counter~0 20)} is VALID [2022-04-28 06:03:29,051 INFO L290 TraceCheckUtils]: 141: Hoare triple {16166#(< ~counter~0 20)} assume !!(0 != ~r~0); {16166#(< ~counter~0 20)} is VALID [2022-04-28 06:03:29,052 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {15685#true} {16166#(< ~counter~0 20)} #63#return; {16166#(< ~counter~0 20)} is VALID [2022-04-28 06:03:29,052 INFO L290 TraceCheckUtils]: 139: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,052 INFO L290 TraceCheckUtils]: 138: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,052 INFO L290 TraceCheckUtils]: 137: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,052 INFO L272 TraceCheckUtils]: 136: Hoare triple {16166#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,052 INFO L290 TraceCheckUtils]: 135: Hoare triple {16166#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {16166#(< ~counter~0 20)} is VALID [2022-04-28 06:03:29,053 INFO L290 TraceCheckUtils]: 134: Hoare triple {16194#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16166#(< ~counter~0 20)} is VALID [2022-04-28 06:03:29,053 INFO L290 TraceCheckUtils]: 133: Hoare triple {16194#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16194#(< ~counter~0 19)} is VALID [2022-04-28 06:03:29,054 INFO L290 TraceCheckUtils]: 132: Hoare triple {16194#(< ~counter~0 19)} assume !!(0 != ~r~0); {16194#(< ~counter~0 19)} is VALID [2022-04-28 06:03:29,054 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {15685#true} {16194#(< ~counter~0 19)} #63#return; {16194#(< ~counter~0 19)} is VALID [2022-04-28 06:03:29,054 INFO L290 TraceCheckUtils]: 130: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,054 INFO L290 TraceCheckUtils]: 129: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,055 INFO L290 TraceCheckUtils]: 128: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,055 INFO L272 TraceCheckUtils]: 127: Hoare triple {16194#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,055 INFO L290 TraceCheckUtils]: 126: Hoare triple {16194#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {16194#(< ~counter~0 19)} is VALID [2022-04-28 06:03:29,055 INFO L290 TraceCheckUtils]: 125: Hoare triple {16222#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16194#(< ~counter~0 19)} is VALID [2022-04-28 06:03:29,056 INFO L290 TraceCheckUtils]: 124: Hoare triple {16222#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16222#(< ~counter~0 18)} is VALID [2022-04-28 06:03:29,056 INFO L290 TraceCheckUtils]: 123: Hoare triple {16222#(< ~counter~0 18)} assume !!(0 != ~r~0); {16222#(< ~counter~0 18)} is VALID [2022-04-28 06:03:29,056 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15685#true} {16222#(< ~counter~0 18)} #63#return; {16222#(< ~counter~0 18)} is VALID [2022-04-28 06:03:29,057 INFO L290 TraceCheckUtils]: 121: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,057 INFO L290 TraceCheckUtils]: 120: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,057 INFO L290 TraceCheckUtils]: 119: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,057 INFO L272 TraceCheckUtils]: 118: Hoare triple {16222#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,057 INFO L290 TraceCheckUtils]: 117: Hoare triple {16222#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {16222#(< ~counter~0 18)} is VALID [2022-04-28 06:03:29,058 INFO L290 TraceCheckUtils]: 116: Hoare triple {16250#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16222#(< ~counter~0 18)} is VALID [2022-04-28 06:03:29,058 INFO L290 TraceCheckUtils]: 115: Hoare triple {16250#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16250#(< ~counter~0 17)} is VALID [2022-04-28 06:03:29,058 INFO L290 TraceCheckUtils]: 114: Hoare triple {16250#(< ~counter~0 17)} assume !!(0 != ~r~0); {16250#(< ~counter~0 17)} is VALID [2022-04-28 06:03:29,059 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {15685#true} {16250#(< ~counter~0 17)} #63#return; {16250#(< ~counter~0 17)} is VALID [2022-04-28 06:03:29,059 INFO L290 TraceCheckUtils]: 112: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,059 INFO L290 TraceCheckUtils]: 111: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,059 INFO L290 TraceCheckUtils]: 110: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,059 INFO L272 TraceCheckUtils]: 109: Hoare triple {16250#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,059 INFO L290 TraceCheckUtils]: 108: Hoare triple {16250#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {16250#(< ~counter~0 17)} is VALID [2022-04-28 06:03:29,060 INFO L290 TraceCheckUtils]: 107: Hoare triple {16278#(< ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16250#(< ~counter~0 17)} is VALID [2022-04-28 06:03:29,060 INFO L290 TraceCheckUtils]: 106: Hoare triple {16278#(< ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16278#(< ~counter~0 16)} is VALID [2022-04-28 06:03:29,060 INFO L290 TraceCheckUtils]: 105: Hoare triple {16278#(< ~counter~0 16)} assume !!(0 != ~r~0); {16278#(< ~counter~0 16)} is VALID [2022-04-28 06:03:29,061 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {15685#true} {16278#(< ~counter~0 16)} #63#return; {16278#(< ~counter~0 16)} is VALID [2022-04-28 06:03:29,061 INFO L290 TraceCheckUtils]: 103: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,061 INFO L290 TraceCheckUtils]: 102: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,061 INFO L290 TraceCheckUtils]: 101: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,061 INFO L272 TraceCheckUtils]: 100: Hoare triple {16278#(< ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,062 INFO L290 TraceCheckUtils]: 99: Hoare triple {16278#(< ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {16278#(< ~counter~0 16)} is VALID [2022-04-28 06:03:29,062 INFO L290 TraceCheckUtils]: 98: Hoare triple {16106#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16278#(< ~counter~0 16)} is VALID [2022-04-28 06:03:29,062 INFO L290 TraceCheckUtils]: 97: Hoare triple {16106#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:29,063 INFO L290 TraceCheckUtils]: 96: Hoare triple {16106#(<= ~counter~0 14)} assume !!(0 != ~r~0); {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:29,063 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {15685#true} {16106#(<= ~counter~0 14)} #63#return; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:29,063 INFO L290 TraceCheckUtils]: 94: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,063 INFO L290 TraceCheckUtils]: 93: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,063 INFO L290 TraceCheckUtils]: 92: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,064 INFO L272 TraceCheckUtils]: 91: Hoare triple {16106#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,064 INFO L290 TraceCheckUtils]: 90: Hoare triple {16106#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:29,064 INFO L290 TraceCheckUtils]: 89: Hoare triple {16078#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16106#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:29,065 INFO L290 TraceCheckUtils]: 88: Hoare triple {16078#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:29,065 INFO L290 TraceCheckUtils]: 87: Hoare triple {16078#(<= ~counter~0 13)} assume !!(0 != ~r~0); {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:29,065 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15685#true} {16078#(<= ~counter~0 13)} #63#return; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:29,066 INFO L290 TraceCheckUtils]: 85: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,066 INFO L290 TraceCheckUtils]: 84: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,066 INFO L290 TraceCheckUtils]: 83: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,066 INFO L272 TraceCheckUtils]: 82: Hoare triple {16078#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,066 INFO L290 TraceCheckUtils]: 81: Hoare triple {16078#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:29,066 INFO L290 TraceCheckUtils]: 80: Hoare triple {16050#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16078#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:29,067 INFO L290 TraceCheckUtils]: 79: Hoare triple {16050#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:29,067 INFO L290 TraceCheckUtils]: 78: Hoare triple {16050#(<= ~counter~0 12)} assume !!(0 != ~r~0); {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:29,068 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15685#true} {16050#(<= ~counter~0 12)} #63#return; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:29,068 INFO L290 TraceCheckUtils]: 76: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,068 INFO L290 TraceCheckUtils]: 75: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,068 INFO L290 TraceCheckUtils]: 74: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,068 INFO L272 TraceCheckUtils]: 73: Hoare triple {16050#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,068 INFO L290 TraceCheckUtils]: 72: Hoare triple {16050#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:29,069 INFO L290 TraceCheckUtils]: 71: Hoare triple {16022#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16050#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:29,069 INFO L290 TraceCheckUtils]: 70: Hoare triple {16022#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:29,069 INFO L290 TraceCheckUtils]: 69: Hoare triple {16022#(<= ~counter~0 11)} assume !!(0 != ~r~0); {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:29,070 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15685#true} {16022#(<= ~counter~0 11)} #63#return; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:29,070 INFO L290 TraceCheckUtils]: 67: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,070 INFO L290 TraceCheckUtils]: 66: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,070 INFO L290 TraceCheckUtils]: 65: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,070 INFO L272 TraceCheckUtils]: 64: Hoare triple {16022#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,070 INFO L290 TraceCheckUtils]: 63: Hoare triple {16022#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:29,071 INFO L290 TraceCheckUtils]: 62: Hoare triple {15994#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16022#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:29,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {15994#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:29,072 INFO L290 TraceCheckUtils]: 60: Hoare triple {15994#(<= ~counter~0 10)} assume !!(0 != ~r~0); {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:29,072 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15685#true} {15994#(<= ~counter~0 10)} #63#return; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:29,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,072 INFO L272 TraceCheckUtils]: 55: Hoare triple {15994#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {15994#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:29,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {15966#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15994#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:29,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {15966#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:29,074 INFO L290 TraceCheckUtils]: 51: Hoare triple {15966#(<= ~counter~0 9)} assume !!(0 != ~r~0); {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:29,074 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15685#true} {15966#(<= ~counter~0 9)} #63#return; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:29,074 INFO L290 TraceCheckUtils]: 49: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,074 INFO L290 TraceCheckUtils]: 48: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,074 INFO L290 TraceCheckUtils]: 47: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,075 INFO L272 TraceCheckUtils]: 46: Hoare triple {15966#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,075 INFO L290 TraceCheckUtils]: 45: Hoare triple {15966#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:29,075 INFO L290 TraceCheckUtils]: 44: Hoare triple {15938#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15966#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:29,076 INFO L290 TraceCheckUtils]: 43: Hoare triple {15938#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:29,076 INFO L290 TraceCheckUtils]: 42: Hoare triple {15938#(<= ~counter~0 8)} assume !!(0 != ~r~0); {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:29,076 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15685#true} {15938#(<= ~counter~0 8)} #63#return; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:29,076 INFO L290 TraceCheckUtils]: 40: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,077 INFO L290 TraceCheckUtils]: 39: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,077 INFO L290 TraceCheckUtils]: 38: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,077 INFO L272 TraceCheckUtils]: 37: Hoare triple {15938#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,077 INFO L290 TraceCheckUtils]: 36: Hoare triple {15938#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:29,077 INFO L290 TraceCheckUtils]: 35: Hoare triple {15910#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15938#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:29,078 INFO L290 TraceCheckUtils]: 34: Hoare triple {15910#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:29,078 INFO L290 TraceCheckUtils]: 33: Hoare triple {15910#(<= ~counter~0 7)} assume !!(0 != ~r~0); {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:29,079 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15685#true} {15910#(<= ~counter~0 7)} #63#return; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:29,079 INFO L290 TraceCheckUtils]: 31: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,079 INFO L290 TraceCheckUtils]: 30: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,079 INFO L290 TraceCheckUtils]: 29: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,079 INFO L272 TraceCheckUtils]: 28: Hoare triple {15910#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,079 INFO L290 TraceCheckUtils]: 27: Hoare triple {15910#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:29,080 INFO L290 TraceCheckUtils]: 26: Hoare triple {15882#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15910#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:29,080 INFO L290 TraceCheckUtils]: 25: Hoare triple {15882#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:29,080 INFO L290 TraceCheckUtils]: 24: Hoare triple {15882#(<= ~counter~0 6)} assume !!(0 != ~r~0); {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:29,081 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15685#true} {15882#(<= ~counter~0 6)} #63#return; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:29,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,081 INFO L290 TraceCheckUtils]: 20: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,081 INFO L272 TraceCheckUtils]: 19: Hoare triple {15882#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,081 INFO L290 TraceCheckUtils]: 18: Hoare triple {15882#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:29,082 INFO L290 TraceCheckUtils]: 17: Hoare triple {15854#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15882#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:29,082 INFO L290 TraceCheckUtils]: 16: Hoare triple {15854#(<= ~counter~0 5)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:29,083 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15685#true} {15854#(<= ~counter~0 5)} #61#return; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:29,083 INFO L290 TraceCheckUtils]: 14: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,083 INFO L290 TraceCheckUtils]: 13: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,083 INFO L290 TraceCheckUtils]: 12: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,083 INFO L272 TraceCheckUtils]: 11: Hoare triple {15854#(<= ~counter~0 5)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,083 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15685#true} {15854#(<= ~counter~0 5)} #59#return; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:29,083 INFO L290 TraceCheckUtils]: 9: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-28 06:03:29,083 INFO L290 TraceCheckUtils]: 8: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-28 06:03:29,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-28 06:03:29,084 INFO L272 TraceCheckUtils]: 6: Hoare triple {15854#(<= ~counter~0 5)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {15685#true} is VALID [2022-04-28 06:03:29,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {15854#(<= ~counter~0 5)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:29,084 INFO L272 TraceCheckUtils]: 4: Hoare triple {15854#(<= ~counter~0 5)} call #t~ret7 := main(); {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:29,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15854#(<= ~counter~0 5)} {15685#true} #67#return; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:29,085 INFO L290 TraceCheckUtils]: 2: Hoare triple {15854#(<= ~counter~0 5)} assume true; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:29,085 INFO L290 TraceCheckUtils]: 1: Hoare triple {15685#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; {15854#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:29,085 INFO L272 TraceCheckUtils]: 0: Hoare triple {15685#true} call ULTIMATE.init(); {15685#true} is VALID [2022-04-28 06:03:29,086 INFO L134 CoverageAnalysis]: Checked inductivity of 879 backedges. 28 proven. 483 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-28 06:03:29,086 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:29,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870118664] [2022-04-28 06:03:29,086 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:29,086 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1188324251] [2022-04-28 06:03:29,086 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1188324251] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:29,086 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:29,086 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-28 06:03:29,087 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:29,087 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1153090519] [2022-04-28 06:03:29,087 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1153090519] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:29,087 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:29,087 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-28 06:03:29,087 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401580940] [2022-04-28 06:03:29,087 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:29,088 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, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 149 [2022-04-28 06:03:29,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:29,088 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, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:29,192 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 146 edges. 146 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:29,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-28 06:03:29,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:29,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-28 06:03:29,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:03:29,193 INFO L87 Difference]: Start difference. First operand 146 states and 161 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, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:29,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:29,770 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2022-04-28 06:03:29,770 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-28 06:03:29,771 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, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) Word has length 149 [2022-04-28 06:03:29,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:29,771 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, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:29,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 175 transitions. [2022-04-28 06:03:29,775 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, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:29,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 175 transitions. [2022-04-28 06:03:29,778 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 175 transitions. [2022-04-28 06:03:29,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:29,932 INFO L225 Difference]: With dead ends: 160 [2022-04-28 06:03:29,932 INFO L226 Difference]: Without dead ends: 155 [2022-04-28 06:03:29,933 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 274 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-28 06:03:29,934 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 59 mSDsluCounter, 136 mSDsCounter, 0 mSdLazyCounter, 86 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 86 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:29,934 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 176 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 86 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:03:29,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-28 06:03:30,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-04-28 06:03:30,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:30,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 155 states. Second operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:03:30,156 INFO L74 IsIncluded]: Start isIncluded. First operand 155 states. Second operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:03:30,156 INFO L87 Difference]: Start difference. First operand 155 states. Second operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:03:30,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:30,159 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-04-28 06:03:30,159 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-04-28 06:03:30,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:30,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:30,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 155 states. [2022-04-28 06:03:30,160 INFO L87 Difference]: Start difference. First operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) Second operand 155 states. [2022-04-28 06:03:30,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:30,162 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-04-28 06:03:30,163 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-04-28 06:03:30,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:30,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:30,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:30,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:30,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 155 states, 117 states have (on average 1.1367521367521367) internal successors, (133), 117 states have internal predecessors, (133), 20 states have call successors, (20), 19 states have call predecessors, (20), 17 states have return successors, (18), 18 states have call predecessors, (18), 18 states have call successors, (18) [2022-04-28 06:03:30,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2022-04-28 06:03:30,166 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 149 [2022-04-28 06:03:30,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:30,167 INFO L495 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2022-04-28 06:03:30,167 INFO L496 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, (19), 17 states have call predecessors, (19), 15 states have return successors, (17), 15 states have call predecessors, (17), 16 states have call successors, (17) [2022-04-28 06:03:30,167 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 171 transitions. [2022-04-28 06:03:32,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 170 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:32,410 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-04-28 06:03:32,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-28 06:03:32,411 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:32,411 INFO L195 NwaCegarLoop]: trace histogram [16, 16, 15, 15, 15, 15, 15, 15, 15, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:32,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-28 06:03:32,611 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-04-28 06:03:32,611 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:32,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2060864036, now seen corresponding path program 29 times [2022-04-28 06:03:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:32,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1050560439] [2022-04-28 06:03:32,612 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:32,612 INFO L85 PathProgramCache]: Analyzing trace with hash -2060864036, now seen corresponding path program 30 times [2022-04-28 06:03:32,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:32,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263632286] [2022-04-28 06:03:32,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:32,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:32,641 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:32,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1339479291] [2022-04-28 06:03:32,641 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:03:32,641 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:32,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:32,642 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:32,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-28 06:03:54,545 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-28 06:03:54,546 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:54,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-28 06:03:54,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:54,607 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:03:55,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {17570#true} call ULTIMATE.init(); {17570#true} is VALID [2022-04-28 06:03:55,403 INFO L290 TraceCheckUtils]: 1: Hoare triple {17570#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; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,403 INFO L290 TraceCheckUtils]: 2: Hoare triple {17578#(<= ~counter~0 0)} assume true; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,403 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17578#(<= ~counter~0 0)} {17570#true} #67#return; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,403 INFO L272 TraceCheckUtils]: 4: Hoare triple {17578#(<= ~counter~0 0)} call #t~ret7 := main(); {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,404 INFO L290 TraceCheckUtils]: 5: Hoare triple {17578#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,404 INFO L272 TraceCheckUtils]: 6: Hoare triple {17578#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,404 INFO L290 TraceCheckUtils]: 7: Hoare triple {17578#(<= ~counter~0 0)} ~cond := #in~cond; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,405 INFO L290 TraceCheckUtils]: 8: Hoare triple {17578#(<= ~counter~0 0)} assume !(0 == ~cond); {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,405 INFO L290 TraceCheckUtils]: 9: Hoare triple {17578#(<= ~counter~0 0)} assume true; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,405 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17578#(<= ~counter~0 0)} {17578#(<= ~counter~0 0)} #59#return; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,406 INFO L272 TraceCheckUtils]: 11: Hoare triple {17578#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {17578#(<= ~counter~0 0)} ~cond := #in~cond; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {17578#(<= ~counter~0 0)} assume !(0 == ~cond); {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {17578#(<= ~counter~0 0)} assume true; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,407 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17578#(<= ~counter~0 0)} {17578#(<= ~counter~0 0)} #61#return; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,407 INFO L290 TraceCheckUtils]: 16: Hoare triple {17578#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17578#(<= ~counter~0 0)} is VALID [2022-04-28 06:03:55,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {17578#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17627#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:55,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {17627#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {17627#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:55,409 INFO L272 TraceCheckUtils]: 19: Hoare triple {17627#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17627#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:55,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {17627#(<= ~counter~0 1)} ~cond := #in~cond; {17627#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:55,409 INFO L290 TraceCheckUtils]: 21: Hoare triple {17627#(<= ~counter~0 1)} assume !(0 == ~cond); {17627#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:55,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {17627#(<= ~counter~0 1)} assume true; {17627#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:55,410 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17627#(<= ~counter~0 1)} {17627#(<= ~counter~0 1)} #63#return; {17627#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:55,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {17627#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17627#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:55,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {17627#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17627#(<= ~counter~0 1)} is VALID [2022-04-28 06:03:55,411 INFO L290 TraceCheckUtils]: 26: Hoare triple {17627#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17655#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:55,411 INFO L290 TraceCheckUtils]: 27: Hoare triple {17655#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {17655#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:55,412 INFO L272 TraceCheckUtils]: 28: Hoare triple {17655#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17655#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:55,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {17655#(<= ~counter~0 2)} ~cond := #in~cond; {17655#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:55,413 INFO L290 TraceCheckUtils]: 30: Hoare triple {17655#(<= ~counter~0 2)} assume !(0 == ~cond); {17655#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:55,413 INFO L290 TraceCheckUtils]: 31: Hoare triple {17655#(<= ~counter~0 2)} assume true; {17655#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:55,413 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17655#(<= ~counter~0 2)} {17655#(<= ~counter~0 2)} #63#return; {17655#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:55,414 INFO L290 TraceCheckUtils]: 33: Hoare triple {17655#(<= ~counter~0 2)} assume !!(0 != ~r~0); {17655#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:55,414 INFO L290 TraceCheckUtils]: 34: Hoare triple {17655#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17655#(<= ~counter~0 2)} is VALID [2022-04-28 06:03:55,414 INFO L290 TraceCheckUtils]: 35: Hoare triple {17655#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17683#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:55,415 INFO L290 TraceCheckUtils]: 36: Hoare triple {17683#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {17683#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:55,415 INFO L272 TraceCheckUtils]: 37: Hoare triple {17683#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17683#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:55,415 INFO L290 TraceCheckUtils]: 38: Hoare triple {17683#(<= ~counter~0 3)} ~cond := #in~cond; {17683#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:55,416 INFO L290 TraceCheckUtils]: 39: Hoare triple {17683#(<= ~counter~0 3)} assume !(0 == ~cond); {17683#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:55,416 INFO L290 TraceCheckUtils]: 40: Hoare triple {17683#(<= ~counter~0 3)} assume true; {17683#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:55,417 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17683#(<= ~counter~0 3)} {17683#(<= ~counter~0 3)} #63#return; {17683#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:55,417 INFO L290 TraceCheckUtils]: 42: Hoare triple {17683#(<= ~counter~0 3)} assume !!(0 != ~r~0); {17683#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:55,417 INFO L290 TraceCheckUtils]: 43: Hoare triple {17683#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17683#(<= ~counter~0 3)} is VALID [2022-04-28 06:03:55,418 INFO L290 TraceCheckUtils]: 44: Hoare triple {17683#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:55,418 INFO L290 TraceCheckUtils]: 45: Hoare triple {17711#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:55,418 INFO L272 TraceCheckUtils]: 46: Hoare triple {17711#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:55,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {17711#(<= ~counter~0 4)} ~cond := #in~cond; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:55,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {17711#(<= ~counter~0 4)} assume !(0 == ~cond); {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:55,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {17711#(<= ~counter~0 4)} assume true; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:55,420 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17711#(<= ~counter~0 4)} {17711#(<= ~counter~0 4)} #63#return; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:55,420 INFO L290 TraceCheckUtils]: 51: Hoare triple {17711#(<= ~counter~0 4)} assume !!(0 != ~r~0); {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:55,420 INFO L290 TraceCheckUtils]: 52: Hoare triple {17711#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:55,421 INFO L290 TraceCheckUtils]: 53: Hoare triple {17711#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:55,421 INFO L290 TraceCheckUtils]: 54: Hoare triple {17739#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:55,422 INFO L272 TraceCheckUtils]: 55: Hoare triple {17739#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:55,422 INFO L290 TraceCheckUtils]: 56: Hoare triple {17739#(<= ~counter~0 5)} ~cond := #in~cond; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:55,422 INFO L290 TraceCheckUtils]: 57: Hoare triple {17739#(<= ~counter~0 5)} assume !(0 == ~cond); {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:55,422 INFO L290 TraceCheckUtils]: 58: Hoare triple {17739#(<= ~counter~0 5)} assume true; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:55,423 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17739#(<= ~counter~0 5)} {17739#(<= ~counter~0 5)} #63#return; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:55,423 INFO L290 TraceCheckUtils]: 60: Hoare triple {17739#(<= ~counter~0 5)} assume !!(0 != ~r~0); {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:55,423 INFO L290 TraceCheckUtils]: 61: Hoare triple {17739#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:55,424 INFO L290 TraceCheckUtils]: 62: Hoare triple {17739#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:55,424 INFO L290 TraceCheckUtils]: 63: Hoare triple {17767#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:55,425 INFO L272 TraceCheckUtils]: 64: Hoare triple {17767#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:55,425 INFO L290 TraceCheckUtils]: 65: Hoare triple {17767#(<= ~counter~0 6)} ~cond := #in~cond; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:55,425 INFO L290 TraceCheckUtils]: 66: Hoare triple {17767#(<= ~counter~0 6)} assume !(0 == ~cond); {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:55,426 INFO L290 TraceCheckUtils]: 67: Hoare triple {17767#(<= ~counter~0 6)} assume true; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:55,426 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17767#(<= ~counter~0 6)} {17767#(<= ~counter~0 6)} #63#return; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:55,426 INFO L290 TraceCheckUtils]: 69: Hoare triple {17767#(<= ~counter~0 6)} assume !!(0 != ~r~0); {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:55,427 INFO L290 TraceCheckUtils]: 70: Hoare triple {17767#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:55,427 INFO L290 TraceCheckUtils]: 71: Hoare triple {17767#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:55,427 INFO L290 TraceCheckUtils]: 72: Hoare triple {17795#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:55,428 INFO L272 TraceCheckUtils]: 73: Hoare triple {17795#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:55,428 INFO L290 TraceCheckUtils]: 74: Hoare triple {17795#(<= ~counter~0 7)} ~cond := #in~cond; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:55,428 INFO L290 TraceCheckUtils]: 75: Hoare triple {17795#(<= ~counter~0 7)} assume !(0 == ~cond); {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:55,429 INFO L290 TraceCheckUtils]: 76: Hoare triple {17795#(<= ~counter~0 7)} assume true; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:55,429 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {17795#(<= ~counter~0 7)} {17795#(<= ~counter~0 7)} #63#return; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:55,430 INFO L290 TraceCheckUtils]: 78: Hoare triple {17795#(<= ~counter~0 7)} assume !!(0 != ~r~0); {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:55,430 INFO L290 TraceCheckUtils]: 79: Hoare triple {17795#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:55,430 INFO L290 TraceCheckUtils]: 80: Hoare triple {17795#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:55,431 INFO L290 TraceCheckUtils]: 81: Hoare triple {17823#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:55,431 INFO L272 TraceCheckUtils]: 82: Hoare triple {17823#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:55,431 INFO L290 TraceCheckUtils]: 83: Hoare triple {17823#(<= ~counter~0 8)} ~cond := #in~cond; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:55,432 INFO L290 TraceCheckUtils]: 84: Hoare triple {17823#(<= ~counter~0 8)} assume !(0 == ~cond); {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:55,432 INFO L290 TraceCheckUtils]: 85: Hoare triple {17823#(<= ~counter~0 8)} assume true; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:55,432 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17823#(<= ~counter~0 8)} {17823#(<= ~counter~0 8)} #63#return; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:55,433 INFO L290 TraceCheckUtils]: 87: Hoare triple {17823#(<= ~counter~0 8)} assume !!(0 != ~r~0); {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:55,434 INFO L290 TraceCheckUtils]: 88: Hoare triple {17823#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:55,435 INFO L290 TraceCheckUtils]: 89: Hoare triple {17823#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:55,436 INFO L290 TraceCheckUtils]: 90: Hoare triple {17851#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:55,436 INFO L272 TraceCheckUtils]: 91: Hoare triple {17851#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:55,436 INFO L290 TraceCheckUtils]: 92: Hoare triple {17851#(<= ~counter~0 9)} ~cond := #in~cond; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:55,437 INFO L290 TraceCheckUtils]: 93: Hoare triple {17851#(<= ~counter~0 9)} assume !(0 == ~cond); {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:55,437 INFO L290 TraceCheckUtils]: 94: Hoare triple {17851#(<= ~counter~0 9)} assume true; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:55,437 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {17851#(<= ~counter~0 9)} {17851#(<= ~counter~0 9)} #63#return; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:55,438 INFO L290 TraceCheckUtils]: 96: Hoare triple {17851#(<= ~counter~0 9)} assume !!(0 != ~r~0); {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:55,438 INFO L290 TraceCheckUtils]: 97: Hoare triple {17851#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:55,438 INFO L290 TraceCheckUtils]: 98: Hoare triple {17851#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:55,439 INFO L290 TraceCheckUtils]: 99: Hoare triple {17879#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:55,439 INFO L272 TraceCheckUtils]: 100: Hoare triple {17879#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:55,440 INFO L290 TraceCheckUtils]: 101: Hoare triple {17879#(<= ~counter~0 10)} ~cond := #in~cond; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:55,440 INFO L290 TraceCheckUtils]: 102: Hoare triple {17879#(<= ~counter~0 10)} assume !(0 == ~cond); {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:55,440 INFO L290 TraceCheckUtils]: 103: Hoare triple {17879#(<= ~counter~0 10)} assume true; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:55,441 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {17879#(<= ~counter~0 10)} {17879#(<= ~counter~0 10)} #63#return; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:55,441 INFO L290 TraceCheckUtils]: 105: Hoare triple {17879#(<= ~counter~0 10)} assume !!(0 != ~r~0); {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:55,441 INFO L290 TraceCheckUtils]: 106: Hoare triple {17879#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:55,442 INFO L290 TraceCheckUtils]: 107: Hoare triple {17879#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:55,442 INFO L290 TraceCheckUtils]: 108: Hoare triple {17907#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:55,442 INFO L272 TraceCheckUtils]: 109: Hoare triple {17907#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:55,443 INFO L290 TraceCheckUtils]: 110: Hoare triple {17907#(<= ~counter~0 11)} ~cond := #in~cond; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:55,443 INFO L290 TraceCheckUtils]: 111: Hoare triple {17907#(<= ~counter~0 11)} assume !(0 == ~cond); {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:55,443 INFO L290 TraceCheckUtils]: 112: Hoare triple {17907#(<= ~counter~0 11)} assume true; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:55,444 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17907#(<= ~counter~0 11)} {17907#(<= ~counter~0 11)} #63#return; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:55,444 INFO L290 TraceCheckUtils]: 114: Hoare triple {17907#(<= ~counter~0 11)} assume !!(0 != ~r~0); {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:55,444 INFO L290 TraceCheckUtils]: 115: Hoare triple {17907#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:55,445 INFO L290 TraceCheckUtils]: 116: Hoare triple {17907#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:55,445 INFO L290 TraceCheckUtils]: 117: Hoare triple {17935#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:55,446 INFO L272 TraceCheckUtils]: 118: Hoare triple {17935#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:55,446 INFO L290 TraceCheckUtils]: 119: Hoare triple {17935#(<= ~counter~0 12)} ~cond := #in~cond; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:55,446 INFO L290 TraceCheckUtils]: 120: Hoare triple {17935#(<= ~counter~0 12)} assume !(0 == ~cond); {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:55,446 INFO L290 TraceCheckUtils]: 121: Hoare triple {17935#(<= ~counter~0 12)} assume true; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:55,447 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17935#(<= ~counter~0 12)} {17935#(<= ~counter~0 12)} #63#return; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:55,447 INFO L290 TraceCheckUtils]: 123: Hoare triple {17935#(<= ~counter~0 12)} assume !!(0 != ~r~0); {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:55,448 INFO L290 TraceCheckUtils]: 124: Hoare triple {17935#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:55,448 INFO L290 TraceCheckUtils]: 125: Hoare triple {17935#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:55,448 INFO L290 TraceCheckUtils]: 126: Hoare triple {17963#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:55,449 INFO L272 TraceCheckUtils]: 127: Hoare triple {17963#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:55,449 INFO L290 TraceCheckUtils]: 128: Hoare triple {17963#(<= ~counter~0 13)} ~cond := #in~cond; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:55,449 INFO L290 TraceCheckUtils]: 129: Hoare triple {17963#(<= ~counter~0 13)} assume !(0 == ~cond); {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:55,450 INFO L290 TraceCheckUtils]: 130: Hoare triple {17963#(<= ~counter~0 13)} assume true; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:55,450 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {17963#(<= ~counter~0 13)} {17963#(<= ~counter~0 13)} #63#return; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:55,450 INFO L290 TraceCheckUtils]: 132: Hoare triple {17963#(<= ~counter~0 13)} assume !!(0 != ~r~0); {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:55,451 INFO L290 TraceCheckUtils]: 133: Hoare triple {17963#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:55,451 INFO L290 TraceCheckUtils]: 134: Hoare triple {17963#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:55,451 INFO L290 TraceCheckUtils]: 135: Hoare triple {17991#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:55,452 INFO L272 TraceCheckUtils]: 136: Hoare triple {17991#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:55,452 INFO L290 TraceCheckUtils]: 137: Hoare triple {17991#(<= ~counter~0 14)} ~cond := #in~cond; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:55,453 INFO L290 TraceCheckUtils]: 138: Hoare triple {17991#(<= ~counter~0 14)} assume !(0 == ~cond); {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:55,453 INFO L290 TraceCheckUtils]: 139: Hoare triple {17991#(<= ~counter~0 14)} assume true; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:55,453 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {17991#(<= ~counter~0 14)} {17991#(<= ~counter~0 14)} #63#return; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:55,454 INFO L290 TraceCheckUtils]: 141: Hoare triple {17991#(<= ~counter~0 14)} assume !!(0 != ~r~0); {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:55,454 INFO L290 TraceCheckUtils]: 142: Hoare triple {17991#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:55,454 INFO L290 TraceCheckUtils]: 143: Hoare triple {17991#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:55,455 INFO L290 TraceCheckUtils]: 144: Hoare triple {18019#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:55,455 INFO L272 TraceCheckUtils]: 145: Hoare triple {18019#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:55,455 INFO L290 TraceCheckUtils]: 146: Hoare triple {18019#(<= ~counter~0 15)} ~cond := #in~cond; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:55,456 INFO L290 TraceCheckUtils]: 147: Hoare triple {18019#(<= ~counter~0 15)} assume !(0 == ~cond); {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:55,456 INFO L290 TraceCheckUtils]: 148: Hoare triple {18019#(<= ~counter~0 15)} assume true; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:55,457 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {18019#(<= ~counter~0 15)} {18019#(<= ~counter~0 15)} #63#return; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:55,457 INFO L290 TraceCheckUtils]: 150: Hoare triple {18019#(<= ~counter~0 15)} assume !!(0 != ~r~0); {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:55,457 INFO L290 TraceCheckUtils]: 151: Hoare triple {18019#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:55,457 INFO L290 TraceCheckUtils]: 152: Hoare triple {18019#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18047#(<= |main_#t~post6| 15)} is VALID [2022-04-28 06:03:55,458 INFO L290 TraceCheckUtils]: 153: Hoare triple {18047#(<= |main_#t~post6| 15)} assume !(#t~post6 < 20);havoc #t~post6; {17571#false} is VALID [2022-04-28 06:03:55,458 INFO L272 TraceCheckUtils]: 154: Hoare triple {17571#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17571#false} is VALID [2022-04-28 06:03:55,458 INFO L290 TraceCheckUtils]: 155: Hoare triple {17571#false} ~cond := #in~cond; {17571#false} is VALID [2022-04-28 06:03:55,458 INFO L290 TraceCheckUtils]: 156: Hoare triple {17571#false} assume 0 == ~cond; {17571#false} is VALID [2022-04-28 06:03:55,458 INFO L290 TraceCheckUtils]: 157: Hoare triple {17571#false} assume !false; {17571#false} is VALID [2022-04-28 06:03:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 30 proven. 975 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:03:55,459 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:03:56,221 INFO L290 TraceCheckUtils]: 157: Hoare triple {17571#false} assume !false; {17571#false} is VALID [2022-04-28 06:03:56,222 INFO L290 TraceCheckUtils]: 156: Hoare triple {17571#false} assume 0 == ~cond; {17571#false} is VALID [2022-04-28 06:03:56,222 INFO L290 TraceCheckUtils]: 155: Hoare triple {17571#false} ~cond := #in~cond; {17571#false} is VALID [2022-04-28 06:03:56,222 INFO L272 TraceCheckUtils]: 154: Hoare triple {17571#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17571#false} is VALID [2022-04-28 06:03:56,222 INFO L290 TraceCheckUtils]: 153: Hoare triple {18075#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {17571#false} is VALID [2022-04-28 06:03:56,223 INFO L290 TraceCheckUtils]: 152: Hoare triple {18079#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18075#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:03:56,223 INFO L290 TraceCheckUtils]: 151: Hoare triple {18079#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18079#(< ~counter~0 20)} is VALID [2022-04-28 06:03:56,223 INFO L290 TraceCheckUtils]: 150: Hoare triple {18079#(< ~counter~0 20)} assume !!(0 != ~r~0); {18079#(< ~counter~0 20)} is VALID [2022-04-28 06:03:56,224 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {17570#true} {18079#(< ~counter~0 20)} #63#return; {18079#(< ~counter~0 20)} is VALID [2022-04-28 06:03:56,224 INFO L290 TraceCheckUtils]: 148: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,224 INFO L290 TraceCheckUtils]: 147: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,224 INFO L290 TraceCheckUtils]: 146: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,224 INFO L272 TraceCheckUtils]: 145: Hoare triple {18079#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,225 INFO L290 TraceCheckUtils]: 144: Hoare triple {18079#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {18079#(< ~counter~0 20)} is VALID [2022-04-28 06:03:56,225 INFO L290 TraceCheckUtils]: 143: Hoare triple {18107#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18079#(< ~counter~0 20)} is VALID [2022-04-28 06:03:56,226 INFO L290 TraceCheckUtils]: 142: Hoare triple {18107#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18107#(< ~counter~0 19)} is VALID [2022-04-28 06:03:56,226 INFO L290 TraceCheckUtils]: 141: Hoare triple {18107#(< ~counter~0 19)} assume !!(0 != ~r~0); {18107#(< ~counter~0 19)} is VALID [2022-04-28 06:03:56,227 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {17570#true} {18107#(< ~counter~0 19)} #63#return; {18107#(< ~counter~0 19)} is VALID [2022-04-28 06:03:56,227 INFO L290 TraceCheckUtils]: 139: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,227 INFO L290 TraceCheckUtils]: 138: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,227 INFO L290 TraceCheckUtils]: 137: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,227 INFO L272 TraceCheckUtils]: 136: Hoare triple {18107#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,228 INFO L290 TraceCheckUtils]: 135: Hoare triple {18107#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {18107#(< ~counter~0 19)} is VALID [2022-04-28 06:03:56,228 INFO L290 TraceCheckUtils]: 134: Hoare triple {18135#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18107#(< ~counter~0 19)} is VALID [2022-04-28 06:03:56,228 INFO L290 TraceCheckUtils]: 133: Hoare triple {18135#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18135#(< ~counter~0 18)} is VALID [2022-04-28 06:03:56,229 INFO L290 TraceCheckUtils]: 132: Hoare triple {18135#(< ~counter~0 18)} assume !!(0 != ~r~0); {18135#(< ~counter~0 18)} is VALID [2022-04-28 06:03:56,229 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {17570#true} {18135#(< ~counter~0 18)} #63#return; {18135#(< ~counter~0 18)} is VALID [2022-04-28 06:03:56,230 INFO L290 TraceCheckUtils]: 130: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,230 INFO L290 TraceCheckUtils]: 129: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,230 INFO L290 TraceCheckUtils]: 128: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,230 INFO L272 TraceCheckUtils]: 127: Hoare triple {18135#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,230 INFO L290 TraceCheckUtils]: 126: Hoare triple {18135#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {18135#(< ~counter~0 18)} is VALID [2022-04-28 06:03:56,231 INFO L290 TraceCheckUtils]: 125: Hoare triple {18163#(< ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18135#(< ~counter~0 18)} is VALID [2022-04-28 06:03:56,231 INFO L290 TraceCheckUtils]: 124: Hoare triple {18163#(< ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18163#(< ~counter~0 17)} is VALID [2022-04-28 06:03:56,231 INFO L290 TraceCheckUtils]: 123: Hoare triple {18163#(< ~counter~0 17)} assume !!(0 != ~r~0); {18163#(< ~counter~0 17)} is VALID [2022-04-28 06:03:56,232 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17570#true} {18163#(< ~counter~0 17)} #63#return; {18163#(< ~counter~0 17)} is VALID [2022-04-28 06:03:56,232 INFO L290 TraceCheckUtils]: 121: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,232 INFO L290 TraceCheckUtils]: 120: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,232 INFO L290 TraceCheckUtils]: 119: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,232 INFO L272 TraceCheckUtils]: 118: Hoare triple {18163#(< ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,233 INFO L290 TraceCheckUtils]: 117: Hoare triple {18163#(< ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {18163#(< ~counter~0 17)} is VALID [2022-04-28 06:03:56,233 INFO L290 TraceCheckUtils]: 116: Hoare triple {18019#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18163#(< ~counter~0 17)} is VALID [2022-04-28 06:03:56,234 INFO L290 TraceCheckUtils]: 115: Hoare triple {18019#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:56,234 INFO L290 TraceCheckUtils]: 114: Hoare triple {18019#(<= ~counter~0 15)} assume !!(0 != ~r~0); {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:56,235 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17570#true} {18019#(<= ~counter~0 15)} #63#return; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:56,235 INFO L290 TraceCheckUtils]: 112: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,235 INFO L290 TraceCheckUtils]: 111: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,235 INFO L290 TraceCheckUtils]: 110: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,235 INFO L272 TraceCheckUtils]: 109: Hoare triple {18019#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,235 INFO L290 TraceCheckUtils]: 108: Hoare triple {18019#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:56,236 INFO L290 TraceCheckUtils]: 107: Hoare triple {17991#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18019#(<= ~counter~0 15)} is VALID [2022-04-28 06:03:56,236 INFO L290 TraceCheckUtils]: 106: Hoare triple {17991#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:56,237 INFO L290 TraceCheckUtils]: 105: Hoare triple {17991#(<= ~counter~0 14)} assume !!(0 != ~r~0); {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:56,237 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {17570#true} {17991#(<= ~counter~0 14)} #63#return; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:56,237 INFO L290 TraceCheckUtils]: 103: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,238 INFO L290 TraceCheckUtils]: 102: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,238 INFO L290 TraceCheckUtils]: 101: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,238 INFO L272 TraceCheckUtils]: 100: Hoare triple {17991#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,238 INFO L290 TraceCheckUtils]: 99: Hoare triple {17991#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:56,239 INFO L290 TraceCheckUtils]: 98: Hoare triple {17963#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17991#(<= ~counter~0 14)} is VALID [2022-04-28 06:03:56,239 INFO L290 TraceCheckUtils]: 97: Hoare triple {17963#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:56,239 INFO L290 TraceCheckUtils]: 96: Hoare triple {17963#(<= ~counter~0 13)} assume !!(0 != ~r~0); {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:56,240 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {17570#true} {17963#(<= ~counter~0 13)} #63#return; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:56,240 INFO L290 TraceCheckUtils]: 94: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,240 INFO L290 TraceCheckUtils]: 93: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,240 INFO L290 TraceCheckUtils]: 92: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,240 INFO L272 TraceCheckUtils]: 91: Hoare triple {17963#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,241 INFO L290 TraceCheckUtils]: 90: Hoare triple {17963#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:56,241 INFO L290 TraceCheckUtils]: 89: Hoare triple {17935#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17963#(<= ~counter~0 13)} is VALID [2022-04-28 06:03:56,242 INFO L290 TraceCheckUtils]: 88: Hoare triple {17935#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:56,242 INFO L290 TraceCheckUtils]: 87: Hoare triple {17935#(<= ~counter~0 12)} assume !!(0 != ~r~0); {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:56,243 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17570#true} {17935#(<= ~counter~0 12)} #63#return; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:56,243 INFO L290 TraceCheckUtils]: 85: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,243 INFO L290 TraceCheckUtils]: 84: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,243 INFO L290 TraceCheckUtils]: 83: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,243 INFO L272 TraceCheckUtils]: 82: Hoare triple {17935#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,243 INFO L290 TraceCheckUtils]: 81: Hoare triple {17935#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:56,244 INFO L290 TraceCheckUtils]: 80: Hoare triple {17907#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17935#(<= ~counter~0 12)} is VALID [2022-04-28 06:03:56,244 INFO L290 TraceCheckUtils]: 79: Hoare triple {17907#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:56,245 INFO L290 TraceCheckUtils]: 78: Hoare triple {17907#(<= ~counter~0 11)} assume !!(0 != ~r~0); {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:56,245 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {17570#true} {17907#(<= ~counter~0 11)} #63#return; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:56,245 INFO L290 TraceCheckUtils]: 76: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,245 INFO L290 TraceCheckUtils]: 75: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,246 INFO L290 TraceCheckUtils]: 74: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,246 INFO L272 TraceCheckUtils]: 73: Hoare triple {17907#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,246 INFO L290 TraceCheckUtils]: 72: Hoare triple {17907#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:56,247 INFO L290 TraceCheckUtils]: 71: Hoare triple {17879#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17907#(<= ~counter~0 11)} is VALID [2022-04-28 06:03:56,247 INFO L290 TraceCheckUtils]: 70: Hoare triple {17879#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:56,247 INFO L290 TraceCheckUtils]: 69: Hoare triple {17879#(<= ~counter~0 10)} assume !!(0 != ~r~0); {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:56,248 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17570#true} {17879#(<= ~counter~0 10)} #63#return; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:56,248 INFO L290 TraceCheckUtils]: 67: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,248 INFO L290 TraceCheckUtils]: 66: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,248 INFO L290 TraceCheckUtils]: 65: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,248 INFO L272 TraceCheckUtils]: 64: Hoare triple {17879#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,249 INFO L290 TraceCheckUtils]: 63: Hoare triple {17879#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:56,249 INFO L290 TraceCheckUtils]: 62: Hoare triple {17851#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17879#(<= ~counter~0 10)} is VALID [2022-04-28 06:03:56,250 INFO L290 TraceCheckUtils]: 61: Hoare triple {17851#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:56,250 INFO L290 TraceCheckUtils]: 60: Hoare triple {17851#(<= ~counter~0 9)} assume !!(0 != ~r~0); {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:56,251 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17570#true} {17851#(<= ~counter~0 9)} #63#return; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:56,251 INFO L290 TraceCheckUtils]: 58: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,251 INFO L290 TraceCheckUtils]: 57: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,251 INFO L290 TraceCheckUtils]: 56: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,251 INFO L272 TraceCheckUtils]: 55: Hoare triple {17851#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,251 INFO L290 TraceCheckUtils]: 54: Hoare triple {17851#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:56,252 INFO L290 TraceCheckUtils]: 53: Hoare triple {17823#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17851#(<= ~counter~0 9)} is VALID [2022-04-28 06:03:56,252 INFO L290 TraceCheckUtils]: 52: Hoare triple {17823#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:56,253 INFO L290 TraceCheckUtils]: 51: Hoare triple {17823#(<= ~counter~0 8)} assume !!(0 != ~r~0); {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:56,253 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17570#true} {17823#(<= ~counter~0 8)} #63#return; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:56,253 INFO L290 TraceCheckUtils]: 49: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,253 INFO L290 TraceCheckUtils]: 48: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,254 INFO L290 TraceCheckUtils]: 47: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,254 INFO L272 TraceCheckUtils]: 46: Hoare triple {17823#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,254 INFO L290 TraceCheckUtils]: 45: Hoare triple {17823#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:56,255 INFO L290 TraceCheckUtils]: 44: Hoare triple {17795#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17823#(<= ~counter~0 8)} is VALID [2022-04-28 06:03:56,255 INFO L290 TraceCheckUtils]: 43: Hoare triple {17795#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:56,255 INFO L290 TraceCheckUtils]: 42: Hoare triple {17795#(<= ~counter~0 7)} assume !!(0 != ~r~0); {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:56,256 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17570#true} {17795#(<= ~counter~0 7)} #63#return; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:56,256 INFO L290 TraceCheckUtils]: 40: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,256 INFO L290 TraceCheckUtils]: 39: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,256 INFO L272 TraceCheckUtils]: 37: Hoare triple {17795#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,257 INFO L290 TraceCheckUtils]: 36: Hoare triple {17795#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:56,257 INFO L290 TraceCheckUtils]: 35: Hoare triple {17767#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17795#(<= ~counter~0 7)} is VALID [2022-04-28 06:03:56,258 INFO L290 TraceCheckUtils]: 34: Hoare triple {17767#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:56,258 INFO L290 TraceCheckUtils]: 33: Hoare triple {17767#(<= ~counter~0 6)} assume !!(0 != ~r~0); {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:56,259 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17570#true} {17767#(<= ~counter~0 6)} #63#return; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:56,259 INFO L290 TraceCheckUtils]: 31: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,259 INFO L290 TraceCheckUtils]: 30: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,259 INFO L290 TraceCheckUtils]: 29: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,259 INFO L272 TraceCheckUtils]: 28: Hoare triple {17767#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,259 INFO L290 TraceCheckUtils]: 27: Hoare triple {17767#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:56,260 INFO L290 TraceCheckUtils]: 26: Hoare triple {17739#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17767#(<= ~counter~0 6)} is VALID [2022-04-28 06:03:56,260 INFO L290 TraceCheckUtils]: 25: Hoare triple {17739#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:56,260 INFO L290 TraceCheckUtils]: 24: Hoare triple {17739#(<= ~counter~0 5)} assume !!(0 != ~r~0); {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:56,261 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17570#true} {17739#(<= ~counter~0 5)} #63#return; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:56,261 INFO L290 TraceCheckUtils]: 22: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,261 INFO L290 TraceCheckUtils]: 21: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,261 INFO L272 TraceCheckUtils]: 19: Hoare triple {17739#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {17739#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:56,262 INFO L290 TraceCheckUtils]: 17: Hoare triple {17711#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17739#(<= ~counter~0 5)} is VALID [2022-04-28 06:03:56,262 INFO L290 TraceCheckUtils]: 16: Hoare triple {17711#(<= ~counter~0 4)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:56,263 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17570#true} {17711#(<= ~counter~0 4)} #61#return; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:56,263 INFO L290 TraceCheckUtils]: 14: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,263 INFO L290 TraceCheckUtils]: 13: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,263 INFO L290 TraceCheckUtils]: 12: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,263 INFO L272 TraceCheckUtils]: 11: Hoare triple {17711#(<= ~counter~0 4)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,263 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17570#true} {17711#(<= ~counter~0 4)} #59#return; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:56,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-28 06:03:56,263 INFO L290 TraceCheckUtils]: 8: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-28 06:03:56,264 INFO L290 TraceCheckUtils]: 7: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-28 06:03:56,264 INFO L272 TraceCheckUtils]: 6: Hoare triple {17711#(<= ~counter~0 4)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17570#true} is VALID [2022-04-28 06:03:56,264 INFO L290 TraceCheckUtils]: 5: Hoare triple {17711#(<= ~counter~0 4)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:56,264 INFO L272 TraceCheckUtils]: 4: Hoare triple {17711#(<= ~counter~0 4)} call #t~ret7 := main(); {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:56,264 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17711#(<= ~counter~0 4)} {17570#true} #67#return; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:56,265 INFO L290 TraceCheckUtils]: 2: Hoare triple {17711#(<= ~counter~0 4)} assume true; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:56,265 INFO L290 TraceCheckUtils]: 1: Hoare triple {17570#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; {17711#(<= ~counter~0 4)} is VALID [2022-04-28 06:03:56,265 INFO L272 TraceCheckUtils]: 0: Hoare triple {17570#true} call ULTIMATE.init(); {17570#true} is VALID [2022-04-28 06:03:56,266 INFO L134 CoverageAnalysis]: Checked inductivity of 1009 backedges. 30 proven. 555 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-28 06:03:56,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:03:56,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263632286] [2022-04-28 06:03:56,266 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:03:56,266 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1339479291] [2022-04-28 06:03:56,266 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1339479291] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:03:56,266 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:03:56,266 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-28 06:03:56,267 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:03:56,267 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1050560439] [2022-04-28 06:03:56,267 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1050560439] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:03:56,267 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:03:56,267 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-28 06:03:56,267 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272664518] [2022-04-28 06:03:56,267 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:03:56,268 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, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 158 [2022-04-28 06:03:56,268 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:03:56,268 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, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:03:56,370 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-28 06:03:56,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-28 06:03:56,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:56,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-28 06:03:56,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:03:56,371 INFO L87 Difference]: Start difference. First operand 155 states and 171 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, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:03:57,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:57,026 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2022-04-28 06:03:57,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-28 06:03:57,026 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, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) Word has length 158 [2022-04-28 06:03:57,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:03:57,027 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, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:03:57,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 185 transitions. [2022-04-28 06:03:57,030 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, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:03:57,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 185 transitions. [2022-04-28 06:03:57,033 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 185 transitions. [2022-04-28 06:03:57,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:57,178 INFO L225 Difference]: With dead ends: 169 [2022-04-28 06:03:57,178 INFO L226 Difference]: Without dead ends: 164 [2022-04-28 06:03:57,178 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 330 GetRequests, 292 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-28 06:03:57,179 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 88 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 88 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:03:57,179 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [88 Valid, 190 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:03:57,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-28 06:03:57,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-28 06:03:57,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:03:57,369 INFO L82 GeneralOperation]: Start isEquivalent. First operand 164 states. Second operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:03:57,369 INFO L74 IsIncluded]: Start isIncluded. First operand 164 states. Second operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:03:57,370 INFO L87 Difference]: Start difference. First operand 164 states. Second operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:03:57,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:57,372 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2022-04-28 06:03:57,372 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2022-04-28 06:03:57,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:57,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:57,373 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 164 states. [2022-04-28 06:03:57,373 INFO L87 Difference]: Start difference. First operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 164 states. [2022-04-28 06:03:57,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:03:57,376 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2022-04-28 06:03:57,376 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2022-04-28 06:03:57,377 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:03:57,377 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:03:57,377 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:03:57,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:03:57,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 124 states have (on average 1.1370967741935485) internal successors, (141), 124 states have internal predecessors, (141), 21 states have call successors, (21), 20 states have call predecessors, (21), 18 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-28 06:03:57,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 181 transitions. [2022-04-28 06:03:57,380 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 181 transitions. Word has length 158 [2022-04-28 06:03:57,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:03:57,380 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 181 transitions. [2022-04-28 06:03:57,381 INFO L496 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, (20), 18 states have call predecessors, (20), 16 states have return successors, (18), 16 states have call predecessors, (18), 17 states have call successors, (18) [2022-04-28 06:03:57,381 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 181 transitions. [2022-04-28 06:03:59,611 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 181 edges. 180 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:03:59,612 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2022-04-28 06:03:59,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-28 06:03:59,613 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:03:59,613 INFO L195 NwaCegarLoop]: trace histogram [17, 17, 16, 16, 16, 16, 16, 16, 16, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:03:59,622 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-28 06:03:59,815 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:59,815 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:03:59,816 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:03:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1479991018, now seen corresponding path program 31 times [2022-04-28 06:03:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:03:59,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [439960469] [2022-04-28 06:03:59,816 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:03:59,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1479991018, now seen corresponding path program 32 times [2022-04-28 06:03:59,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:03:59,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967687265] [2022-04-28 06:03:59,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:03:59,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:03:59,833 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:03:59,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [981577468] [2022-04-28 06:03:59,834 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:03:59,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:03:59,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:03:59,835 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:03:59,839 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-28 06:03:59,913 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:03:59,914 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:03:59,915 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-28 06:03:59,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:03:59,948 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:04:00,787 INFO L272 TraceCheckUtils]: 0: Hoare triple {19565#true} call ULTIMATE.init(); {19565#true} is VALID [2022-04-28 06:04:00,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {19565#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; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {19573#(<= ~counter~0 0)} assume true; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,788 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19573#(<= ~counter~0 0)} {19565#true} #67#return; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,788 INFO L272 TraceCheckUtils]: 4: Hoare triple {19573#(<= ~counter~0 0)} call #t~ret7 := main(); {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,789 INFO L290 TraceCheckUtils]: 5: Hoare triple {19573#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,789 INFO L272 TraceCheckUtils]: 6: Hoare triple {19573#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {19573#(<= ~counter~0 0)} ~cond := #in~cond; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,790 INFO L290 TraceCheckUtils]: 8: Hoare triple {19573#(<= ~counter~0 0)} assume !(0 == ~cond); {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {19573#(<= ~counter~0 0)} assume true; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,790 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19573#(<= ~counter~0 0)} {19573#(<= ~counter~0 0)} #59#return; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,791 INFO L272 TraceCheckUtils]: 11: Hoare triple {19573#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {19573#(<= ~counter~0 0)} ~cond := #in~cond; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {19573#(<= ~counter~0 0)} assume !(0 == ~cond); {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {19573#(<= ~counter~0 0)} assume true; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,792 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19573#(<= ~counter~0 0)} {19573#(<= ~counter~0 0)} #61#return; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {19573#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19573#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:00,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {19573#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19622#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:00,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {19622#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {19622#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:00,794 INFO L272 TraceCheckUtils]: 19: Hoare triple {19622#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19622#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:00,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {19622#(<= ~counter~0 1)} ~cond := #in~cond; {19622#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:00,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {19622#(<= ~counter~0 1)} assume !(0 == ~cond); {19622#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:00,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {19622#(<= ~counter~0 1)} assume true; {19622#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:00,795 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19622#(<= ~counter~0 1)} {19622#(<= ~counter~0 1)} #63#return; {19622#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:00,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {19622#(<= ~counter~0 1)} assume !!(0 != ~r~0); {19622#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:00,796 INFO L290 TraceCheckUtils]: 25: Hoare triple {19622#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19622#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:00,796 INFO L290 TraceCheckUtils]: 26: Hoare triple {19622#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19650#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:00,796 INFO L290 TraceCheckUtils]: 27: Hoare triple {19650#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {19650#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:00,797 INFO L272 TraceCheckUtils]: 28: Hoare triple {19650#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19650#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:00,797 INFO L290 TraceCheckUtils]: 29: Hoare triple {19650#(<= ~counter~0 2)} ~cond := #in~cond; {19650#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:00,797 INFO L290 TraceCheckUtils]: 30: Hoare triple {19650#(<= ~counter~0 2)} assume !(0 == ~cond); {19650#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:00,798 INFO L290 TraceCheckUtils]: 31: Hoare triple {19650#(<= ~counter~0 2)} assume true; {19650#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:00,798 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19650#(<= ~counter~0 2)} {19650#(<= ~counter~0 2)} #63#return; {19650#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:00,798 INFO L290 TraceCheckUtils]: 33: Hoare triple {19650#(<= ~counter~0 2)} assume !!(0 != ~r~0); {19650#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:00,799 INFO L290 TraceCheckUtils]: 34: Hoare triple {19650#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19650#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:00,799 INFO L290 TraceCheckUtils]: 35: Hoare triple {19650#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:00,800 INFO L290 TraceCheckUtils]: 36: Hoare triple {19678#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:00,800 INFO L272 TraceCheckUtils]: 37: Hoare triple {19678#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:00,800 INFO L290 TraceCheckUtils]: 38: Hoare triple {19678#(<= ~counter~0 3)} ~cond := #in~cond; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:00,801 INFO L290 TraceCheckUtils]: 39: Hoare triple {19678#(<= ~counter~0 3)} assume !(0 == ~cond); {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:00,801 INFO L290 TraceCheckUtils]: 40: Hoare triple {19678#(<= ~counter~0 3)} assume true; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:00,801 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19678#(<= ~counter~0 3)} {19678#(<= ~counter~0 3)} #63#return; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:00,802 INFO L290 TraceCheckUtils]: 42: Hoare triple {19678#(<= ~counter~0 3)} assume !!(0 != ~r~0); {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:00,802 INFO L290 TraceCheckUtils]: 43: Hoare triple {19678#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:00,802 INFO L290 TraceCheckUtils]: 44: Hoare triple {19678#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:00,803 INFO L290 TraceCheckUtils]: 45: Hoare triple {19706#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:00,803 INFO L272 TraceCheckUtils]: 46: Hoare triple {19706#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:00,803 INFO L290 TraceCheckUtils]: 47: Hoare triple {19706#(<= ~counter~0 4)} ~cond := #in~cond; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:00,804 INFO L290 TraceCheckUtils]: 48: Hoare triple {19706#(<= ~counter~0 4)} assume !(0 == ~cond); {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:00,804 INFO L290 TraceCheckUtils]: 49: Hoare triple {19706#(<= ~counter~0 4)} assume true; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:00,805 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19706#(<= ~counter~0 4)} {19706#(<= ~counter~0 4)} #63#return; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:00,805 INFO L290 TraceCheckUtils]: 51: Hoare triple {19706#(<= ~counter~0 4)} assume !!(0 != ~r~0); {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:00,805 INFO L290 TraceCheckUtils]: 52: Hoare triple {19706#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:00,806 INFO L290 TraceCheckUtils]: 53: Hoare triple {19706#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:00,806 INFO L290 TraceCheckUtils]: 54: Hoare triple {19734#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:00,806 INFO L272 TraceCheckUtils]: 55: Hoare triple {19734#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:00,807 INFO L290 TraceCheckUtils]: 56: Hoare triple {19734#(<= ~counter~0 5)} ~cond := #in~cond; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:00,807 INFO L290 TraceCheckUtils]: 57: Hoare triple {19734#(<= ~counter~0 5)} assume !(0 == ~cond); {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:00,807 INFO L290 TraceCheckUtils]: 58: Hoare triple {19734#(<= ~counter~0 5)} assume true; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:00,808 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19734#(<= ~counter~0 5)} {19734#(<= ~counter~0 5)} #63#return; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:00,808 INFO L290 TraceCheckUtils]: 60: Hoare triple {19734#(<= ~counter~0 5)} assume !!(0 != ~r~0); {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:00,808 INFO L290 TraceCheckUtils]: 61: Hoare triple {19734#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:00,809 INFO L290 TraceCheckUtils]: 62: Hoare triple {19734#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:00,809 INFO L290 TraceCheckUtils]: 63: Hoare triple {19762#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:00,809 INFO L272 TraceCheckUtils]: 64: Hoare triple {19762#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:00,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {19762#(<= ~counter~0 6)} ~cond := #in~cond; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:00,810 INFO L290 TraceCheckUtils]: 66: Hoare triple {19762#(<= ~counter~0 6)} assume !(0 == ~cond); {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:00,810 INFO L290 TraceCheckUtils]: 67: Hoare triple {19762#(<= ~counter~0 6)} assume true; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:00,811 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19762#(<= ~counter~0 6)} {19762#(<= ~counter~0 6)} #63#return; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:00,811 INFO L290 TraceCheckUtils]: 69: Hoare triple {19762#(<= ~counter~0 6)} assume !!(0 != ~r~0); {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:00,811 INFO L290 TraceCheckUtils]: 70: Hoare triple {19762#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:00,812 INFO L290 TraceCheckUtils]: 71: Hoare triple {19762#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:00,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {19790#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:00,813 INFO L272 TraceCheckUtils]: 73: Hoare triple {19790#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:00,813 INFO L290 TraceCheckUtils]: 74: Hoare triple {19790#(<= ~counter~0 7)} ~cond := #in~cond; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:00,813 INFO L290 TraceCheckUtils]: 75: Hoare triple {19790#(<= ~counter~0 7)} assume !(0 == ~cond); {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:00,814 INFO L290 TraceCheckUtils]: 76: Hoare triple {19790#(<= ~counter~0 7)} assume true; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:00,814 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {19790#(<= ~counter~0 7)} {19790#(<= ~counter~0 7)} #63#return; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:00,814 INFO L290 TraceCheckUtils]: 78: Hoare triple {19790#(<= ~counter~0 7)} assume !!(0 != ~r~0); {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:00,815 INFO L290 TraceCheckUtils]: 79: Hoare triple {19790#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:00,815 INFO L290 TraceCheckUtils]: 80: Hoare triple {19790#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:00,823 INFO L290 TraceCheckUtils]: 81: Hoare triple {19818#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:00,824 INFO L272 TraceCheckUtils]: 82: Hoare triple {19818#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:00,824 INFO L290 TraceCheckUtils]: 83: Hoare triple {19818#(<= ~counter~0 8)} ~cond := #in~cond; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:00,825 INFO L290 TraceCheckUtils]: 84: Hoare triple {19818#(<= ~counter~0 8)} assume !(0 == ~cond); {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:00,825 INFO L290 TraceCheckUtils]: 85: Hoare triple {19818#(<= ~counter~0 8)} assume true; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:00,826 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19818#(<= ~counter~0 8)} {19818#(<= ~counter~0 8)} #63#return; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:00,826 INFO L290 TraceCheckUtils]: 87: Hoare triple {19818#(<= ~counter~0 8)} assume !!(0 != ~r~0); {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:00,827 INFO L290 TraceCheckUtils]: 88: Hoare triple {19818#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:00,827 INFO L290 TraceCheckUtils]: 89: Hoare triple {19818#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:00,828 INFO L290 TraceCheckUtils]: 90: Hoare triple {19846#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:00,828 INFO L272 TraceCheckUtils]: 91: Hoare triple {19846#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:00,829 INFO L290 TraceCheckUtils]: 92: Hoare triple {19846#(<= ~counter~0 9)} ~cond := #in~cond; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:00,829 INFO L290 TraceCheckUtils]: 93: Hoare triple {19846#(<= ~counter~0 9)} assume !(0 == ~cond); {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:00,829 INFO L290 TraceCheckUtils]: 94: Hoare triple {19846#(<= ~counter~0 9)} assume true; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:00,830 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {19846#(<= ~counter~0 9)} {19846#(<= ~counter~0 9)} #63#return; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:00,830 INFO L290 TraceCheckUtils]: 96: Hoare triple {19846#(<= ~counter~0 9)} assume !!(0 != ~r~0); {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:00,830 INFO L290 TraceCheckUtils]: 97: Hoare triple {19846#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:00,831 INFO L290 TraceCheckUtils]: 98: Hoare triple {19846#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:00,831 INFO L290 TraceCheckUtils]: 99: Hoare triple {19874#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:00,832 INFO L272 TraceCheckUtils]: 100: Hoare triple {19874#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:00,832 INFO L290 TraceCheckUtils]: 101: Hoare triple {19874#(<= ~counter~0 10)} ~cond := #in~cond; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:00,832 INFO L290 TraceCheckUtils]: 102: Hoare triple {19874#(<= ~counter~0 10)} assume !(0 == ~cond); {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:00,833 INFO L290 TraceCheckUtils]: 103: Hoare triple {19874#(<= ~counter~0 10)} assume true; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:00,833 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {19874#(<= ~counter~0 10)} {19874#(<= ~counter~0 10)} #63#return; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:00,833 INFO L290 TraceCheckUtils]: 105: Hoare triple {19874#(<= ~counter~0 10)} assume !!(0 != ~r~0); {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:00,834 INFO L290 TraceCheckUtils]: 106: Hoare triple {19874#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:00,834 INFO L290 TraceCheckUtils]: 107: Hoare triple {19874#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:00,834 INFO L290 TraceCheckUtils]: 108: Hoare triple {19902#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:00,835 INFO L272 TraceCheckUtils]: 109: Hoare triple {19902#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:00,835 INFO L290 TraceCheckUtils]: 110: Hoare triple {19902#(<= ~counter~0 11)} ~cond := #in~cond; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:00,835 INFO L290 TraceCheckUtils]: 111: Hoare triple {19902#(<= ~counter~0 11)} assume !(0 == ~cond); {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:00,836 INFO L290 TraceCheckUtils]: 112: Hoare triple {19902#(<= ~counter~0 11)} assume true; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:00,836 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19902#(<= ~counter~0 11)} {19902#(<= ~counter~0 11)} #63#return; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:00,836 INFO L290 TraceCheckUtils]: 114: Hoare triple {19902#(<= ~counter~0 11)} assume !!(0 != ~r~0); {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:00,837 INFO L290 TraceCheckUtils]: 115: Hoare triple {19902#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:00,837 INFO L290 TraceCheckUtils]: 116: Hoare triple {19902#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:00,838 INFO L290 TraceCheckUtils]: 117: Hoare triple {19930#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:00,838 INFO L272 TraceCheckUtils]: 118: Hoare triple {19930#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:00,838 INFO L290 TraceCheckUtils]: 119: Hoare triple {19930#(<= ~counter~0 12)} ~cond := #in~cond; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:00,839 INFO L290 TraceCheckUtils]: 120: Hoare triple {19930#(<= ~counter~0 12)} assume !(0 == ~cond); {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:00,839 INFO L290 TraceCheckUtils]: 121: Hoare triple {19930#(<= ~counter~0 12)} assume true; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:00,839 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19930#(<= ~counter~0 12)} {19930#(<= ~counter~0 12)} #63#return; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:00,840 INFO L290 TraceCheckUtils]: 123: Hoare triple {19930#(<= ~counter~0 12)} assume !!(0 != ~r~0); {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:00,840 INFO L290 TraceCheckUtils]: 124: Hoare triple {19930#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:00,840 INFO L290 TraceCheckUtils]: 125: Hoare triple {19930#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:00,841 INFO L290 TraceCheckUtils]: 126: Hoare triple {19958#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:00,841 INFO L272 TraceCheckUtils]: 127: Hoare triple {19958#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:00,841 INFO L290 TraceCheckUtils]: 128: Hoare triple {19958#(<= ~counter~0 13)} ~cond := #in~cond; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:00,842 INFO L290 TraceCheckUtils]: 129: Hoare triple {19958#(<= ~counter~0 13)} assume !(0 == ~cond); {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:00,842 INFO L290 TraceCheckUtils]: 130: Hoare triple {19958#(<= ~counter~0 13)} assume true; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:00,843 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {19958#(<= ~counter~0 13)} {19958#(<= ~counter~0 13)} #63#return; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:00,843 INFO L290 TraceCheckUtils]: 132: Hoare triple {19958#(<= ~counter~0 13)} assume !!(0 != ~r~0); {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:00,843 INFO L290 TraceCheckUtils]: 133: Hoare triple {19958#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:00,844 INFO L290 TraceCheckUtils]: 134: Hoare triple {19958#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:00,844 INFO L290 TraceCheckUtils]: 135: Hoare triple {19986#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:00,844 INFO L272 TraceCheckUtils]: 136: Hoare triple {19986#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:00,845 INFO L290 TraceCheckUtils]: 137: Hoare triple {19986#(<= ~counter~0 14)} ~cond := #in~cond; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:00,845 INFO L290 TraceCheckUtils]: 138: Hoare triple {19986#(<= ~counter~0 14)} assume !(0 == ~cond); {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:00,847 INFO L290 TraceCheckUtils]: 139: Hoare triple {19986#(<= ~counter~0 14)} assume true; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:00,848 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {19986#(<= ~counter~0 14)} {19986#(<= ~counter~0 14)} #63#return; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:00,848 INFO L290 TraceCheckUtils]: 141: Hoare triple {19986#(<= ~counter~0 14)} assume !!(0 != ~r~0); {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:00,848 INFO L290 TraceCheckUtils]: 142: Hoare triple {19986#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:00,849 INFO L290 TraceCheckUtils]: 143: Hoare triple {19986#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:00,849 INFO L290 TraceCheckUtils]: 144: Hoare triple {20014#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:00,850 INFO L272 TraceCheckUtils]: 145: Hoare triple {20014#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:00,850 INFO L290 TraceCheckUtils]: 146: Hoare triple {20014#(<= ~counter~0 15)} ~cond := #in~cond; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:00,850 INFO L290 TraceCheckUtils]: 147: Hoare triple {20014#(<= ~counter~0 15)} assume !(0 == ~cond); {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:00,851 INFO L290 TraceCheckUtils]: 148: Hoare triple {20014#(<= ~counter~0 15)} assume true; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:00,851 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {20014#(<= ~counter~0 15)} {20014#(<= ~counter~0 15)} #63#return; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:00,851 INFO L290 TraceCheckUtils]: 150: Hoare triple {20014#(<= ~counter~0 15)} assume !!(0 != ~r~0); {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:00,852 INFO L290 TraceCheckUtils]: 151: Hoare triple {20014#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:00,852 INFO L290 TraceCheckUtils]: 152: Hoare triple {20014#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:00,852 INFO L290 TraceCheckUtils]: 153: Hoare triple {20042#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:00,853 INFO L272 TraceCheckUtils]: 154: Hoare triple {20042#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:00,853 INFO L290 TraceCheckUtils]: 155: Hoare triple {20042#(<= ~counter~0 16)} ~cond := #in~cond; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:00,854 INFO L290 TraceCheckUtils]: 156: Hoare triple {20042#(<= ~counter~0 16)} assume !(0 == ~cond); {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:00,854 INFO L290 TraceCheckUtils]: 157: Hoare triple {20042#(<= ~counter~0 16)} assume true; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:00,854 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {20042#(<= ~counter~0 16)} {20042#(<= ~counter~0 16)} #63#return; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:00,855 INFO L290 TraceCheckUtils]: 159: Hoare triple {20042#(<= ~counter~0 16)} assume !!(0 != ~r~0); {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:00,855 INFO L290 TraceCheckUtils]: 160: Hoare triple {20042#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:00,855 INFO L290 TraceCheckUtils]: 161: Hoare triple {20042#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20070#(<= |main_#t~post6| 16)} is VALID [2022-04-28 06:04:00,856 INFO L290 TraceCheckUtils]: 162: Hoare triple {20070#(<= |main_#t~post6| 16)} assume !(#t~post6 < 20);havoc #t~post6; {19566#false} is VALID [2022-04-28 06:04:00,856 INFO L272 TraceCheckUtils]: 163: Hoare triple {19566#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19566#false} is VALID [2022-04-28 06:04:00,856 INFO L290 TraceCheckUtils]: 164: Hoare triple {19566#false} ~cond := #in~cond; {19566#false} is VALID [2022-04-28 06:04:00,856 INFO L290 TraceCheckUtils]: 165: Hoare triple {19566#false} assume 0 == ~cond; {19566#false} is VALID [2022-04-28 06:04:00,856 INFO L290 TraceCheckUtils]: 166: Hoare triple {19566#false} assume !false; {19566#false} is VALID [2022-04-28 06:04:00,857 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 32 proven. 1112 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:04:00,857 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:04:01,605 INFO L290 TraceCheckUtils]: 166: Hoare triple {19566#false} assume !false; {19566#false} is VALID [2022-04-28 06:04:01,606 INFO L290 TraceCheckUtils]: 165: Hoare triple {19566#false} assume 0 == ~cond; {19566#false} is VALID [2022-04-28 06:04:01,606 INFO L290 TraceCheckUtils]: 164: Hoare triple {19566#false} ~cond := #in~cond; {19566#false} is VALID [2022-04-28 06:04:01,606 INFO L272 TraceCheckUtils]: 163: Hoare triple {19566#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19566#false} is VALID [2022-04-28 06:04:01,606 INFO L290 TraceCheckUtils]: 162: Hoare triple {20098#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {19566#false} is VALID [2022-04-28 06:04:01,606 INFO L290 TraceCheckUtils]: 161: Hoare triple {20102#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20098#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:04:01,607 INFO L290 TraceCheckUtils]: 160: Hoare triple {20102#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20102#(< ~counter~0 20)} is VALID [2022-04-28 06:04:01,607 INFO L290 TraceCheckUtils]: 159: Hoare triple {20102#(< ~counter~0 20)} assume !!(0 != ~r~0); {20102#(< ~counter~0 20)} is VALID [2022-04-28 06:04:01,608 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {19565#true} {20102#(< ~counter~0 20)} #63#return; {20102#(< ~counter~0 20)} is VALID [2022-04-28 06:04:01,608 INFO L290 TraceCheckUtils]: 157: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,608 INFO L290 TraceCheckUtils]: 156: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,608 INFO L290 TraceCheckUtils]: 155: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,608 INFO L272 TraceCheckUtils]: 154: Hoare triple {20102#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,608 INFO L290 TraceCheckUtils]: 153: Hoare triple {20102#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {20102#(< ~counter~0 20)} is VALID [2022-04-28 06:04:01,609 INFO L290 TraceCheckUtils]: 152: Hoare triple {20130#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20102#(< ~counter~0 20)} is VALID [2022-04-28 06:04:01,609 INFO L290 TraceCheckUtils]: 151: Hoare triple {20130#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20130#(< ~counter~0 19)} is VALID [2022-04-28 06:04:01,609 INFO L290 TraceCheckUtils]: 150: Hoare triple {20130#(< ~counter~0 19)} assume !!(0 != ~r~0); {20130#(< ~counter~0 19)} is VALID [2022-04-28 06:04:01,610 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {19565#true} {20130#(< ~counter~0 19)} #63#return; {20130#(< ~counter~0 19)} is VALID [2022-04-28 06:04:01,610 INFO L290 TraceCheckUtils]: 148: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,610 INFO L290 TraceCheckUtils]: 147: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,610 INFO L290 TraceCheckUtils]: 146: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,610 INFO L272 TraceCheckUtils]: 145: Hoare triple {20130#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,610 INFO L290 TraceCheckUtils]: 144: Hoare triple {20130#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {20130#(< ~counter~0 19)} is VALID [2022-04-28 06:04:01,611 INFO L290 TraceCheckUtils]: 143: Hoare triple {20158#(< ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20130#(< ~counter~0 19)} is VALID [2022-04-28 06:04:01,611 INFO L290 TraceCheckUtils]: 142: Hoare triple {20158#(< ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20158#(< ~counter~0 18)} is VALID [2022-04-28 06:04:01,611 INFO L290 TraceCheckUtils]: 141: Hoare triple {20158#(< ~counter~0 18)} assume !!(0 != ~r~0); {20158#(< ~counter~0 18)} is VALID [2022-04-28 06:04:01,612 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {19565#true} {20158#(< ~counter~0 18)} #63#return; {20158#(< ~counter~0 18)} is VALID [2022-04-28 06:04:01,612 INFO L290 TraceCheckUtils]: 139: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,612 INFO L290 TraceCheckUtils]: 138: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,612 INFO L290 TraceCheckUtils]: 137: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,612 INFO L272 TraceCheckUtils]: 136: Hoare triple {20158#(< ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,613 INFO L290 TraceCheckUtils]: 135: Hoare triple {20158#(< ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {20158#(< ~counter~0 18)} is VALID [2022-04-28 06:04:01,613 INFO L290 TraceCheckUtils]: 134: Hoare triple {20042#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20158#(< ~counter~0 18)} is VALID [2022-04-28 06:04:01,613 INFO L290 TraceCheckUtils]: 133: Hoare triple {20042#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:01,614 INFO L290 TraceCheckUtils]: 132: Hoare triple {20042#(<= ~counter~0 16)} assume !!(0 != ~r~0); {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:01,614 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {19565#true} {20042#(<= ~counter~0 16)} #63#return; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:01,614 INFO L290 TraceCheckUtils]: 130: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,614 INFO L290 TraceCheckUtils]: 129: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,614 INFO L290 TraceCheckUtils]: 128: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,614 INFO L272 TraceCheckUtils]: 127: Hoare triple {20042#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,615 INFO L290 TraceCheckUtils]: 126: Hoare triple {20042#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:01,615 INFO L290 TraceCheckUtils]: 125: Hoare triple {20014#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20042#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:01,615 INFO L290 TraceCheckUtils]: 124: Hoare triple {20014#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:01,616 INFO L290 TraceCheckUtils]: 123: Hoare triple {20014#(<= ~counter~0 15)} assume !!(0 != ~r~0); {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:01,616 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19565#true} {20014#(<= ~counter~0 15)} #63#return; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:01,616 INFO L290 TraceCheckUtils]: 121: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,616 INFO L290 TraceCheckUtils]: 120: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,617 INFO L290 TraceCheckUtils]: 119: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,617 INFO L272 TraceCheckUtils]: 118: Hoare triple {20014#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,617 INFO L290 TraceCheckUtils]: 117: Hoare triple {20014#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:01,617 INFO L290 TraceCheckUtils]: 116: Hoare triple {19986#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {20014#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:01,618 INFO L290 TraceCheckUtils]: 115: Hoare triple {19986#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:01,618 INFO L290 TraceCheckUtils]: 114: Hoare triple {19986#(<= ~counter~0 14)} assume !!(0 != ~r~0); {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:01,618 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19565#true} {19986#(<= ~counter~0 14)} #63#return; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:01,619 INFO L290 TraceCheckUtils]: 112: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,619 INFO L290 TraceCheckUtils]: 111: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,619 INFO L290 TraceCheckUtils]: 110: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,619 INFO L272 TraceCheckUtils]: 109: Hoare triple {19986#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,619 INFO L290 TraceCheckUtils]: 108: Hoare triple {19986#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:01,619 INFO L290 TraceCheckUtils]: 107: Hoare triple {19958#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19986#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:01,620 INFO L290 TraceCheckUtils]: 106: Hoare triple {19958#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:01,620 INFO L290 TraceCheckUtils]: 105: Hoare triple {19958#(<= ~counter~0 13)} assume !!(0 != ~r~0); {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:01,621 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {19565#true} {19958#(<= ~counter~0 13)} #63#return; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:01,621 INFO L290 TraceCheckUtils]: 103: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,621 INFO L290 TraceCheckUtils]: 102: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,621 INFO L290 TraceCheckUtils]: 101: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,621 INFO L272 TraceCheckUtils]: 100: Hoare triple {19958#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,621 INFO L290 TraceCheckUtils]: 99: Hoare triple {19958#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:01,622 INFO L290 TraceCheckUtils]: 98: Hoare triple {19930#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19958#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:01,622 INFO L290 TraceCheckUtils]: 97: Hoare triple {19930#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:01,622 INFO L290 TraceCheckUtils]: 96: Hoare triple {19930#(<= ~counter~0 12)} assume !!(0 != ~r~0); {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:01,623 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {19565#true} {19930#(<= ~counter~0 12)} #63#return; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:01,623 INFO L290 TraceCheckUtils]: 94: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,623 INFO L290 TraceCheckUtils]: 93: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,623 INFO L290 TraceCheckUtils]: 92: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,623 INFO L272 TraceCheckUtils]: 91: Hoare triple {19930#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,623 INFO L290 TraceCheckUtils]: 90: Hoare triple {19930#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:01,624 INFO L290 TraceCheckUtils]: 89: Hoare triple {19902#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19930#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:01,624 INFO L290 TraceCheckUtils]: 88: Hoare triple {19902#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:01,624 INFO L290 TraceCheckUtils]: 87: Hoare triple {19902#(<= ~counter~0 11)} assume !!(0 != ~r~0); {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:01,625 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19565#true} {19902#(<= ~counter~0 11)} #63#return; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:01,625 INFO L290 TraceCheckUtils]: 85: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,625 INFO L290 TraceCheckUtils]: 84: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,625 INFO L290 TraceCheckUtils]: 83: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,625 INFO L272 TraceCheckUtils]: 82: Hoare triple {19902#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,625 INFO L290 TraceCheckUtils]: 81: Hoare triple {19902#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:01,626 INFO L290 TraceCheckUtils]: 80: Hoare triple {19874#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19902#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:01,626 INFO L290 TraceCheckUtils]: 79: Hoare triple {19874#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:01,626 INFO L290 TraceCheckUtils]: 78: Hoare triple {19874#(<= ~counter~0 10)} assume !!(0 != ~r~0); {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:01,627 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {19565#true} {19874#(<= ~counter~0 10)} #63#return; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:01,627 INFO L290 TraceCheckUtils]: 76: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,627 INFO L290 TraceCheckUtils]: 75: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,627 INFO L290 TraceCheckUtils]: 74: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,627 INFO L272 TraceCheckUtils]: 73: Hoare triple {19874#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,627 INFO L290 TraceCheckUtils]: 72: Hoare triple {19874#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:01,628 INFO L290 TraceCheckUtils]: 71: Hoare triple {19846#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19874#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:01,628 INFO L290 TraceCheckUtils]: 70: Hoare triple {19846#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:01,629 INFO L290 TraceCheckUtils]: 69: Hoare triple {19846#(<= ~counter~0 9)} assume !!(0 != ~r~0); {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:01,629 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19565#true} {19846#(<= ~counter~0 9)} #63#return; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:01,629 INFO L290 TraceCheckUtils]: 67: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,629 INFO L290 TraceCheckUtils]: 66: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,629 INFO L290 TraceCheckUtils]: 65: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,629 INFO L272 TraceCheckUtils]: 64: Hoare triple {19846#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,630 INFO L290 TraceCheckUtils]: 63: Hoare triple {19846#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:01,630 INFO L290 TraceCheckUtils]: 62: Hoare triple {19818#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19846#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:01,630 INFO L290 TraceCheckUtils]: 61: Hoare triple {19818#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:01,631 INFO L290 TraceCheckUtils]: 60: Hoare triple {19818#(<= ~counter~0 8)} assume !!(0 != ~r~0); {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:01,631 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19565#true} {19818#(<= ~counter~0 8)} #63#return; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:01,631 INFO L290 TraceCheckUtils]: 58: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,631 INFO L290 TraceCheckUtils]: 57: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,631 INFO L290 TraceCheckUtils]: 56: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,631 INFO L272 TraceCheckUtils]: 55: Hoare triple {19818#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,632 INFO L290 TraceCheckUtils]: 54: Hoare triple {19818#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:01,632 INFO L290 TraceCheckUtils]: 53: Hoare triple {19790#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19818#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:01,632 INFO L290 TraceCheckUtils]: 52: Hoare triple {19790#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:01,633 INFO L290 TraceCheckUtils]: 51: Hoare triple {19790#(<= ~counter~0 7)} assume !!(0 != ~r~0); {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:01,633 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19565#true} {19790#(<= ~counter~0 7)} #63#return; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:01,633 INFO L290 TraceCheckUtils]: 49: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,634 INFO L290 TraceCheckUtils]: 48: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,634 INFO L290 TraceCheckUtils]: 47: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,634 INFO L272 TraceCheckUtils]: 46: Hoare triple {19790#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,635 INFO L290 TraceCheckUtils]: 45: Hoare triple {19790#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:01,636 INFO L290 TraceCheckUtils]: 44: Hoare triple {19762#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19790#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:01,636 INFO L290 TraceCheckUtils]: 43: Hoare triple {19762#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:01,636 INFO L290 TraceCheckUtils]: 42: Hoare triple {19762#(<= ~counter~0 6)} assume !!(0 != ~r~0); {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:01,637 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19565#true} {19762#(<= ~counter~0 6)} #63#return; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:01,637 INFO L290 TraceCheckUtils]: 40: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,637 INFO L290 TraceCheckUtils]: 39: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,637 INFO L290 TraceCheckUtils]: 38: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,637 INFO L272 TraceCheckUtils]: 37: Hoare triple {19762#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {19762#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:01,644 INFO L290 TraceCheckUtils]: 35: Hoare triple {19734#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19762#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:01,645 INFO L290 TraceCheckUtils]: 34: Hoare triple {19734#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:01,645 INFO L290 TraceCheckUtils]: 33: Hoare triple {19734#(<= ~counter~0 5)} assume !!(0 != ~r~0); {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:01,646 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19565#true} {19734#(<= ~counter~0 5)} #63#return; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:01,646 INFO L290 TraceCheckUtils]: 31: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,646 INFO L272 TraceCheckUtils]: 28: Hoare triple {19734#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,647 INFO L290 TraceCheckUtils]: 27: Hoare triple {19734#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:01,647 INFO L290 TraceCheckUtils]: 26: Hoare triple {19706#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19734#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:01,648 INFO L290 TraceCheckUtils]: 25: Hoare triple {19706#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:01,648 INFO L290 TraceCheckUtils]: 24: Hoare triple {19706#(<= ~counter~0 4)} assume !!(0 != ~r~0); {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:01,649 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19565#true} {19706#(<= ~counter~0 4)} #63#return; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:01,649 INFO L290 TraceCheckUtils]: 22: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,649 INFO L272 TraceCheckUtils]: 19: Hoare triple {19706#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {19706#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:01,650 INFO L290 TraceCheckUtils]: 17: Hoare triple {19678#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19706#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:01,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {19678#(<= ~counter~0 3)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:01,651 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19565#true} {19678#(<= ~counter~0 3)} #61#return; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:01,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,651 INFO L272 TraceCheckUtils]: 11: Hoare triple {19678#(<= ~counter~0 3)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,652 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19565#true} {19678#(<= ~counter~0 3)} #59#return; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:01,652 INFO L290 TraceCheckUtils]: 9: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-28 06:04:01,652 INFO L290 TraceCheckUtils]: 8: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-28 06:04:01,652 INFO L290 TraceCheckUtils]: 7: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-28 06:04:01,652 INFO L272 TraceCheckUtils]: 6: Hoare triple {19678#(<= ~counter~0 3)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {19565#true} is VALID [2022-04-28 06:04:01,653 INFO L290 TraceCheckUtils]: 5: Hoare triple {19678#(<= ~counter~0 3)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:01,653 INFO L272 TraceCheckUtils]: 4: Hoare triple {19678#(<= ~counter~0 3)} call #t~ret7 := main(); {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:01,653 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19678#(<= ~counter~0 3)} {19565#true} #67#return; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:01,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {19678#(<= ~counter~0 3)} assume true; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:01,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {19565#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; {19678#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:01,655 INFO L272 TraceCheckUtils]: 0: Hoare triple {19565#true} call ULTIMATE.init(); {19565#true} is VALID [2022-04-28 06:04:01,655 INFO L134 CoverageAnalysis]: Checked inductivity of 1148 backedges. 32 proven. 632 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-28 06:04:01,656 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:04:01,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967687265] [2022-04-28 06:04:01,656 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:04:01,656 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [981577468] [2022-04-28 06:04:01,656 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [981577468] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:04:01,656 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:04:01,656 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-28 06:04:01,656 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:04:01,657 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [439960469] [2022-04-28 06:04:01,657 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [439960469] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:04:01,657 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:04:01,657 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-28 06:04:01,657 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1380704287] [2022-04-28 06:04:01,657 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:04:01,658 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, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 167 [2022-04-28 06:04:01,658 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:04:01,658 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, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:04:01,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:01,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-28 06:04:01,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:01,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-28 06:04:01,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:04:01,800 INFO L87 Difference]: Start difference. First operand 164 states and 181 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, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:04:02,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:02,542 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2022-04-28 06:04:02,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-28 06:04:02,543 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, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) Word has length 167 [2022-04-28 06:04:02,543 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:04:02,543 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, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:04:02,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 195 transitions. [2022-04-28 06:04:02,547 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, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:04:02,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 195 transitions. [2022-04-28 06:04:02,550 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 195 transitions. [2022-04-28 06:04:02,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 195 edges. 195 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:02,724 INFO L225 Difference]: With dead ends: 178 [2022-04-28 06:04:02,724 INFO L226 Difference]: Without dead ends: 173 [2022-04-28 06:04:02,725 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 349 GetRequests, 310 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-28 06:04:02,726 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 70 mSDsluCounter, 156 mSDsCounter, 0 mSdLazyCounter, 93 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 93 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:04:02,726 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [70 Valid, 198 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 93 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:04:02,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-28 06:04:02,986 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-28 06:04:02,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:04:02,987 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 06:04:02,987 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 06:04:02,988 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 06:04:02,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:02,990 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2022-04-28 06:04:02,990 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2022-04-28 06:04:02,991 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:02,991 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:02,991 INFO L74 IsIncluded]: Start isIncluded. First operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 173 states. [2022-04-28 06:04:02,991 INFO L87 Difference]: Start difference. First operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) Second operand 173 states. [2022-04-28 06:04:02,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:02,994 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2022-04-28 06:04:02,994 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2022-04-28 06:04:02,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:02,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:02,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:04:02,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:04:02,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 173 states, 131 states have (on average 1.1374045801526718) internal successors, (149), 131 states have internal predecessors, (149), 22 states have call successors, (22), 21 states have call predecessors, (22), 19 states have return successors, (20), 20 states have call predecessors, (20), 20 states have call successors, (20) [2022-04-28 06:04:02,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 191 transitions. [2022-04-28 06:04:02,998 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 191 transitions. Word has length 167 [2022-04-28 06:04:02,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:04:02,998 INFO L495 AbstractCegarLoop]: Abstraction has 173 states and 191 transitions. [2022-04-28 06:04:02,999 INFO L496 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, (21), 19 states have call predecessors, (21), 17 states have return successors, (19), 17 states have call predecessors, (19), 18 states have call successors, (19) [2022-04-28 06:04:02,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 191 transitions. [2022-04-28 06:04:04,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:04,170 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2022-04-28 06:04:04,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-28 06:04:04,171 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:04:04,171 INFO L195 NwaCegarLoop]: trace histogram [18, 18, 17, 17, 17, 17, 17, 17, 17, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:04:04,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Ended with exit code 0 [2022-04-28 06:04:04,383 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:04,383 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:04:04,384 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:04:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash 318093084, now seen corresponding path program 33 times [2022-04-28 06:04:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:04,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [789841973] [2022-04-28 06:04:04,384 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:04:04,384 INFO L85 PathProgramCache]: Analyzing trace with hash 318093084, now seen corresponding path program 34 times [2022-04-28 06:04:04,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:04:04,384 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413250755] [2022-04-28 06:04:04,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:04:04,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:04:04,401 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:04:04,402 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1845487788] [2022-04-28 06:04:04,402 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:04:04,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:04,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:04:04,403 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:04:04,406 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-28 06:04:04,667 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:04:04,668 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:04:04,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-28 06:04:04,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:04:04,709 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:04:05,708 INFO L272 TraceCheckUtils]: 0: Hoare triple {21670#true} call ULTIMATE.init(); {21670#true} is VALID [2022-04-28 06:04:05,709 INFO L290 TraceCheckUtils]: 1: Hoare triple {21670#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; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,709 INFO L290 TraceCheckUtils]: 2: Hoare triple {21678#(<= ~counter~0 0)} assume true; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,710 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21678#(<= ~counter~0 0)} {21670#true} #67#return; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,710 INFO L272 TraceCheckUtils]: 4: Hoare triple {21678#(<= ~counter~0 0)} call #t~ret7 := main(); {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,710 INFO L290 TraceCheckUtils]: 5: Hoare triple {21678#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,711 INFO L272 TraceCheckUtils]: 6: Hoare triple {21678#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {21678#(<= ~counter~0 0)} ~cond := #in~cond; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,711 INFO L290 TraceCheckUtils]: 8: Hoare triple {21678#(<= ~counter~0 0)} assume !(0 == ~cond); {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {21678#(<= ~counter~0 0)} assume true; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,712 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21678#(<= ~counter~0 0)} {21678#(<= ~counter~0 0)} #59#return; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,712 INFO L272 TraceCheckUtils]: 11: Hoare triple {21678#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {21678#(<= ~counter~0 0)} ~cond := #in~cond; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {21678#(<= ~counter~0 0)} assume !(0 == ~cond); {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {21678#(<= ~counter~0 0)} assume true; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,714 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21678#(<= ~counter~0 0)} {21678#(<= ~counter~0 0)} #61#return; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,714 INFO L290 TraceCheckUtils]: 16: Hoare triple {21678#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21678#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:05,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {21678#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21727#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:05,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {21727#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {21727#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:05,715 INFO L272 TraceCheckUtils]: 19: Hoare triple {21727#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21727#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:05,716 INFO L290 TraceCheckUtils]: 20: Hoare triple {21727#(<= ~counter~0 1)} ~cond := #in~cond; {21727#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:05,716 INFO L290 TraceCheckUtils]: 21: Hoare triple {21727#(<= ~counter~0 1)} assume !(0 == ~cond); {21727#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:05,716 INFO L290 TraceCheckUtils]: 22: Hoare triple {21727#(<= ~counter~0 1)} assume true; {21727#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:05,717 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21727#(<= ~counter~0 1)} {21727#(<= ~counter~0 1)} #63#return; {21727#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:05,717 INFO L290 TraceCheckUtils]: 24: Hoare triple {21727#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21727#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:05,717 INFO L290 TraceCheckUtils]: 25: Hoare triple {21727#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21727#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:05,718 INFO L290 TraceCheckUtils]: 26: Hoare triple {21727#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:05,718 INFO L290 TraceCheckUtils]: 27: Hoare triple {21755#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:05,719 INFO L272 TraceCheckUtils]: 28: Hoare triple {21755#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:05,719 INFO L290 TraceCheckUtils]: 29: Hoare triple {21755#(<= ~counter~0 2)} ~cond := #in~cond; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:05,732 INFO L290 TraceCheckUtils]: 30: Hoare triple {21755#(<= ~counter~0 2)} assume !(0 == ~cond); {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:05,733 INFO L290 TraceCheckUtils]: 31: Hoare triple {21755#(<= ~counter~0 2)} assume true; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:05,733 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21755#(<= ~counter~0 2)} {21755#(<= ~counter~0 2)} #63#return; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:05,733 INFO L290 TraceCheckUtils]: 33: Hoare triple {21755#(<= ~counter~0 2)} assume !!(0 != ~r~0); {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:05,734 INFO L290 TraceCheckUtils]: 34: Hoare triple {21755#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:05,734 INFO L290 TraceCheckUtils]: 35: Hoare triple {21755#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:05,735 INFO L290 TraceCheckUtils]: 36: Hoare triple {21783#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:05,735 INFO L272 TraceCheckUtils]: 37: Hoare triple {21783#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:05,736 INFO L290 TraceCheckUtils]: 38: Hoare triple {21783#(<= ~counter~0 3)} ~cond := #in~cond; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:05,736 INFO L290 TraceCheckUtils]: 39: Hoare triple {21783#(<= ~counter~0 3)} assume !(0 == ~cond); {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:05,736 INFO L290 TraceCheckUtils]: 40: Hoare triple {21783#(<= ~counter~0 3)} assume true; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:05,737 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21783#(<= ~counter~0 3)} {21783#(<= ~counter~0 3)} #63#return; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:05,737 INFO L290 TraceCheckUtils]: 42: Hoare triple {21783#(<= ~counter~0 3)} assume !!(0 != ~r~0); {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:05,737 INFO L290 TraceCheckUtils]: 43: Hoare triple {21783#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:05,738 INFO L290 TraceCheckUtils]: 44: Hoare triple {21783#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:05,738 INFO L290 TraceCheckUtils]: 45: Hoare triple {21811#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:05,739 INFO L272 TraceCheckUtils]: 46: Hoare triple {21811#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:05,739 INFO L290 TraceCheckUtils]: 47: Hoare triple {21811#(<= ~counter~0 4)} ~cond := #in~cond; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:05,739 INFO L290 TraceCheckUtils]: 48: Hoare triple {21811#(<= ~counter~0 4)} assume !(0 == ~cond); {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:05,739 INFO L290 TraceCheckUtils]: 49: Hoare triple {21811#(<= ~counter~0 4)} assume true; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:05,740 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21811#(<= ~counter~0 4)} {21811#(<= ~counter~0 4)} #63#return; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:05,740 INFO L290 TraceCheckUtils]: 51: Hoare triple {21811#(<= ~counter~0 4)} assume !!(0 != ~r~0); {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:05,740 INFO L290 TraceCheckUtils]: 52: Hoare triple {21811#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:05,741 INFO L290 TraceCheckUtils]: 53: Hoare triple {21811#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:05,741 INFO L290 TraceCheckUtils]: 54: Hoare triple {21839#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:05,742 INFO L272 TraceCheckUtils]: 55: Hoare triple {21839#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:05,742 INFO L290 TraceCheckUtils]: 56: Hoare triple {21839#(<= ~counter~0 5)} ~cond := #in~cond; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:05,742 INFO L290 TraceCheckUtils]: 57: Hoare triple {21839#(<= ~counter~0 5)} assume !(0 == ~cond); {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:05,743 INFO L290 TraceCheckUtils]: 58: Hoare triple {21839#(<= ~counter~0 5)} assume true; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:05,743 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21839#(<= ~counter~0 5)} {21839#(<= ~counter~0 5)} #63#return; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:05,743 INFO L290 TraceCheckUtils]: 60: Hoare triple {21839#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:05,744 INFO L290 TraceCheckUtils]: 61: Hoare triple {21839#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:05,744 INFO L290 TraceCheckUtils]: 62: Hoare triple {21839#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:05,745 INFO L290 TraceCheckUtils]: 63: Hoare triple {21867#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:05,745 INFO L272 TraceCheckUtils]: 64: Hoare triple {21867#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:05,745 INFO L290 TraceCheckUtils]: 65: Hoare triple {21867#(<= ~counter~0 6)} ~cond := #in~cond; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:05,746 INFO L290 TraceCheckUtils]: 66: Hoare triple {21867#(<= ~counter~0 6)} assume !(0 == ~cond); {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:05,746 INFO L290 TraceCheckUtils]: 67: Hoare triple {21867#(<= ~counter~0 6)} assume true; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:05,746 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21867#(<= ~counter~0 6)} {21867#(<= ~counter~0 6)} #63#return; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:05,747 INFO L290 TraceCheckUtils]: 69: Hoare triple {21867#(<= ~counter~0 6)} assume !!(0 != ~r~0); {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:05,747 INFO L290 TraceCheckUtils]: 70: Hoare triple {21867#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:05,747 INFO L290 TraceCheckUtils]: 71: Hoare triple {21867#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:05,748 INFO L290 TraceCheckUtils]: 72: Hoare triple {21895#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:05,748 INFO L272 TraceCheckUtils]: 73: Hoare triple {21895#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:05,749 INFO L290 TraceCheckUtils]: 74: Hoare triple {21895#(<= ~counter~0 7)} ~cond := #in~cond; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:05,749 INFO L290 TraceCheckUtils]: 75: Hoare triple {21895#(<= ~counter~0 7)} assume !(0 == ~cond); {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:05,749 INFO L290 TraceCheckUtils]: 76: Hoare triple {21895#(<= ~counter~0 7)} assume true; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:05,751 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21895#(<= ~counter~0 7)} {21895#(<= ~counter~0 7)} #63#return; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:05,752 INFO L290 TraceCheckUtils]: 78: Hoare triple {21895#(<= ~counter~0 7)} assume !!(0 != ~r~0); {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:05,752 INFO L290 TraceCheckUtils]: 79: Hoare triple {21895#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:05,753 INFO L290 TraceCheckUtils]: 80: Hoare triple {21895#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:05,753 INFO L290 TraceCheckUtils]: 81: Hoare triple {21923#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:05,754 INFO L272 TraceCheckUtils]: 82: Hoare triple {21923#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:05,754 INFO L290 TraceCheckUtils]: 83: Hoare triple {21923#(<= ~counter~0 8)} ~cond := #in~cond; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:05,755 INFO L290 TraceCheckUtils]: 84: Hoare triple {21923#(<= ~counter~0 8)} assume !(0 == ~cond); {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:05,755 INFO L290 TraceCheckUtils]: 85: Hoare triple {21923#(<= ~counter~0 8)} assume true; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:05,756 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21923#(<= ~counter~0 8)} {21923#(<= ~counter~0 8)} #63#return; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:05,756 INFO L290 TraceCheckUtils]: 87: Hoare triple {21923#(<= ~counter~0 8)} assume !!(0 != ~r~0); {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:05,757 INFO L290 TraceCheckUtils]: 88: Hoare triple {21923#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:05,758 INFO L290 TraceCheckUtils]: 89: Hoare triple {21923#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:05,758 INFO L290 TraceCheckUtils]: 90: Hoare triple {21951#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:05,759 INFO L272 TraceCheckUtils]: 91: Hoare triple {21951#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:05,759 INFO L290 TraceCheckUtils]: 92: Hoare triple {21951#(<= ~counter~0 9)} ~cond := #in~cond; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:05,759 INFO L290 TraceCheckUtils]: 93: Hoare triple {21951#(<= ~counter~0 9)} assume !(0 == ~cond); {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:05,760 INFO L290 TraceCheckUtils]: 94: Hoare triple {21951#(<= ~counter~0 9)} assume true; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:05,760 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21951#(<= ~counter~0 9)} {21951#(<= ~counter~0 9)} #63#return; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:05,761 INFO L290 TraceCheckUtils]: 96: Hoare triple {21951#(<= ~counter~0 9)} assume !!(0 != ~r~0); {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:05,761 INFO L290 TraceCheckUtils]: 97: Hoare triple {21951#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:05,762 INFO L290 TraceCheckUtils]: 98: Hoare triple {21951#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:05,762 INFO L290 TraceCheckUtils]: 99: Hoare triple {21979#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:05,763 INFO L272 TraceCheckUtils]: 100: Hoare triple {21979#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:05,763 INFO L290 TraceCheckUtils]: 101: Hoare triple {21979#(<= ~counter~0 10)} ~cond := #in~cond; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:05,764 INFO L290 TraceCheckUtils]: 102: Hoare triple {21979#(<= ~counter~0 10)} assume !(0 == ~cond); {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:05,764 INFO L290 TraceCheckUtils]: 103: Hoare triple {21979#(<= ~counter~0 10)} assume true; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:05,765 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {21979#(<= ~counter~0 10)} {21979#(<= ~counter~0 10)} #63#return; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:05,765 INFO L290 TraceCheckUtils]: 105: Hoare triple {21979#(<= ~counter~0 10)} assume !!(0 != ~r~0); {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:05,765 INFO L290 TraceCheckUtils]: 106: Hoare triple {21979#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:05,766 INFO L290 TraceCheckUtils]: 107: Hoare triple {21979#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:05,766 INFO L290 TraceCheckUtils]: 108: Hoare triple {22007#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:05,767 INFO L272 TraceCheckUtils]: 109: Hoare triple {22007#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:05,767 INFO L290 TraceCheckUtils]: 110: Hoare triple {22007#(<= ~counter~0 11)} ~cond := #in~cond; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:05,768 INFO L290 TraceCheckUtils]: 111: Hoare triple {22007#(<= ~counter~0 11)} assume !(0 == ~cond); {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:05,768 INFO L290 TraceCheckUtils]: 112: Hoare triple {22007#(<= ~counter~0 11)} assume true; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:05,769 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {22007#(<= ~counter~0 11)} {22007#(<= ~counter~0 11)} #63#return; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:05,769 INFO L290 TraceCheckUtils]: 114: Hoare triple {22007#(<= ~counter~0 11)} assume !!(0 != ~r~0); {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:05,769 INFO L290 TraceCheckUtils]: 115: Hoare triple {22007#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:05,770 INFO L290 TraceCheckUtils]: 116: Hoare triple {22007#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:05,771 INFO L290 TraceCheckUtils]: 117: Hoare triple {22035#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:05,771 INFO L272 TraceCheckUtils]: 118: Hoare triple {22035#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:05,772 INFO L290 TraceCheckUtils]: 119: Hoare triple {22035#(<= ~counter~0 12)} ~cond := #in~cond; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:05,772 INFO L290 TraceCheckUtils]: 120: Hoare triple {22035#(<= ~counter~0 12)} assume !(0 == ~cond); {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:05,773 INFO L290 TraceCheckUtils]: 121: Hoare triple {22035#(<= ~counter~0 12)} assume true; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:05,773 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {22035#(<= ~counter~0 12)} {22035#(<= ~counter~0 12)} #63#return; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:05,774 INFO L290 TraceCheckUtils]: 123: Hoare triple {22035#(<= ~counter~0 12)} assume !!(0 != ~r~0); {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:05,774 INFO L290 TraceCheckUtils]: 124: Hoare triple {22035#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:05,775 INFO L290 TraceCheckUtils]: 125: Hoare triple {22035#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:05,775 INFO L290 TraceCheckUtils]: 126: Hoare triple {22063#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:05,776 INFO L272 TraceCheckUtils]: 127: Hoare triple {22063#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:05,776 INFO L290 TraceCheckUtils]: 128: Hoare triple {22063#(<= ~counter~0 13)} ~cond := #in~cond; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:05,777 INFO L290 TraceCheckUtils]: 129: Hoare triple {22063#(<= ~counter~0 13)} assume !(0 == ~cond); {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:05,777 INFO L290 TraceCheckUtils]: 130: Hoare triple {22063#(<= ~counter~0 13)} assume true; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:05,778 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {22063#(<= ~counter~0 13)} {22063#(<= ~counter~0 13)} #63#return; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:05,778 INFO L290 TraceCheckUtils]: 132: Hoare triple {22063#(<= ~counter~0 13)} assume !!(0 != ~r~0); {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:05,779 INFO L290 TraceCheckUtils]: 133: Hoare triple {22063#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:05,779 INFO L290 TraceCheckUtils]: 134: Hoare triple {22063#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:05,780 INFO L290 TraceCheckUtils]: 135: Hoare triple {22091#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:05,781 INFO L272 TraceCheckUtils]: 136: Hoare triple {22091#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:05,781 INFO L290 TraceCheckUtils]: 137: Hoare triple {22091#(<= ~counter~0 14)} ~cond := #in~cond; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:05,781 INFO L290 TraceCheckUtils]: 138: Hoare triple {22091#(<= ~counter~0 14)} assume !(0 == ~cond); {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:05,782 INFO L290 TraceCheckUtils]: 139: Hoare triple {22091#(<= ~counter~0 14)} assume true; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:05,783 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {22091#(<= ~counter~0 14)} {22091#(<= ~counter~0 14)} #63#return; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:05,783 INFO L290 TraceCheckUtils]: 141: Hoare triple {22091#(<= ~counter~0 14)} assume !!(0 != ~r~0); {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:05,783 INFO L290 TraceCheckUtils]: 142: Hoare triple {22091#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:05,784 INFO L290 TraceCheckUtils]: 143: Hoare triple {22091#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:05,784 INFO L290 TraceCheckUtils]: 144: Hoare triple {22119#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:05,785 INFO L272 TraceCheckUtils]: 145: Hoare triple {22119#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:05,786 INFO L290 TraceCheckUtils]: 146: Hoare triple {22119#(<= ~counter~0 15)} ~cond := #in~cond; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:05,786 INFO L290 TraceCheckUtils]: 147: Hoare triple {22119#(<= ~counter~0 15)} assume !(0 == ~cond); {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:05,786 INFO L290 TraceCheckUtils]: 148: Hoare triple {22119#(<= ~counter~0 15)} assume true; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:05,787 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {22119#(<= ~counter~0 15)} {22119#(<= ~counter~0 15)} #63#return; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:05,787 INFO L290 TraceCheckUtils]: 150: Hoare triple {22119#(<= ~counter~0 15)} assume !!(0 != ~r~0); {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:05,788 INFO L290 TraceCheckUtils]: 151: Hoare triple {22119#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:05,788 INFO L290 TraceCheckUtils]: 152: Hoare triple {22119#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:05,789 INFO L290 TraceCheckUtils]: 153: Hoare triple {22147#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:05,789 INFO L272 TraceCheckUtils]: 154: Hoare triple {22147#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:05,790 INFO L290 TraceCheckUtils]: 155: Hoare triple {22147#(<= ~counter~0 16)} ~cond := #in~cond; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:05,790 INFO L290 TraceCheckUtils]: 156: Hoare triple {22147#(<= ~counter~0 16)} assume !(0 == ~cond); {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:05,790 INFO L290 TraceCheckUtils]: 157: Hoare triple {22147#(<= ~counter~0 16)} assume true; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:05,791 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {22147#(<= ~counter~0 16)} {22147#(<= ~counter~0 16)} #63#return; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:05,791 INFO L290 TraceCheckUtils]: 159: Hoare triple {22147#(<= ~counter~0 16)} assume !!(0 != ~r~0); {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:05,792 INFO L290 TraceCheckUtils]: 160: Hoare triple {22147#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:05,793 INFO L290 TraceCheckUtils]: 161: Hoare triple {22147#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:05,793 INFO L290 TraceCheckUtils]: 162: Hoare triple {22175#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:05,794 INFO L272 TraceCheckUtils]: 163: Hoare triple {22175#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:05,794 INFO L290 TraceCheckUtils]: 164: Hoare triple {22175#(<= ~counter~0 17)} ~cond := #in~cond; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:05,794 INFO L290 TraceCheckUtils]: 165: Hoare triple {22175#(<= ~counter~0 17)} assume !(0 == ~cond); {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:05,795 INFO L290 TraceCheckUtils]: 166: Hoare triple {22175#(<= ~counter~0 17)} assume true; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:05,795 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {22175#(<= ~counter~0 17)} {22175#(<= ~counter~0 17)} #63#return; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:05,796 INFO L290 TraceCheckUtils]: 168: Hoare triple {22175#(<= ~counter~0 17)} assume !!(0 != ~r~0); {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:05,796 INFO L290 TraceCheckUtils]: 169: Hoare triple {22175#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:05,796 INFO L290 TraceCheckUtils]: 170: Hoare triple {22175#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22203#(<= |main_#t~post6| 17)} is VALID [2022-04-28 06:04:05,797 INFO L290 TraceCheckUtils]: 171: Hoare triple {22203#(<= |main_#t~post6| 17)} assume !(#t~post6 < 20);havoc #t~post6; {21671#false} is VALID [2022-04-28 06:04:05,797 INFO L272 TraceCheckUtils]: 172: Hoare triple {21671#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21671#false} is VALID [2022-04-28 06:04:05,797 INFO L290 TraceCheckUtils]: 173: Hoare triple {21671#false} ~cond := #in~cond; {21671#false} is VALID [2022-04-28 06:04:05,797 INFO L290 TraceCheckUtils]: 174: Hoare triple {21671#false} assume 0 == ~cond; {21671#false} is VALID [2022-04-28 06:04:05,797 INFO L290 TraceCheckUtils]: 175: Hoare triple {21671#false} assume !false; {21671#false} is VALID [2022-04-28 06:04:05,798 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 34 proven. 1258 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:04:05,798 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:04:06,589 INFO L290 TraceCheckUtils]: 175: Hoare triple {21671#false} assume !false; {21671#false} is VALID [2022-04-28 06:04:06,589 INFO L290 TraceCheckUtils]: 174: Hoare triple {21671#false} assume 0 == ~cond; {21671#false} is VALID [2022-04-28 06:04:06,589 INFO L290 TraceCheckUtils]: 173: Hoare triple {21671#false} ~cond := #in~cond; {21671#false} is VALID [2022-04-28 06:04:06,589 INFO L272 TraceCheckUtils]: 172: Hoare triple {21671#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21671#false} is VALID [2022-04-28 06:04:06,589 INFO L290 TraceCheckUtils]: 171: Hoare triple {22231#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {21671#false} is VALID [2022-04-28 06:04:06,590 INFO L290 TraceCheckUtils]: 170: Hoare triple {22235#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22231#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:04:06,590 INFO L290 TraceCheckUtils]: 169: Hoare triple {22235#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22235#(< ~counter~0 20)} is VALID [2022-04-28 06:04:06,590 INFO L290 TraceCheckUtils]: 168: Hoare triple {22235#(< ~counter~0 20)} assume !!(0 != ~r~0); {22235#(< ~counter~0 20)} is VALID [2022-04-28 06:04:06,591 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {21670#true} {22235#(< ~counter~0 20)} #63#return; {22235#(< ~counter~0 20)} is VALID [2022-04-28 06:04:06,591 INFO L290 TraceCheckUtils]: 166: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,591 INFO L290 TraceCheckUtils]: 165: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,591 INFO L290 TraceCheckUtils]: 164: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,591 INFO L272 TraceCheckUtils]: 163: Hoare triple {22235#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,591 INFO L290 TraceCheckUtils]: 162: Hoare triple {22235#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {22235#(< ~counter~0 20)} is VALID [2022-04-28 06:04:06,592 INFO L290 TraceCheckUtils]: 161: Hoare triple {22263#(< ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22235#(< ~counter~0 20)} is VALID [2022-04-28 06:04:06,593 INFO L290 TraceCheckUtils]: 160: Hoare triple {22263#(< ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22263#(< ~counter~0 19)} is VALID [2022-04-28 06:04:06,593 INFO L290 TraceCheckUtils]: 159: Hoare triple {22263#(< ~counter~0 19)} assume !!(0 != ~r~0); {22263#(< ~counter~0 19)} is VALID [2022-04-28 06:04:06,593 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {21670#true} {22263#(< ~counter~0 19)} #63#return; {22263#(< ~counter~0 19)} is VALID [2022-04-28 06:04:06,593 INFO L290 TraceCheckUtils]: 157: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,594 INFO L290 TraceCheckUtils]: 156: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,594 INFO L290 TraceCheckUtils]: 155: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,594 INFO L272 TraceCheckUtils]: 154: Hoare triple {22263#(< ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,594 INFO L290 TraceCheckUtils]: 153: Hoare triple {22263#(< ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {22263#(< ~counter~0 19)} is VALID [2022-04-28 06:04:06,594 INFO L290 TraceCheckUtils]: 152: Hoare triple {22175#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22263#(< ~counter~0 19)} is VALID [2022-04-28 06:04:06,595 INFO L290 TraceCheckUtils]: 151: Hoare triple {22175#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:06,595 INFO L290 TraceCheckUtils]: 150: Hoare triple {22175#(<= ~counter~0 17)} assume !!(0 != ~r~0); {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:06,596 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {21670#true} {22175#(<= ~counter~0 17)} #63#return; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:06,596 INFO L290 TraceCheckUtils]: 148: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,596 INFO L290 TraceCheckUtils]: 147: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,596 INFO L290 TraceCheckUtils]: 146: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,596 INFO L272 TraceCheckUtils]: 145: Hoare triple {22175#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,596 INFO L290 TraceCheckUtils]: 144: Hoare triple {22175#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:06,597 INFO L290 TraceCheckUtils]: 143: Hoare triple {22147#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22175#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:06,597 INFO L290 TraceCheckUtils]: 142: Hoare triple {22147#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:06,597 INFO L290 TraceCheckUtils]: 141: Hoare triple {22147#(<= ~counter~0 16)} assume !!(0 != ~r~0); {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:06,598 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21670#true} {22147#(<= ~counter~0 16)} #63#return; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:06,598 INFO L290 TraceCheckUtils]: 139: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,598 INFO L290 TraceCheckUtils]: 138: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,598 INFO L290 TraceCheckUtils]: 137: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,598 INFO L272 TraceCheckUtils]: 136: Hoare triple {22147#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,598 INFO L290 TraceCheckUtils]: 135: Hoare triple {22147#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:06,599 INFO L290 TraceCheckUtils]: 134: Hoare triple {22119#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22147#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:06,599 INFO L290 TraceCheckUtils]: 133: Hoare triple {22119#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:06,599 INFO L290 TraceCheckUtils]: 132: Hoare triple {22119#(<= ~counter~0 15)} assume !!(0 != ~r~0); {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:06,600 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {21670#true} {22119#(<= ~counter~0 15)} #63#return; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:06,600 INFO L290 TraceCheckUtils]: 130: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,600 INFO L290 TraceCheckUtils]: 129: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,600 INFO L290 TraceCheckUtils]: 128: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,600 INFO L272 TraceCheckUtils]: 127: Hoare triple {22119#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,601 INFO L290 TraceCheckUtils]: 126: Hoare triple {22119#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:06,601 INFO L290 TraceCheckUtils]: 125: Hoare triple {22091#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22119#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:06,601 INFO L290 TraceCheckUtils]: 124: Hoare triple {22091#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:06,602 INFO L290 TraceCheckUtils]: 123: Hoare triple {22091#(<= ~counter~0 14)} assume !!(0 != ~r~0); {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:06,602 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {21670#true} {22091#(<= ~counter~0 14)} #63#return; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:06,602 INFO L290 TraceCheckUtils]: 121: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,602 INFO L290 TraceCheckUtils]: 120: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,602 INFO L290 TraceCheckUtils]: 119: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,602 INFO L272 TraceCheckUtils]: 118: Hoare triple {22091#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,603 INFO L290 TraceCheckUtils]: 117: Hoare triple {22091#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:06,603 INFO L290 TraceCheckUtils]: 116: Hoare triple {22063#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22091#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:06,604 INFO L290 TraceCheckUtils]: 115: Hoare triple {22063#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:06,604 INFO L290 TraceCheckUtils]: 114: Hoare triple {22063#(<= ~counter~0 13)} assume !!(0 != ~r~0); {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:06,604 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21670#true} {22063#(<= ~counter~0 13)} #63#return; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:06,604 INFO L290 TraceCheckUtils]: 112: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,605 INFO L290 TraceCheckUtils]: 111: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,605 INFO L290 TraceCheckUtils]: 110: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,605 INFO L272 TraceCheckUtils]: 109: Hoare triple {22063#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,607 INFO L290 TraceCheckUtils]: 108: Hoare triple {22063#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:06,608 INFO L290 TraceCheckUtils]: 107: Hoare triple {22035#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22063#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:06,608 INFO L290 TraceCheckUtils]: 106: Hoare triple {22035#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:06,609 INFO L290 TraceCheckUtils]: 105: Hoare triple {22035#(<= ~counter~0 12)} assume !!(0 != ~r~0); {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:06,609 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {21670#true} {22035#(<= ~counter~0 12)} #63#return; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:06,610 INFO L290 TraceCheckUtils]: 103: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,610 INFO L290 TraceCheckUtils]: 102: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,610 INFO L290 TraceCheckUtils]: 101: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,610 INFO L272 TraceCheckUtils]: 100: Hoare triple {22035#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,610 INFO L290 TraceCheckUtils]: 99: Hoare triple {22035#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:06,611 INFO L290 TraceCheckUtils]: 98: Hoare triple {22007#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22035#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:06,611 INFO L290 TraceCheckUtils]: 97: Hoare triple {22007#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:06,612 INFO L290 TraceCheckUtils]: 96: Hoare triple {22007#(<= ~counter~0 11)} assume !!(0 != ~r~0); {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:06,612 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21670#true} {22007#(<= ~counter~0 11)} #63#return; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:06,612 INFO L290 TraceCheckUtils]: 94: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,613 INFO L290 TraceCheckUtils]: 93: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,613 INFO L290 TraceCheckUtils]: 92: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,613 INFO L272 TraceCheckUtils]: 91: Hoare triple {22007#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,613 INFO L290 TraceCheckUtils]: 90: Hoare triple {22007#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:06,614 INFO L290 TraceCheckUtils]: 89: Hoare triple {21979#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22007#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:06,614 INFO L290 TraceCheckUtils]: 88: Hoare triple {21979#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:06,614 INFO L290 TraceCheckUtils]: 87: Hoare triple {21979#(<= ~counter~0 10)} assume !!(0 != ~r~0); {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:06,615 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21670#true} {21979#(<= ~counter~0 10)} #63#return; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:06,615 INFO L290 TraceCheckUtils]: 85: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,615 INFO L290 TraceCheckUtils]: 84: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,615 INFO L290 TraceCheckUtils]: 83: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,615 INFO L272 TraceCheckUtils]: 82: Hoare triple {21979#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,615 INFO L290 TraceCheckUtils]: 81: Hoare triple {21979#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:06,616 INFO L290 TraceCheckUtils]: 80: Hoare triple {21951#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21979#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:06,616 INFO L290 TraceCheckUtils]: 79: Hoare triple {21951#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:06,616 INFO L290 TraceCheckUtils]: 78: Hoare triple {21951#(<= ~counter~0 9)} assume !!(0 != ~r~0); {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:06,617 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21670#true} {21951#(<= ~counter~0 9)} #63#return; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:06,617 INFO L290 TraceCheckUtils]: 76: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,617 INFO L290 TraceCheckUtils]: 75: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,617 INFO L290 TraceCheckUtils]: 74: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,617 INFO L272 TraceCheckUtils]: 73: Hoare triple {21951#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,617 INFO L290 TraceCheckUtils]: 72: Hoare triple {21951#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:06,618 INFO L290 TraceCheckUtils]: 71: Hoare triple {21923#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21951#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:06,618 INFO L290 TraceCheckUtils]: 70: Hoare triple {21923#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:06,619 INFO L290 TraceCheckUtils]: 69: Hoare triple {21923#(<= ~counter~0 8)} assume !!(0 != ~r~0); {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:06,619 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21670#true} {21923#(<= ~counter~0 8)} #63#return; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:06,619 INFO L290 TraceCheckUtils]: 67: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,619 INFO L290 TraceCheckUtils]: 66: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,619 INFO L290 TraceCheckUtils]: 65: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,619 INFO L272 TraceCheckUtils]: 64: Hoare triple {21923#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {21923#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:06,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {21895#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21923#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:06,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {21895#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:06,621 INFO L290 TraceCheckUtils]: 60: Hoare triple {21895#(<= ~counter~0 7)} assume !!(0 != ~r~0); {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:06,621 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21670#true} {21895#(<= ~counter~0 7)} #63#return; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:06,621 INFO L290 TraceCheckUtils]: 58: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,621 INFO L290 TraceCheckUtils]: 57: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,622 INFO L290 TraceCheckUtils]: 56: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,622 INFO L272 TraceCheckUtils]: 55: Hoare triple {21895#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {21895#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:06,622 INFO L290 TraceCheckUtils]: 53: Hoare triple {21867#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21895#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:06,623 INFO L290 TraceCheckUtils]: 52: Hoare triple {21867#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:06,623 INFO L290 TraceCheckUtils]: 51: Hoare triple {21867#(<= ~counter~0 6)} assume !!(0 != ~r~0); {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:06,624 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21670#true} {21867#(<= ~counter~0 6)} #63#return; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:06,624 INFO L290 TraceCheckUtils]: 49: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,624 INFO L290 TraceCheckUtils]: 48: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,624 INFO L290 TraceCheckUtils]: 47: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,624 INFO L272 TraceCheckUtils]: 46: Hoare triple {21867#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,624 INFO L290 TraceCheckUtils]: 45: Hoare triple {21867#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:06,625 INFO L290 TraceCheckUtils]: 44: Hoare triple {21839#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21867#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:06,625 INFO L290 TraceCheckUtils]: 43: Hoare triple {21839#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:06,625 INFO L290 TraceCheckUtils]: 42: Hoare triple {21839#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:06,626 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21670#true} {21839#(<= ~counter~0 5)} #63#return; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:06,626 INFO L290 TraceCheckUtils]: 40: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,626 INFO L290 TraceCheckUtils]: 39: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,626 INFO L290 TraceCheckUtils]: 38: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,626 INFO L272 TraceCheckUtils]: 37: Hoare triple {21839#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {21839#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:06,627 INFO L290 TraceCheckUtils]: 35: Hoare triple {21811#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21839#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:06,627 INFO L290 TraceCheckUtils]: 34: Hoare triple {21811#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:06,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {21811#(<= ~counter~0 4)} assume !!(0 != ~r~0); {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:06,628 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21670#true} {21811#(<= ~counter~0 4)} #63#return; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:06,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,628 INFO L272 TraceCheckUtils]: 28: Hoare triple {21811#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,629 INFO L290 TraceCheckUtils]: 27: Hoare triple {21811#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:06,629 INFO L290 TraceCheckUtils]: 26: Hoare triple {21783#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21811#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:06,629 INFO L290 TraceCheckUtils]: 25: Hoare triple {21783#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:06,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {21783#(<= ~counter~0 3)} assume !!(0 != ~r~0); {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:06,630 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21670#true} {21783#(<= ~counter~0 3)} #63#return; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:06,630 INFO L290 TraceCheckUtils]: 22: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,631 INFO L272 TraceCheckUtils]: 19: Hoare triple {21783#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {21783#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:06,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {21755#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21783#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:06,632 INFO L290 TraceCheckUtils]: 16: Hoare triple {21755#(<= ~counter~0 2)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:06,632 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21670#true} {21755#(<= ~counter~0 2)} #61#return; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:06,632 INFO L290 TraceCheckUtils]: 14: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,632 INFO L290 TraceCheckUtils]: 13: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,632 INFO L272 TraceCheckUtils]: 11: Hoare triple {21755#(<= ~counter~0 2)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,633 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21670#true} {21755#(<= ~counter~0 2)} #59#return; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:06,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-28 06:04:06,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-28 06:04:06,633 INFO L290 TraceCheckUtils]: 7: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-28 06:04:06,633 INFO L272 TraceCheckUtils]: 6: Hoare triple {21755#(<= ~counter~0 2)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21670#true} is VALID [2022-04-28 06:04:06,633 INFO L290 TraceCheckUtils]: 5: Hoare triple {21755#(<= ~counter~0 2)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:06,634 INFO L272 TraceCheckUtils]: 4: Hoare triple {21755#(<= ~counter~0 2)} call #t~ret7 := main(); {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:06,634 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21755#(<= ~counter~0 2)} {21670#true} #67#return; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:06,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {21755#(<= ~counter~0 2)} assume true; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:06,635 INFO L290 TraceCheckUtils]: 1: Hoare triple {21670#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; {21755#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:06,635 INFO L272 TraceCheckUtils]: 0: Hoare triple {21670#true} call ULTIMATE.init(); {21670#true} is VALID [2022-04-28 06:04:06,635 INFO L134 CoverageAnalysis]: Checked inductivity of 1296 backedges. 34 proven. 714 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-28 06:04:06,636 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:04:06,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413250755] [2022-04-28 06:04:06,636 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:04:06,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1845487788] [2022-04-28 06:04:06,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1845487788] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:04:06,636 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:04:06,636 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-28 06:04:06,636 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:04:06,636 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [789841973] [2022-04-28 06:04:06,636 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [789841973] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:04:06,636 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:04:06,637 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-28 06:04:06,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1612923187] [2022-04-28 06:04:06,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:04:06,637 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, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 176 [2022-04-28 06:04:06,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:04:06,638 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, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:04:06,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 173 edges. 173 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:06,767 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-28 06:04:06,767 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:06,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-28 06:04:06,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:04:06,768 INFO L87 Difference]: Start difference. First operand 173 states and 191 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, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:04:07,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:07,623 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2022-04-28 06:04:07,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-28 06:04:07,623 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, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) Word has length 176 [2022-04-28 06:04:07,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:04:07,624 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, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:04:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 205 transitions. [2022-04-28 06:04:07,628 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, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:04:07,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 205 transitions. [2022-04-28 06:04:07,631 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 205 transitions. [2022-04-28 06:04:07,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:07,811 INFO L225 Difference]: With dead ends: 187 [2022-04-28 06:04:07,812 INFO L226 Difference]: Without dead ends: 182 [2022-04-28 06:04:07,812 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=627, Invalid=1013, Unknown=0, NotChecked=0, Total=1640 [2022-04-28 06:04:07,813 INFO L413 NwaCegarLoop]: 43 mSDtfsCounter, 48 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 218 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:04:07,813 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 218 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:04:07,814 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-28 06:04:08,086 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-28 06:04:08,086 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:04:08,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 06:04:08,087 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 06:04:08,087 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 06:04:08,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:08,090 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-04-28 06:04:08,090 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2022-04-28 06:04:08,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:08,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:08,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 182 states. [2022-04-28 06:04:08,092 INFO L87 Difference]: Start difference. First operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) Second operand 182 states. [2022-04-28 06:04:08,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:08,095 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-04-28 06:04:08,096 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2022-04-28 06:04:08,096 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:08,096 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:08,096 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:04:08,096 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:04:08,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.1376811594202898) internal successors, (157), 138 states have internal predecessors, (157), 23 states have call successors, (23), 22 states have call predecessors, (23), 20 states have return successors, (21), 21 states have call predecessors, (21), 21 states have call successors, (21) [2022-04-28 06:04:08,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 201 transitions. [2022-04-28 06:04:08,100 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 201 transitions. Word has length 176 [2022-04-28 06:04:08,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:04:08,100 INFO L495 AbstractCegarLoop]: Abstraction has 182 states and 201 transitions. [2022-04-28 06:04:08,100 INFO L496 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, (22), 20 states have call predecessors, (22), 18 states have return successors, (20), 18 states have call predecessors, (20), 19 states have call successors, (20) [2022-04-28 06:04:08,101 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 201 transitions. [2022-04-28 06:04:09,905 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:09,905 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2022-04-28 06:04:09,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-28 06:04:09,907 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:04:09,908 INFO L195 NwaCegarLoop]: trace histogram [19, 19, 18, 18, 18, 18, 18, 18, 18, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:04:09,916 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-28 06:04:10,116 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:10,116 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:04:10,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:04:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 994740182, now seen corresponding path program 35 times [2022-04-28 06:04:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:10,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [317680573] [2022-04-28 06:04:10,117 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:04:10,117 INFO L85 PathProgramCache]: Analyzing trace with hash 994740182, now seen corresponding path program 36 times [2022-04-28 06:04:10,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:04:10,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [58735553] [2022-04-28 06:04:10,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:04:10,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:04:10,135 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:04:10,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1796012034] [2022-04-28 06:04:10,136 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-28 06:04:10,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:10,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:04:10,137 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:04:10,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-28 06:04:12,254 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-28 06:04:12,254 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:04:12,259 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-28 06:04:12,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:04:12,296 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:04:13,279 INFO L272 TraceCheckUtils]: 0: Hoare triple {23885#true} call ULTIMATE.init(); {23885#true} is VALID [2022-04-28 06:04:13,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {23885#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; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {23893#(<= ~counter~0 0)} assume true; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,281 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23893#(<= ~counter~0 0)} {23885#true} #67#return; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,281 INFO L272 TraceCheckUtils]: 4: Hoare triple {23893#(<= ~counter~0 0)} call #t~ret7 := main(); {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {23893#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,282 INFO L272 TraceCheckUtils]: 6: Hoare triple {23893#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {23893#(<= ~counter~0 0)} ~cond := #in~cond; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {23893#(<= ~counter~0 0)} assume !(0 == ~cond); {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,283 INFO L290 TraceCheckUtils]: 9: Hoare triple {23893#(<= ~counter~0 0)} assume true; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,283 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23893#(<= ~counter~0 0)} {23893#(<= ~counter~0 0)} #59#return; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,284 INFO L272 TraceCheckUtils]: 11: Hoare triple {23893#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {23893#(<= ~counter~0 0)} ~cond := #in~cond; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {23893#(<= ~counter~0 0)} assume !(0 == ~cond); {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,285 INFO L290 TraceCheckUtils]: 14: Hoare triple {23893#(<= ~counter~0 0)} assume true; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,285 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23893#(<= ~counter~0 0)} {23893#(<= ~counter~0 0)} #61#return; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {23893#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23893#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:13,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {23893#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:13,287 INFO L290 TraceCheckUtils]: 18: Hoare triple {23942#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:13,288 INFO L272 TraceCheckUtils]: 19: Hoare triple {23942#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:13,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {23942#(<= ~counter~0 1)} ~cond := #in~cond; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:13,288 INFO L290 TraceCheckUtils]: 21: Hoare triple {23942#(<= ~counter~0 1)} assume !(0 == ~cond); {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:13,289 INFO L290 TraceCheckUtils]: 22: Hoare triple {23942#(<= ~counter~0 1)} assume true; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:13,289 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23942#(<= ~counter~0 1)} {23942#(<= ~counter~0 1)} #63#return; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:13,289 INFO L290 TraceCheckUtils]: 24: Hoare triple {23942#(<= ~counter~0 1)} assume !!(0 != ~r~0); {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:13,290 INFO L290 TraceCheckUtils]: 25: Hoare triple {23942#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:13,290 INFO L290 TraceCheckUtils]: 26: Hoare triple {23942#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:13,291 INFO L290 TraceCheckUtils]: 27: Hoare triple {23970#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:13,291 INFO L272 TraceCheckUtils]: 28: Hoare triple {23970#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:13,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {23970#(<= ~counter~0 2)} ~cond := #in~cond; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:13,292 INFO L290 TraceCheckUtils]: 30: Hoare triple {23970#(<= ~counter~0 2)} assume !(0 == ~cond); {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:13,292 INFO L290 TraceCheckUtils]: 31: Hoare triple {23970#(<= ~counter~0 2)} assume true; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:13,293 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23970#(<= ~counter~0 2)} {23970#(<= ~counter~0 2)} #63#return; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:13,293 INFO L290 TraceCheckUtils]: 33: Hoare triple {23970#(<= ~counter~0 2)} assume !!(0 != ~r~0); {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:13,294 INFO L290 TraceCheckUtils]: 34: Hoare triple {23970#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:13,294 INFO L290 TraceCheckUtils]: 35: Hoare triple {23970#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:13,295 INFO L290 TraceCheckUtils]: 36: Hoare triple {23998#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:13,295 INFO L272 TraceCheckUtils]: 37: Hoare triple {23998#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:13,296 INFO L290 TraceCheckUtils]: 38: Hoare triple {23998#(<= ~counter~0 3)} ~cond := #in~cond; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:13,296 INFO L290 TraceCheckUtils]: 39: Hoare triple {23998#(<= ~counter~0 3)} assume !(0 == ~cond); {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:13,296 INFO L290 TraceCheckUtils]: 40: Hoare triple {23998#(<= ~counter~0 3)} assume true; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:13,297 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23998#(<= ~counter~0 3)} {23998#(<= ~counter~0 3)} #63#return; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:13,297 INFO L290 TraceCheckUtils]: 42: Hoare triple {23998#(<= ~counter~0 3)} assume !!(0 != ~r~0); {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:13,297 INFO L290 TraceCheckUtils]: 43: Hoare triple {23998#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:13,298 INFO L290 TraceCheckUtils]: 44: Hoare triple {23998#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:13,298 INFO L290 TraceCheckUtils]: 45: Hoare triple {24026#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:13,299 INFO L272 TraceCheckUtils]: 46: Hoare triple {24026#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:13,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {24026#(<= ~counter~0 4)} ~cond := #in~cond; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:13,300 INFO L290 TraceCheckUtils]: 48: Hoare triple {24026#(<= ~counter~0 4)} assume !(0 == ~cond); {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:13,300 INFO L290 TraceCheckUtils]: 49: Hoare triple {24026#(<= ~counter~0 4)} assume true; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:13,301 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24026#(<= ~counter~0 4)} {24026#(<= ~counter~0 4)} #63#return; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:13,301 INFO L290 TraceCheckUtils]: 51: Hoare triple {24026#(<= ~counter~0 4)} assume !!(0 != ~r~0); {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:13,301 INFO L290 TraceCheckUtils]: 52: Hoare triple {24026#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:13,302 INFO L290 TraceCheckUtils]: 53: Hoare triple {24026#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:13,302 INFO L290 TraceCheckUtils]: 54: Hoare triple {24054#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:13,303 INFO L272 TraceCheckUtils]: 55: Hoare triple {24054#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:13,303 INFO L290 TraceCheckUtils]: 56: Hoare triple {24054#(<= ~counter~0 5)} ~cond := #in~cond; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:13,304 INFO L290 TraceCheckUtils]: 57: Hoare triple {24054#(<= ~counter~0 5)} assume !(0 == ~cond); {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:13,304 INFO L290 TraceCheckUtils]: 58: Hoare triple {24054#(<= ~counter~0 5)} assume true; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:13,305 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24054#(<= ~counter~0 5)} {24054#(<= ~counter~0 5)} #63#return; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:13,305 INFO L290 TraceCheckUtils]: 60: Hoare triple {24054#(<= ~counter~0 5)} assume !!(0 != ~r~0); {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:13,305 INFO L290 TraceCheckUtils]: 61: Hoare triple {24054#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:13,306 INFO L290 TraceCheckUtils]: 62: Hoare triple {24054#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:13,306 INFO L290 TraceCheckUtils]: 63: Hoare triple {24082#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:13,307 INFO L272 TraceCheckUtils]: 64: Hoare triple {24082#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:13,307 INFO L290 TraceCheckUtils]: 65: Hoare triple {24082#(<= ~counter~0 6)} ~cond := #in~cond; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:13,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {24082#(<= ~counter~0 6)} assume !(0 == ~cond); {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:13,308 INFO L290 TraceCheckUtils]: 67: Hoare triple {24082#(<= ~counter~0 6)} assume true; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:13,308 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {24082#(<= ~counter~0 6)} {24082#(<= ~counter~0 6)} #63#return; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:13,309 INFO L290 TraceCheckUtils]: 69: Hoare triple {24082#(<= ~counter~0 6)} assume !!(0 != ~r~0); {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:13,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {24082#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:13,310 INFO L290 TraceCheckUtils]: 71: Hoare triple {24082#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:13,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {24110#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:13,311 INFO L272 TraceCheckUtils]: 73: Hoare triple {24110#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:13,311 INFO L290 TraceCheckUtils]: 74: Hoare triple {24110#(<= ~counter~0 7)} ~cond := #in~cond; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:13,311 INFO L290 TraceCheckUtils]: 75: Hoare triple {24110#(<= ~counter~0 7)} assume !(0 == ~cond); {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:13,312 INFO L290 TraceCheckUtils]: 76: Hoare triple {24110#(<= ~counter~0 7)} assume true; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:13,312 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {24110#(<= ~counter~0 7)} {24110#(<= ~counter~0 7)} #63#return; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:13,313 INFO L290 TraceCheckUtils]: 78: Hoare triple {24110#(<= ~counter~0 7)} assume !!(0 != ~r~0); {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:13,313 INFO L290 TraceCheckUtils]: 79: Hoare triple {24110#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:13,314 INFO L290 TraceCheckUtils]: 80: Hoare triple {24110#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:13,314 INFO L290 TraceCheckUtils]: 81: Hoare triple {24138#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:13,315 INFO L272 TraceCheckUtils]: 82: Hoare triple {24138#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:13,315 INFO L290 TraceCheckUtils]: 83: Hoare triple {24138#(<= ~counter~0 8)} ~cond := #in~cond; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:13,315 INFO L290 TraceCheckUtils]: 84: Hoare triple {24138#(<= ~counter~0 8)} assume !(0 == ~cond); {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:13,316 INFO L290 TraceCheckUtils]: 85: Hoare triple {24138#(<= ~counter~0 8)} assume true; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:13,316 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {24138#(<= ~counter~0 8)} {24138#(<= ~counter~0 8)} #63#return; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:13,316 INFO L290 TraceCheckUtils]: 87: Hoare triple {24138#(<= ~counter~0 8)} assume !!(0 != ~r~0); {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:13,317 INFO L290 TraceCheckUtils]: 88: Hoare triple {24138#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:13,317 INFO L290 TraceCheckUtils]: 89: Hoare triple {24138#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:13,318 INFO L290 TraceCheckUtils]: 90: Hoare triple {24166#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:13,318 INFO L272 TraceCheckUtils]: 91: Hoare triple {24166#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:13,319 INFO L290 TraceCheckUtils]: 92: Hoare triple {24166#(<= ~counter~0 9)} ~cond := #in~cond; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:13,319 INFO L290 TraceCheckUtils]: 93: Hoare triple {24166#(<= ~counter~0 9)} assume !(0 == ~cond); {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:13,319 INFO L290 TraceCheckUtils]: 94: Hoare triple {24166#(<= ~counter~0 9)} assume true; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:13,320 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {24166#(<= ~counter~0 9)} {24166#(<= ~counter~0 9)} #63#return; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:13,320 INFO L290 TraceCheckUtils]: 96: Hoare triple {24166#(<= ~counter~0 9)} assume !!(0 != ~r~0); {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:13,321 INFO L290 TraceCheckUtils]: 97: Hoare triple {24166#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:13,321 INFO L290 TraceCheckUtils]: 98: Hoare triple {24166#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:13,322 INFO L290 TraceCheckUtils]: 99: Hoare triple {24194#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:13,322 INFO L272 TraceCheckUtils]: 100: Hoare triple {24194#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:13,323 INFO L290 TraceCheckUtils]: 101: Hoare triple {24194#(<= ~counter~0 10)} ~cond := #in~cond; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:13,323 INFO L290 TraceCheckUtils]: 102: Hoare triple {24194#(<= ~counter~0 10)} assume !(0 == ~cond); {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:13,323 INFO L290 TraceCheckUtils]: 103: Hoare triple {24194#(<= ~counter~0 10)} assume true; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:13,324 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {24194#(<= ~counter~0 10)} {24194#(<= ~counter~0 10)} #63#return; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:13,324 INFO L290 TraceCheckUtils]: 105: Hoare triple {24194#(<= ~counter~0 10)} assume !!(0 != ~r~0); {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:13,324 INFO L290 TraceCheckUtils]: 106: Hoare triple {24194#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:13,325 INFO L290 TraceCheckUtils]: 107: Hoare triple {24194#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:13,325 INFO L290 TraceCheckUtils]: 108: Hoare triple {24222#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:13,326 INFO L272 TraceCheckUtils]: 109: Hoare triple {24222#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:13,327 INFO L290 TraceCheckUtils]: 110: Hoare triple {24222#(<= ~counter~0 11)} ~cond := #in~cond; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:13,327 INFO L290 TraceCheckUtils]: 111: Hoare triple {24222#(<= ~counter~0 11)} assume !(0 == ~cond); {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:13,327 INFO L290 TraceCheckUtils]: 112: Hoare triple {24222#(<= ~counter~0 11)} assume true; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:13,328 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {24222#(<= ~counter~0 11)} {24222#(<= ~counter~0 11)} #63#return; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:13,328 INFO L290 TraceCheckUtils]: 114: Hoare triple {24222#(<= ~counter~0 11)} assume !!(0 != ~r~0); {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:13,329 INFO L290 TraceCheckUtils]: 115: Hoare triple {24222#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:13,330 INFO L290 TraceCheckUtils]: 116: Hoare triple {24222#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:13,330 INFO L290 TraceCheckUtils]: 117: Hoare triple {24250#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:13,331 INFO L272 TraceCheckUtils]: 118: Hoare triple {24250#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:13,331 INFO L290 TraceCheckUtils]: 119: Hoare triple {24250#(<= ~counter~0 12)} ~cond := #in~cond; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:13,331 INFO L290 TraceCheckUtils]: 120: Hoare triple {24250#(<= ~counter~0 12)} assume !(0 == ~cond); {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:13,332 INFO L290 TraceCheckUtils]: 121: Hoare triple {24250#(<= ~counter~0 12)} assume true; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:13,333 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24250#(<= ~counter~0 12)} {24250#(<= ~counter~0 12)} #63#return; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:13,333 INFO L290 TraceCheckUtils]: 123: Hoare triple {24250#(<= ~counter~0 12)} assume !!(0 != ~r~0); {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:13,333 INFO L290 TraceCheckUtils]: 124: Hoare triple {24250#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:13,334 INFO L290 TraceCheckUtils]: 125: Hoare triple {24250#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:13,334 INFO L290 TraceCheckUtils]: 126: Hoare triple {24278#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:13,335 INFO L272 TraceCheckUtils]: 127: Hoare triple {24278#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:13,336 INFO L290 TraceCheckUtils]: 128: Hoare triple {24278#(<= ~counter~0 13)} ~cond := #in~cond; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:13,336 INFO L290 TraceCheckUtils]: 129: Hoare triple {24278#(<= ~counter~0 13)} assume !(0 == ~cond); {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:13,336 INFO L290 TraceCheckUtils]: 130: Hoare triple {24278#(<= ~counter~0 13)} assume true; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:13,337 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {24278#(<= ~counter~0 13)} {24278#(<= ~counter~0 13)} #63#return; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:13,338 INFO L290 TraceCheckUtils]: 132: Hoare triple {24278#(<= ~counter~0 13)} assume !!(0 != ~r~0); {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:13,338 INFO L290 TraceCheckUtils]: 133: Hoare triple {24278#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:13,339 INFO L290 TraceCheckUtils]: 134: Hoare triple {24278#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:13,339 INFO L290 TraceCheckUtils]: 135: Hoare triple {24306#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:13,340 INFO L272 TraceCheckUtils]: 136: Hoare triple {24306#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:13,340 INFO L290 TraceCheckUtils]: 137: Hoare triple {24306#(<= ~counter~0 14)} ~cond := #in~cond; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:13,341 INFO L290 TraceCheckUtils]: 138: Hoare triple {24306#(<= ~counter~0 14)} assume !(0 == ~cond); {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:13,341 INFO L290 TraceCheckUtils]: 139: Hoare triple {24306#(<= ~counter~0 14)} assume true; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:13,342 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {24306#(<= ~counter~0 14)} {24306#(<= ~counter~0 14)} #63#return; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:13,342 INFO L290 TraceCheckUtils]: 141: Hoare triple {24306#(<= ~counter~0 14)} assume !!(0 != ~r~0); {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:13,343 INFO L290 TraceCheckUtils]: 142: Hoare triple {24306#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:13,343 INFO L290 TraceCheckUtils]: 143: Hoare triple {24306#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:13,344 INFO L290 TraceCheckUtils]: 144: Hoare triple {24334#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:13,344 INFO L272 TraceCheckUtils]: 145: Hoare triple {24334#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:13,345 INFO L290 TraceCheckUtils]: 146: Hoare triple {24334#(<= ~counter~0 15)} ~cond := #in~cond; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:13,345 INFO L290 TraceCheckUtils]: 147: Hoare triple {24334#(<= ~counter~0 15)} assume !(0 == ~cond); {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:13,346 INFO L290 TraceCheckUtils]: 148: Hoare triple {24334#(<= ~counter~0 15)} assume true; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:13,346 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {24334#(<= ~counter~0 15)} {24334#(<= ~counter~0 15)} #63#return; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:13,347 INFO L290 TraceCheckUtils]: 150: Hoare triple {24334#(<= ~counter~0 15)} assume !!(0 != ~r~0); {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:13,347 INFO L290 TraceCheckUtils]: 151: Hoare triple {24334#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:13,348 INFO L290 TraceCheckUtils]: 152: Hoare triple {24334#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:13,348 INFO L290 TraceCheckUtils]: 153: Hoare triple {24362#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:13,349 INFO L272 TraceCheckUtils]: 154: Hoare triple {24362#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:13,349 INFO L290 TraceCheckUtils]: 155: Hoare triple {24362#(<= ~counter~0 16)} ~cond := #in~cond; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:13,349 INFO L290 TraceCheckUtils]: 156: Hoare triple {24362#(<= ~counter~0 16)} assume !(0 == ~cond); {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:13,350 INFO L290 TraceCheckUtils]: 157: Hoare triple {24362#(<= ~counter~0 16)} assume true; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:13,350 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {24362#(<= ~counter~0 16)} {24362#(<= ~counter~0 16)} #63#return; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:13,351 INFO L290 TraceCheckUtils]: 159: Hoare triple {24362#(<= ~counter~0 16)} assume !!(0 != ~r~0); {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:13,351 INFO L290 TraceCheckUtils]: 160: Hoare triple {24362#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:13,352 INFO L290 TraceCheckUtils]: 161: Hoare triple {24362#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:13,352 INFO L290 TraceCheckUtils]: 162: Hoare triple {24390#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:13,353 INFO L272 TraceCheckUtils]: 163: Hoare triple {24390#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:13,353 INFO L290 TraceCheckUtils]: 164: Hoare triple {24390#(<= ~counter~0 17)} ~cond := #in~cond; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:13,353 INFO L290 TraceCheckUtils]: 165: Hoare triple {24390#(<= ~counter~0 17)} assume !(0 == ~cond); {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:13,354 INFO L290 TraceCheckUtils]: 166: Hoare triple {24390#(<= ~counter~0 17)} assume true; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:13,354 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {24390#(<= ~counter~0 17)} {24390#(<= ~counter~0 17)} #63#return; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:13,355 INFO L290 TraceCheckUtils]: 168: Hoare triple {24390#(<= ~counter~0 17)} assume !!(0 != ~r~0); {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:13,355 INFO L290 TraceCheckUtils]: 169: Hoare triple {24390#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:13,356 INFO L290 TraceCheckUtils]: 170: Hoare triple {24390#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:13,356 INFO L290 TraceCheckUtils]: 171: Hoare triple {24418#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:13,357 INFO L272 TraceCheckUtils]: 172: Hoare triple {24418#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:13,357 INFO L290 TraceCheckUtils]: 173: Hoare triple {24418#(<= ~counter~0 18)} ~cond := #in~cond; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:13,357 INFO L290 TraceCheckUtils]: 174: Hoare triple {24418#(<= ~counter~0 18)} assume !(0 == ~cond); {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:13,358 INFO L290 TraceCheckUtils]: 175: Hoare triple {24418#(<= ~counter~0 18)} assume true; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:13,358 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {24418#(<= ~counter~0 18)} {24418#(<= ~counter~0 18)} #63#return; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:13,359 INFO L290 TraceCheckUtils]: 177: Hoare triple {24418#(<= ~counter~0 18)} assume !!(0 != ~r~0); {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:13,359 INFO L290 TraceCheckUtils]: 178: Hoare triple {24418#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:13,360 INFO L290 TraceCheckUtils]: 179: Hoare triple {24418#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24446#(<= |main_#t~post6| 18)} is VALID [2022-04-28 06:04:13,360 INFO L290 TraceCheckUtils]: 180: Hoare triple {24446#(<= |main_#t~post6| 18)} assume !(#t~post6 < 20);havoc #t~post6; {23886#false} is VALID [2022-04-28 06:04:13,360 INFO L272 TraceCheckUtils]: 181: Hoare triple {23886#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23886#false} is VALID [2022-04-28 06:04:13,360 INFO L290 TraceCheckUtils]: 182: Hoare triple {23886#false} ~cond := #in~cond; {23886#false} is VALID [2022-04-28 06:04:13,360 INFO L290 TraceCheckUtils]: 183: Hoare triple {23886#false} assume 0 == ~cond; {23886#false} is VALID [2022-04-28 06:04:13,360 INFO L290 TraceCheckUtils]: 184: Hoare triple {23886#false} assume !false; {23886#false} is VALID [2022-04-28 06:04:13,361 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 36 proven. 1413 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:04:13,362 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:04:14,199 INFO L290 TraceCheckUtils]: 184: Hoare triple {23886#false} assume !false; {23886#false} is VALID [2022-04-28 06:04:14,200 INFO L290 TraceCheckUtils]: 183: Hoare triple {23886#false} assume 0 == ~cond; {23886#false} is VALID [2022-04-28 06:04:14,200 INFO L290 TraceCheckUtils]: 182: Hoare triple {23886#false} ~cond := #in~cond; {23886#false} is VALID [2022-04-28 06:04:14,200 INFO L272 TraceCheckUtils]: 181: Hoare triple {23886#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23886#false} is VALID [2022-04-28 06:04:14,200 INFO L290 TraceCheckUtils]: 180: Hoare triple {24474#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {23886#false} is VALID [2022-04-28 06:04:14,200 INFO L290 TraceCheckUtils]: 179: Hoare triple {24478#(< ~counter~0 20)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24474#(< |main_#t~post6| 20)} is VALID [2022-04-28 06:04:14,201 INFO L290 TraceCheckUtils]: 178: Hoare triple {24478#(< ~counter~0 20)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24478#(< ~counter~0 20)} is VALID [2022-04-28 06:04:14,201 INFO L290 TraceCheckUtils]: 177: Hoare triple {24478#(< ~counter~0 20)} assume !!(0 != ~r~0); {24478#(< ~counter~0 20)} is VALID [2022-04-28 06:04:14,201 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {23885#true} {24478#(< ~counter~0 20)} #63#return; {24478#(< ~counter~0 20)} is VALID [2022-04-28 06:04:14,202 INFO L290 TraceCheckUtils]: 175: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,202 INFO L290 TraceCheckUtils]: 174: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,202 INFO L290 TraceCheckUtils]: 173: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,202 INFO L272 TraceCheckUtils]: 172: Hoare triple {24478#(< ~counter~0 20)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,202 INFO L290 TraceCheckUtils]: 171: Hoare triple {24478#(< ~counter~0 20)} assume !!(#t~post6 < 20);havoc #t~post6; {24478#(< ~counter~0 20)} is VALID [2022-04-28 06:04:14,203 INFO L290 TraceCheckUtils]: 170: Hoare triple {24418#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24478#(< ~counter~0 20)} is VALID [2022-04-28 06:04:14,203 INFO L290 TraceCheckUtils]: 169: Hoare triple {24418#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:14,203 INFO L290 TraceCheckUtils]: 168: Hoare triple {24418#(<= ~counter~0 18)} assume !!(0 != ~r~0); {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:14,204 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {23885#true} {24418#(<= ~counter~0 18)} #63#return; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:14,204 INFO L290 TraceCheckUtils]: 166: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,204 INFO L290 TraceCheckUtils]: 165: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,204 INFO L290 TraceCheckUtils]: 164: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,204 INFO L272 TraceCheckUtils]: 163: Hoare triple {24418#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,204 INFO L290 TraceCheckUtils]: 162: Hoare triple {24418#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:14,205 INFO L290 TraceCheckUtils]: 161: Hoare triple {24390#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24418#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:14,205 INFO L290 TraceCheckUtils]: 160: Hoare triple {24390#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:14,206 INFO L290 TraceCheckUtils]: 159: Hoare triple {24390#(<= ~counter~0 17)} assume !!(0 != ~r~0); {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:14,206 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {23885#true} {24390#(<= ~counter~0 17)} #63#return; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:14,206 INFO L290 TraceCheckUtils]: 157: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,206 INFO L290 TraceCheckUtils]: 156: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,206 INFO L290 TraceCheckUtils]: 155: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,206 INFO L272 TraceCheckUtils]: 154: Hoare triple {24390#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,207 INFO L290 TraceCheckUtils]: 153: Hoare triple {24390#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:14,207 INFO L290 TraceCheckUtils]: 152: Hoare triple {24362#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24390#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:14,207 INFO L290 TraceCheckUtils]: 151: Hoare triple {24362#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:14,208 INFO L290 TraceCheckUtils]: 150: Hoare triple {24362#(<= ~counter~0 16)} assume !!(0 != ~r~0); {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:14,208 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {23885#true} {24362#(<= ~counter~0 16)} #63#return; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:14,208 INFO L290 TraceCheckUtils]: 148: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,208 INFO L290 TraceCheckUtils]: 147: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,208 INFO L290 TraceCheckUtils]: 146: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,208 INFO L272 TraceCheckUtils]: 145: Hoare triple {24362#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,209 INFO L290 TraceCheckUtils]: 144: Hoare triple {24362#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:14,209 INFO L290 TraceCheckUtils]: 143: Hoare triple {24334#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24362#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:14,210 INFO L290 TraceCheckUtils]: 142: Hoare triple {24334#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:14,210 INFO L290 TraceCheckUtils]: 141: Hoare triple {24334#(<= ~counter~0 15)} assume !!(0 != ~r~0); {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:14,210 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {23885#true} {24334#(<= ~counter~0 15)} #63#return; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:14,210 INFO L290 TraceCheckUtils]: 139: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,210 INFO L290 TraceCheckUtils]: 138: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,211 INFO L290 TraceCheckUtils]: 137: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,211 INFO L272 TraceCheckUtils]: 136: Hoare triple {24334#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,211 INFO L290 TraceCheckUtils]: 135: Hoare triple {24334#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:14,211 INFO L290 TraceCheckUtils]: 134: Hoare triple {24306#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24334#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:14,212 INFO L290 TraceCheckUtils]: 133: Hoare triple {24306#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:14,212 INFO L290 TraceCheckUtils]: 132: Hoare triple {24306#(<= ~counter~0 14)} assume !!(0 != ~r~0); {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:14,212 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {23885#true} {24306#(<= ~counter~0 14)} #63#return; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:14,213 INFO L290 TraceCheckUtils]: 130: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,213 INFO L290 TraceCheckUtils]: 129: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,213 INFO L290 TraceCheckUtils]: 128: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,213 INFO L272 TraceCheckUtils]: 127: Hoare triple {24306#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,213 INFO L290 TraceCheckUtils]: 126: Hoare triple {24306#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:14,214 INFO L290 TraceCheckUtils]: 125: Hoare triple {24278#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24306#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:14,214 INFO L290 TraceCheckUtils]: 124: Hoare triple {24278#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:14,214 INFO L290 TraceCheckUtils]: 123: Hoare triple {24278#(<= ~counter~0 13)} assume !!(0 != ~r~0); {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:14,215 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23885#true} {24278#(<= ~counter~0 13)} #63#return; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:14,215 INFO L290 TraceCheckUtils]: 121: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,215 INFO L290 TraceCheckUtils]: 120: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,215 INFO L290 TraceCheckUtils]: 119: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,215 INFO L272 TraceCheckUtils]: 118: Hoare triple {24278#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,215 INFO L290 TraceCheckUtils]: 117: Hoare triple {24278#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:14,216 INFO L290 TraceCheckUtils]: 116: Hoare triple {24250#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24278#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:14,216 INFO L290 TraceCheckUtils]: 115: Hoare triple {24250#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:14,216 INFO L290 TraceCheckUtils]: 114: Hoare triple {24250#(<= ~counter~0 12)} assume !!(0 != ~r~0); {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:14,217 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23885#true} {24250#(<= ~counter~0 12)} #63#return; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:14,217 INFO L290 TraceCheckUtils]: 112: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,217 INFO L290 TraceCheckUtils]: 111: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,217 INFO L290 TraceCheckUtils]: 110: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,217 INFO L272 TraceCheckUtils]: 109: Hoare triple {24250#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,217 INFO L290 TraceCheckUtils]: 108: Hoare triple {24250#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:14,218 INFO L290 TraceCheckUtils]: 107: Hoare triple {24222#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24250#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:14,218 INFO L290 TraceCheckUtils]: 106: Hoare triple {24222#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:14,218 INFO L290 TraceCheckUtils]: 105: Hoare triple {24222#(<= ~counter~0 11)} assume !!(0 != ~r~0); {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:14,219 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {23885#true} {24222#(<= ~counter~0 11)} #63#return; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:14,219 INFO L290 TraceCheckUtils]: 103: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,219 INFO L290 TraceCheckUtils]: 102: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,219 INFO L290 TraceCheckUtils]: 101: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,219 INFO L272 TraceCheckUtils]: 100: Hoare triple {24222#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,219 INFO L290 TraceCheckUtils]: 99: Hoare triple {24222#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:14,220 INFO L290 TraceCheckUtils]: 98: Hoare triple {24194#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24222#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:14,220 INFO L290 TraceCheckUtils]: 97: Hoare triple {24194#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:14,221 INFO L290 TraceCheckUtils]: 96: Hoare triple {24194#(<= ~counter~0 10)} assume !!(0 != ~r~0); {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:14,221 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {23885#true} {24194#(<= ~counter~0 10)} #63#return; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:14,221 INFO L290 TraceCheckUtils]: 94: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,221 INFO L290 TraceCheckUtils]: 93: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,221 INFO L290 TraceCheckUtils]: 92: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,221 INFO L272 TraceCheckUtils]: 91: Hoare triple {24194#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,222 INFO L290 TraceCheckUtils]: 90: Hoare triple {24194#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:14,222 INFO L290 TraceCheckUtils]: 89: Hoare triple {24166#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24194#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:14,222 INFO L290 TraceCheckUtils]: 88: Hoare triple {24166#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:14,223 INFO L290 TraceCheckUtils]: 87: Hoare triple {24166#(<= ~counter~0 9)} assume !!(0 != ~r~0); {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:14,223 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23885#true} {24166#(<= ~counter~0 9)} #63#return; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:14,223 INFO L290 TraceCheckUtils]: 85: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,223 INFO L290 TraceCheckUtils]: 84: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,223 INFO L290 TraceCheckUtils]: 83: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,224 INFO L272 TraceCheckUtils]: 82: Hoare triple {24166#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,224 INFO L290 TraceCheckUtils]: 81: Hoare triple {24166#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:14,224 INFO L290 TraceCheckUtils]: 80: Hoare triple {24138#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24166#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:14,225 INFO L290 TraceCheckUtils]: 79: Hoare triple {24138#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:14,225 INFO L290 TraceCheckUtils]: 78: Hoare triple {24138#(<= ~counter~0 8)} assume !!(0 != ~r~0); {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:14,225 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23885#true} {24138#(<= ~counter~0 8)} #63#return; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:14,225 INFO L290 TraceCheckUtils]: 76: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,225 INFO L290 TraceCheckUtils]: 75: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,226 INFO L290 TraceCheckUtils]: 74: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,226 INFO L272 TraceCheckUtils]: 73: Hoare triple {24138#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,226 INFO L290 TraceCheckUtils]: 72: Hoare triple {24138#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:14,226 INFO L290 TraceCheckUtils]: 71: Hoare triple {24110#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24138#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:14,227 INFO L290 TraceCheckUtils]: 70: Hoare triple {24110#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:14,227 INFO L290 TraceCheckUtils]: 69: Hoare triple {24110#(<= ~counter~0 7)} assume !!(0 != ~r~0); {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:14,227 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {23885#true} {24110#(<= ~counter~0 7)} #63#return; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:14,228 INFO L290 TraceCheckUtils]: 67: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,228 INFO L290 TraceCheckUtils]: 66: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,228 INFO L290 TraceCheckUtils]: 65: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,228 INFO L272 TraceCheckUtils]: 64: Hoare triple {24110#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,228 INFO L290 TraceCheckUtils]: 63: Hoare triple {24110#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:14,229 INFO L290 TraceCheckUtils]: 62: Hoare triple {24082#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24110#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:14,229 INFO L290 TraceCheckUtils]: 61: Hoare triple {24082#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:14,229 INFO L290 TraceCheckUtils]: 60: Hoare triple {24082#(<= ~counter~0 6)} assume !!(0 != ~r~0); {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:14,230 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23885#true} {24082#(<= ~counter~0 6)} #63#return; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:14,230 INFO L290 TraceCheckUtils]: 58: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,230 INFO L290 TraceCheckUtils]: 57: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,230 INFO L290 TraceCheckUtils]: 56: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,230 INFO L272 TraceCheckUtils]: 55: Hoare triple {24082#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,230 INFO L290 TraceCheckUtils]: 54: Hoare triple {24082#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:14,231 INFO L290 TraceCheckUtils]: 53: Hoare triple {24054#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24082#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:14,231 INFO L290 TraceCheckUtils]: 52: Hoare triple {24054#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:14,231 INFO L290 TraceCheckUtils]: 51: Hoare triple {24054#(<= ~counter~0 5)} assume !!(0 != ~r~0); {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:14,232 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23885#true} {24054#(<= ~counter~0 5)} #63#return; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:14,232 INFO L290 TraceCheckUtils]: 49: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,232 INFO L290 TraceCheckUtils]: 48: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,232 INFO L290 TraceCheckUtils]: 47: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,232 INFO L272 TraceCheckUtils]: 46: Hoare triple {24054#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {24054#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:14,233 INFO L290 TraceCheckUtils]: 44: Hoare triple {24026#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24054#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:14,233 INFO L290 TraceCheckUtils]: 43: Hoare triple {24026#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:14,233 INFO L290 TraceCheckUtils]: 42: Hoare triple {24026#(<= ~counter~0 4)} assume !!(0 != ~r~0); {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:14,234 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23885#true} {24026#(<= ~counter~0 4)} #63#return; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:14,234 INFO L290 TraceCheckUtils]: 40: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,234 INFO L272 TraceCheckUtils]: 37: Hoare triple {24026#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,234 INFO L290 TraceCheckUtils]: 36: Hoare triple {24026#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:14,235 INFO L290 TraceCheckUtils]: 35: Hoare triple {23998#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24026#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:14,235 INFO L290 TraceCheckUtils]: 34: Hoare triple {23998#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:14,235 INFO L290 TraceCheckUtils]: 33: Hoare triple {23998#(<= ~counter~0 3)} assume !!(0 != ~r~0); {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:14,236 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23885#true} {23998#(<= ~counter~0 3)} #63#return; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:14,236 INFO L290 TraceCheckUtils]: 31: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,236 INFO L290 TraceCheckUtils]: 30: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,236 INFO L272 TraceCheckUtils]: 28: Hoare triple {23998#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,237 INFO L290 TraceCheckUtils]: 27: Hoare triple {23998#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:14,237 INFO L290 TraceCheckUtils]: 26: Hoare triple {23970#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23998#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:14,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {23970#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:14,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {23970#(<= ~counter~0 2)} assume !!(0 != ~r~0); {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:14,238 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23885#true} {23970#(<= ~counter~0 2)} #63#return; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:14,238 INFO L290 TraceCheckUtils]: 22: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,238 INFO L290 TraceCheckUtils]: 21: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,238 INFO L290 TraceCheckUtils]: 20: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,238 INFO L272 TraceCheckUtils]: 19: Hoare triple {23970#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {23970#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:14,239 INFO L290 TraceCheckUtils]: 17: Hoare triple {23942#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23970#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:14,239 INFO L290 TraceCheckUtils]: 16: Hoare triple {23942#(<= ~counter~0 1)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:14,240 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23885#true} {23942#(<= ~counter~0 1)} #61#return; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:14,240 INFO L290 TraceCheckUtils]: 14: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,240 INFO L290 TraceCheckUtils]: 13: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,240 INFO L290 TraceCheckUtils]: 12: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,240 INFO L272 TraceCheckUtils]: 11: Hoare triple {23942#(<= ~counter~0 1)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,241 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23885#true} {23942#(<= ~counter~0 1)} #59#return; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:14,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-28 06:04:14,241 INFO L290 TraceCheckUtils]: 8: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-28 06:04:14,241 INFO L290 TraceCheckUtils]: 7: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-28 06:04:14,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {23942#(<= ~counter~0 1)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {23885#true} is VALID [2022-04-28 06:04:14,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {23942#(<= ~counter~0 1)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:14,241 INFO L272 TraceCheckUtils]: 4: Hoare triple {23942#(<= ~counter~0 1)} call #t~ret7 := main(); {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:14,242 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23942#(<= ~counter~0 1)} {23885#true} #67#return; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:14,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {23942#(<= ~counter~0 1)} assume true; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:14,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {23885#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; {23942#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:14,243 INFO L272 TraceCheckUtils]: 0: Hoare triple {23885#true} call ULTIMATE.init(); {23885#true} is VALID [2022-04-28 06:04:14,243 INFO L134 CoverageAnalysis]: Checked inductivity of 1453 backedges. 36 proven. 801 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-28 06:04:14,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:04:14,243 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [58735553] [2022-04-28 06:04:14,244 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:04:14,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796012034] [2022-04-28 06:04:14,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796012034] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:04:14,244 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:04:14,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2022-04-28 06:04:14,244 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:04:14,244 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [317680573] [2022-04-28 06:04:14,244 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [317680573] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:04:14,244 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:04:14,244 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-28 06:04:14,244 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537282029] [2022-04-28 06:04:14,244 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:04:14,245 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, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 185 [2022-04-28 06:04:14,245 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:04:14,245 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, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:04:14,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:14,374 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-28 06:04:14,374 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:14,374 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-28 06:04:14,374 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-28 06:04:14,374 INFO L87 Difference]: Start difference. First operand 182 states and 201 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, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:04:15,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:15,174 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2022-04-28 06:04:15,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-28 06:04:15,174 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, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) Word has length 185 [2022-04-28 06:04:15,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:04:15,175 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, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:04:15,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 215 transitions. [2022-04-28 06:04:15,180 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, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:04:15,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 215 transitions. [2022-04-28 06:04:15,186 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 215 transitions. [2022-04-28 06:04:15,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 215 edges. 215 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:15,396 INFO L225 Difference]: With dead ends: 196 [2022-04-28 06:04:15,396 INFO L226 Difference]: Without dead ends: 191 [2022-04-28 06:04:15,398 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=650, Invalid=1072, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 06:04:15,399 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 63 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 125 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-28 06:04:15,399 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 232 Invalid, 125 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-28 06:04:15,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-28 06:04:15,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-04-28 06:04:15,695 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:04:15,695 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 06:04:15,696 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 06:04:15,696 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 06:04:15,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:15,700 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-04-28 06:04:15,700 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-04-28 06:04:15,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:15,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:15,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 191 states. [2022-04-28 06:04:15,702 INFO L87 Difference]: Start difference. First operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) Second operand 191 states. [2022-04-28 06:04:15,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:15,706 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-04-28 06:04:15,706 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-04-28 06:04:15,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:15,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:15,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:04:15,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:04:15,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 145 states have (on average 1.1379310344827587) internal successors, (165), 145 states have internal predecessors, (165), 24 states have call successors, (24), 23 states have call predecessors, (24), 21 states have return successors, (22), 22 states have call predecessors, (22), 22 states have call successors, (22) [2022-04-28 06:04:15,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2022-04-28 06:04:15,712 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 185 [2022-04-28 06:04:15,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:04:15,712 INFO L495 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2022-04-28 06:04:15,713 INFO L496 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, (23), 21 states have call predecessors, (23), 19 states have return successors, (21), 19 states have call predecessors, (21), 20 states have call successors, (21) [2022-04-28 06:04:15,713 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 211 transitions. [2022-04-28 06:04:18,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 210 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:18,020 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-04-28 06:04:18,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-28 06:04:18,021 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:04:18,021 INFO L195 NwaCegarLoop]: trace histogram [20, 20, 19, 19, 19, 19, 19, 19, 19, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:04:18,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-28 06:04:18,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:18,231 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:04:18,231 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:04:18,231 INFO L85 PathProgramCache]: Analyzing trace with hash 1522264156, now seen corresponding path program 37 times [2022-04-28 06:04:18,231 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:18,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [910313542] [2022-04-28 06:04:18,232 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:04:18,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1522264156, now seen corresponding path program 38 times [2022-04-28 06:04:18,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:04:18,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [639188428] [2022-04-28 06:04:18,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:04:18,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:04:18,262 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:04:18,262 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [688379010] [2022-04-28 06:04:18,262 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-28 06:04:18,262 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:18,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:04:18,288 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:04:18,289 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-28 06:04:18,405 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-28 06:04:18,405 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-28 06:04:18,407 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-28 06:04:18,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-28 06:04:18,443 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-28 06:04:19,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {26210#true} call ULTIMATE.init(); {26210#true} is VALID [2022-04-28 06:04:19,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {26210#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; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {26218#(<= ~counter~0 0)} assume true; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,444 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26218#(<= ~counter~0 0)} {26210#true} #67#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {26218#(<= ~counter~0 0)} call #t~ret7 := main(); {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {26218#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,445 INFO L272 TraceCheckUtils]: 6: Hoare triple {26218#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {26218#(<= ~counter~0 0)} ~cond := #in~cond; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {26218#(<= ~counter~0 0)} assume !(0 == ~cond); {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {26218#(<= ~counter~0 0)} assume true; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,447 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26218#(<= ~counter~0 0)} {26218#(<= ~counter~0 0)} #59#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,447 INFO L272 TraceCheckUtils]: 11: Hoare triple {26218#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {26218#(<= ~counter~0 0)} ~cond := #in~cond; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {26218#(<= ~counter~0 0)} assume !(0 == ~cond); {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {26218#(<= ~counter~0 0)} assume true; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,448 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26218#(<= ~counter~0 0)} {26218#(<= ~counter~0 0)} #61#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {26218#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:19,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {26218#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:19,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {26267#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:19,450 INFO L272 TraceCheckUtils]: 19: Hoare triple {26267#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:19,450 INFO L290 TraceCheckUtils]: 20: Hoare triple {26267#(<= ~counter~0 1)} ~cond := #in~cond; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:19,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {26267#(<= ~counter~0 1)} assume !(0 == ~cond); {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:19,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {26267#(<= ~counter~0 1)} assume true; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:19,451 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26267#(<= ~counter~0 1)} {26267#(<= ~counter~0 1)} #63#return; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:19,452 INFO L290 TraceCheckUtils]: 24: Hoare triple {26267#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:19,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {26267#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:19,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {26267#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:19,453 INFO L290 TraceCheckUtils]: 27: Hoare triple {26295#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:19,453 INFO L272 TraceCheckUtils]: 28: Hoare triple {26295#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:19,454 INFO L290 TraceCheckUtils]: 29: Hoare triple {26295#(<= ~counter~0 2)} ~cond := #in~cond; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:19,454 INFO L290 TraceCheckUtils]: 30: Hoare triple {26295#(<= ~counter~0 2)} assume !(0 == ~cond); {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:19,454 INFO L290 TraceCheckUtils]: 31: Hoare triple {26295#(<= ~counter~0 2)} assume true; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:19,455 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26295#(<= ~counter~0 2)} {26295#(<= ~counter~0 2)} #63#return; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:19,455 INFO L290 TraceCheckUtils]: 33: Hoare triple {26295#(<= ~counter~0 2)} assume !!(0 != ~r~0); {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:19,455 INFO L290 TraceCheckUtils]: 34: Hoare triple {26295#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:19,456 INFO L290 TraceCheckUtils]: 35: Hoare triple {26295#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:19,456 INFO L290 TraceCheckUtils]: 36: Hoare triple {26323#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:19,457 INFO L272 TraceCheckUtils]: 37: Hoare triple {26323#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:19,457 INFO L290 TraceCheckUtils]: 38: Hoare triple {26323#(<= ~counter~0 3)} ~cond := #in~cond; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:19,457 INFO L290 TraceCheckUtils]: 39: Hoare triple {26323#(<= ~counter~0 3)} assume !(0 == ~cond); {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:19,457 INFO L290 TraceCheckUtils]: 40: Hoare triple {26323#(<= ~counter~0 3)} assume true; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:19,458 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {26323#(<= ~counter~0 3)} {26323#(<= ~counter~0 3)} #63#return; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:19,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {26323#(<= ~counter~0 3)} assume !!(0 != ~r~0); {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:19,458 INFO L290 TraceCheckUtils]: 43: Hoare triple {26323#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:19,459 INFO L290 TraceCheckUtils]: 44: Hoare triple {26323#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:19,459 INFO L290 TraceCheckUtils]: 45: Hoare triple {26351#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:19,460 INFO L272 TraceCheckUtils]: 46: Hoare triple {26351#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:19,460 INFO L290 TraceCheckUtils]: 47: Hoare triple {26351#(<= ~counter~0 4)} ~cond := #in~cond; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:19,460 INFO L290 TraceCheckUtils]: 48: Hoare triple {26351#(<= ~counter~0 4)} assume !(0 == ~cond); {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:19,461 INFO L290 TraceCheckUtils]: 49: Hoare triple {26351#(<= ~counter~0 4)} assume true; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:19,461 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26351#(<= ~counter~0 4)} {26351#(<= ~counter~0 4)} #63#return; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:19,461 INFO L290 TraceCheckUtils]: 51: Hoare triple {26351#(<= ~counter~0 4)} assume !!(0 != ~r~0); {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:19,462 INFO L290 TraceCheckUtils]: 52: Hoare triple {26351#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:19,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {26351#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:19,462 INFO L290 TraceCheckUtils]: 54: Hoare triple {26379#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:19,463 INFO L272 TraceCheckUtils]: 55: Hoare triple {26379#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:19,463 INFO L290 TraceCheckUtils]: 56: Hoare triple {26379#(<= ~counter~0 5)} ~cond := #in~cond; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:19,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {26379#(<= ~counter~0 5)} assume !(0 == ~cond); {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:19,464 INFO L290 TraceCheckUtils]: 58: Hoare triple {26379#(<= ~counter~0 5)} assume true; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:19,464 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26379#(<= ~counter~0 5)} {26379#(<= ~counter~0 5)} #63#return; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:19,465 INFO L290 TraceCheckUtils]: 60: Hoare triple {26379#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:19,465 INFO L290 TraceCheckUtils]: 61: Hoare triple {26379#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:19,465 INFO L290 TraceCheckUtils]: 62: Hoare triple {26379#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:19,466 INFO L290 TraceCheckUtils]: 63: Hoare triple {26407#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:19,466 INFO L272 TraceCheckUtils]: 64: Hoare triple {26407#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:19,466 INFO L290 TraceCheckUtils]: 65: Hoare triple {26407#(<= ~counter~0 6)} ~cond := #in~cond; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:19,467 INFO L290 TraceCheckUtils]: 66: Hoare triple {26407#(<= ~counter~0 6)} assume !(0 == ~cond); {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:19,467 INFO L290 TraceCheckUtils]: 67: Hoare triple {26407#(<= ~counter~0 6)} assume true; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:19,468 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {26407#(<= ~counter~0 6)} {26407#(<= ~counter~0 6)} #63#return; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:19,468 INFO L290 TraceCheckUtils]: 69: Hoare triple {26407#(<= ~counter~0 6)} assume !!(0 != ~r~0); {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:19,468 INFO L290 TraceCheckUtils]: 70: Hoare triple {26407#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:19,469 INFO L290 TraceCheckUtils]: 71: Hoare triple {26407#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:19,469 INFO L290 TraceCheckUtils]: 72: Hoare triple {26435#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:19,469 INFO L272 TraceCheckUtils]: 73: Hoare triple {26435#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:19,470 INFO L290 TraceCheckUtils]: 74: Hoare triple {26435#(<= ~counter~0 7)} ~cond := #in~cond; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:19,470 INFO L290 TraceCheckUtils]: 75: Hoare triple {26435#(<= ~counter~0 7)} assume !(0 == ~cond); {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:19,470 INFO L290 TraceCheckUtils]: 76: Hoare triple {26435#(<= ~counter~0 7)} assume true; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:19,471 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {26435#(<= ~counter~0 7)} {26435#(<= ~counter~0 7)} #63#return; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:19,471 INFO L290 TraceCheckUtils]: 78: Hoare triple {26435#(<= ~counter~0 7)} assume !!(0 != ~r~0); {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:19,471 INFO L290 TraceCheckUtils]: 79: Hoare triple {26435#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:19,472 INFO L290 TraceCheckUtils]: 80: Hoare triple {26435#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:19,472 INFO L290 TraceCheckUtils]: 81: Hoare triple {26463#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:19,473 INFO L272 TraceCheckUtils]: 82: Hoare triple {26463#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:19,473 INFO L290 TraceCheckUtils]: 83: Hoare triple {26463#(<= ~counter~0 8)} ~cond := #in~cond; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:19,473 INFO L290 TraceCheckUtils]: 84: Hoare triple {26463#(<= ~counter~0 8)} assume !(0 == ~cond); {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:19,473 INFO L290 TraceCheckUtils]: 85: Hoare triple {26463#(<= ~counter~0 8)} assume true; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:19,474 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26463#(<= ~counter~0 8)} {26463#(<= ~counter~0 8)} #63#return; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:19,474 INFO L290 TraceCheckUtils]: 87: Hoare triple {26463#(<= ~counter~0 8)} assume !!(0 != ~r~0); {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:19,475 INFO L290 TraceCheckUtils]: 88: Hoare triple {26463#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:19,475 INFO L290 TraceCheckUtils]: 89: Hoare triple {26463#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:19,475 INFO L290 TraceCheckUtils]: 90: Hoare triple {26491#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:19,476 INFO L272 TraceCheckUtils]: 91: Hoare triple {26491#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:19,476 INFO L290 TraceCheckUtils]: 92: Hoare triple {26491#(<= ~counter~0 9)} ~cond := #in~cond; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:19,476 INFO L290 TraceCheckUtils]: 93: Hoare triple {26491#(<= ~counter~0 9)} assume !(0 == ~cond); {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:19,477 INFO L290 TraceCheckUtils]: 94: Hoare triple {26491#(<= ~counter~0 9)} assume true; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:19,477 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {26491#(<= ~counter~0 9)} {26491#(<= ~counter~0 9)} #63#return; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:19,477 INFO L290 TraceCheckUtils]: 96: Hoare triple {26491#(<= ~counter~0 9)} assume !!(0 != ~r~0); {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:19,478 INFO L290 TraceCheckUtils]: 97: Hoare triple {26491#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:19,478 INFO L290 TraceCheckUtils]: 98: Hoare triple {26491#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:19,479 INFO L290 TraceCheckUtils]: 99: Hoare triple {26519#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:19,479 INFO L272 TraceCheckUtils]: 100: Hoare triple {26519#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:19,479 INFO L290 TraceCheckUtils]: 101: Hoare triple {26519#(<= ~counter~0 10)} ~cond := #in~cond; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:19,480 INFO L290 TraceCheckUtils]: 102: Hoare triple {26519#(<= ~counter~0 10)} assume !(0 == ~cond); {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:19,480 INFO L290 TraceCheckUtils]: 103: Hoare triple {26519#(<= ~counter~0 10)} assume true; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:19,480 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26519#(<= ~counter~0 10)} {26519#(<= ~counter~0 10)} #63#return; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:19,481 INFO L290 TraceCheckUtils]: 105: Hoare triple {26519#(<= ~counter~0 10)} assume !!(0 != ~r~0); {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:19,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {26519#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:19,482 INFO L290 TraceCheckUtils]: 107: Hoare triple {26519#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:19,482 INFO L290 TraceCheckUtils]: 108: Hoare triple {26547#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:19,496 INFO L272 TraceCheckUtils]: 109: Hoare triple {26547#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:19,496 INFO L290 TraceCheckUtils]: 110: Hoare triple {26547#(<= ~counter~0 11)} ~cond := #in~cond; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:19,497 INFO L290 TraceCheckUtils]: 111: Hoare triple {26547#(<= ~counter~0 11)} assume !(0 == ~cond); {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:19,497 INFO L290 TraceCheckUtils]: 112: Hoare triple {26547#(<= ~counter~0 11)} assume true; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:19,498 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {26547#(<= ~counter~0 11)} {26547#(<= ~counter~0 11)} #63#return; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:19,498 INFO L290 TraceCheckUtils]: 114: Hoare triple {26547#(<= ~counter~0 11)} assume !!(0 != ~r~0); {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:19,498 INFO L290 TraceCheckUtils]: 115: Hoare triple {26547#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:19,499 INFO L290 TraceCheckUtils]: 116: Hoare triple {26547#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:19,499 INFO L290 TraceCheckUtils]: 117: Hoare triple {26575#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:19,500 INFO L272 TraceCheckUtils]: 118: Hoare triple {26575#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:19,500 INFO L290 TraceCheckUtils]: 119: Hoare triple {26575#(<= ~counter~0 12)} ~cond := #in~cond; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:19,500 INFO L290 TraceCheckUtils]: 120: Hoare triple {26575#(<= ~counter~0 12)} assume !(0 == ~cond); {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:19,501 INFO L290 TraceCheckUtils]: 121: Hoare triple {26575#(<= ~counter~0 12)} assume true; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:19,501 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26575#(<= ~counter~0 12)} {26575#(<= ~counter~0 12)} #63#return; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:19,502 INFO L290 TraceCheckUtils]: 123: Hoare triple {26575#(<= ~counter~0 12)} assume !!(0 != ~r~0); {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:19,502 INFO L290 TraceCheckUtils]: 124: Hoare triple {26575#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:19,502 INFO L290 TraceCheckUtils]: 125: Hoare triple {26575#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:19,503 INFO L290 TraceCheckUtils]: 126: Hoare triple {26603#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:19,503 INFO L272 TraceCheckUtils]: 127: Hoare triple {26603#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:19,504 INFO L290 TraceCheckUtils]: 128: Hoare triple {26603#(<= ~counter~0 13)} ~cond := #in~cond; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:19,504 INFO L290 TraceCheckUtils]: 129: Hoare triple {26603#(<= ~counter~0 13)} assume !(0 == ~cond); {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:19,504 INFO L290 TraceCheckUtils]: 130: Hoare triple {26603#(<= ~counter~0 13)} assume true; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:19,505 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {26603#(<= ~counter~0 13)} {26603#(<= ~counter~0 13)} #63#return; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:19,505 INFO L290 TraceCheckUtils]: 132: Hoare triple {26603#(<= ~counter~0 13)} assume !!(0 != ~r~0); {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:19,505 INFO L290 TraceCheckUtils]: 133: Hoare triple {26603#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:19,506 INFO L290 TraceCheckUtils]: 134: Hoare triple {26603#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:19,506 INFO L290 TraceCheckUtils]: 135: Hoare triple {26631#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:19,507 INFO L272 TraceCheckUtils]: 136: Hoare triple {26631#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:19,507 INFO L290 TraceCheckUtils]: 137: Hoare triple {26631#(<= ~counter~0 14)} ~cond := #in~cond; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:19,507 INFO L290 TraceCheckUtils]: 138: Hoare triple {26631#(<= ~counter~0 14)} assume !(0 == ~cond); {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:19,507 INFO L290 TraceCheckUtils]: 139: Hoare triple {26631#(<= ~counter~0 14)} assume true; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:19,508 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {26631#(<= ~counter~0 14)} {26631#(<= ~counter~0 14)} #63#return; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:19,508 INFO L290 TraceCheckUtils]: 141: Hoare triple {26631#(<= ~counter~0 14)} assume !!(0 != ~r~0); {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:19,509 INFO L290 TraceCheckUtils]: 142: Hoare triple {26631#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:19,509 INFO L290 TraceCheckUtils]: 143: Hoare triple {26631#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:19,509 INFO L290 TraceCheckUtils]: 144: Hoare triple {26659#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:19,510 INFO L272 TraceCheckUtils]: 145: Hoare triple {26659#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:19,510 INFO L290 TraceCheckUtils]: 146: Hoare triple {26659#(<= ~counter~0 15)} ~cond := #in~cond; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:19,511 INFO L290 TraceCheckUtils]: 147: Hoare triple {26659#(<= ~counter~0 15)} assume !(0 == ~cond); {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:19,511 INFO L290 TraceCheckUtils]: 148: Hoare triple {26659#(<= ~counter~0 15)} assume true; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:19,511 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {26659#(<= ~counter~0 15)} {26659#(<= ~counter~0 15)} #63#return; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:19,512 INFO L290 TraceCheckUtils]: 150: Hoare triple {26659#(<= ~counter~0 15)} assume !!(0 != ~r~0); {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:19,512 INFO L290 TraceCheckUtils]: 151: Hoare triple {26659#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:19,512 INFO L290 TraceCheckUtils]: 152: Hoare triple {26659#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:19,513 INFO L290 TraceCheckUtils]: 153: Hoare triple {26687#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:19,513 INFO L272 TraceCheckUtils]: 154: Hoare triple {26687#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:19,514 INFO L290 TraceCheckUtils]: 155: Hoare triple {26687#(<= ~counter~0 16)} ~cond := #in~cond; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:19,514 INFO L290 TraceCheckUtils]: 156: Hoare triple {26687#(<= ~counter~0 16)} assume !(0 == ~cond); {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:19,514 INFO L290 TraceCheckUtils]: 157: Hoare triple {26687#(<= ~counter~0 16)} assume true; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:19,515 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {26687#(<= ~counter~0 16)} {26687#(<= ~counter~0 16)} #63#return; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:19,515 INFO L290 TraceCheckUtils]: 159: Hoare triple {26687#(<= ~counter~0 16)} assume !!(0 != ~r~0); {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:19,515 INFO L290 TraceCheckUtils]: 160: Hoare triple {26687#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:19,516 INFO L290 TraceCheckUtils]: 161: Hoare triple {26687#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:19,516 INFO L290 TraceCheckUtils]: 162: Hoare triple {26715#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:19,517 INFO L272 TraceCheckUtils]: 163: Hoare triple {26715#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:19,517 INFO L290 TraceCheckUtils]: 164: Hoare triple {26715#(<= ~counter~0 17)} ~cond := #in~cond; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:19,517 INFO L290 TraceCheckUtils]: 165: Hoare triple {26715#(<= ~counter~0 17)} assume !(0 == ~cond); {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:19,517 INFO L290 TraceCheckUtils]: 166: Hoare triple {26715#(<= ~counter~0 17)} assume true; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:19,518 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {26715#(<= ~counter~0 17)} {26715#(<= ~counter~0 17)} #63#return; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:19,518 INFO L290 TraceCheckUtils]: 168: Hoare triple {26715#(<= ~counter~0 17)} assume !!(0 != ~r~0); {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:19,518 INFO L290 TraceCheckUtils]: 169: Hoare triple {26715#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:19,519 INFO L290 TraceCheckUtils]: 170: Hoare triple {26715#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:19,519 INFO L290 TraceCheckUtils]: 171: Hoare triple {26743#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:19,520 INFO L272 TraceCheckUtils]: 172: Hoare triple {26743#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:19,520 INFO L290 TraceCheckUtils]: 173: Hoare triple {26743#(<= ~counter~0 18)} ~cond := #in~cond; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:19,520 INFO L290 TraceCheckUtils]: 174: Hoare triple {26743#(<= ~counter~0 18)} assume !(0 == ~cond); {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:19,521 INFO L290 TraceCheckUtils]: 175: Hoare triple {26743#(<= ~counter~0 18)} assume true; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:19,521 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {26743#(<= ~counter~0 18)} {26743#(<= ~counter~0 18)} #63#return; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:19,521 INFO L290 TraceCheckUtils]: 177: Hoare triple {26743#(<= ~counter~0 18)} assume !!(0 != ~r~0); {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:19,522 INFO L290 TraceCheckUtils]: 178: Hoare triple {26743#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:19,522 INFO L290 TraceCheckUtils]: 179: Hoare triple {26743#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:19,522 INFO L290 TraceCheckUtils]: 180: Hoare triple {26771#(<= ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:19,523 INFO L272 TraceCheckUtils]: 181: Hoare triple {26771#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:19,523 INFO L290 TraceCheckUtils]: 182: Hoare triple {26771#(<= ~counter~0 19)} ~cond := #in~cond; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:19,523 INFO L290 TraceCheckUtils]: 183: Hoare triple {26771#(<= ~counter~0 19)} assume !(0 == ~cond); {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:19,524 INFO L290 TraceCheckUtils]: 184: Hoare triple {26771#(<= ~counter~0 19)} assume true; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:19,524 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26771#(<= ~counter~0 19)} {26771#(<= ~counter~0 19)} #63#return; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:19,524 INFO L290 TraceCheckUtils]: 186: Hoare triple {26771#(<= ~counter~0 19)} assume !!(0 != ~r~0); {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:19,525 INFO L290 TraceCheckUtils]: 187: Hoare triple {26771#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:19,525 INFO L290 TraceCheckUtils]: 188: Hoare triple {26771#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26799#(<= |main_#t~post6| 19)} is VALID [2022-04-28 06:04:19,525 INFO L290 TraceCheckUtils]: 189: Hoare triple {26799#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {26211#false} is VALID [2022-04-28 06:04:19,526 INFO L272 TraceCheckUtils]: 190: Hoare triple {26211#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26211#false} is VALID [2022-04-28 06:04:19,526 INFO L290 TraceCheckUtils]: 191: Hoare triple {26211#false} ~cond := #in~cond; {26211#false} is VALID [2022-04-28 06:04:19,526 INFO L290 TraceCheckUtils]: 192: Hoare triple {26211#false} assume 0 == ~cond; {26211#false} is VALID [2022-04-28 06:04:19,526 INFO L290 TraceCheckUtils]: 193: Hoare triple {26211#false} assume !false; {26211#false} is VALID [2022-04-28 06:04:19,527 INFO L134 CoverageAnalysis]: Checked inductivity of 1619 backedges. 38 proven. 1577 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-28 06:04:19,527 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-28 06:04:20,372 INFO L290 TraceCheckUtils]: 193: Hoare triple {26211#false} assume !false; {26211#false} is VALID [2022-04-28 06:04:20,372 INFO L290 TraceCheckUtils]: 192: Hoare triple {26211#false} assume 0 == ~cond; {26211#false} is VALID [2022-04-28 06:04:20,372 INFO L290 TraceCheckUtils]: 191: Hoare triple {26211#false} ~cond := #in~cond; {26211#false} is VALID [2022-04-28 06:04:20,372 INFO L272 TraceCheckUtils]: 190: Hoare triple {26211#false} call __VERIFIER_assert((if 4 * ~A~0 == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26211#false} is VALID [2022-04-28 06:04:20,373 INFO L290 TraceCheckUtils]: 189: Hoare triple {26799#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {26211#false} is VALID [2022-04-28 06:04:20,373 INFO L290 TraceCheckUtils]: 188: Hoare triple {26771#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26799#(<= |main_#t~post6| 19)} is VALID [2022-04-28 06:04:20,374 INFO L290 TraceCheckUtils]: 187: Hoare triple {26771#(<= ~counter~0 19)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:20,374 INFO L290 TraceCheckUtils]: 186: Hoare triple {26771#(<= ~counter~0 19)} assume !!(0 != ~r~0); {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:20,375 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26210#true} {26771#(<= ~counter~0 19)} #63#return; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:20,375 INFO L290 TraceCheckUtils]: 184: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,375 INFO L290 TraceCheckUtils]: 183: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,375 INFO L290 TraceCheckUtils]: 182: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,375 INFO L272 TraceCheckUtils]: 181: Hoare triple {26771#(<= ~counter~0 19)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,375 INFO L290 TraceCheckUtils]: 180: Hoare triple {26771#(<= ~counter~0 19)} assume !!(#t~post6 < 20);havoc #t~post6; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:20,376 INFO L290 TraceCheckUtils]: 179: Hoare triple {26743#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26771#(<= ~counter~0 19)} is VALID [2022-04-28 06:04:20,377 INFO L290 TraceCheckUtils]: 178: Hoare triple {26743#(<= ~counter~0 18)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:20,377 INFO L290 TraceCheckUtils]: 177: Hoare triple {26743#(<= ~counter~0 18)} assume !!(0 != ~r~0); {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:20,377 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {26210#true} {26743#(<= ~counter~0 18)} #63#return; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:20,377 INFO L290 TraceCheckUtils]: 175: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,378 INFO L290 TraceCheckUtils]: 174: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,378 INFO L290 TraceCheckUtils]: 173: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,378 INFO L272 TraceCheckUtils]: 172: Hoare triple {26743#(<= ~counter~0 18)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,378 INFO L290 TraceCheckUtils]: 171: Hoare triple {26743#(<= ~counter~0 18)} assume !!(#t~post6 < 20);havoc #t~post6; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:20,378 INFO L290 TraceCheckUtils]: 170: Hoare triple {26715#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26743#(<= ~counter~0 18)} is VALID [2022-04-28 06:04:20,379 INFO L290 TraceCheckUtils]: 169: Hoare triple {26715#(<= ~counter~0 17)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:20,379 INFO L290 TraceCheckUtils]: 168: Hoare triple {26715#(<= ~counter~0 17)} assume !!(0 != ~r~0); {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:20,380 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {26210#true} {26715#(<= ~counter~0 17)} #63#return; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:20,380 INFO L290 TraceCheckUtils]: 166: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,380 INFO L290 TraceCheckUtils]: 165: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,380 INFO L290 TraceCheckUtils]: 164: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,380 INFO L272 TraceCheckUtils]: 163: Hoare triple {26715#(<= ~counter~0 17)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,380 INFO L290 TraceCheckUtils]: 162: Hoare triple {26715#(<= ~counter~0 17)} assume !!(#t~post6 < 20);havoc #t~post6; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:20,381 INFO L290 TraceCheckUtils]: 161: Hoare triple {26687#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26715#(<= ~counter~0 17)} is VALID [2022-04-28 06:04:20,381 INFO L290 TraceCheckUtils]: 160: Hoare triple {26687#(<= ~counter~0 16)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:20,381 INFO L290 TraceCheckUtils]: 159: Hoare triple {26687#(<= ~counter~0 16)} assume !!(0 != ~r~0); {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:20,382 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {26210#true} {26687#(<= ~counter~0 16)} #63#return; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:20,382 INFO L290 TraceCheckUtils]: 157: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,382 INFO L290 TraceCheckUtils]: 156: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,382 INFO L290 TraceCheckUtils]: 155: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,382 INFO L272 TraceCheckUtils]: 154: Hoare triple {26687#(<= ~counter~0 16)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,382 INFO L290 TraceCheckUtils]: 153: Hoare triple {26687#(<= ~counter~0 16)} assume !!(#t~post6 < 20);havoc #t~post6; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:20,383 INFO L290 TraceCheckUtils]: 152: Hoare triple {26659#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26687#(<= ~counter~0 16)} is VALID [2022-04-28 06:04:20,383 INFO L290 TraceCheckUtils]: 151: Hoare triple {26659#(<= ~counter~0 15)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:20,383 INFO L290 TraceCheckUtils]: 150: Hoare triple {26659#(<= ~counter~0 15)} assume !!(0 != ~r~0); {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:20,384 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {26210#true} {26659#(<= ~counter~0 15)} #63#return; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:20,384 INFO L290 TraceCheckUtils]: 148: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,384 INFO L290 TraceCheckUtils]: 147: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,384 INFO L290 TraceCheckUtils]: 146: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,384 INFO L272 TraceCheckUtils]: 145: Hoare triple {26659#(<= ~counter~0 15)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,384 INFO L290 TraceCheckUtils]: 144: Hoare triple {26659#(<= ~counter~0 15)} assume !!(#t~post6 < 20);havoc #t~post6; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:20,385 INFO L290 TraceCheckUtils]: 143: Hoare triple {26631#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26659#(<= ~counter~0 15)} is VALID [2022-04-28 06:04:20,385 INFO L290 TraceCheckUtils]: 142: Hoare triple {26631#(<= ~counter~0 14)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:20,385 INFO L290 TraceCheckUtils]: 141: Hoare triple {26631#(<= ~counter~0 14)} assume !!(0 != ~r~0); {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:20,386 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {26210#true} {26631#(<= ~counter~0 14)} #63#return; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:20,386 INFO L290 TraceCheckUtils]: 139: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,386 INFO L290 TraceCheckUtils]: 138: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,386 INFO L290 TraceCheckUtils]: 137: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,386 INFO L272 TraceCheckUtils]: 136: Hoare triple {26631#(<= ~counter~0 14)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,386 INFO L290 TraceCheckUtils]: 135: Hoare triple {26631#(<= ~counter~0 14)} assume !!(#t~post6 < 20);havoc #t~post6; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:20,387 INFO L290 TraceCheckUtils]: 134: Hoare triple {26603#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26631#(<= ~counter~0 14)} is VALID [2022-04-28 06:04:20,387 INFO L290 TraceCheckUtils]: 133: Hoare triple {26603#(<= ~counter~0 13)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:20,387 INFO L290 TraceCheckUtils]: 132: Hoare triple {26603#(<= ~counter~0 13)} assume !!(0 != ~r~0); {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:20,388 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {26210#true} {26603#(<= ~counter~0 13)} #63#return; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:20,388 INFO L290 TraceCheckUtils]: 130: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,388 INFO L290 TraceCheckUtils]: 129: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,388 INFO L290 TraceCheckUtils]: 128: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,388 INFO L272 TraceCheckUtils]: 127: Hoare triple {26603#(<= ~counter~0 13)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,389 INFO L290 TraceCheckUtils]: 126: Hoare triple {26603#(<= ~counter~0 13)} assume !!(#t~post6 < 20);havoc #t~post6; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:20,389 INFO L290 TraceCheckUtils]: 125: Hoare triple {26575#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26603#(<= ~counter~0 13)} is VALID [2022-04-28 06:04:20,389 INFO L290 TraceCheckUtils]: 124: Hoare triple {26575#(<= ~counter~0 12)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:20,390 INFO L290 TraceCheckUtils]: 123: Hoare triple {26575#(<= ~counter~0 12)} assume !!(0 != ~r~0); {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:20,390 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26210#true} {26575#(<= ~counter~0 12)} #63#return; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:20,390 INFO L290 TraceCheckUtils]: 121: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,390 INFO L290 TraceCheckUtils]: 120: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,390 INFO L290 TraceCheckUtils]: 119: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,390 INFO L272 TraceCheckUtils]: 118: Hoare triple {26575#(<= ~counter~0 12)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,391 INFO L290 TraceCheckUtils]: 117: Hoare triple {26575#(<= ~counter~0 12)} assume !!(#t~post6 < 20);havoc #t~post6; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:20,391 INFO L290 TraceCheckUtils]: 116: Hoare triple {26547#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26575#(<= ~counter~0 12)} is VALID [2022-04-28 06:04:20,391 INFO L290 TraceCheckUtils]: 115: Hoare triple {26547#(<= ~counter~0 11)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:20,392 INFO L290 TraceCheckUtils]: 114: Hoare triple {26547#(<= ~counter~0 11)} assume !!(0 != ~r~0); {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:20,392 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {26210#true} {26547#(<= ~counter~0 11)} #63#return; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:20,392 INFO L290 TraceCheckUtils]: 112: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,392 INFO L290 TraceCheckUtils]: 111: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,392 INFO L290 TraceCheckUtils]: 110: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,393 INFO L272 TraceCheckUtils]: 109: Hoare triple {26547#(<= ~counter~0 11)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,393 INFO L290 TraceCheckUtils]: 108: Hoare triple {26547#(<= ~counter~0 11)} assume !!(#t~post6 < 20);havoc #t~post6; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:20,393 INFO L290 TraceCheckUtils]: 107: Hoare triple {26519#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26547#(<= ~counter~0 11)} is VALID [2022-04-28 06:04:20,394 INFO L290 TraceCheckUtils]: 106: Hoare triple {26519#(<= ~counter~0 10)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:20,394 INFO L290 TraceCheckUtils]: 105: Hoare triple {26519#(<= ~counter~0 10)} assume !!(0 != ~r~0); {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:20,394 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26210#true} {26519#(<= ~counter~0 10)} #63#return; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:20,394 INFO L290 TraceCheckUtils]: 103: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,395 INFO L290 TraceCheckUtils]: 102: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,395 INFO L290 TraceCheckUtils]: 101: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,395 INFO L272 TraceCheckUtils]: 100: Hoare triple {26519#(<= ~counter~0 10)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,395 INFO L290 TraceCheckUtils]: 99: Hoare triple {26519#(<= ~counter~0 10)} assume !!(#t~post6 < 20);havoc #t~post6; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:20,395 INFO L290 TraceCheckUtils]: 98: Hoare triple {26491#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26519#(<= ~counter~0 10)} is VALID [2022-04-28 06:04:20,396 INFO L290 TraceCheckUtils]: 97: Hoare triple {26491#(<= ~counter~0 9)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:20,396 INFO L290 TraceCheckUtils]: 96: Hoare triple {26491#(<= ~counter~0 9)} assume !!(0 != ~r~0); {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:20,396 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {26210#true} {26491#(<= ~counter~0 9)} #63#return; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:20,397 INFO L290 TraceCheckUtils]: 94: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,397 INFO L290 TraceCheckUtils]: 93: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,397 INFO L290 TraceCheckUtils]: 92: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,397 INFO L272 TraceCheckUtils]: 91: Hoare triple {26491#(<= ~counter~0 9)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,397 INFO L290 TraceCheckUtils]: 90: Hoare triple {26491#(<= ~counter~0 9)} assume !!(#t~post6 < 20);havoc #t~post6; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:20,398 INFO L290 TraceCheckUtils]: 89: Hoare triple {26463#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26491#(<= ~counter~0 9)} is VALID [2022-04-28 06:04:20,398 INFO L290 TraceCheckUtils]: 88: Hoare triple {26463#(<= ~counter~0 8)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:20,398 INFO L290 TraceCheckUtils]: 87: Hoare triple {26463#(<= ~counter~0 8)} assume !!(0 != ~r~0); {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:20,399 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26210#true} {26463#(<= ~counter~0 8)} #63#return; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:20,399 INFO L290 TraceCheckUtils]: 85: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,399 INFO L290 TraceCheckUtils]: 84: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,399 INFO L290 TraceCheckUtils]: 83: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,399 INFO L272 TraceCheckUtils]: 82: Hoare triple {26463#(<= ~counter~0 8)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,399 INFO L290 TraceCheckUtils]: 81: Hoare triple {26463#(<= ~counter~0 8)} assume !!(#t~post6 < 20);havoc #t~post6; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:20,400 INFO L290 TraceCheckUtils]: 80: Hoare triple {26435#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26463#(<= ~counter~0 8)} is VALID [2022-04-28 06:04:20,400 INFO L290 TraceCheckUtils]: 79: Hoare triple {26435#(<= ~counter~0 7)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:20,400 INFO L290 TraceCheckUtils]: 78: Hoare triple {26435#(<= ~counter~0 7)} assume !!(0 != ~r~0); {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:20,401 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {26210#true} {26435#(<= ~counter~0 7)} #63#return; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:20,401 INFO L290 TraceCheckUtils]: 76: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,401 INFO L290 TraceCheckUtils]: 75: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,401 INFO L290 TraceCheckUtils]: 74: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,401 INFO L272 TraceCheckUtils]: 73: Hoare triple {26435#(<= ~counter~0 7)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,401 INFO L290 TraceCheckUtils]: 72: Hoare triple {26435#(<= ~counter~0 7)} assume !!(#t~post6 < 20);havoc #t~post6; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:20,402 INFO L290 TraceCheckUtils]: 71: Hoare triple {26407#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26435#(<= ~counter~0 7)} is VALID [2022-04-28 06:04:20,402 INFO L290 TraceCheckUtils]: 70: Hoare triple {26407#(<= ~counter~0 6)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:20,402 INFO L290 TraceCheckUtils]: 69: Hoare triple {26407#(<= ~counter~0 6)} assume !!(0 != ~r~0); {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:20,403 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {26210#true} {26407#(<= ~counter~0 6)} #63#return; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:20,403 INFO L290 TraceCheckUtils]: 67: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,403 INFO L290 TraceCheckUtils]: 66: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,403 INFO L290 TraceCheckUtils]: 65: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,403 INFO L272 TraceCheckUtils]: 64: Hoare triple {26407#(<= ~counter~0 6)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,403 INFO L290 TraceCheckUtils]: 63: Hoare triple {26407#(<= ~counter~0 6)} assume !!(#t~post6 < 20);havoc #t~post6; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:20,404 INFO L290 TraceCheckUtils]: 62: Hoare triple {26379#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26407#(<= ~counter~0 6)} is VALID [2022-04-28 06:04:20,404 INFO L290 TraceCheckUtils]: 61: Hoare triple {26379#(<= ~counter~0 5)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:20,404 INFO L290 TraceCheckUtils]: 60: Hoare triple {26379#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:20,405 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26210#true} {26379#(<= ~counter~0 5)} #63#return; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:20,405 INFO L290 TraceCheckUtils]: 58: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,405 INFO L290 TraceCheckUtils]: 57: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,405 INFO L290 TraceCheckUtils]: 56: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,405 INFO L272 TraceCheckUtils]: 55: Hoare triple {26379#(<= ~counter~0 5)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,406 INFO L290 TraceCheckUtils]: 54: Hoare triple {26379#(<= ~counter~0 5)} assume !!(#t~post6 < 20);havoc #t~post6; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:20,406 INFO L290 TraceCheckUtils]: 53: Hoare triple {26351#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26379#(<= ~counter~0 5)} is VALID [2022-04-28 06:04:20,406 INFO L290 TraceCheckUtils]: 52: Hoare triple {26351#(<= ~counter~0 4)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:20,407 INFO L290 TraceCheckUtils]: 51: Hoare triple {26351#(<= ~counter~0 4)} assume !!(0 != ~r~0); {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:20,407 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26210#true} {26351#(<= ~counter~0 4)} #63#return; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:20,407 INFO L290 TraceCheckUtils]: 49: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,407 INFO L290 TraceCheckUtils]: 48: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,407 INFO L290 TraceCheckUtils]: 47: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,407 INFO L272 TraceCheckUtils]: 46: Hoare triple {26351#(<= ~counter~0 4)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,408 INFO L290 TraceCheckUtils]: 45: Hoare triple {26351#(<= ~counter~0 4)} assume !!(#t~post6 < 20);havoc #t~post6; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:20,408 INFO L290 TraceCheckUtils]: 44: Hoare triple {26323#(<= ~counter~0 3)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26351#(<= ~counter~0 4)} is VALID [2022-04-28 06:04:20,408 INFO L290 TraceCheckUtils]: 43: Hoare triple {26323#(<= ~counter~0 3)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:20,409 INFO L290 TraceCheckUtils]: 42: Hoare triple {26323#(<= ~counter~0 3)} assume !!(0 != ~r~0); {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:20,409 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {26210#true} {26323#(<= ~counter~0 3)} #63#return; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:20,409 INFO L290 TraceCheckUtils]: 40: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,409 INFO L290 TraceCheckUtils]: 39: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,409 INFO L290 TraceCheckUtils]: 38: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,409 INFO L272 TraceCheckUtils]: 37: Hoare triple {26323#(<= ~counter~0 3)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,410 INFO L290 TraceCheckUtils]: 36: Hoare triple {26323#(<= ~counter~0 3)} assume !!(#t~post6 < 20);havoc #t~post6; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:20,410 INFO L290 TraceCheckUtils]: 35: Hoare triple {26295#(<= ~counter~0 2)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26323#(<= ~counter~0 3)} is VALID [2022-04-28 06:04:20,411 INFO L290 TraceCheckUtils]: 34: Hoare triple {26295#(<= ~counter~0 2)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:20,411 INFO L290 TraceCheckUtils]: 33: Hoare triple {26295#(<= ~counter~0 2)} assume !!(0 != ~r~0); {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:20,411 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26210#true} {26295#(<= ~counter~0 2)} #63#return; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:20,411 INFO L290 TraceCheckUtils]: 31: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,411 INFO L290 TraceCheckUtils]: 30: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,412 INFO L290 TraceCheckUtils]: 29: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,412 INFO L272 TraceCheckUtils]: 28: Hoare triple {26295#(<= ~counter~0 2)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,412 INFO L290 TraceCheckUtils]: 27: Hoare triple {26295#(<= ~counter~0 2)} assume !!(#t~post6 < 20);havoc #t~post6; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:20,412 INFO L290 TraceCheckUtils]: 26: Hoare triple {26267#(<= ~counter~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26295#(<= ~counter~0 2)} is VALID [2022-04-28 06:04:20,413 INFO L290 TraceCheckUtils]: 25: Hoare triple {26267#(<= ~counter~0 1)} assume ~r~0 > 0;~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:20,413 INFO L290 TraceCheckUtils]: 24: Hoare triple {26267#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:20,413 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26210#true} {26267#(<= ~counter~0 1)} #63#return; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:20,414 INFO L290 TraceCheckUtils]: 22: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,414 INFO L290 TraceCheckUtils]: 21: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,414 INFO L290 TraceCheckUtils]: 20: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,414 INFO L272 TraceCheckUtils]: 19: Hoare triple {26267#(<= ~counter~0 1)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,414 INFO L290 TraceCheckUtils]: 18: Hoare triple {26267#(<= ~counter~0 1)} assume !!(#t~post6 < 20);havoc #t~post6; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:20,414 INFO L290 TraceCheckUtils]: 17: Hoare triple {26218#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26267#(<= ~counter~0 1)} is VALID [2022-04-28 06:04:20,415 INFO L290 TraceCheckUtils]: 16: Hoare triple {26218#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:20,415 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26210#true} {26218#(<= ~counter~0 0)} #61#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:20,415 INFO L290 TraceCheckUtils]: 14: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,415 INFO L272 TraceCheckUtils]: 11: Hoare triple {26218#(<= ~counter~0 0)} call assume_abort_if_not((if 1 == (if ~A~0 < 0 && 0 != ~A~0 % 2 then ~A~0 % 2 - 2 else ~A~0 % 2) then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,416 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26210#true} {26218#(<= ~counter~0 0)} #59#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:20,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-28 06:04:20,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-28 06:04:20,416 INFO L290 TraceCheckUtils]: 7: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-28 06:04:20,416 INFO L272 TraceCheckUtils]: 6: Hoare triple {26218#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26210#true} is VALID [2022-04-28 06:04:20,416 INFO L290 TraceCheckUtils]: 5: Hoare triple {26218#(<= ~counter~0 0)} havoc ~A~0;havoc ~R~0;havoc ~u~0;havoc ~v~0;havoc ~r~0;assume -2147483648 <= #t~nondet4 && #t~nondet4 <= 2147483647;~A~0 := #t~nondet4;havoc #t~nondet4;assume -2147483648 <= #t~nondet5 && #t~nondet5 <= 2147483647;~R~0 := #t~nondet5;havoc #t~nondet5; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:20,417 INFO L272 TraceCheckUtils]: 4: Hoare triple {26218#(<= ~counter~0 0)} call #t~ret7 := main(); {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:20,417 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26218#(<= ~counter~0 0)} {26210#true} #67#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:20,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {26218#(<= ~counter~0 0)} assume true; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:20,418 INFO L290 TraceCheckUtils]: 1: Hoare triple {26210#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; {26218#(<= ~counter~0 0)} is VALID [2022-04-28 06:04:20,418 INFO L272 TraceCheckUtils]: 0: Hoare triple {26210#true} call ULTIMATE.init(); {26210#true} is VALID [2022-04-28 06:04:20,419 INFO L134 CoverageAnalysis]: Checked inductivity of 1619 backedges. 38 proven. 893 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-04-28 06:04:20,419 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-28 06:04:20,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [639188428] [2022-04-28 06:04:20,419 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-28 06:04:20,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [688379010] [2022-04-28 06:04:20,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [688379010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-28 06:04:20,419 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-28 06:04:20,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2022-04-28 06:04:20,419 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-28 06:04:20,419 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [910313542] [2022-04-28 06:04:20,419 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [910313542] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-28 06:04:20,419 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-28 06:04:20,419 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-28 06:04:20,420 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2123713554] [2022-04-28 06:04:20,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-28 06:04:20,420 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, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 194 [2022-04-28 06:04:20,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-28 06:04:20,421 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, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 06:04:20,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:20,578 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-28 06:04:20,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:20,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-28 06:04:20,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2022-04-28 06:04:20,579 INFO L87 Difference]: Start difference. First operand 191 states and 211 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, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 06:04:21,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:21,609 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2022-04-28 06:04:21,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-28 06:04:21,609 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, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) Word has length 194 [2022-04-28 06:04:21,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-28 06:04:21,610 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, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 06:04:21,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 225 transitions. [2022-04-28 06:04:21,615 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, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 06:04:21,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 225 transitions. [2022-04-28 06:04:21,621 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 225 transitions. [2022-04-28 06:04:21,821 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-28 06:04:21,824 INFO L225 Difference]: With dead ends: 205 [2022-04-28 06:04:21,825 INFO L226 Difference]: Without dead ends: 200 [2022-04-28 06:04:21,825 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=651, Invalid=1071, Unknown=0, NotChecked=0, Total=1722 [2022-04-28 06:04:21,826 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 50 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 264 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-28 06:04:21,826 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 264 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-28 06:04:21,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-28 06:04:22,108 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-28 06:04:22,108 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-28 06:04:22,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 06:04:22,109 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 06:04:22,109 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 06:04:22,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:22,113 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-28 06:04:22,113 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-28 06:04:22,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:22,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:22,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-28 06:04:22,114 INFO L87 Difference]: Start difference. First operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) Second operand 200 states. [2022-04-28 06:04:22,118 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-28 06:04:22,118 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-28 06:04:22,118 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-28 06:04:22,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-28 06:04:22,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-28 06:04:22,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-28 06:04:22,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-28 06:04:22,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 152 states have (on average 1.138157894736842) internal successors, (173), 152 states have internal predecessors, (173), 25 states have call successors, (25), 24 states have call predecessors, (25), 22 states have return successors, (23), 23 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-28 06:04:22,122 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-04-28 06:04:22,122 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 194 [2022-04-28 06:04:22,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-28 06:04:22,123 INFO L495 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-04-28 06:04:22,123 INFO L496 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, (24), 22 states have call predecessors, (24), 20 states have return successors, (22), 20 states have call predecessors, (22), 21 states have call successors, (22) [2022-04-28 06:04:22,123 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 221 transitions. [2022-04-28 06:04:24,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 220 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-28 06:04:24,418 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-28 06:04:24,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-04-28 06:04:24,419 INFO L187 NwaCegarLoop]: Found error trace [2022-04-28 06:04:24,419 INFO L195 NwaCegarLoop]: trace histogram [21, 21, 20, 20, 20, 20, 20, 20, 20, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-28 06:04:24,427 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-28 06:04:24,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:24,625 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-28 06:04:24,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-28 06:04:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1934081686, now seen corresponding path program 39 times [2022-04-28 06:04:24,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-28 06:04:24,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1479148804] [2022-04-28 06:04:24,625 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-28 06:04:24,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1934081686, now seen corresponding path program 40 times [2022-04-28 06:04:24,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-28 06:04:24,626 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1255383035] [2022-04-28 06:04:24,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-28 06:04:24,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-28 06:04:24,644 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-28 06:04:24,644 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [744761381] [2022-04-28 06:04:24,644 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-28 06:04:24,644 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:24,645 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-28 06:04:24,645 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-28 06:04:24,646 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-28 06:04:24,821 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-28 06:04:24,822 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-28 06:04:24,822 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-28 06:04:24,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-28 06:04:25,078 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-28 06:04:25,079 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-28 06:04:25,079 INFO L271 BasicCegarLoop]: Counterexample is feasible [2022-04-28 06:04:25,082 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-28 06:04:25,096 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Forceful destruction successful, exit code 0 [2022-04-28 06:04:25,290 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-28 06:04:25,293 INFO L356 BasicCegarLoop]: Path program histogram: [40, 2, 2, 2, 2] [2022-04-28 06:04:25,296 INFO L176 ceAbstractionStarter]: Computing trace abstraction results [2022-04-28 06:04:25,319 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-28 06:04:25,319 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-28 06:04:25,319 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 06:04:25,319 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-28 06:04:25,319 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-28 06:04:25,319 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-28 06:04:25,319 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 06:04:25,320 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 06:04:25,321 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-28 06:04:25,322 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-28 06:04:25,322 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 06:04:25,322 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-28 06:04:25,322 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-28 06:04:25,322 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-04-28 06:04:25,323 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.04 06:04:25 BoogieIcfgContainer [2022-04-28 06:04:25,323 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-28 06:04:25,324 INFO L158 Benchmark]: Toolchain (without parser) took 127449.24ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 145.6MB in the beginning and 172.7MB in the end (delta: -27.1MB). Peak memory consumption was 12.7MB. Max. memory is 8.0GB. [2022-04-28 06:04:25,324 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory was 162.4MB in the beginning and 162.3MB in the end (delta: 78.3kB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-28 06:04:25,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 265.96ms. Allocated memory is still 197.1MB. Free memory was 145.4MB in the beginning and 172.4MB in the end (delta: -27.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. [2022-04-28 06:04:25,325 INFO L158 Benchmark]: Boogie Preprocessor took 40.72ms. Allocated memory is still 197.1MB. Free memory was 172.4MB in the beginning and 170.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-04-28 06:04:25,325 INFO L158 Benchmark]: RCFGBuilder took 326.52ms. Allocated memory is still 197.1MB. Free memory was 170.7MB in the beginning and 159.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-28 06:04:25,325 INFO L158 Benchmark]: TraceAbstraction took 126809.55ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 158.8MB in the beginning and 172.7MB in the end (delta: -13.8MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. [2022-04-28 06:04:25,326 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 197.1MB. Free memory was 162.4MB in the beginning and 162.3MB in the end (delta: 78.3kB). There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 265.96ms. Allocated memory is still 197.1MB. Free memory was 145.4MB in the beginning and 172.4MB in the end (delta: -27.0MB). Peak memory consumption was 10.5MB. Max. memory is 8.0GB. * Boogie Preprocessor took 40.72ms. Allocated memory is still 197.1MB. Free memory was 172.4MB in the beginning and 170.9MB in the end (delta: 1.4MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * RCFGBuilder took 326.52ms. Allocated memory is still 197.1MB. Free memory was 170.7MB in the beginning and 159.6MB in the end (delta: 11.1MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 126809.55ms. Allocated memory was 197.1MB in the beginning and 237.0MB in the end (delta: 39.8MB). Free memory was 158.8MB in the beginning and 172.7MB in the end (delta: -13.8MB). Peak memory consumption was 26.3MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - CounterExampleResult [Line: 14]: a call to reach_error is reachable a call to reach_error is reachable We found a FailurePath: [L19] int counter = 0; [L21] int A, R; [L22] long long u, v, r; [L23] A = __VERIFIER_nondet_int() [L24] R = __VERIFIER_nondet_int() [L26] CALL assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) [L9] COND FALSE !(!cond) [L26] RET assume_abort_if_not(((long long) R - 1) * ((long long) R - 1) < A) [L28] CALL assume_abort_if_not(A % 2 == 1) [L9] COND FALSE !(!cond) [L28] RET assume_abort_if_not(A % 2 == 1) [L30] u = ((long long) 2 * R) + 1 [L31] v = 1 [L32] r = ((long long) R * R) - A [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND TRUE counter++<20 [L35] CALL __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L12] COND FALSE !(!(cond)) [L35] RET __VERIFIER_assert(4*(A+r) == u*u - v*v - 2*u + 2*v) [L36] COND FALSE !(!(r != 0)) [L38] COND TRUE r > 0 [L39] r = r - v [L40] v = v + 2 [L34] EXPR counter++ [L34] COND FALSE !(counter++<20) [L48] CALL __VERIFIER_assert(((long long) 4*A) == u*u - v*v - 2*u + 2*v) [L12] COND TRUE !(cond) [L14] reach_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 6 procedures, 33 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 126.7s, OverallIterations: 24, TraceHistogramMax: 21, PathProgramHistogramMax: 40, EmptinessCheckTime: 0.0s, AutomataDifference: 23.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 739 SdHoareTripleChecker+Valid, 5.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 738 mSDsluCounter, 3313 SdHoareTripleChecker+Invalid, 5.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2523 mSDsCounter, 343 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1303 IncrementalHoareTripleChecker+Invalid, 1646 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 343 mSolverCounterUnsat, 790 mSDtfsCounter, 1303 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 4591 GetRequests, 4028 SyntacticMatches, 11 SemanticMatches, 552 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1674 ImplicationChecksByTransitivity, 4.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=23, InterpolantAutomatonStates: 475, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 3.1s AutomataMinimizationTime, 23 MinimizatonAttempts, 10 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: No data available, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! [2022-04-28 06:04:25,352 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request...