/usr/bin/java -ea -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerC.xml -s ../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf -i ../../../trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-34549b5 [2022-04-08 12:40:50,065 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-08 12:40:50,067 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-08 12:40:50,098 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-08 12:40:50,099 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-08 12:40:50,100 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-08 12:40:50,102 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-08 12:40:50,103 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-08 12:40:50,105 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-08 12:40:50,108 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-08 12:40:50,108 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-08 12:40:50,109 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-08 12:40:50,109 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-08 12:40:50,111 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-08 12:40:50,112 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-08 12:40:50,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-08 12:40:50,114 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-08 12:40:50,114 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-08 12:40:50,116 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-08 12:40:50,119 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-08 12:40:50,121 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-08 12:40:50,121 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-08 12:40:50,122 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-08 12:40:50,122 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-08 12:40:50,123 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-08 12:40:50,127 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-08 12:40:50,127 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-08 12:40:50,128 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-08 12:40:50,128 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-08 12:40:50,128 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-08 12:40:50,129 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-08 12:40:50,129 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-08 12:40:50,130 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-08 12:40:50,131 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-08 12:40:50,131 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-08 12:40:50,131 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-08 12:40:50,132 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-08 12:40:50,132 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-08 12:40:50,132 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-08 12:40:50,132 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-08 12:40:50,133 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-08 12:40:50,134 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-08 12:40:50,134 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-08 12:40:50,142 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-08 12:40:50,142 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-08 12:40:50,143 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-08 12:40:50,143 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-08 12:40:50,143 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-08 12:40:50,143 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-08 12:40:50,143 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-08 12:40:50,143 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-08 12:40:50,143 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-08 12:40:50,144 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-08 12:40:50,144 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-08 12:40:50,144 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-08 12:40:50,144 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-08 12:40:50,144 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-08 12:40:50,144 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-08 12:40:50,144 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:40:50,144 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-08 12:40:50,145 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-08 12:40:50,145 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-08 12:40:50,145 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-08 12:40:50,145 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-08 12:40:50,145 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-08 12:40:50,145 INFO L138 SettingsManager]: * Use separate solver for trace checks=false WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-04-08 12:40:50,312 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-08 12:40:50,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-08 12:40:50,334 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-08 12:40:50,335 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-08 12:40:50,335 INFO L275 PluginConnector]: CDTParser initialized [2022-04-08 12:40:50,336 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-08 12:40:50,390 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c902de763/77e2d42c13b14f819f00d109c40ef50d/FLAG68ccca381 [2022-04-08 12:40:50,731 INFO L306 CDTParser]: Found 1 translation units. [2022-04-08 12:40:50,731 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat2-ll_unwindbound20.c [2022-04-08 12:40:50,735 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c902de763/77e2d42c13b14f819f00d109c40ef50d/FLAG68ccca381 [2022-04-08 12:40:51,171 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c902de763/77e2d42c13b14f819f00d109c40ef50d [2022-04-08 12:40:51,172 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-08 12:40:51,173 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-08 12:40:51,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-08 12:40:51,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-08 12:40:51,177 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-08 12:40:51,178 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,179 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3fc68d3e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51, skipping insertion in model container [2022-04-08 12:40:51,179 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,183 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-08 12:40:51,193 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-08 12:40:51,310 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-08 12:40:51,322 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:40:51,327 INFO L203 MainTranslator]: Completed pre-run [2022-04-08 12:40:51,335 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-08 12:40:51,340 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-08 12:40:51,348 INFO L208 MainTranslator]: Completed translation [2022-04-08 12:40:51,348 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51 WrapperNode [2022-04-08 12:40:51,348 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-08 12:40:51,349 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-08 12:40:51,349 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-08 12:40:51,349 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-08 12:40:51,356 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,356 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,363 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,363 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,374 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,379 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,381 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,382 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-08 12:40:51,382 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-08 12:40:51,382 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-08 12:40:51,382 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-08 12:40:51,384 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51" (1/1) ... [2022-04-08 12:40:51,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-08 12:40:51,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:40:51,411 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-04-08 12:40:51,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-04-08 12:40:51,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-08 12:40:51,433 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-08 12:40:51,433 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-08 12:40:51,433 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-08 12:40:51,433 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-08 12:40:51,433 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-08 12:40:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-08 12:40:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-08 12:40:51,433 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-08 12:40:51,434 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-08 12:40:51,475 INFO L234 CfgBuilder]: Building ICFG [2022-04-08 12:40:51,476 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-08 12:40:51,590 INFO L275 CfgBuilder]: Performing block encoding [2022-04-08 12:40:51,595 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-08 12:40:51,595 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-04-08 12:40:51,596 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:40:51 BoogieIcfgContainer [2022-04-08 12:40:51,596 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-08 12:40:51,597 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-08 12:40:51,597 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-08 12:40:51,600 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-08 12:40:51,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.04 12:40:51" (1/3) ... [2022-04-08 12:40:51,600 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b08a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:40:51, skipping insertion in model container [2022-04-08 12:40:51,600 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.04 12:40:51" (2/3) ... [2022-04-08 12:40:51,601 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@41b08a31 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.04 12:40:51, skipping insertion in model container [2022-04-08 12:40:51,601 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.04 12:40:51" (3/3) ... [2022-04-08 12:40:51,601 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat2-ll_unwindbound20.c [2022-04-08 12:40:51,604 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-08 12:40:51,605 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-08 12:40:51,643 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-08 12:40:51,647 INFO L340 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=Craig_NestedInterpolation, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP [2022-04-08 12:40:51,648 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-08 12:40:51,684 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-08 12:40:51,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-08 12:40:51,689 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:40:51,690 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:40:51,690 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:40:51,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:40:51,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 1 times [2022-04-08 12:40:51,707 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:51,708 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1542269885] [2022-04-08 12:40:51,715 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:40:51,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1859024204, now seen corresponding path program 2 times [2022-04-08 12:40:51,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:40:51,718 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [694323065] [2022-04-08 12:40:51,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:40:51,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:40:51,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:40:51,821 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [931440624] [2022-04-08 12:40:51,821 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:40:51,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:40:51,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:40:51,824 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:40:51,826 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-04-08 12:40:51,902 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:40:51,902 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:40:51,903 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-08 12:40:51,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:40:51,914 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:40:51,983 INFO L272 TraceCheckUtils]: 0: Hoare triple {33#true} call ULTIMATE.init(); {33#true} is VALID [2022-04-08 12:40:51,984 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-08 12:40:51,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 12:40:51,984 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33#true} {33#true} #67#return; {33#true} is VALID [2022-04-08 12:40:51,984 INFO L272 TraceCheckUtils]: 4: Hoare triple {33#true} call #t~ret7 := main(); {33#true} is VALID [2022-04-08 12:40:51,984 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-08 12:40:51,985 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-08 12:40:51,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 12:40:51,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} assume 0 == ~cond;assume false; {33#true} is VALID [2022-04-08 12:40:51,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#true} assume true; {33#true} is VALID [2022-04-08 12:40:51,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#true} {33#true} #59#return; {33#true} is VALID [2022-04-08 12:40:51,986 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-08 12:40:51,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} ~cond := #in~cond; {33#true} is VALID [2022-04-08 12:40:51,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {33#true} assume 0 == ~cond;assume false; {34#false} is VALID [2022-04-08 12:40:51,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} assume true; {34#false} is VALID [2022-04-08 12:40:51,987 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {34#false} {33#true} #61#return; {34#false} is VALID [2022-04-08 12:40:51,987 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-08 12:40:51,987 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-04-08 12:40:51,987 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-08 12:40:51,988 INFO L290 TraceCheckUtils]: 19: Hoare triple {34#false} ~cond := #in~cond; {34#false} is VALID [2022-04-08 12:40:51,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {34#false} assume 0 == ~cond; {34#false} is VALID [2022-04-08 12:40:51,988 INFO L290 TraceCheckUtils]: 21: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-04-08 12:40:51,989 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-08 12:40:51,989 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:40:51,989 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:40:51,989 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [694323065] [2022-04-08 12:40:51,989 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:40:51,990 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [931440624] [2022-04-08 12:40:51,990 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [931440624] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:40:51,990 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:40:51,990 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 12:40:51,993 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:40:51,993 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1542269885] [2022-04-08 12:40:51,993 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1542269885] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:40:51,993 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:40:51,993 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-08 12:40:51,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1672631859] [2022-04-08 12:40:51,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:40:51,997 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-08 12:40:51,999 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:40:52,001 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-08 12:40:52,024 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-08 12:40:52,024 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-08 12:40:52,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:52,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-08 12:40:52,044 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-08 12:40:52,046 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-08 12:40:52,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:52,100 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-08 12:40:52,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-08 12:40:52,100 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-08 12:40:52,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:40:52,101 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-08 12:40:52,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-08 12:40:52,106 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-08 12:40:52,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 70 transitions. [2022-04-08 12:40:52,109 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 70 transitions. [2022-04-08 12:40:52,172 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:40:52,179 INFO L225 Difference]: With dead ends: 53 [2022-04-08 12:40:52,179 INFO L226 Difference]: Without dead ends: 25 [2022-04-08 12:40:52,181 INFO L912 BasicCegarLoop]: 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-08 12:40:52,184 INFO L913 BasicCegarLoop]: 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-08 12:40:52,185 INFO L914 BasicCegarLoop]: 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-08 12:40:52,195 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-04-08 12:40:52,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-04-08 12:40:52,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:40:52,205 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-08 12:40:52,205 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-08 12:40:52,206 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-08 12:40:52,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:52,209 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-08 12:40:52,209 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-08 12:40:52,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:52,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:52,210 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-08 12:40:52,210 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-08 12:40:52,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:52,212 INFO L93 Difference]: Finished difference Result 25 states and 29 transitions. [2022-04-08 12:40:52,212 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-08 12:40:52,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:52,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:52,213 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:40:52,213 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:40:52,213 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-08 12:40:52,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-04-08 12:40:52,216 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 22 [2022-04-08 12:40:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:40:52,216 INFO L478 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-04-08 12:40:52,216 INFO L479 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-08 12:40:52,216 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 29 transitions. [2022-04-08 12:40:52,239 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:40:52,239 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-04-08 12:40:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 12:40:52,240 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:40:52,241 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:40:52,257 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-04-08 12:40:52,444 WARN L460 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-08 12:40:52,445 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:40:52,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:40:52,446 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 1 times [2022-04-08 12:40:52,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:52,446 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [395987658] [2022-04-08 12:40:52,447 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:40:52,447 INFO L85 PathProgramCache]: Analyzing trace with hash 243739414, now seen corresponding path program 2 times [2022-04-08 12:40:52,447 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:40:52,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [685275086] [2022-04-08 12:40:52,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:40:52,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:40:52,463 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:40:52,463 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2137395686] [2022-04-08 12:40:52,463 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:40:52,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:40:52,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:40:52,469 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:40:52,470 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-04-08 12:40:52,521 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:40:52,521 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:40:52,522 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-08 12:40:52,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:40:52,531 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:40:52,673 INFO L272 TraceCheckUtils]: 0: Hoare triple {306#true} call ULTIMATE.init(); {306#true} is VALID [2022-04-08 12:40:52,674 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-08 12:40:52,674 INFO L290 TraceCheckUtils]: 2: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,675 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {314#(<= ~counter~0 0)} {306#true} #67#return; {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {314#(<= ~counter~0 0)} call #t~ret7 := main(); {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,676 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-08 12:40:52,677 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-08 12:40:52,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {314#(<= ~counter~0 0)} ~cond := #in~cond; {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {314#(<= ~counter~0 0)} assume !(0 == ~cond); {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,679 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {314#(<= ~counter~0 0)} {314#(<= ~counter~0 0)} #59#return; {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,679 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-08 12:40:52,680 INFO L290 TraceCheckUtils]: 12: Hoare triple {314#(<= ~counter~0 0)} ~cond := #in~cond; {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,680 INFO L290 TraceCheckUtils]: 13: Hoare triple {314#(<= ~counter~0 0)} assume !(0 == ~cond); {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,680 INFO L290 TraceCheckUtils]: 14: Hoare triple {314#(<= ~counter~0 0)} assume true; {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,681 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {314#(<= ~counter~0 0)} {314#(<= ~counter~0 0)} #61#return; {314#(<= ~counter~0 0)} is VALID [2022-04-08 12:40:52,681 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-08 12:40:52,682 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-08 12:40:52,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {363#(<= |main_#t~post6| 0)} assume !(#t~post6 < 20);havoc #t~post6; {307#false} is VALID [2022-04-08 12:40:52,682 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-08 12:40:52,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {307#false} ~cond := #in~cond; {307#false} is VALID [2022-04-08 12:40:52,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {307#false} assume 0 == ~cond; {307#false} is VALID [2022-04-08 12:40:52,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {307#false} assume !false; {307#false} is VALID [2022-04-08 12:40:52,683 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-08 12:40:52,683 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:40:52,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:40:52,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [685275086] [2022-04-08 12:40:52,684 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:40:52,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137395686] [2022-04-08 12:40:52,684 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137395686] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:40:52,684 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:40:52,684 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:40:52,684 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:40:52,684 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [395987658] [2022-04-08 12:40:52,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [395987658] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:40:52,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:40:52,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-08 12:40:52,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [414303628] [2022-04-08 12:40:52,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:40:52,689 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-08 12:40:52,689 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:40:52,690 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-08 12:40:52,704 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-08 12:40:52,704 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-08 12:40:52,705 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:52,705 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-08 12:40:52,706 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-08 12:40:52,706 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-08 12:40:52,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:52,769 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2022-04-08 12:40:52,769 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-08 12:40:52,769 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-08 12:40:52,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:40:52,770 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-08 12:40:52,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 12:40:52,772 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-08 12:40:52,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 38 transitions. [2022-04-08 12:40:52,773 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 38 transitions. [2022-04-08 12:40:52,797 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:40:52,798 INFO L225 Difference]: With dead ends: 34 [2022-04-08 12:40:52,799 INFO L226 Difference]: Without dead ends: 27 [2022-04-08 12:40:52,799 INFO L912 BasicCegarLoop]: 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-08 12:40:52,800 INFO L913 BasicCegarLoop]: 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-08 12:40:52,800 INFO L914 BasicCegarLoop]: 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-08 12:40:52,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-04-08 12:40:52,809 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-04-08 12:40:52,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:40:52,809 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-08 12:40:52,809 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-08 12:40:52,809 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-08 12:40:52,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:52,811 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 12:40:52,811 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 12:40:52,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:52,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:52,812 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-08 12:40:52,812 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-08 12:40:52,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:40:52,814 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-04-08 12:40:52,814 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 12:40:52,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:40:52,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:40:52,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:40:52,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:40:52,814 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-08 12:40:52,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-04-08 12:40:52,816 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 23 [2022-04-08 12:40:52,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:40:52,816 INFO L478 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-04-08 12:40:52,816 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 3 states have internal predecessors, (12), 3 states have call successors, (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-08 12:40:52,816 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 31 transitions. [2022-04-08 12:40:52,836 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-08 12:40:52,836 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-04-08 12:40:52,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-08 12:40:52,837 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:40:52,837 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:40:52,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-04-08 12:40:53,051 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable1 [2022-04-08 12:40:53,052 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:40:53,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:40:53,052 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 1 times [2022-04-08 12:40:53,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:53,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1483765460] [2022-04-08 12:40:53,053 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:40:53,053 INFO L85 PathProgramCache]: Analyzing trace with hash 245526874, now seen corresponding path program 2 times [2022-04-08 12:40:53,053 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:40:53,053 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725414203] [2022-04-08 12:40:53,054 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:40:53,054 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:40:53,065 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:40:53,066 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752773276] [2022-04-08 12:40:53,066 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:40:53,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:40:53,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:40:53,067 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:40:53,068 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-04-08 12:40:53,110 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-08 12:40:53,110 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:40:53,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:40:53,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:40:53,122 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:40:53,338 INFO L272 TraceCheckUtils]: 0: Hoare triple {554#true} call ULTIMATE.init(); {554#true} is VALID [2022-04-08 12:40:53,338 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-08 12:40:53,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-08 12:40:53,339 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {554#true} {554#true} #67#return; {554#true} is VALID [2022-04-08 12:40:53,339 INFO L272 TraceCheckUtils]: 4: Hoare triple {554#true} call #t~ret7 := main(); {554#true} is VALID [2022-04-08 12:40:53,339 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-08 12:40:53,339 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-08 12:40:53,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-08 12:40:53,339 INFO L290 TraceCheckUtils]: 8: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-08 12:40:53,340 INFO L290 TraceCheckUtils]: 9: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-08 12:40:53,340 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {554#true} {554#true} #59#return; {554#true} is VALID [2022-04-08 12:40:53,340 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-08 12:40:53,340 INFO L290 TraceCheckUtils]: 12: Hoare triple {554#true} ~cond := #in~cond; {554#true} is VALID [2022-04-08 12:40:53,340 INFO L290 TraceCheckUtils]: 13: Hoare triple {554#true} assume !(0 == ~cond); {554#true} is VALID [2022-04-08 12:40:53,340 INFO L290 TraceCheckUtils]: 14: Hoare triple {554#true} assume true; {554#true} is VALID [2022-04-08 12:40:53,340 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {554#true} {554#true} #61#return; {554#true} is VALID [2022-04-08 12:40:53,392 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-08 12:40:53,393 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-08 12:40:53,394 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-08 12:40:54,617 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-08 12:40:54,618 INFO L290 TraceCheckUtils]: 20: Hoare triple {617#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {621#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:40:54,618 INFO L290 TraceCheckUtils]: 21: Hoare triple {621#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {555#false} is VALID [2022-04-08 12:40:54,618 INFO L290 TraceCheckUtils]: 22: Hoare triple {555#false} assume !false; {555#false} is VALID [2022-04-08 12:40:54,619 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-08 12:40:54,619 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-08 12:40:54,619 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:40:54,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725414203] [2022-04-08 12:40:54,619 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:40:54,619 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752773276] [2022-04-08 12:40:54,619 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752773276] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:40:54,619 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:40:54,619 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:40:54,620 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:40:54,620 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1483765460] [2022-04-08 12:40:54,620 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1483765460] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:40:54,620 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:40:54,620 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:40:54,620 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [430616795] [2022-04-08 12:40:54,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:40:54,620 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-08 12:40:54,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:40:54,621 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-08 12:40:57,035 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-08 12:40:57,036 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:40:57,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:40:57,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:40:57,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-08 12:40:57,037 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-08 12:40:59,144 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.32s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:41:02,949 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result VALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-08 12:41:03,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:03,018 INFO L93 Difference]: Finished difference Result 39 states and 46 transitions. [2022-04-08 12:41:03,018 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-08 12:41:03,018 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-08 12:41:03,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:03,018 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-08 12:41:03,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-08 12:41:03,020 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-08 12:41:03,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 44 transitions. [2022-04-08 12:41:03,021 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 44 transitions. [2022-04-08 12:41:08,581 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 42 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:08,583 INFO L225 Difference]: With dead ends: 39 [2022-04-08 12:41:08,583 INFO L226 Difference]: Without dead ends: 37 [2022-04-08 12:41:08,585 INFO L912 BasicCegarLoop]: 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-08 12:41:08,589 INFO L913 BasicCegarLoop]: 24 mSDtfsCounter, 8 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.8s 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.8s IncrementalHoareTripleChecker+Time [2022-04-08 12:41:08,590 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 85 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 3.8s Time] [2022-04-08 12:41:08,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-04-08 12:41:08,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2022-04-08 12:41:08,609 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:08,609 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-08 12:41:08,609 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-08 12:41:08,609 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-08 12:41:08,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:08,611 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-08 12:41:08,611 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-08 12:41:08,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:08,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:08,612 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-08 12:41:08,612 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-08 12:41:08,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:08,613 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-04-08 12:41:08,613 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 44 transitions. [2022-04-08 12:41:08,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:08,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:08,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:08,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:08,614 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-08 12:41:08,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2022-04-08 12:41:08,615 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 23 [2022-04-08 12:41:08,616 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:08,616 INFO L478 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2022-04-08 12:41:08,616 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 4 states have internal predecessors, (12), 2 states have call successors, (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-08 12:41:08,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 43 transitions. [2022-04-08 12:41:13,923 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 41 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:13,923 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2022-04-08 12:41:13,924 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-08 12:41:13,924 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:13,924 INFO L499 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-08 12:41:13,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:14,124 WARN L460 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-08 12:41:14,125 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:14,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:14,125 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 1 times [2022-04-08 12:41:14,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:14,125 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [645438680] [2022-04-08 12:41:14,126 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:14,126 INFO L85 PathProgramCache]: Analyzing trace with hash -1019533657, now seen corresponding path program 2 times [2022-04-08 12:41:14,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:14,126 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799523087] [2022-04-08 12:41:14,126 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:14,126 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:14,136 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:14,136 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1897277683] [2022-04-08 12:41:14,136 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:41:14,136 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:14,136 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:14,137 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:14,138 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-04-08 12:41:14,171 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:41:14,171 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:14,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-08 12:41:14,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:14,180 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:14,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2022-04-08 12:41:14,310 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-08 12:41:14,310 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-08 12:41:14,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #67#return; {853#true} is VALID [2022-04-08 12:41:14,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret7 := main(); {853#true} is VALID [2022-04-08 12:41:14,311 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-08 12:41:14,311 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-08 12:41:14,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-08 12:41:14,312 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-08 12:41:14,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-08 12:41:14,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {853#true} {853#true} #59#return; {853#true} is VALID [2022-04-08 12:41:14,312 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-08 12:41:14,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-08 12:41:14,312 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-08 12:41:14,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-08 12:41:14,313 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {853#true} {853#true} #61#return; {853#true} is VALID [2022-04-08 12:41:14,313 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-08 12:41:14,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {853#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {853#true} is VALID [2022-04-08 12:41:14,313 INFO L290 TraceCheckUtils]: 18: Hoare triple {853#true} assume !!(#t~post6 < 20);havoc #t~post6; {853#true} is VALID [2022-04-08 12:41:14,313 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-08 12:41:14,314 INFO L290 TraceCheckUtils]: 20: Hoare triple {853#true} ~cond := #in~cond; {918#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:41:14,315 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-08 12:41:14,316 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-08 12:41:14,317 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-08 12:41:14,318 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-08 12:41:14,318 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-08 12:41:14,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:41:14,319 INFO L290 TraceCheckUtils]: 27: Hoare triple {941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {854#false} is VALID [2022-04-08 12:41:14,319 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-08 12:41:14,320 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-08 12:41:14,320 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:14,679 INFO L290 TraceCheckUtils]: 28: Hoare triple {854#false} assume !false; {854#false} is VALID [2022-04-08 12:41:14,680 INFO L290 TraceCheckUtils]: 27: Hoare triple {941#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {854#false} is VALID [2022-04-08 12:41:14,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {937#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {941#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-08 12:41:14,681 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-08 12:41:14,681 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-08 12:41:14,684 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-08 12:41:14,684 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-08 12:41:14,684 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-08 12:41:14,685 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-08 12:41:14,685 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-08 12:41:14,685 INFO L290 TraceCheckUtils]: 18: Hoare triple {853#true} assume !!(#t~post6 < 20);havoc #t~post6; {853#true} is VALID [2022-04-08 12:41:14,685 INFO L290 TraceCheckUtils]: 17: Hoare triple {853#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {853#true} is VALID [2022-04-08 12:41:14,685 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-08 12:41:14,685 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {853#true} {853#true} #61#return; {853#true} is VALID [2022-04-08 12:41:14,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-08 12:41:14,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-08 12:41:14,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-08 12:41:14,686 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-08 12:41:14,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {853#true} {853#true} #59#return; {853#true} is VALID [2022-04-08 12:41:14,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-08 12:41:14,687 INFO L290 TraceCheckUtils]: 8: Hoare triple {853#true} assume !(0 == ~cond); {853#true} is VALID [2022-04-08 12:41:14,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {853#true} ~cond := #in~cond; {853#true} is VALID [2022-04-08 12:41:14,687 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-08 12:41:14,688 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-08 12:41:14,688 INFO L272 TraceCheckUtils]: 4: Hoare triple {853#true} call #t~ret7 := main(); {853#true} is VALID [2022-04-08 12:41:14,695 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {853#true} {853#true} #67#return; {853#true} is VALID [2022-04-08 12:41:14,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {853#true} assume true; {853#true} is VALID [2022-04-08 12:41:14,697 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-08 12:41:14,697 INFO L272 TraceCheckUtils]: 0: Hoare triple {853#true} call ULTIMATE.init(); {853#true} is VALID [2022-04-08 12:41:14,698 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-08 12:41:14,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799523087] [2022-04-08 12:41:14,698 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1897277683] [2022-04-08 12:41:14,698 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1897277683] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:14,698 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:14,698 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-08 12:41:14,698 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:14,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [645438680] [2022-04-08 12:41:14,699 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [645438680] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:14,699 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:14,699 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:41:14,699 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1680938938] [2022-04-08 12:41:14,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:14,699 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-08 12:41:14,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:14,700 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-08 12:41:14,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:14,722 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:41:14,722 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:14,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:41:14,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:41:14,723 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-08 12:41:14,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:14,996 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-04-08 12:41:14,996 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:41:14,996 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-08 12:41:14,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:14,997 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-08 12:41:14,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 12:41:14,998 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-08 12:41:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 35 transitions. [2022-04-08 12:41:14,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 35 transitions. [2022-04-08 12:41:15,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:15,037 INFO L225 Difference]: With dead ends: 43 [2022-04-08 12:41:15,037 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 12:41:15,037 INFO L912 BasicCegarLoop]: 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-08 12:41:15,038 INFO L913 BasicCegarLoop]: 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-08 12:41:15,039 INFO L914 BasicCegarLoop]: 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-08 12:41:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 12:41:15,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 29. [2022-04-08 12:41:15,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:15,057 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-08 12:41:15,057 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-08 12:41:15,057 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-08 12:41:15,059 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:15,059 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-08 12:41:15,059 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-08 12:41:15,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:15,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:15,060 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-08 12:41:15,060 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-08 12:41:15,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:15,061 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2022-04-08 12:41:15,061 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-04-08 12:41:15,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:15,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:15,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:15,062 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:15,062 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-08 12:41:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 31 transitions. [2022-04-08 12:41:15,063 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 31 transitions. Word has length 29 [2022-04-08 12:41:15,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:15,063 INFO L478 AbstractCegarLoop]: Abstraction has 29 states and 31 transitions. [2022-04-08 12:41:15,063 INFO L479 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-08 12:41:15,063 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 31 transitions. [2022-04-08 12:41:16,600 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-08 12:41:16,601 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 31 transitions. [2022-04-08 12:41:16,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-04-08 12:41:16,601 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:16,601 INFO L499 BasicCegarLoop]: 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-08 12:41:16,617 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:16,802 WARN L460 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-08 12:41:16,802 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:16,802 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:16,802 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 1 times [2022-04-08 12:41:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:16,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1883960670] [2022-04-08 12:41:16,803 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:16,803 INFO L85 PathProgramCache]: Analyzing trace with hash 1080225052, now seen corresponding path program 2 times [2022-04-08 12:41:16,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:16,803 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748389893] [2022-04-08 12:41:16,803 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:16,803 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:16,820 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:16,820 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1424163342] [2022-04-08 12:41:16,820 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:41:16,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:16,821 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:16,832 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:16,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-04-08 12:41:16,867 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:41:16,867 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:16,868 INFO L263 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-08 12:41:16,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:16,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:17,015 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-08 12:41:17,016 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-08 12:41:17,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {1270#(<= ~counter~0 0)} assume true; {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,017 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1270#(<= ~counter~0 0)} {1262#true} #67#return; {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,017 INFO L272 TraceCheckUtils]: 4: Hoare triple {1270#(<= ~counter~0 0)} call #t~ret7 := main(); {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,018 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-08 12:41:17,018 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-08 12:41:17,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {1270#(<= ~counter~0 0)} ~cond := #in~cond; {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {1270#(<= ~counter~0 0)} assume !(0 == ~cond); {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,019 INFO L290 TraceCheckUtils]: 9: Hoare triple {1270#(<= ~counter~0 0)} assume true; {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,020 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1270#(<= ~counter~0 0)} {1270#(<= ~counter~0 0)} #59#return; {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,020 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-08 12:41:17,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {1270#(<= ~counter~0 0)} ~cond := #in~cond; {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {1270#(<= ~counter~0 0)} assume !(0 == ~cond); {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {1270#(<= ~counter~0 0)} assume true; {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,022 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1270#(<= ~counter~0 0)} {1270#(<= ~counter~0 0)} #61#return; {1270#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:17,022 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-08 12:41:17,023 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-08 12:41:17,023 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-08 12:41:17,024 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-08 12:41:17,024 INFO L290 TraceCheckUtils]: 20: Hoare triple {1319#(<= ~counter~0 1)} ~cond := #in~cond; {1319#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:17,024 INFO L290 TraceCheckUtils]: 21: Hoare triple {1319#(<= ~counter~0 1)} assume !(0 == ~cond); {1319#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:17,025 INFO L290 TraceCheckUtils]: 22: Hoare triple {1319#(<= ~counter~0 1)} assume true; {1319#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:17,025 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1319#(<= ~counter~0 1)} {1319#(<= ~counter~0 1)} #63#return; {1319#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:17,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {1319#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1319#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:17,026 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-08 12:41:17,026 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-08 12:41:17,027 INFO L290 TraceCheckUtils]: 27: Hoare triple {1347#(<= |main_#t~post6| 1)} assume !(#t~post6 < 20);havoc #t~post6; {1263#false} is VALID [2022-04-08 12:41:17,027 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-08 12:41:17,027 INFO L290 TraceCheckUtils]: 29: Hoare triple {1263#false} ~cond := #in~cond; {1263#false} is VALID [2022-04-08 12:41:17,027 INFO L290 TraceCheckUtils]: 30: Hoare triple {1263#false} assume 0 == ~cond; {1263#false} is VALID [2022-04-08 12:41:17,027 INFO L290 TraceCheckUtils]: 31: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-08 12:41:17,028 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-08 12:41:17,028 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:17,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {1263#false} assume !false; {1263#false} is VALID [2022-04-08 12:41:17,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {1263#false} assume 0 == ~cond; {1263#false} is VALID [2022-04-08 12:41:17,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {1263#false} ~cond := #in~cond; {1263#false} is VALID [2022-04-08 12:41:17,196 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-08 12:41:17,197 INFO L290 TraceCheckUtils]: 27: Hoare triple {1375#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1263#false} is VALID [2022-04-08 12:41:17,197 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-08 12:41:17,197 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-08 12:41:17,198 INFO L290 TraceCheckUtils]: 24: Hoare triple {1379#(< ~counter~0 20)} assume !!(0 != ~r~0); {1379#(< ~counter~0 20)} is VALID [2022-04-08 12:41:17,198 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1262#true} {1379#(< ~counter~0 20)} #63#return; {1379#(< ~counter~0 20)} is VALID [2022-04-08 12:41:17,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-08 12:41:17,199 INFO L290 TraceCheckUtils]: 21: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-08 12:41:17,199 INFO L290 TraceCheckUtils]: 20: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-08 12:41:17,199 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-08 12:41:17,199 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-08 12:41:17,200 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-08 12:41:17,200 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-08 12:41:17,200 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1262#true} {1407#(< ~counter~0 19)} #61#return; {1407#(< ~counter~0 19)} is VALID [2022-04-08 12:41:17,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-08 12:41:17,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-08 12:41:17,201 INFO L290 TraceCheckUtils]: 12: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-08 12:41:17,201 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-08 12:41:17,201 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1262#true} {1407#(< ~counter~0 19)} #59#return; {1407#(< ~counter~0 19)} is VALID [2022-04-08 12:41:17,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {1262#true} assume true; {1262#true} is VALID [2022-04-08 12:41:17,202 INFO L290 TraceCheckUtils]: 8: Hoare triple {1262#true} assume !(0 == ~cond); {1262#true} is VALID [2022-04-08 12:41:17,202 INFO L290 TraceCheckUtils]: 7: Hoare triple {1262#true} ~cond := #in~cond; {1262#true} is VALID [2022-04-08 12:41:17,202 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-08 12:41:17,202 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-08 12:41:17,203 INFO L272 TraceCheckUtils]: 4: Hoare triple {1407#(< ~counter~0 19)} call #t~ret7 := main(); {1407#(< ~counter~0 19)} is VALID [2022-04-08 12:41:17,203 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1407#(< ~counter~0 19)} {1262#true} #67#return; {1407#(< ~counter~0 19)} is VALID [2022-04-08 12:41:17,203 INFO L290 TraceCheckUtils]: 2: Hoare triple {1407#(< ~counter~0 19)} assume true; {1407#(< ~counter~0 19)} is VALID [2022-04-08 12:41:17,204 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-08 12:41:17,204 INFO L272 TraceCheckUtils]: 0: Hoare triple {1262#true} call ULTIMATE.init(); {1262#true} is VALID [2022-04-08 12:41:17,204 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-08 12:41:17,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:17,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748389893] [2022-04-08 12:41:17,204 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:17,204 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424163342] [2022-04-08 12:41:17,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1424163342] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:17,205 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:17,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2022-04-08 12:41:17,205 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:17,205 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1883960670] [2022-04-08 12:41:17,205 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1883960670] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:17,205 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:17,205 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-08 12:41:17,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918521845] [2022-04-08 12:41:17,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:17,206 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-08 12:41:17,206 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:17,206 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-08 12:41:17,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:17,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-08 12:41:17,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:17,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-08 12:41:17,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2022-04-08 12:41:17,227 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-08 12:41:17,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:17,321 INFO L93 Difference]: Finished difference Result 43 states and 46 transitions. [2022-04-08 12:41:17,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-08 12:41:17,322 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-08 12:41:17,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:17,322 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-08 12:41:17,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 12:41:17,323 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-08 12:41:17,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-04-08 12:41:17,324 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-04-08 12:41:17,353 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:17,354 INFO L225 Difference]: With dead ends: 43 [2022-04-08 12:41:17,354 INFO L226 Difference]: Without dead ends: 38 [2022-04-08 12:41:17,354 INFO L912 BasicCegarLoop]: 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-08 12:41:17,355 INFO L913 BasicCegarLoop]: 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-08 12:41:17,355 INFO L914 BasicCegarLoop]: 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-08 12:41:17,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-04-08 12:41:17,379 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-04-08 12:41:17,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:17,380 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-08 12:41:17,380 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-08 12:41:17,380 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-08 12:41:17,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:17,381 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 12:41:17,381 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 12:41:17,382 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:17,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:17,382 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-08 12:41:17,382 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-08 12:41:17,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:17,383 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2022-04-08 12:41:17,383 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 12:41:17,383 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:17,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:17,384 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:17,384 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:17,384 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-08 12:41:17,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2022-04-08 12:41:17,385 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 32 [2022-04-08 12:41:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:17,385 INFO L478 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2022-04-08 12:41:17,385 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 4 states have internal predecessors, (19), 4 states have call successors, (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-08 12:41:17,385 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 41 transitions. [2022-04-08 12:41:18,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:18,702 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2022-04-08 12:41:18,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-08 12:41:18,702 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:18,702 INFO L499 BasicCegarLoop]: 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-08 12:41:18,718 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:18,918 WARN L460 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-08 12:41:18,919 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:18,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:18,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 3 times [2022-04-08 12:41:18,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:18,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [424148663] [2022-04-08 12:41:18,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:18,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1448743382, now seen corresponding path program 4 times [2022-04-08 12:41:18,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:18,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586498934] [2022-04-08 12:41:18,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:18,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:18,929 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:18,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [868291349] [2022-04-08 12:41:18,929 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:41:18,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:18,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:18,939 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:18,941 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-04-08 12:41:19,001 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:41:19,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:19,001 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-08 12:41:19,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:19,012 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:19,160 INFO L272 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2022-04-08 12:41:19,161 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-08 12:41:19,161 INFO L290 TraceCheckUtils]: 2: Hoare triple {1709#(<= ~counter~0 0)} assume true; {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,161 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1709#(<= ~counter~0 0)} {1701#true} #67#return; {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,162 INFO L272 TraceCheckUtils]: 4: Hoare triple {1709#(<= ~counter~0 0)} call #t~ret7 := main(); {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,162 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-08 12:41:19,162 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-08 12:41:19,163 INFO L290 TraceCheckUtils]: 7: Hoare triple {1709#(<= ~counter~0 0)} ~cond := #in~cond; {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,163 INFO L290 TraceCheckUtils]: 8: Hoare triple {1709#(<= ~counter~0 0)} assume !(0 == ~cond); {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {1709#(<= ~counter~0 0)} assume true; {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,166 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1709#(<= ~counter~0 0)} {1709#(<= ~counter~0 0)} #59#return; {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,167 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-08 12:41:19,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {1709#(<= ~counter~0 0)} ~cond := #in~cond; {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {1709#(<= ~counter~0 0)} assume !(0 == ~cond); {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {1709#(<= ~counter~0 0)} assume true; {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,168 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1709#(<= ~counter~0 0)} {1709#(<= ~counter~0 0)} #61#return; {1709#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:19,168 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-08 12:41:19,169 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-08 12:41:19,169 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-08 12:41:19,169 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-08 12:41:19,170 INFO L290 TraceCheckUtils]: 20: Hoare triple {1758#(<= ~counter~0 1)} ~cond := #in~cond; {1758#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:19,170 INFO L290 TraceCheckUtils]: 21: Hoare triple {1758#(<= ~counter~0 1)} assume !(0 == ~cond); {1758#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:19,170 INFO L290 TraceCheckUtils]: 22: Hoare triple {1758#(<= ~counter~0 1)} assume true; {1758#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:19,171 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1758#(<= ~counter~0 1)} {1758#(<= ~counter~0 1)} #63#return; {1758#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:19,171 INFO L290 TraceCheckUtils]: 24: Hoare triple {1758#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1758#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:19,171 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-08 12:41:19,171 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-08 12:41:19,172 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-08 12:41:19,172 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-08 12:41:19,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {1786#(<= ~counter~0 2)} ~cond := #in~cond; {1786#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:19,173 INFO L290 TraceCheckUtils]: 30: Hoare triple {1786#(<= ~counter~0 2)} assume !(0 == ~cond); {1786#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:19,173 INFO L290 TraceCheckUtils]: 31: Hoare triple {1786#(<= ~counter~0 2)} assume true; {1786#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:19,174 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1786#(<= ~counter~0 2)} {1786#(<= ~counter~0 2)} #63#return; {1786#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:19,174 INFO L290 TraceCheckUtils]: 33: Hoare triple {1786#(<= ~counter~0 2)} assume !!(0 != ~r~0); {1786#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:19,174 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-08 12:41:19,174 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-08 12:41:19,175 INFO L290 TraceCheckUtils]: 36: Hoare triple {1814#(<= |main_#t~post6| 2)} assume !(#t~post6 < 20);havoc #t~post6; {1702#false} is VALID [2022-04-08 12:41:19,175 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-08 12:41:19,175 INFO L290 TraceCheckUtils]: 38: Hoare triple {1702#false} ~cond := #in~cond; {1702#false} is VALID [2022-04-08 12:41:19,175 INFO L290 TraceCheckUtils]: 39: Hoare triple {1702#false} assume 0 == ~cond; {1702#false} is VALID [2022-04-08 12:41:19,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {1702#false} assume !false; {1702#false} is VALID [2022-04-08 12:41:19,175 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-08 12:41:19,175 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:19,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {1702#false} assume !false; {1702#false} is VALID [2022-04-08 12:41:19,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {1702#false} assume 0 == ~cond; {1702#false} is VALID [2022-04-08 12:41:19,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {1702#false} ~cond := #in~cond; {1702#false} is VALID [2022-04-08 12:41:19,389 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-08 12:41:19,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {1842#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {1702#false} is VALID [2022-04-08 12:41:19,389 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-08 12:41:19,390 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-08 12:41:19,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {1846#(< ~counter~0 20)} assume !!(0 != ~r~0); {1846#(< ~counter~0 20)} is VALID [2022-04-08 12:41:19,391 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {1701#true} {1846#(< ~counter~0 20)} #63#return; {1846#(< ~counter~0 20)} is VALID [2022-04-08 12:41:19,391 INFO L290 TraceCheckUtils]: 31: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-08 12:41:19,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-08 12:41:19,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-08 12:41:19,391 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-08 12:41:19,391 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-08 12:41:19,392 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-08 12:41:19,392 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-08 12:41:19,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {1874#(< ~counter~0 19)} assume !!(0 != ~r~0); {1874#(< ~counter~0 19)} is VALID [2022-04-08 12:41:19,393 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1701#true} {1874#(< ~counter~0 19)} #63#return; {1874#(< ~counter~0 19)} is VALID [2022-04-08 12:41:19,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-08 12:41:19,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-08 12:41:19,394 INFO L290 TraceCheckUtils]: 20: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-08 12:41:19,394 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-08 12:41:19,394 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-08 12:41:19,395 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-08 12:41:19,397 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-08 12:41:19,398 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1701#true} {1902#(< ~counter~0 18)} #61#return; {1902#(< ~counter~0 18)} is VALID [2022-04-08 12:41:19,398 INFO L290 TraceCheckUtils]: 14: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-08 12:41:19,398 INFO L290 TraceCheckUtils]: 13: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-08 12:41:19,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-08 12:41:19,398 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-08 12:41:19,399 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1701#true} {1902#(< ~counter~0 18)} #59#return; {1902#(< ~counter~0 18)} is VALID [2022-04-08 12:41:19,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {1701#true} assume true; {1701#true} is VALID [2022-04-08 12:41:19,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {1701#true} assume !(0 == ~cond); {1701#true} is VALID [2022-04-08 12:41:19,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {1701#true} ~cond := #in~cond; {1701#true} is VALID [2022-04-08 12:41:19,399 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-08 12:41:19,399 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-08 12:41:19,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {1902#(< ~counter~0 18)} call #t~ret7 := main(); {1902#(< ~counter~0 18)} is VALID [2022-04-08 12:41:19,400 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1902#(< ~counter~0 18)} {1701#true} #67#return; {1902#(< ~counter~0 18)} is VALID [2022-04-08 12:41:19,400 INFO L290 TraceCheckUtils]: 2: Hoare triple {1902#(< ~counter~0 18)} assume true; {1902#(< ~counter~0 18)} is VALID [2022-04-08 12:41:19,401 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-08 12:41:19,401 INFO L272 TraceCheckUtils]: 0: Hoare triple {1701#true} call ULTIMATE.init(); {1701#true} is VALID [2022-04-08 12:41:19,401 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-08 12:41:19,401 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:19,401 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586498934] [2022-04-08 12:41:19,401 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:19,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [868291349] [2022-04-08 12:41:19,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [868291349] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:19,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:19,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-08 12:41:19,402 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:19,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [424148663] [2022-04-08 12:41:19,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [424148663] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:19,402 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:19,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-08 12:41:19,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058147032] [2022-04-08 12:41:19,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:19,403 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-08 12:41:19,403 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:19,403 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-08 12:41:19,428 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:19,428 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-08 12:41:19,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:19,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-08 12:41:19,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-08 12:41:19,429 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-08 12:41:19,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:19,548 INFO L93 Difference]: Finished difference Result 52 states and 56 transitions. [2022-04-08 12:41:19,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-08 12:41:19,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-08 12:41:19,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:19,548 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-08 12:41:19,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-08 12:41:19,550 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-08 12:41:19,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 55 transitions. [2022-04-08 12:41:19,551 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 55 transitions. [2022-04-08 12:41:19,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:19,598 INFO L225 Difference]: With dead ends: 52 [2022-04-08 12:41:19,598 INFO L226 Difference]: Without dead ends: 47 [2022-04-08 12:41:19,598 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=51, Invalid=81, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:41:19,600 INFO L913 BasicCegarLoop]: 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-08 12:41:19,600 INFO L914 BasicCegarLoop]: 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-08 12:41:19,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-04-08 12:41:19,629 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 47. [2022-04-08 12:41:19,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:19,629 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-08 12:41:19,629 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-08 12:41:19,629 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-08 12:41:19,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:19,632 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 12:41:19,633 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 12:41:19,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:19,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:19,636 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-08 12:41:19,636 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-08 12:41:19,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:19,639 INFO L93 Difference]: Finished difference Result 47 states and 51 transitions. [2022-04-08 12:41:19,639 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 12:41:19,639 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:19,639 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:19,639 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:19,639 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:19,640 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-08 12:41:19,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 51 transitions. [2022-04-08 12:41:19,641 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 51 transitions. Word has length 41 [2022-04-08 12:41:19,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:19,642 INFO L478 AbstractCegarLoop]: Abstraction has 47 states and 51 transitions. [2022-04-08 12:41:19,643 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.333333333333333) internal successors, (26), 5 states have internal predecessors, (26), 5 states have call successors, (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-08 12:41:19,643 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 47 states and 51 transitions. [2022-04-08 12:41:21,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:21,420 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 51 transitions. [2022-04-08 12:41:21,420 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-04-08 12:41:21,420 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:21,420 INFO L499 BasicCegarLoop]: 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-08 12:41:21,438 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:21,638 WARN L460 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-08 12:41:21,640 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:21,655 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:21,655 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 5 times [2022-04-08 12:41:21,655 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:21,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1018064714] [2022-04-08 12:41:21,656 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:21,656 INFO L85 PathProgramCache]: Analyzing trace with hash -678977956, now seen corresponding path program 6 times [2022-04-08 12:41:21,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:21,656 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176159363] [2022-04-08 12:41:21,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:21,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:21,667 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:21,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1489035293] [2022-04-08 12:41:21,668 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:41:21,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:21,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:21,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:21,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-04-08 12:41:21,717 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-04-08 12:41:21,717 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:21,718 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-08 12:41:21,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:21,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:21,951 INFO L272 TraceCheckUtils]: 0: Hoare triple {2252#true} call ULTIMATE.init(); {2252#true} is VALID [2022-04-08 12:41:21,952 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-08 12:41:21,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {2260#(<= ~counter~0 0)} assume true; {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,953 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2260#(<= ~counter~0 0)} {2252#true} #67#return; {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,953 INFO L272 TraceCheckUtils]: 4: Hoare triple {2260#(<= ~counter~0 0)} call #t~ret7 := main(); {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,953 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-08 12:41:21,954 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-08 12:41:21,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {2260#(<= ~counter~0 0)} ~cond := #in~cond; {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {2260#(<= ~counter~0 0)} assume !(0 == ~cond); {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {2260#(<= ~counter~0 0)} assume true; {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,955 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2260#(<= ~counter~0 0)} {2260#(<= ~counter~0 0)} #59#return; {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,956 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-08 12:41:21,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {2260#(<= ~counter~0 0)} ~cond := #in~cond; {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {2260#(<= ~counter~0 0)} assume !(0 == ~cond); {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {2260#(<= ~counter~0 0)} assume true; {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,957 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2260#(<= ~counter~0 0)} {2260#(<= ~counter~0 0)} #61#return; {2260#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:21,957 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-08 12:41:21,958 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-08 12:41:21,958 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-08 12:41:21,958 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-08 12:41:21,959 INFO L290 TraceCheckUtils]: 20: Hoare triple {2309#(<= ~counter~0 1)} ~cond := #in~cond; {2309#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:21,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {2309#(<= ~counter~0 1)} assume !(0 == ~cond); {2309#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:21,959 INFO L290 TraceCheckUtils]: 22: Hoare triple {2309#(<= ~counter~0 1)} assume true; {2309#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:21,960 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2309#(<= ~counter~0 1)} {2309#(<= ~counter~0 1)} #63#return; {2309#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:21,960 INFO L290 TraceCheckUtils]: 24: Hoare triple {2309#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2309#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:21,960 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-08 12:41:21,961 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-08 12:41:21,961 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-08 12:41:21,962 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-08 12:41:21,962 INFO L290 TraceCheckUtils]: 29: Hoare triple {2337#(<= ~counter~0 2)} ~cond := #in~cond; {2337#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:21,962 INFO L290 TraceCheckUtils]: 30: Hoare triple {2337#(<= ~counter~0 2)} assume !(0 == ~cond); {2337#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:21,963 INFO L290 TraceCheckUtils]: 31: Hoare triple {2337#(<= ~counter~0 2)} assume true; {2337#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:21,963 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2337#(<= ~counter~0 2)} {2337#(<= ~counter~0 2)} #63#return; {2337#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:21,963 INFO L290 TraceCheckUtils]: 33: Hoare triple {2337#(<= ~counter~0 2)} assume !!(0 != ~r~0); {2337#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:21,964 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-08 12:41:21,964 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-08 12:41:21,965 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-08 12:41:21,965 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-08 12:41:21,965 INFO L290 TraceCheckUtils]: 38: Hoare triple {2365#(<= ~counter~0 3)} ~cond := #in~cond; {2365#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:21,966 INFO L290 TraceCheckUtils]: 39: Hoare triple {2365#(<= ~counter~0 3)} assume !(0 == ~cond); {2365#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:21,966 INFO L290 TraceCheckUtils]: 40: Hoare triple {2365#(<= ~counter~0 3)} assume true; {2365#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:21,967 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2365#(<= ~counter~0 3)} {2365#(<= ~counter~0 3)} #63#return; {2365#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:21,968 INFO L290 TraceCheckUtils]: 42: Hoare triple {2365#(<= ~counter~0 3)} assume !!(0 != ~r~0); {2365#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:21,968 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-08 12:41:21,968 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-08 12:41:21,969 INFO L290 TraceCheckUtils]: 45: Hoare triple {2393#(<= |main_#t~post6| 3)} assume !(#t~post6 < 20);havoc #t~post6; {2253#false} is VALID [2022-04-08 12:41:21,969 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-08 12:41:21,969 INFO L290 TraceCheckUtils]: 47: Hoare triple {2253#false} ~cond := #in~cond; {2253#false} is VALID [2022-04-08 12:41:21,969 INFO L290 TraceCheckUtils]: 48: Hoare triple {2253#false} assume 0 == ~cond; {2253#false} is VALID [2022-04-08 12:41:21,969 INFO L290 TraceCheckUtils]: 49: Hoare triple {2253#false} assume !false; {2253#false} is VALID [2022-04-08 12:41:21,969 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-08 12:41:21,969 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:22,212 INFO L290 TraceCheckUtils]: 49: Hoare triple {2253#false} assume !false; {2253#false} is VALID [2022-04-08 12:41:22,212 INFO L290 TraceCheckUtils]: 48: Hoare triple {2253#false} assume 0 == ~cond; {2253#false} is VALID [2022-04-08 12:41:22,212 INFO L290 TraceCheckUtils]: 47: Hoare triple {2253#false} ~cond := #in~cond; {2253#false} is VALID [2022-04-08 12:41:22,212 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-08 12:41:22,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {2421#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {2253#false} is VALID [2022-04-08 12:41:22,213 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-08 12:41:22,213 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-08 12:41:22,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {2425#(< ~counter~0 20)} assume !!(0 != ~r~0); {2425#(< ~counter~0 20)} is VALID [2022-04-08 12:41:22,214 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2252#true} {2425#(< ~counter~0 20)} #63#return; {2425#(< ~counter~0 20)} is VALID [2022-04-08 12:41:22,214 INFO L290 TraceCheckUtils]: 40: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-08 12:41:22,214 INFO L290 TraceCheckUtils]: 39: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-08 12:41:22,214 INFO L290 TraceCheckUtils]: 38: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-08 12:41:22,214 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-08 12:41:22,216 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-08 12:41:22,217 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-08 12:41:22,217 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-08 12:41:22,217 INFO L290 TraceCheckUtils]: 33: Hoare triple {2453#(< ~counter~0 19)} assume !!(0 != ~r~0); {2453#(< ~counter~0 19)} is VALID [2022-04-08 12:41:22,218 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2252#true} {2453#(< ~counter~0 19)} #63#return; {2453#(< ~counter~0 19)} is VALID [2022-04-08 12:41:22,218 INFO L290 TraceCheckUtils]: 31: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-08 12:41:22,218 INFO L290 TraceCheckUtils]: 30: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-08 12:41:22,218 INFO L290 TraceCheckUtils]: 29: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-08 12:41:22,218 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-08 12:41:22,219 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-08 12:41:22,219 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-08 12:41:22,219 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-08 12:41:22,220 INFO L290 TraceCheckUtils]: 24: Hoare triple {2481#(< ~counter~0 18)} assume !!(0 != ~r~0); {2481#(< ~counter~0 18)} is VALID [2022-04-08 12:41:22,220 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2252#true} {2481#(< ~counter~0 18)} #63#return; {2481#(< ~counter~0 18)} is VALID [2022-04-08 12:41:22,220 INFO L290 TraceCheckUtils]: 22: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-08 12:41:22,220 INFO L290 TraceCheckUtils]: 21: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-08 12:41:22,220 INFO L290 TraceCheckUtils]: 20: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-08 12:41:22,220 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-08 12:41:22,221 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-08 12:41:22,221 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-08 12:41:22,221 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-08 12:41:22,222 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2252#true} {2509#(< ~counter~0 17)} #61#return; {2509#(< ~counter~0 17)} is VALID [2022-04-08 12:41:22,222 INFO L290 TraceCheckUtils]: 14: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-08 12:41:22,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-08 12:41:22,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-08 12:41:22,222 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-08 12:41:22,223 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2252#true} {2509#(< ~counter~0 17)} #59#return; {2509#(< ~counter~0 17)} is VALID [2022-04-08 12:41:22,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {2252#true} assume true; {2252#true} is VALID [2022-04-08 12:41:22,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {2252#true} assume !(0 == ~cond); {2252#true} is VALID [2022-04-08 12:41:22,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {2252#true} ~cond := #in~cond; {2252#true} is VALID [2022-04-08 12:41:22,223 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-08 12:41:22,223 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-08 12:41:22,224 INFO L272 TraceCheckUtils]: 4: Hoare triple {2509#(< ~counter~0 17)} call #t~ret7 := main(); {2509#(< ~counter~0 17)} is VALID [2022-04-08 12:41:22,224 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2509#(< ~counter~0 17)} {2252#true} #67#return; {2509#(< ~counter~0 17)} is VALID [2022-04-08 12:41:22,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {2509#(< ~counter~0 17)} assume true; {2509#(< ~counter~0 17)} is VALID [2022-04-08 12:41:22,225 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-08 12:41:22,225 INFO L272 TraceCheckUtils]: 0: Hoare triple {2252#true} call ULTIMATE.init(); {2252#true} is VALID [2022-04-08 12:41:22,225 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-08 12:41:22,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:22,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176159363] [2022-04-08 12:41:22,225 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:22,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1489035293] [2022-04-08 12:41:22,225 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1489035293] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:22,226 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:22,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-08 12:41:22,226 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:22,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1018064714] [2022-04-08 12:41:22,226 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1018064714] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:22,226 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:22,226 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-08 12:41:22,226 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [93145553] [2022-04-08 12:41:22,226 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:22,227 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-08 12:41:22,227 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:22,227 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-08 12:41:22,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:22,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-08 12:41:22,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-08 12:41:22,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-08 12:41:22,257 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-08 12:41:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:22,405 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-04-08 12:41:22,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-08 12:41:22,405 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-08 12:41:22,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:22,406 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-08 12:41:22,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-08 12:41:22,407 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-08 12:41:22,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 65 transitions. [2022-04-08 12:41:22,408 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 65 transitions. [2022-04-08 12:41:22,450 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:22,451 INFO L225 Difference]: With dead ends: 61 [2022-04-08 12:41:22,451 INFO L226 Difference]: Without dead ends: 56 [2022-04-08 12:41:22,459 INFO L912 BasicCegarLoop]: 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-08 12:41:22,460 INFO L913 BasicCegarLoop]: 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-08 12:41:22,460 INFO L914 BasicCegarLoop]: 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-08 12:41:22,461 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-04-08 12:41:22,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-04-08 12:41:22,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:22,504 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-08 12:41:22,505 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-08 12:41:22,505 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-08 12:41:22,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:22,506 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-08 12:41:22,506 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-08 12:41:22,507 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:22,507 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:22,507 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-08 12:41:22,507 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-08 12:41:22,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:22,508 INFO L93 Difference]: Finished difference Result 56 states and 61 transitions. [2022-04-08 12:41:22,508 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-08 12:41:22,509 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:22,509 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:22,509 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:22,509 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:22,509 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-08 12:41:22,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 61 transitions. [2022-04-08 12:41:22,510 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 61 transitions. Word has length 50 [2022-04-08 12:41:22,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:22,510 INFO L478 AbstractCegarLoop]: Abstraction has 56 states and 61 transitions. [2022-04-08 12:41:22,510 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.714285714285714) internal successors, (33), 6 states have internal predecessors, (33), 6 states have call successors, (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-08 12:41:22,510 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 56 states and 61 transitions. [2022-04-08 12:41:24,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 60 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:24,575 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 61 transitions. [2022-04-08 12:41:24,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-08 12:41:24,575 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:24,575 INFO L499 BasicCegarLoop]: 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-08 12:41:24,592 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:24,779 WARN L460 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-08 12:41:24,780 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:24,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 7 times [2022-04-08 12:41:24,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:24,780 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1327755490] [2022-04-08 12:41:24,780 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:24,780 INFO L85 PathProgramCache]: Analyzing trace with hash 1632159894, now seen corresponding path program 8 times [2022-04-08 12:41:24,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:24,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791803388] [2022-04-08 12:41:24,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:24,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:24,794 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:24,794 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [841282506] [2022-04-08 12:41:24,795 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:41:24,795 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:24,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:24,795 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:24,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-04-08 12:41:24,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:41:24,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:24,838 INFO L263 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-08 12:41:24,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:24,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:25,108 INFO L272 TraceCheckUtils]: 0: Hoare triple {2915#true} call ULTIMATE.init(); {2915#true} is VALID [2022-04-08 12:41:25,108 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-08 12:41:25,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {2923#(<= ~counter~0 0)} assume true; {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,109 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2923#(<= ~counter~0 0)} {2915#true} #67#return; {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,109 INFO L272 TraceCheckUtils]: 4: Hoare triple {2923#(<= ~counter~0 0)} call #t~ret7 := main(); {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,109 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-08 12:41:25,120 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-08 12:41:25,121 INFO L290 TraceCheckUtils]: 7: Hoare triple {2923#(<= ~counter~0 0)} ~cond := #in~cond; {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,121 INFO L290 TraceCheckUtils]: 8: Hoare triple {2923#(<= ~counter~0 0)} assume !(0 == ~cond); {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {2923#(<= ~counter~0 0)} assume true; {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,122 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2923#(<= ~counter~0 0)} {2923#(<= ~counter~0 0)} #59#return; {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,122 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-08 12:41:25,123 INFO L290 TraceCheckUtils]: 12: Hoare triple {2923#(<= ~counter~0 0)} ~cond := #in~cond; {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {2923#(<= ~counter~0 0)} assume !(0 == ~cond); {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {2923#(<= ~counter~0 0)} assume true; {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,124 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2923#(<= ~counter~0 0)} {2923#(<= ~counter~0 0)} #61#return; {2923#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:25,124 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-08 12:41:25,125 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-08 12:41:25,125 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-08 12:41:25,125 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-08 12:41:25,126 INFO L290 TraceCheckUtils]: 20: Hoare triple {2972#(<= ~counter~0 1)} ~cond := #in~cond; {2972#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:25,126 INFO L290 TraceCheckUtils]: 21: Hoare triple {2972#(<= ~counter~0 1)} assume !(0 == ~cond); {2972#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:25,126 INFO L290 TraceCheckUtils]: 22: Hoare triple {2972#(<= ~counter~0 1)} assume true; {2972#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:25,127 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2972#(<= ~counter~0 1)} {2972#(<= ~counter~0 1)} #63#return; {2972#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:25,127 INFO L290 TraceCheckUtils]: 24: Hoare triple {2972#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2972#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:25,127 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-08 12:41:25,128 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-08 12:41:25,128 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-08 12:41:25,129 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-08 12:41:25,129 INFO L290 TraceCheckUtils]: 29: Hoare triple {3000#(<= ~counter~0 2)} ~cond := #in~cond; {3000#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:25,129 INFO L290 TraceCheckUtils]: 30: Hoare triple {3000#(<= ~counter~0 2)} assume !(0 == ~cond); {3000#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:25,129 INFO L290 TraceCheckUtils]: 31: Hoare triple {3000#(<= ~counter~0 2)} assume true; {3000#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:25,130 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3000#(<= ~counter~0 2)} {3000#(<= ~counter~0 2)} #63#return; {3000#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:25,130 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3000#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:25,131 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-08 12:41:25,131 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-08 12:41:25,131 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-08 12:41:25,132 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-08 12:41:25,132 INFO L290 TraceCheckUtils]: 38: Hoare triple {3028#(<= ~counter~0 3)} ~cond := #in~cond; {3028#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:25,132 INFO L290 TraceCheckUtils]: 39: Hoare triple {3028#(<= ~counter~0 3)} assume !(0 == ~cond); {3028#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:25,133 INFO L290 TraceCheckUtils]: 40: Hoare triple {3028#(<= ~counter~0 3)} assume true; {3028#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:25,133 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3028#(<= ~counter~0 3)} {3028#(<= ~counter~0 3)} #63#return; {3028#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:25,133 INFO L290 TraceCheckUtils]: 42: Hoare triple {3028#(<= ~counter~0 3)} assume !!(0 != ~r~0); {3028#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:25,134 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-08 12:41:25,134 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-08 12:41:25,134 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-08 12:41:25,135 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-08 12:41:25,135 INFO L290 TraceCheckUtils]: 47: Hoare triple {3056#(<= ~counter~0 4)} ~cond := #in~cond; {3056#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:25,135 INFO L290 TraceCheckUtils]: 48: Hoare triple {3056#(<= ~counter~0 4)} assume !(0 == ~cond); {3056#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:25,136 INFO L290 TraceCheckUtils]: 49: Hoare triple {3056#(<= ~counter~0 4)} assume true; {3056#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:25,136 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3056#(<= ~counter~0 4)} {3056#(<= ~counter~0 4)} #63#return; {3056#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:25,136 INFO L290 TraceCheckUtils]: 51: Hoare triple {3056#(<= ~counter~0 4)} assume !!(0 != ~r~0); {3056#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:25,137 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-08 12:41:25,137 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-08 12:41:25,137 INFO L290 TraceCheckUtils]: 54: Hoare triple {3084#(<= |main_#t~post6| 4)} assume !(#t~post6 < 20);havoc #t~post6; {2916#false} is VALID [2022-04-08 12:41:25,137 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-08 12:41:25,137 INFO L290 TraceCheckUtils]: 56: Hoare triple {2916#false} ~cond := #in~cond; {2916#false} is VALID [2022-04-08 12:41:25,137 INFO L290 TraceCheckUtils]: 57: Hoare triple {2916#false} assume 0 == ~cond; {2916#false} is VALID [2022-04-08 12:41:25,138 INFO L290 TraceCheckUtils]: 58: Hoare triple {2916#false} assume !false; {2916#false} is VALID [2022-04-08 12:41:25,138 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-08 12:41:25,138 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:25,423 INFO L290 TraceCheckUtils]: 58: Hoare triple {2916#false} assume !false; {2916#false} is VALID [2022-04-08 12:41:25,424 INFO L290 TraceCheckUtils]: 57: Hoare triple {2916#false} assume 0 == ~cond; {2916#false} is VALID [2022-04-08 12:41:25,424 INFO L290 TraceCheckUtils]: 56: Hoare triple {2916#false} ~cond := #in~cond; {2916#false} is VALID [2022-04-08 12:41:25,424 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-08 12:41:25,424 INFO L290 TraceCheckUtils]: 54: Hoare triple {3112#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {2916#false} is VALID [2022-04-08 12:41:25,424 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-08 12:41:25,425 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-08 12:41:25,425 INFO L290 TraceCheckUtils]: 51: Hoare triple {3116#(< ~counter~0 20)} assume !!(0 != ~r~0); {3116#(< ~counter~0 20)} is VALID [2022-04-08 12:41:25,425 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {2915#true} {3116#(< ~counter~0 20)} #63#return; {3116#(< ~counter~0 20)} is VALID [2022-04-08 12:41:25,426 INFO L290 TraceCheckUtils]: 49: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-08 12:41:25,426 INFO L290 TraceCheckUtils]: 48: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-08 12:41:25,426 INFO L290 TraceCheckUtils]: 47: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-08 12:41:25,426 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-08 12:41:25,426 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-08 12:41:25,427 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-08 12:41:25,427 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-08 12:41:25,427 INFO L290 TraceCheckUtils]: 42: Hoare triple {3144#(< ~counter~0 19)} assume !!(0 != ~r~0); {3144#(< ~counter~0 19)} is VALID [2022-04-08 12:41:25,428 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {2915#true} {3144#(< ~counter~0 19)} #63#return; {3144#(< ~counter~0 19)} is VALID [2022-04-08 12:41:25,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-08 12:41:25,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-08 12:41:25,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-08 12:41:25,428 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-08 12:41:25,428 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-08 12:41:25,429 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-08 12:41:25,429 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-08 12:41:25,429 INFO L290 TraceCheckUtils]: 33: Hoare triple {3172#(< ~counter~0 18)} assume !!(0 != ~r~0); {3172#(< ~counter~0 18)} is VALID [2022-04-08 12:41:25,430 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {2915#true} {3172#(< ~counter~0 18)} #63#return; {3172#(< ~counter~0 18)} is VALID [2022-04-08 12:41:25,430 INFO L290 TraceCheckUtils]: 31: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-08 12:41:25,430 INFO L290 TraceCheckUtils]: 30: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-08 12:41:25,430 INFO L290 TraceCheckUtils]: 29: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-08 12:41:25,430 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-08 12:41:25,430 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-08 12:41:25,431 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-08 12:41:25,431 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-08 12:41:25,431 INFO L290 TraceCheckUtils]: 24: Hoare triple {3200#(< ~counter~0 17)} assume !!(0 != ~r~0); {3200#(< ~counter~0 17)} is VALID [2022-04-08 12:41:25,432 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2915#true} {3200#(< ~counter~0 17)} #63#return; {3200#(< ~counter~0 17)} is VALID [2022-04-08 12:41:25,432 INFO L290 TraceCheckUtils]: 22: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-08 12:41:25,432 INFO L290 TraceCheckUtils]: 21: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-08 12:41:25,432 INFO L290 TraceCheckUtils]: 20: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-08 12:41:25,432 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-08 12:41:25,433 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-08 12:41:25,433 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-08 12:41:25,433 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-08 12:41:25,434 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2915#true} {3228#(< ~counter~0 16)} #61#return; {3228#(< ~counter~0 16)} is VALID [2022-04-08 12:41:25,434 INFO L290 TraceCheckUtils]: 14: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-08 12:41:25,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-08 12:41:25,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-08 12:41:25,434 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-08 12:41:25,435 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2915#true} {3228#(< ~counter~0 16)} #59#return; {3228#(< ~counter~0 16)} is VALID [2022-04-08 12:41:25,435 INFO L290 TraceCheckUtils]: 9: Hoare triple {2915#true} assume true; {2915#true} is VALID [2022-04-08 12:41:25,435 INFO L290 TraceCheckUtils]: 8: Hoare triple {2915#true} assume !(0 == ~cond); {2915#true} is VALID [2022-04-08 12:41:25,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {2915#true} ~cond := #in~cond; {2915#true} is VALID [2022-04-08 12:41:25,435 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-08 12:41:25,435 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-08 12:41:25,436 INFO L272 TraceCheckUtils]: 4: Hoare triple {3228#(< ~counter~0 16)} call #t~ret7 := main(); {3228#(< ~counter~0 16)} is VALID [2022-04-08 12:41:25,436 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3228#(< ~counter~0 16)} {2915#true} #67#return; {3228#(< ~counter~0 16)} is VALID [2022-04-08 12:41:25,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {3228#(< ~counter~0 16)} assume true; {3228#(< ~counter~0 16)} is VALID [2022-04-08 12:41:25,437 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-08 12:41:25,437 INFO L272 TraceCheckUtils]: 0: Hoare triple {2915#true} call ULTIMATE.init(); {2915#true} is VALID [2022-04-08 12:41:25,437 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-08 12:41:25,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:25,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791803388] [2022-04-08 12:41:25,437 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:25,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [841282506] [2022-04-08 12:41:25,437 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [841282506] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:25,437 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:25,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-08 12:41:25,438 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:25,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1327755490] [2022-04-08 12:41:25,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1327755490] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:25,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:25,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-08 12:41:25,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1325541413] [2022-04-08 12:41:25,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:25,439 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-08 12:41:25,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:25,439 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-08 12:41:25,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:25,475 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-08 12:41:25,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:25,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-08 12:41:25,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-08 12:41:25,476 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-08 12:41:25,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:25,677 INFO L93 Difference]: Finished difference Result 70 states and 76 transitions. [2022-04-08 12:41:25,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-08 12:41:25,678 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-08 12:41:25,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:25,678 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-08 12:41:25,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-08 12:41:25,681 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-08 12:41:25,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 75 transitions. [2022-04-08 12:41:25,682 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 75 transitions. [2022-04-08 12:41:25,731 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-08 12:41:25,733 INFO L225 Difference]: With dead ends: 70 [2022-04-08 12:41:25,733 INFO L226 Difference]: Without dead ends: 65 [2022-04-08 12:41:25,733 INFO L912 BasicCegarLoop]: 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-08 12:41:25,734 INFO L913 BasicCegarLoop]: 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-08 12:41:25,734 INFO L914 BasicCegarLoop]: 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-08 12:41:25,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-04-08 12:41:25,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-04-08 12:41:25,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:25,787 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-08 12:41:25,788 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-08 12:41:25,788 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-08 12:41:25,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:25,790 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-08 12:41:25,790 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-08 12:41:25,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:25,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:25,791 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-08 12:41:25,796 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-08 12:41:25,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:25,798 INFO L93 Difference]: Finished difference Result 65 states and 71 transitions. [2022-04-08 12:41:25,798 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-08 12:41:25,798 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:25,799 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:25,799 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:25,799 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:25,799 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-08 12:41:25,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 71 transitions. [2022-04-08 12:41:25,801 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 71 transitions. Word has length 59 [2022-04-08 12:41:25,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:25,801 INFO L478 AbstractCegarLoop]: Abstraction has 65 states and 71 transitions. [2022-04-08 12:41:25,802 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.0) internal successors, (40), 7 states have internal predecessors, (40), 7 states have call successors, (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-08 12:41:25,803 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 65 states and 71 transitions. [2022-04-08 12:41:26,120 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-08 12:41:26,120 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 71 transitions. [2022-04-08 12:41:26,121 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2022-04-08 12:41:26,121 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:26,121 INFO L499 BasicCegarLoop]: 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-08 12:41:26,137 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-04-08 12:41:26,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2022-04-08 12:41:26,335 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 9 times [2022-04-08 12:41:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:26,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408260993] [2022-04-08 12:41:26,336 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1512407140, now seen corresponding path program 10 times [2022-04-08 12:41:26,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:26,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1865909895] [2022-04-08 12:41:26,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:26,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:26,363 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:26,363 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625130403] [2022-04-08 12:41:26,363 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:41:26,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:26,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:26,368 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:26,369 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-04-08 12:41:26,506 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:41:26,507 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:26,508 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-08 12:41:26,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:26,520 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:26,835 INFO L272 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2022-04-08 12:41:26,835 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-08 12:41:26,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {3698#(<= ~counter~0 0)} assume true; {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,836 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3698#(<= ~counter~0 0)} {3690#true} #67#return; {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,836 INFO L272 TraceCheckUtils]: 4: Hoare triple {3698#(<= ~counter~0 0)} call #t~ret7 := main(); {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,836 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-08 12:41:26,837 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-08 12:41:26,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {3698#(<= ~counter~0 0)} ~cond := #in~cond; {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {3698#(<= ~counter~0 0)} assume !(0 == ~cond); {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,838 INFO L290 TraceCheckUtils]: 9: Hoare triple {3698#(<= ~counter~0 0)} assume true; {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,838 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3698#(<= ~counter~0 0)} {3698#(<= ~counter~0 0)} #59#return; {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,839 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-08 12:41:26,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {3698#(<= ~counter~0 0)} ~cond := #in~cond; {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {3698#(<= ~counter~0 0)} assume !(0 == ~cond); {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,840 INFO L290 TraceCheckUtils]: 14: Hoare triple {3698#(<= ~counter~0 0)} assume true; {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,840 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3698#(<= ~counter~0 0)} {3698#(<= ~counter~0 0)} #61#return; {3698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:26,841 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-08 12:41:26,841 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-08 12:41:26,842 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-08 12:41:26,842 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-08 12:41:26,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {3747#(<= ~counter~0 1)} ~cond := #in~cond; {3747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:26,843 INFO L290 TraceCheckUtils]: 21: Hoare triple {3747#(<= ~counter~0 1)} assume !(0 == ~cond); {3747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:26,843 INFO L290 TraceCheckUtils]: 22: Hoare triple {3747#(<= ~counter~0 1)} assume true; {3747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:26,844 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3747#(<= ~counter~0 1)} {3747#(<= ~counter~0 1)} #63#return; {3747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:26,844 INFO L290 TraceCheckUtils]: 24: Hoare triple {3747#(<= ~counter~0 1)} assume !!(0 != ~r~0); {3747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:26,844 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-08 12:41:26,845 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-08 12:41:26,845 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-08 12:41:26,846 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-08 12:41:26,846 INFO L290 TraceCheckUtils]: 29: Hoare triple {3775#(<= ~counter~0 2)} ~cond := #in~cond; {3775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:26,847 INFO L290 TraceCheckUtils]: 30: Hoare triple {3775#(<= ~counter~0 2)} assume !(0 == ~cond); {3775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:26,847 INFO L290 TraceCheckUtils]: 31: Hoare triple {3775#(<= ~counter~0 2)} assume true; {3775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:26,848 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3775#(<= ~counter~0 2)} {3775#(<= ~counter~0 2)} #63#return; {3775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:26,848 INFO L290 TraceCheckUtils]: 33: Hoare triple {3775#(<= ~counter~0 2)} assume !!(0 != ~r~0); {3775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:26,848 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-08 12:41:26,849 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-08 12:41:26,849 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-08 12:41:26,850 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-08 12:41:26,850 INFO L290 TraceCheckUtils]: 38: Hoare triple {3803#(<= ~counter~0 3)} ~cond := #in~cond; {3803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:26,851 INFO L290 TraceCheckUtils]: 39: Hoare triple {3803#(<= ~counter~0 3)} assume !(0 == ~cond); {3803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:26,851 INFO L290 TraceCheckUtils]: 40: Hoare triple {3803#(<= ~counter~0 3)} assume true; {3803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:26,852 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3803#(<= ~counter~0 3)} {3803#(<= ~counter~0 3)} #63#return; {3803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:26,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {3803#(<= ~counter~0 3)} assume !!(0 != ~r~0); {3803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:26,852 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-08 12:41:26,853 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-08 12:41:26,853 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-08 12:41:26,854 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-08 12:41:26,854 INFO L290 TraceCheckUtils]: 47: Hoare triple {3831#(<= ~counter~0 4)} ~cond := #in~cond; {3831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:26,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {3831#(<= ~counter~0 4)} assume !(0 == ~cond); {3831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:26,854 INFO L290 TraceCheckUtils]: 49: Hoare triple {3831#(<= ~counter~0 4)} assume true; {3831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:26,855 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3831#(<= ~counter~0 4)} {3831#(<= ~counter~0 4)} #63#return; {3831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:26,855 INFO L290 TraceCheckUtils]: 51: Hoare triple {3831#(<= ~counter~0 4)} assume !!(0 != ~r~0); {3831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:26,856 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-08 12:41:26,856 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-08 12:41:26,856 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-08 12:41:26,857 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-08 12:41:26,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {3859#(<= ~counter~0 5)} ~cond := #in~cond; {3859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:26,857 INFO L290 TraceCheckUtils]: 57: Hoare triple {3859#(<= ~counter~0 5)} assume !(0 == ~cond); {3859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:26,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {3859#(<= ~counter~0 5)} assume true; {3859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:26,858 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3859#(<= ~counter~0 5)} {3859#(<= ~counter~0 5)} #63#return; {3859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:26,859 INFO L290 TraceCheckUtils]: 60: Hoare triple {3859#(<= ~counter~0 5)} assume !!(0 != ~r~0); {3859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:26,859 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-08 12:41:26,859 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-08 12:41:26,860 INFO L290 TraceCheckUtils]: 63: Hoare triple {3887#(<= |main_#t~post6| 5)} assume !(#t~post6 < 20);havoc #t~post6; {3691#false} is VALID [2022-04-08 12:41:26,860 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-08 12:41:26,860 INFO L290 TraceCheckUtils]: 65: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2022-04-08 12:41:26,860 INFO L290 TraceCheckUtils]: 66: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2022-04-08 12:41:26,860 INFO L290 TraceCheckUtils]: 67: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2022-04-08 12:41:26,860 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-08 12:41:26,860 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:27,211 INFO L290 TraceCheckUtils]: 67: Hoare triple {3691#false} assume !false; {3691#false} is VALID [2022-04-08 12:41:27,212 INFO L290 TraceCheckUtils]: 66: Hoare triple {3691#false} assume 0 == ~cond; {3691#false} is VALID [2022-04-08 12:41:27,212 INFO L290 TraceCheckUtils]: 65: Hoare triple {3691#false} ~cond := #in~cond; {3691#false} is VALID [2022-04-08 12:41:27,212 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-08 12:41:27,212 INFO L290 TraceCheckUtils]: 63: Hoare triple {3915#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {3691#false} is VALID [2022-04-08 12:41:27,212 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-08 12:41:27,213 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-08 12:41:27,213 INFO L290 TraceCheckUtils]: 60: Hoare triple {3919#(< ~counter~0 20)} assume !!(0 != ~r~0); {3919#(< ~counter~0 20)} is VALID [2022-04-08 12:41:27,214 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {3690#true} {3919#(< ~counter~0 20)} #63#return; {3919#(< ~counter~0 20)} is VALID [2022-04-08 12:41:27,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-08 12:41:27,214 INFO L290 TraceCheckUtils]: 57: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-08 12:41:27,214 INFO L290 TraceCheckUtils]: 56: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-08 12:41:27,214 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-08 12:41:27,214 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-08 12:41:27,215 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-08 12:41:27,215 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-08 12:41:27,215 INFO L290 TraceCheckUtils]: 51: Hoare triple {3947#(< ~counter~0 19)} assume !!(0 != ~r~0); {3947#(< ~counter~0 19)} is VALID [2022-04-08 12:41:27,216 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {3690#true} {3947#(< ~counter~0 19)} #63#return; {3947#(< ~counter~0 19)} is VALID [2022-04-08 12:41:27,216 INFO L290 TraceCheckUtils]: 49: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-08 12:41:27,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-08 12:41:27,216 INFO L290 TraceCheckUtils]: 47: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-08 12:41:27,216 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-08 12:41:27,217 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-08 12:41:27,217 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-08 12:41:27,217 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-08 12:41:27,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {3975#(< ~counter~0 18)} assume !!(0 != ~r~0); {3975#(< ~counter~0 18)} is VALID [2022-04-08 12:41:27,218 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {3690#true} {3975#(< ~counter~0 18)} #63#return; {3975#(< ~counter~0 18)} is VALID [2022-04-08 12:41:27,219 INFO L290 TraceCheckUtils]: 40: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-08 12:41:27,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-08 12:41:27,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-08 12:41:27,219 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-08 12:41:27,219 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-08 12:41:27,219 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-08 12:41:27,220 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-08 12:41:27,220 INFO L290 TraceCheckUtils]: 33: Hoare triple {4003#(< ~counter~0 17)} assume !!(0 != ~r~0); {4003#(< ~counter~0 17)} is VALID [2022-04-08 12:41:27,221 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {3690#true} {4003#(< ~counter~0 17)} #63#return; {4003#(< ~counter~0 17)} is VALID [2022-04-08 12:41:27,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-08 12:41:27,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-08 12:41:27,221 INFO L290 TraceCheckUtils]: 29: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-08 12:41:27,221 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-08 12:41:27,221 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-08 12:41:27,222 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-08 12:41:27,222 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-08 12:41:27,222 INFO L290 TraceCheckUtils]: 24: Hoare triple {4031#(< ~counter~0 16)} assume !!(0 != ~r~0); {4031#(< ~counter~0 16)} is VALID [2022-04-08 12:41:27,223 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3690#true} {4031#(< ~counter~0 16)} #63#return; {4031#(< ~counter~0 16)} is VALID [2022-04-08 12:41:27,223 INFO L290 TraceCheckUtils]: 22: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-08 12:41:27,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-08 12:41:27,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-08 12:41:27,223 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-08 12:41:27,224 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-08 12:41:27,224 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-08 12:41:27,224 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-08 12:41:27,225 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3690#true} {4059#(< ~counter~0 15)} #61#return; {4059#(< ~counter~0 15)} is VALID [2022-04-08 12:41:27,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-08 12:41:27,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-08 12:41:27,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-08 12:41:27,225 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-08 12:41:27,225 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3690#true} {4059#(< ~counter~0 15)} #59#return; {4059#(< ~counter~0 15)} is VALID [2022-04-08 12:41:27,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {3690#true} assume true; {3690#true} is VALID [2022-04-08 12:41:27,226 INFO L290 TraceCheckUtils]: 8: Hoare triple {3690#true} assume !(0 == ~cond); {3690#true} is VALID [2022-04-08 12:41:27,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {3690#true} ~cond := #in~cond; {3690#true} is VALID [2022-04-08 12:41:27,226 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-08 12:41:27,226 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-08 12:41:27,226 INFO L272 TraceCheckUtils]: 4: Hoare triple {4059#(< ~counter~0 15)} call #t~ret7 := main(); {4059#(< ~counter~0 15)} is VALID [2022-04-08 12:41:27,227 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4059#(< ~counter~0 15)} {3690#true} #67#return; {4059#(< ~counter~0 15)} is VALID [2022-04-08 12:41:27,227 INFO L290 TraceCheckUtils]: 2: Hoare triple {4059#(< ~counter~0 15)} assume true; {4059#(< ~counter~0 15)} is VALID [2022-04-08 12:41:27,227 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-08 12:41:27,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {3690#true} call ULTIMATE.init(); {3690#true} is VALID [2022-04-08 12:41:27,228 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-08 12:41:27,228 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:27,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1865909895] [2022-04-08 12:41:27,228 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:27,228 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625130403] [2022-04-08 12:41:27,228 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625130403] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:27,228 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:27,228 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-08 12:41:27,229 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:27,229 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408260993] [2022-04-08 12:41:27,229 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408260993] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:27,229 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:27,229 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-08 12:41:27,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175442129] [2022-04-08 12:41:27,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:27,229 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-08 12:41:27,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:27,230 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-08 12:41:27,273 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:27,273 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-08 12:41:27,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:27,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-08 12:41:27,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-08 12:41:27,274 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-08 12:41:27,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:27,492 INFO L93 Difference]: Finished difference Result 79 states and 86 transitions. [2022-04-08 12:41:27,492 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-08 12:41:27,493 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-08 12:41:27,494 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:27,494 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-08 12:41:27,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-08 12:41:27,502 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-08 12:41:27,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 85 transitions. [2022-04-08 12:41:27,505 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 85 transitions. [2022-04-08 12:41:27,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:27,561 INFO L225 Difference]: With dead ends: 79 [2022-04-08 12:41:27,561 INFO L226 Difference]: Without dead ends: 74 [2022-04-08 12:41:27,561 INFO L912 BasicCegarLoop]: 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-08 12:41:27,563 INFO L913 BasicCegarLoop]: 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-08 12:41:27,563 INFO L914 BasicCegarLoop]: 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-08 12:41:27,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2022-04-08 12:41:27,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2022-04-08 12:41:27,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:27,630 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-08 12:41:27,630 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-08 12:41:27,630 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-08 12:41:27,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:27,632 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-08 12:41:27,632 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-08 12:41:27,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:27,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:27,633 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-08 12:41:27,633 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-08 12:41:27,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:27,634 INFO L93 Difference]: Finished difference Result 74 states and 81 transitions. [2022-04-08 12:41:27,634 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-08 12:41:27,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:27,634 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:27,634 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:27,634 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:27,635 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-08 12:41:27,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 81 transitions. [2022-04-08 12:41:27,636 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 81 transitions. Word has length 68 [2022-04-08 12:41:27,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:27,636 INFO L478 AbstractCegarLoop]: Abstraction has 74 states and 81 transitions. [2022-04-08 12:41:27,636 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.222222222222222) internal successors, (47), 8 states have internal predecessors, (47), 8 states have call successors, (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-08 12:41:27,636 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 74 states and 81 transitions. [2022-04-08 12:41:29,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:29,217 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 81 transitions. [2022-04-08 12:41:29,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2022-04-08 12:41:29,217 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:29,217 INFO L499 BasicCegarLoop]: 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-08 12:41:29,233 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:29,418 WARN L460 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-08 12:41:29,418 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:29,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:29,418 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 11 times [2022-04-08 12:41:29,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:29,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1867012860] [2022-04-08 12:41:29,419 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:29,419 INFO L85 PathProgramCache]: Analyzing trace with hash 771706710, now seen corresponding path program 12 times [2022-04-08 12:41:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:29,419 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278898087] [2022-04-08 12:41:29,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:29,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:29,445 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:29,445 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1477168275] [2022-04-08 12:41:29,445 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:41:29,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:29,445 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:29,447 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:29,471 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-04-08 12:41:29,571 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-08 12:41:29,571 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:29,572 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-08 12:41:29,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:29,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:29,915 INFO L272 TraceCheckUtils]: 0: Hoare triple {4577#true} call ULTIMATE.init(); {4577#true} is VALID [2022-04-08 12:41:29,916 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-08 12:41:29,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {4585#(<= ~counter~0 0)} assume true; {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,916 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4585#(<= ~counter~0 0)} {4577#true} #67#return; {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,916 INFO L272 TraceCheckUtils]: 4: Hoare triple {4585#(<= ~counter~0 0)} call #t~ret7 := main(); {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,917 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-08 12:41:29,917 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-08 12:41:29,917 INFO L290 TraceCheckUtils]: 7: Hoare triple {4585#(<= ~counter~0 0)} ~cond := #in~cond; {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,918 INFO L290 TraceCheckUtils]: 8: Hoare triple {4585#(<= ~counter~0 0)} assume !(0 == ~cond); {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {4585#(<= ~counter~0 0)} assume true; {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,918 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4585#(<= ~counter~0 0)} {4585#(<= ~counter~0 0)} #59#return; {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,919 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-08 12:41:29,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {4585#(<= ~counter~0 0)} ~cond := #in~cond; {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {4585#(<= ~counter~0 0)} assume !(0 == ~cond); {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {4585#(<= ~counter~0 0)} assume true; {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,920 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4585#(<= ~counter~0 0)} {4585#(<= ~counter~0 0)} #61#return; {4585#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:29,920 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-08 12:41:29,928 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-08 12:41:29,928 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-08 12:41:29,929 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-08 12:41:29,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {4634#(<= ~counter~0 1)} ~cond := #in~cond; {4634#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:29,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {4634#(<= ~counter~0 1)} assume !(0 == ~cond); {4634#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:29,929 INFO L290 TraceCheckUtils]: 22: Hoare triple {4634#(<= ~counter~0 1)} assume true; {4634#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:29,930 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4634#(<= ~counter~0 1)} {4634#(<= ~counter~0 1)} #63#return; {4634#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:29,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {4634#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4634#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:29,930 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-08 12:41:29,931 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-08 12:41:29,931 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-08 12:41:29,932 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-08 12:41:29,932 INFO L290 TraceCheckUtils]: 29: Hoare triple {4662#(<= ~counter~0 2)} ~cond := #in~cond; {4662#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:29,932 INFO L290 TraceCheckUtils]: 30: Hoare triple {4662#(<= ~counter~0 2)} assume !(0 == ~cond); {4662#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:29,932 INFO L290 TraceCheckUtils]: 31: Hoare triple {4662#(<= ~counter~0 2)} assume true; {4662#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:29,933 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4662#(<= ~counter~0 2)} {4662#(<= ~counter~0 2)} #63#return; {4662#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:29,933 INFO L290 TraceCheckUtils]: 33: Hoare triple {4662#(<= ~counter~0 2)} assume !!(0 != ~r~0); {4662#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:29,933 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-08 12:41:29,951 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-08 12:41:29,951 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-08 12:41:29,952 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-08 12:41:29,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {4690#(<= ~counter~0 3)} ~cond := #in~cond; {4690#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:29,952 INFO L290 TraceCheckUtils]: 39: Hoare triple {4690#(<= ~counter~0 3)} assume !(0 == ~cond); {4690#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:29,953 INFO L290 TraceCheckUtils]: 40: Hoare triple {4690#(<= ~counter~0 3)} assume true; {4690#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:29,953 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4690#(<= ~counter~0 3)} {4690#(<= ~counter~0 3)} #63#return; {4690#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:29,954 INFO L290 TraceCheckUtils]: 42: Hoare triple {4690#(<= ~counter~0 3)} assume !!(0 != ~r~0); {4690#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:29,954 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-08 12:41:29,954 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-08 12:41:29,955 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-08 12:41:29,955 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-08 12:41:29,955 INFO L290 TraceCheckUtils]: 47: Hoare triple {4718#(<= ~counter~0 4)} ~cond := #in~cond; {4718#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:29,956 INFO L290 TraceCheckUtils]: 48: Hoare triple {4718#(<= ~counter~0 4)} assume !(0 == ~cond); {4718#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:29,956 INFO L290 TraceCheckUtils]: 49: Hoare triple {4718#(<= ~counter~0 4)} assume true; {4718#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:29,956 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4718#(<= ~counter~0 4)} {4718#(<= ~counter~0 4)} #63#return; {4718#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:29,957 INFO L290 TraceCheckUtils]: 51: Hoare triple {4718#(<= ~counter~0 4)} assume !!(0 != ~r~0); {4718#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:29,957 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-08 12:41:29,957 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-08 12:41:29,958 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-08 12:41:29,958 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-08 12:41:29,959 INFO L290 TraceCheckUtils]: 56: Hoare triple {4746#(<= ~counter~0 5)} ~cond := #in~cond; {4746#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:29,959 INFO L290 TraceCheckUtils]: 57: Hoare triple {4746#(<= ~counter~0 5)} assume !(0 == ~cond); {4746#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:29,959 INFO L290 TraceCheckUtils]: 58: Hoare triple {4746#(<= ~counter~0 5)} assume true; {4746#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:29,960 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4746#(<= ~counter~0 5)} {4746#(<= ~counter~0 5)} #63#return; {4746#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:29,960 INFO L290 TraceCheckUtils]: 60: Hoare triple {4746#(<= ~counter~0 5)} assume !!(0 != ~r~0); {4746#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:29,960 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-08 12:41:29,961 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-08 12:41:29,961 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-08 12:41:29,961 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-08 12:41:29,962 INFO L290 TraceCheckUtils]: 65: Hoare triple {4774#(<= ~counter~0 6)} ~cond := #in~cond; {4774#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:29,962 INFO L290 TraceCheckUtils]: 66: Hoare triple {4774#(<= ~counter~0 6)} assume !(0 == ~cond); {4774#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:29,962 INFO L290 TraceCheckUtils]: 67: Hoare triple {4774#(<= ~counter~0 6)} assume true; {4774#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:29,963 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4774#(<= ~counter~0 6)} {4774#(<= ~counter~0 6)} #63#return; {4774#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:29,963 INFO L290 TraceCheckUtils]: 69: Hoare triple {4774#(<= ~counter~0 6)} assume !!(0 != ~r~0); {4774#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:29,963 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-08 12:41:29,964 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-08 12:41:29,964 INFO L290 TraceCheckUtils]: 72: Hoare triple {4802#(<= |main_#t~post6| 6)} assume !(#t~post6 < 20);havoc #t~post6; {4578#false} is VALID [2022-04-08 12:41:29,964 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-08 12:41:29,964 INFO L290 TraceCheckUtils]: 74: Hoare triple {4578#false} ~cond := #in~cond; {4578#false} is VALID [2022-04-08 12:41:29,964 INFO L290 TraceCheckUtils]: 75: Hoare triple {4578#false} assume 0 == ~cond; {4578#false} is VALID [2022-04-08 12:41:29,964 INFO L290 TraceCheckUtils]: 76: Hoare triple {4578#false} assume !false; {4578#false} is VALID [2022-04-08 12:41:29,964 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-08 12:41:29,965 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:30,313 INFO L290 TraceCheckUtils]: 76: Hoare triple {4578#false} assume !false; {4578#false} is VALID [2022-04-08 12:41:30,313 INFO L290 TraceCheckUtils]: 75: Hoare triple {4578#false} assume 0 == ~cond; {4578#false} is VALID [2022-04-08 12:41:30,314 INFO L290 TraceCheckUtils]: 74: Hoare triple {4578#false} ~cond := #in~cond; {4578#false} is VALID [2022-04-08 12:41:30,314 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-08 12:41:30,314 INFO L290 TraceCheckUtils]: 72: Hoare triple {4830#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {4578#false} is VALID [2022-04-08 12:41:30,314 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-08 12:41:30,315 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-08 12:41:30,315 INFO L290 TraceCheckUtils]: 69: Hoare triple {4834#(< ~counter~0 20)} assume !!(0 != ~r~0); {4834#(< ~counter~0 20)} is VALID [2022-04-08 12:41:30,316 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {4577#true} {4834#(< ~counter~0 20)} #63#return; {4834#(< ~counter~0 20)} is VALID [2022-04-08 12:41:30,316 INFO L290 TraceCheckUtils]: 67: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-08 12:41:30,316 INFO L290 TraceCheckUtils]: 66: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-08 12:41:30,316 INFO L290 TraceCheckUtils]: 65: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-08 12:41:30,316 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-08 12:41:30,316 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-08 12:41:30,317 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-08 12:41:30,317 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-08 12:41:30,317 INFO L290 TraceCheckUtils]: 60: Hoare triple {4862#(< ~counter~0 19)} assume !!(0 != ~r~0); {4862#(< ~counter~0 19)} is VALID [2022-04-08 12:41:30,318 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {4577#true} {4862#(< ~counter~0 19)} #63#return; {4862#(< ~counter~0 19)} is VALID [2022-04-08 12:41:30,318 INFO L290 TraceCheckUtils]: 58: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-08 12:41:30,318 INFO L290 TraceCheckUtils]: 57: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-08 12:41:30,318 INFO L290 TraceCheckUtils]: 56: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-08 12:41:30,318 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-08 12:41:30,319 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-08 12:41:30,319 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-08 12:41:30,319 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-08 12:41:30,320 INFO L290 TraceCheckUtils]: 51: Hoare triple {4890#(< ~counter~0 18)} assume !!(0 != ~r~0); {4890#(< ~counter~0 18)} is VALID [2022-04-08 12:41:30,320 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {4577#true} {4890#(< ~counter~0 18)} #63#return; {4890#(< ~counter~0 18)} is VALID [2022-04-08 12:41:30,320 INFO L290 TraceCheckUtils]: 49: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-08 12:41:30,320 INFO L290 TraceCheckUtils]: 48: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-08 12:41:30,321 INFO L290 TraceCheckUtils]: 47: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-08 12:41:30,321 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-08 12:41:30,321 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-08 12:41:30,321 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-08 12:41:30,322 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-08 12:41:30,322 INFO L290 TraceCheckUtils]: 42: Hoare triple {4918#(< ~counter~0 17)} assume !!(0 != ~r~0); {4918#(< ~counter~0 17)} is VALID [2022-04-08 12:41:30,323 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {4577#true} {4918#(< ~counter~0 17)} #63#return; {4918#(< ~counter~0 17)} is VALID [2022-04-08 12:41:30,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-08 12:41:30,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-08 12:41:30,323 INFO L290 TraceCheckUtils]: 38: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-08 12:41:30,323 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-08 12:41:30,323 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-08 12:41:30,324 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-08 12:41:30,324 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-08 12:41:30,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {4946#(< ~counter~0 16)} assume !!(0 != ~r~0); {4946#(< ~counter~0 16)} is VALID [2022-04-08 12:41:30,325 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {4577#true} {4946#(< ~counter~0 16)} #63#return; {4946#(< ~counter~0 16)} is VALID [2022-04-08 12:41:30,325 INFO L290 TraceCheckUtils]: 31: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-08 12:41:30,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-08 12:41:30,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-08 12:41:30,325 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-08 12:41:30,326 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-08 12:41:30,326 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-08 12:41:30,326 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-08 12:41:30,327 INFO L290 TraceCheckUtils]: 24: Hoare triple {4974#(< ~counter~0 15)} assume !!(0 != ~r~0); {4974#(< ~counter~0 15)} is VALID [2022-04-08 12:41:30,327 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4577#true} {4974#(< ~counter~0 15)} #63#return; {4974#(< ~counter~0 15)} is VALID [2022-04-08 12:41:30,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-08 12:41:30,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-08 12:41:30,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-08 12:41:30,328 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-08 12:41:30,328 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-08 12:41:30,328 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-08 12:41:30,329 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-08 12:41:30,329 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4577#true} {5002#(< ~counter~0 14)} #61#return; {5002#(< ~counter~0 14)} is VALID [2022-04-08 12:41:30,329 INFO L290 TraceCheckUtils]: 14: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-08 12:41:30,329 INFO L290 TraceCheckUtils]: 13: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-08 12:41:30,329 INFO L290 TraceCheckUtils]: 12: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-08 12:41:30,329 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-08 12:41:30,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4577#true} {5002#(< ~counter~0 14)} #59#return; {5002#(< ~counter~0 14)} is VALID [2022-04-08 12:41:30,330 INFO L290 TraceCheckUtils]: 9: Hoare triple {4577#true} assume true; {4577#true} is VALID [2022-04-08 12:41:30,330 INFO L290 TraceCheckUtils]: 8: Hoare triple {4577#true} assume !(0 == ~cond); {4577#true} is VALID [2022-04-08 12:41:30,330 INFO L290 TraceCheckUtils]: 7: Hoare triple {4577#true} ~cond := #in~cond; {4577#true} is VALID [2022-04-08 12:41:30,330 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-08 12:41:30,330 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-08 12:41:30,330 INFO L272 TraceCheckUtils]: 4: Hoare triple {5002#(< ~counter~0 14)} call #t~ret7 := main(); {5002#(< ~counter~0 14)} is VALID [2022-04-08 12:41:30,331 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5002#(< ~counter~0 14)} {4577#true} #67#return; {5002#(< ~counter~0 14)} is VALID [2022-04-08 12:41:30,331 INFO L290 TraceCheckUtils]: 2: Hoare triple {5002#(< ~counter~0 14)} assume true; {5002#(< ~counter~0 14)} is VALID [2022-04-08 12:41:30,331 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-08 12:41:30,332 INFO L272 TraceCheckUtils]: 0: Hoare triple {4577#true} call ULTIMATE.init(); {4577#true} is VALID [2022-04-08 12:41:30,332 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-08 12:41:30,332 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:30,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278898087] [2022-04-08 12:41:30,332 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:30,332 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1477168275] [2022-04-08 12:41:30,332 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1477168275] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:30,332 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:30,332 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-08 12:41:30,333 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:30,333 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1867012860] [2022-04-08 12:41:30,333 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1867012860] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:30,333 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:30,333 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-08 12:41:30,333 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1821953650] [2022-04-08 12:41:30,333 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:30,333 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-08 12:41:30,333 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:30,334 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-08 12:41:30,389 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-08 12:41:30,389 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-08 12:41:30,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:30,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-08 12:41:30,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-08 12:41:30,390 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-08 12:41:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:30,630 INFO L93 Difference]: Finished difference Result 88 states and 96 transitions. [2022-04-08 12:41:30,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-08 12:41:30,630 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-08 12:41:30,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:30,630 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-08 12:41:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-08 12:41:30,632 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-08 12:41:30,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 95 transitions. [2022-04-08 12:41:30,633 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 95 transitions. [2022-04-08 12:41:30,692 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-08 12:41:30,693 INFO L225 Difference]: With dead ends: 88 [2022-04-08 12:41:30,693 INFO L226 Difference]: Without dead ends: 83 [2022-04-08 12:41:30,693 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 159 GetRequests, 137 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=227, Invalid=325, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:41:30,694 INFO L913 BasicCegarLoop]: 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-08 12:41:30,694 INFO L914 BasicCegarLoop]: 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-08 12:41:30,694 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-04-08 12:41:30,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2022-04-08 12:41:30,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:30,775 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-08 12:41:30,775 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-08 12:41:30,775 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-08 12:41:30,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:30,777 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-08 12:41:30,777 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-08 12:41:30,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:30,777 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:30,777 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-08 12:41:30,777 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-08 12:41:30,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:30,778 INFO L93 Difference]: Finished difference Result 83 states and 91 transitions. [2022-04-08 12:41:30,778 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-08 12:41:30,779 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:30,779 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:30,779 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:30,779 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:30,779 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-08 12:41:30,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 91 transitions. [2022-04-08 12:41:30,780 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 91 transitions. Word has length 77 [2022-04-08 12:41:30,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:30,780 INFO L478 AbstractCegarLoop]: Abstraction has 83 states and 91 transitions. [2022-04-08 12:41:30,780 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.4) internal successors, (54), 9 states have internal predecessors, (54), 9 states have call successors, (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-08 12:41:30,780 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 83 states and 91 transitions. [2022-04-08 12:41:31,659 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:31,659 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 91 transitions. [2022-04-08 12:41:31,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2022-04-08 12:41:31,660 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:31,660 INFO L499 BasicCegarLoop]: 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-08 12:41:31,664 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:31,864 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-04-08 12:41:31,864 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:31,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:31,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 13 times [2022-04-08 12:41:31,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:31,864 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [100387790] [2022-04-08 12:41:31,865 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:31,865 INFO L85 PathProgramCache]: Analyzing trace with hash 1848611036, now seen corresponding path program 14 times [2022-04-08 12:41:31,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:31,865 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1488290260] [2022-04-08 12:41:31,865 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:31,865 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:31,875 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:31,876 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [752330488] [2022-04-08 12:41:31,876 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:41:31,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:31,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:31,876 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:31,877 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-04-08 12:41:31,918 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:41:31,918 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:31,919 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-08 12:41:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:31,932 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:32,310 INFO L272 TraceCheckUtils]: 0: Hoare triple {5576#true} call ULTIMATE.init(); {5576#true} is VALID [2022-04-08 12:41:32,311 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-08 12:41:32,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {5584#(<= ~counter~0 0)} assume true; {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,311 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5584#(<= ~counter~0 0)} {5576#true} #67#return; {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,311 INFO L272 TraceCheckUtils]: 4: Hoare triple {5584#(<= ~counter~0 0)} call #t~ret7 := main(); {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,312 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-08 12:41:32,312 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-08 12:41:32,312 INFO L290 TraceCheckUtils]: 7: Hoare triple {5584#(<= ~counter~0 0)} ~cond := #in~cond; {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,313 INFO L290 TraceCheckUtils]: 8: Hoare triple {5584#(<= ~counter~0 0)} assume !(0 == ~cond); {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,313 INFO L290 TraceCheckUtils]: 9: Hoare triple {5584#(<= ~counter~0 0)} assume true; {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,313 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5584#(<= ~counter~0 0)} {5584#(<= ~counter~0 0)} #59#return; {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,314 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-08 12:41:32,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {5584#(<= ~counter~0 0)} ~cond := #in~cond; {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,314 INFO L290 TraceCheckUtils]: 13: Hoare triple {5584#(<= ~counter~0 0)} assume !(0 == ~cond); {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,314 INFO L290 TraceCheckUtils]: 14: Hoare triple {5584#(<= ~counter~0 0)} assume true; {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,315 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5584#(<= ~counter~0 0)} {5584#(<= ~counter~0 0)} #61#return; {5584#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:32,315 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-08 12:41:32,316 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-08 12:41:32,316 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-08 12:41:32,316 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-08 12:41:32,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {5633#(<= ~counter~0 1)} ~cond := #in~cond; {5633#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:32,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {5633#(<= ~counter~0 1)} assume !(0 == ~cond); {5633#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:32,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {5633#(<= ~counter~0 1)} assume true; {5633#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:32,318 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5633#(<= ~counter~0 1)} {5633#(<= ~counter~0 1)} #63#return; {5633#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:32,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {5633#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5633#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:32,318 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-08 12:41:32,318 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-08 12:41:32,319 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-08 12:41:32,319 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-08 12:41:32,319 INFO L290 TraceCheckUtils]: 29: Hoare triple {5661#(<= ~counter~0 2)} ~cond := #in~cond; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:32,320 INFO L290 TraceCheckUtils]: 30: Hoare triple {5661#(<= ~counter~0 2)} assume !(0 == ~cond); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:32,320 INFO L290 TraceCheckUtils]: 31: Hoare triple {5661#(<= ~counter~0 2)} assume true; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:32,320 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5661#(<= ~counter~0 2)} {5661#(<= ~counter~0 2)} #63#return; {5661#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:32,321 INFO L290 TraceCheckUtils]: 33: Hoare triple {5661#(<= ~counter~0 2)} assume !!(0 != ~r~0); {5661#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:32,321 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-08 12:41:32,321 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-08 12:41:32,322 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-08 12:41:32,322 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-08 12:41:32,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {5689#(<= ~counter~0 3)} ~cond := #in~cond; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:32,323 INFO L290 TraceCheckUtils]: 39: Hoare triple {5689#(<= ~counter~0 3)} assume !(0 == ~cond); {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:32,323 INFO L290 TraceCheckUtils]: 40: Hoare triple {5689#(<= ~counter~0 3)} assume true; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:32,323 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5689#(<= ~counter~0 3)} {5689#(<= ~counter~0 3)} #63#return; {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:32,324 INFO L290 TraceCheckUtils]: 42: Hoare triple {5689#(<= ~counter~0 3)} assume !!(0 != ~r~0); {5689#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:32,324 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-08 12:41:32,324 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-08 12:41:32,324 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-08 12:41:32,327 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-08 12:41:32,327 INFO L290 TraceCheckUtils]: 47: Hoare triple {5717#(<= ~counter~0 4)} ~cond := #in~cond; {5717#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:32,327 INFO L290 TraceCheckUtils]: 48: Hoare triple {5717#(<= ~counter~0 4)} assume !(0 == ~cond); {5717#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:32,328 INFO L290 TraceCheckUtils]: 49: Hoare triple {5717#(<= ~counter~0 4)} assume true; {5717#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:32,328 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5717#(<= ~counter~0 4)} {5717#(<= ~counter~0 4)} #63#return; {5717#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:32,328 INFO L290 TraceCheckUtils]: 51: Hoare triple {5717#(<= ~counter~0 4)} assume !!(0 != ~r~0); {5717#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:32,329 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-08 12:41:32,329 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-08 12:41:32,329 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-08 12:41:32,330 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-08 12:41:32,330 INFO L290 TraceCheckUtils]: 56: Hoare triple {5745#(<= ~counter~0 5)} ~cond := #in~cond; {5745#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:32,330 INFO L290 TraceCheckUtils]: 57: Hoare triple {5745#(<= ~counter~0 5)} assume !(0 == ~cond); {5745#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:32,330 INFO L290 TraceCheckUtils]: 58: Hoare triple {5745#(<= ~counter~0 5)} assume true; {5745#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:32,331 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5745#(<= ~counter~0 5)} {5745#(<= ~counter~0 5)} #63#return; {5745#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:32,331 INFO L290 TraceCheckUtils]: 60: Hoare triple {5745#(<= ~counter~0 5)} assume !!(0 != ~r~0); {5745#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:32,331 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-08 12:41:32,332 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-08 12:41:32,332 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-08 12:41:32,333 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-08 12:41:32,333 INFO L290 TraceCheckUtils]: 65: Hoare triple {5773#(<= ~counter~0 6)} ~cond := #in~cond; {5773#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:32,333 INFO L290 TraceCheckUtils]: 66: Hoare triple {5773#(<= ~counter~0 6)} assume !(0 == ~cond); {5773#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:32,333 INFO L290 TraceCheckUtils]: 67: Hoare triple {5773#(<= ~counter~0 6)} assume true; {5773#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:32,334 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5773#(<= ~counter~0 6)} {5773#(<= ~counter~0 6)} #63#return; {5773#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:32,334 INFO L290 TraceCheckUtils]: 69: Hoare triple {5773#(<= ~counter~0 6)} assume !!(0 != ~r~0); {5773#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:32,334 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-08 12:41:32,335 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-08 12:41:32,335 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-08 12:41:32,336 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-08 12:41:32,336 INFO L290 TraceCheckUtils]: 74: Hoare triple {5801#(<= ~counter~0 7)} ~cond := #in~cond; {5801#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:32,336 INFO L290 TraceCheckUtils]: 75: Hoare triple {5801#(<= ~counter~0 7)} assume !(0 == ~cond); {5801#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:32,336 INFO L290 TraceCheckUtils]: 76: Hoare triple {5801#(<= ~counter~0 7)} assume true; {5801#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:32,337 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5801#(<= ~counter~0 7)} {5801#(<= ~counter~0 7)} #63#return; {5801#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:32,337 INFO L290 TraceCheckUtils]: 78: Hoare triple {5801#(<= ~counter~0 7)} assume !!(0 != ~r~0); {5801#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:32,337 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-08 12:41:32,338 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-08 12:41:32,338 INFO L290 TraceCheckUtils]: 81: Hoare triple {5829#(<= |main_#t~post6| 7)} assume !(#t~post6 < 20);havoc #t~post6; {5577#false} is VALID [2022-04-08 12:41:32,338 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-08 12:41:32,338 INFO L290 TraceCheckUtils]: 83: Hoare triple {5577#false} ~cond := #in~cond; {5577#false} is VALID [2022-04-08 12:41:32,338 INFO L290 TraceCheckUtils]: 84: Hoare triple {5577#false} assume 0 == ~cond; {5577#false} is VALID [2022-04-08 12:41:32,338 INFO L290 TraceCheckUtils]: 85: Hoare triple {5577#false} assume !false; {5577#false} is VALID [2022-04-08 12:41:32,339 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-08 12:41:32,339 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:32,740 INFO L290 TraceCheckUtils]: 85: Hoare triple {5577#false} assume !false; {5577#false} is VALID [2022-04-08 12:41:32,740 INFO L290 TraceCheckUtils]: 84: Hoare triple {5577#false} assume 0 == ~cond; {5577#false} is VALID [2022-04-08 12:41:32,740 INFO L290 TraceCheckUtils]: 83: Hoare triple {5577#false} ~cond := #in~cond; {5577#false} is VALID [2022-04-08 12:41:32,740 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-08 12:41:32,741 INFO L290 TraceCheckUtils]: 81: Hoare triple {5857#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {5577#false} is VALID [2022-04-08 12:41:32,741 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-08 12:41:32,741 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-08 12:41:32,741 INFO L290 TraceCheckUtils]: 78: Hoare triple {5861#(< ~counter~0 20)} assume !!(0 != ~r~0); {5861#(< ~counter~0 20)} is VALID [2022-04-08 12:41:32,742 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {5576#true} {5861#(< ~counter~0 20)} #63#return; {5861#(< ~counter~0 20)} is VALID [2022-04-08 12:41:32,742 INFO L290 TraceCheckUtils]: 76: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-08 12:41:32,742 INFO L290 TraceCheckUtils]: 75: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-08 12:41:32,742 INFO L290 TraceCheckUtils]: 74: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-08 12:41:32,742 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-08 12:41:32,743 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-08 12:41:32,743 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-08 12:41:32,743 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-08 12:41:32,744 INFO L290 TraceCheckUtils]: 69: Hoare triple {5889#(< ~counter~0 19)} assume !!(0 != ~r~0); {5889#(< ~counter~0 19)} is VALID [2022-04-08 12:41:32,744 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {5576#true} {5889#(< ~counter~0 19)} #63#return; {5889#(< ~counter~0 19)} is VALID [2022-04-08 12:41:32,744 INFO L290 TraceCheckUtils]: 67: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-08 12:41:32,744 INFO L290 TraceCheckUtils]: 66: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-08 12:41:32,744 INFO L290 TraceCheckUtils]: 65: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-08 12:41:32,744 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-08 12:41:32,745 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-08 12:41:32,745 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-08 12:41:32,745 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-08 12:41:32,745 INFO L290 TraceCheckUtils]: 60: Hoare triple {5917#(< ~counter~0 18)} assume !!(0 != ~r~0); {5917#(< ~counter~0 18)} is VALID [2022-04-08 12:41:32,746 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {5576#true} {5917#(< ~counter~0 18)} #63#return; {5917#(< ~counter~0 18)} is VALID [2022-04-08 12:41:32,746 INFO L290 TraceCheckUtils]: 58: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-08 12:41:32,746 INFO L290 TraceCheckUtils]: 57: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-08 12:41:32,746 INFO L290 TraceCheckUtils]: 56: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-08 12:41:32,746 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-08 12:41:32,746 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-08 12:41:32,747 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-08 12:41:32,747 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-08 12:41:32,747 INFO L290 TraceCheckUtils]: 51: Hoare triple {5945#(< ~counter~0 17)} assume !!(0 != ~r~0); {5945#(< ~counter~0 17)} is VALID [2022-04-08 12:41:32,748 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {5576#true} {5945#(< ~counter~0 17)} #63#return; {5945#(< ~counter~0 17)} is VALID [2022-04-08 12:41:32,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-08 12:41:32,748 INFO L290 TraceCheckUtils]: 48: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-08 12:41:32,748 INFO L290 TraceCheckUtils]: 47: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-08 12:41:32,748 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-08 12:41:32,748 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-08 12:41:32,749 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-08 12:41:32,749 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-08 12:41:32,749 INFO L290 TraceCheckUtils]: 42: Hoare triple {5973#(< ~counter~0 16)} assume !!(0 != ~r~0); {5973#(< ~counter~0 16)} is VALID [2022-04-08 12:41:32,750 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {5576#true} {5973#(< ~counter~0 16)} #63#return; {5973#(< ~counter~0 16)} is VALID [2022-04-08 12:41:32,750 INFO L290 TraceCheckUtils]: 40: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-08 12:41:32,750 INFO L290 TraceCheckUtils]: 39: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-08 12:41:32,750 INFO L290 TraceCheckUtils]: 38: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-08 12:41:32,750 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-08 12:41:32,750 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-08 12:41:32,751 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-08 12:41:32,751 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-08 12:41:32,751 INFO L290 TraceCheckUtils]: 33: Hoare triple {6001#(< ~counter~0 15)} assume !!(0 != ~r~0); {6001#(< ~counter~0 15)} is VALID [2022-04-08 12:41:32,752 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {5576#true} {6001#(< ~counter~0 15)} #63#return; {6001#(< ~counter~0 15)} is VALID [2022-04-08 12:41:32,752 INFO L290 TraceCheckUtils]: 31: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-08 12:41:32,752 INFO L290 TraceCheckUtils]: 30: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-08 12:41:32,752 INFO L290 TraceCheckUtils]: 29: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-08 12:41:32,752 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-08 12:41:32,752 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-08 12:41:32,753 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-08 12:41:32,753 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-08 12:41:32,753 INFO L290 TraceCheckUtils]: 24: Hoare triple {6029#(< ~counter~0 14)} assume !!(0 != ~r~0); {6029#(< ~counter~0 14)} is VALID [2022-04-08 12:41:32,754 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5576#true} {6029#(< ~counter~0 14)} #63#return; {6029#(< ~counter~0 14)} is VALID [2022-04-08 12:41:32,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-08 12:41:32,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-08 12:41:32,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-08 12:41:32,754 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-08 12:41:32,754 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-08 12:41:32,755 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-08 12:41:32,755 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-08 12:41:32,755 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5576#true} {6057#(< ~counter~0 13)} #61#return; {6057#(< ~counter~0 13)} is VALID [2022-04-08 12:41:32,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-08 12:41:32,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-08 12:41:32,755 INFO L290 TraceCheckUtils]: 12: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-08 12:41:32,756 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-08 12:41:32,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5576#true} {6057#(< ~counter~0 13)} #59#return; {6057#(< ~counter~0 13)} is VALID [2022-04-08 12:41:32,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {5576#true} assume true; {5576#true} is VALID [2022-04-08 12:41:32,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {5576#true} assume !(0 == ~cond); {5576#true} is VALID [2022-04-08 12:41:32,756 INFO L290 TraceCheckUtils]: 7: Hoare triple {5576#true} ~cond := #in~cond; {5576#true} is VALID [2022-04-08 12:41:32,756 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-08 12:41:32,756 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-08 12:41:32,757 INFO L272 TraceCheckUtils]: 4: Hoare triple {6057#(< ~counter~0 13)} call #t~ret7 := main(); {6057#(< ~counter~0 13)} is VALID [2022-04-08 12:41:32,757 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6057#(< ~counter~0 13)} {5576#true} #67#return; {6057#(< ~counter~0 13)} is VALID [2022-04-08 12:41:32,757 INFO L290 TraceCheckUtils]: 2: Hoare triple {6057#(< ~counter~0 13)} assume true; {6057#(< ~counter~0 13)} is VALID [2022-04-08 12:41:32,758 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-08 12:41:32,758 INFO L272 TraceCheckUtils]: 0: Hoare triple {5576#true} call ULTIMATE.init(); {5576#true} is VALID [2022-04-08 12:41:32,758 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-08 12:41:32,758 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:32,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1488290260] [2022-04-08 12:41:32,758 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:32,758 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [752330488] [2022-04-08 12:41:32,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [752330488] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:32,759 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:32,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-08 12:41:32,759 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:32,759 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [100387790] [2022-04-08 12:41:32,759 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [100387790] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:32,759 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:32,759 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-08 12:41:32,759 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712718406] [2022-04-08 12:41:32,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:32,760 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-08 12:41:32,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:32,760 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-08 12:41:32,809 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-08 12:41:32,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-08 12:41:32,809 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:32,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-08 12:41:32,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-08 12:41:32,810 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-08 12:41:33,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:33,077 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-04-08 12:41:33,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-04-08 12:41:33,077 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-08 12:41:33,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:33,078 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-08 12:41:33,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-08 12:41:33,079 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-08 12:41:33,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 105 transitions. [2022-04-08 12:41:33,081 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 18 states and 105 transitions. [2022-04-08 12:41:33,143 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-08 12:41:33,144 INFO L225 Difference]: With dead ends: 97 [2022-04-08 12:41:33,144 INFO L226 Difference]: Without dead ends: 92 [2022-04-08 12:41:33,144 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=291, Invalid=411, Unknown=0, NotChecked=0, Total=702 [2022-04-08 12:41:33,145 INFO L913 BasicCegarLoop]: 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-08 12:41:33,145 INFO L914 BasicCegarLoop]: 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-08 12:41:33,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-04-08 12:41:33,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2022-04-08 12:41:33,213 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:33,214 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-08 12:41:33,214 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-08 12:41:33,214 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-08 12:41:33,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:33,215 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-08 12:41:33,215 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-08 12:41:33,216 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:33,216 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:33,216 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-08 12:41:33,216 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-08 12:41:33,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:33,217 INFO L93 Difference]: Finished difference Result 92 states and 101 transitions. [2022-04-08 12:41:33,217 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-08 12:41:33,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:33,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:33,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:33,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:33,218 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-08 12:41:33,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 101 transitions. [2022-04-08 12:41:33,219 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 101 transitions. Word has length 86 [2022-04-08 12:41:33,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:33,219 INFO L478 AbstractCegarLoop]: Abstraction has 92 states and 101 transitions. [2022-04-08 12:41:33,219 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.545454545454546) internal successors, (61), 10 states have internal predecessors, (61), 10 states have call successors, (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-08 12:41:33,220 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 92 states and 101 transitions. [2022-04-08 12:41:35,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:35,020 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 101 transitions. [2022-04-08 12:41:35,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2022-04-08 12:41:35,021 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:35,021 INFO L499 BasicCegarLoop]: 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-08 12:41:35,037 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:35,227 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-04-08 12:41:35,227 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:35,228 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 15 times [2022-04-08 12:41:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:35,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1789958272] [2022-04-08 12:41:35,228 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:35,228 INFO L85 PathProgramCache]: Analyzing trace with hash -399923690, now seen corresponding path program 16 times [2022-04-08 12:41:35,228 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:35,229 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224473088] [2022-04-08 12:41:35,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:35,229 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:35,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:35,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1120153558] [2022-04-08 12:41:35,249 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:41:35,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:35,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:35,250 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:35,251 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-04-08 12:41:35,352 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:41:35,352 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:35,353 INFO L263 TraceCheckSpWp]: Trace formula consists of 253 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-08 12:41:35,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:35,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:35,774 INFO L272 TraceCheckUtils]: 0: Hoare triple {6687#true} call ULTIMATE.init(); {6687#true} is VALID [2022-04-08 12:41:35,775 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-08 12:41:35,775 INFO L290 TraceCheckUtils]: 2: Hoare triple {6695#(<= ~counter~0 0)} assume true; {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,775 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6695#(<= ~counter~0 0)} {6687#true} #67#return; {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,776 INFO L272 TraceCheckUtils]: 4: Hoare triple {6695#(<= ~counter~0 0)} call #t~ret7 := main(); {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,776 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-08 12:41:35,776 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-08 12:41:35,776 INFO L290 TraceCheckUtils]: 7: Hoare triple {6695#(<= ~counter~0 0)} ~cond := #in~cond; {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,777 INFO L290 TraceCheckUtils]: 8: Hoare triple {6695#(<= ~counter~0 0)} assume !(0 == ~cond); {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,777 INFO L290 TraceCheckUtils]: 9: Hoare triple {6695#(<= ~counter~0 0)} assume true; {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,777 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6695#(<= ~counter~0 0)} {6695#(<= ~counter~0 0)} #59#return; {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,778 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-08 12:41:35,778 INFO L290 TraceCheckUtils]: 12: Hoare triple {6695#(<= ~counter~0 0)} ~cond := #in~cond; {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,778 INFO L290 TraceCheckUtils]: 13: Hoare triple {6695#(<= ~counter~0 0)} assume !(0 == ~cond); {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,779 INFO L290 TraceCheckUtils]: 14: Hoare triple {6695#(<= ~counter~0 0)} assume true; {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,802 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6695#(<= ~counter~0 0)} {6695#(<= ~counter~0 0)} #61#return; {6695#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:35,802 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-08 12:41:35,803 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-08 12:41:35,803 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-08 12:41:35,803 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-08 12:41:35,804 INFO L290 TraceCheckUtils]: 20: Hoare triple {6744#(<= ~counter~0 1)} ~cond := #in~cond; {6744#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:35,804 INFO L290 TraceCheckUtils]: 21: Hoare triple {6744#(<= ~counter~0 1)} assume !(0 == ~cond); {6744#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:35,804 INFO L290 TraceCheckUtils]: 22: Hoare triple {6744#(<= ~counter~0 1)} assume true; {6744#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:35,805 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6744#(<= ~counter~0 1)} {6744#(<= ~counter~0 1)} #63#return; {6744#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:35,805 INFO L290 TraceCheckUtils]: 24: Hoare triple {6744#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6744#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:35,805 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-08 12:41:35,806 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-08 12:41:35,806 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-08 12:41:35,807 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-08 12:41:35,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {6772#(<= ~counter~0 2)} ~cond := #in~cond; {6772#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:35,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {6772#(<= ~counter~0 2)} assume !(0 == ~cond); {6772#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:35,808 INFO L290 TraceCheckUtils]: 31: Hoare triple {6772#(<= ~counter~0 2)} assume true; {6772#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:35,808 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6772#(<= ~counter~0 2)} {6772#(<= ~counter~0 2)} #63#return; {6772#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:35,808 INFO L290 TraceCheckUtils]: 33: Hoare triple {6772#(<= ~counter~0 2)} assume !!(0 != ~r~0); {6772#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:35,809 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-08 12:41:35,809 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-08 12:41:35,809 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-08 12:41:35,810 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-08 12:41:35,810 INFO L290 TraceCheckUtils]: 38: Hoare triple {6800#(<= ~counter~0 3)} ~cond := #in~cond; {6800#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:35,810 INFO L290 TraceCheckUtils]: 39: Hoare triple {6800#(<= ~counter~0 3)} assume !(0 == ~cond); {6800#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:35,811 INFO L290 TraceCheckUtils]: 40: Hoare triple {6800#(<= ~counter~0 3)} assume true; {6800#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:35,811 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6800#(<= ~counter~0 3)} {6800#(<= ~counter~0 3)} #63#return; {6800#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:35,811 INFO L290 TraceCheckUtils]: 42: Hoare triple {6800#(<= ~counter~0 3)} assume !!(0 != ~r~0); {6800#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:35,812 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-08 12:41:35,812 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-08 12:41:35,812 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-08 12:41:35,813 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-08 12:41:35,813 INFO L290 TraceCheckUtils]: 47: Hoare triple {6828#(<= ~counter~0 4)} ~cond := #in~cond; {6828#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:35,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {6828#(<= ~counter~0 4)} assume !(0 == ~cond); {6828#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:35,814 INFO L290 TraceCheckUtils]: 49: Hoare triple {6828#(<= ~counter~0 4)} assume true; {6828#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:35,814 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6828#(<= ~counter~0 4)} {6828#(<= ~counter~0 4)} #63#return; {6828#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:35,815 INFO L290 TraceCheckUtils]: 51: Hoare triple {6828#(<= ~counter~0 4)} assume !!(0 != ~r~0); {6828#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:35,815 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-08 12:41:35,815 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-08 12:41:35,816 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-08 12:41:35,816 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-08 12:41:35,816 INFO L290 TraceCheckUtils]: 56: Hoare triple {6856#(<= ~counter~0 5)} ~cond := #in~cond; {6856#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:35,817 INFO L290 TraceCheckUtils]: 57: Hoare triple {6856#(<= ~counter~0 5)} assume !(0 == ~cond); {6856#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:35,817 INFO L290 TraceCheckUtils]: 58: Hoare triple {6856#(<= ~counter~0 5)} assume true; {6856#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:35,818 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6856#(<= ~counter~0 5)} {6856#(<= ~counter~0 5)} #63#return; {6856#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:35,818 INFO L290 TraceCheckUtils]: 60: Hoare triple {6856#(<= ~counter~0 5)} assume !!(0 != ~r~0); {6856#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:35,818 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-08 12:41:35,819 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-08 12:41:35,819 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-08 12:41:35,819 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-08 12:41:35,820 INFO L290 TraceCheckUtils]: 65: Hoare triple {6884#(<= ~counter~0 6)} ~cond := #in~cond; {6884#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:35,820 INFO L290 TraceCheckUtils]: 66: Hoare triple {6884#(<= ~counter~0 6)} assume !(0 == ~cond); {6884#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:35,820 INFO L290 TraceCheckUtils]: 67: Hoare triple {6884#(<= ~counter~0 6)} assume true; {6884#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:35,821 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6884#(<= ~counter~0 6)} {6884#(<= ~counter~0 6)} #63#return; {6884#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:35,821 INFO L290 TraceCheckUtils]: 69: Hoare triple {6884#(<= ~counter~0 6)} assume !!(0 != ~r~0); {6884#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:35,821 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-08 12:41:35,822 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-08 12:41:35,822 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-08 12:41:35,822 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-08 12:41:35,822 INFO L290 TraceCheckUtils]: 74: Hoare triple {6912#(<= ~counter~0 7)} ~cond := #in~cond; {6912#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:35,823 INFO L290 TraceCheckUtils]: 75: Hoare triple {6912#(<= ~counter~0 7)} assume !(0 == ~cond); {6912#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:35,823 INFO L290 TraceCheckUtils]: 76: Hoare triple {6912#(<= ~counter~0 7)} assume true; {6912#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:35,824 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6912#(<= ~counter~0 7)} {6912#(<= ~counter~0 7)} #63#return; {6912#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:35,824 INFO L290 TraceCheckUtils]: 78: Hoare triple {6912#(<= ~counter~0 7)} assume !!(0 != ~r~0); {6912#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:35,824 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-08 12:41:35,824 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-08 12:41:35,825 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-08 12:41:35,825 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-08 12:41:35,825 INFO L290 TraceCheckUtils]: 83: Hoare triple {6940#(<= ~counter~0 8)} ~cond := #in~cond; {6940#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:35,826 INFO L290 TraceCheckUtils]: 84: Hoare triple {6940#(<= ~counter~0 8)} assume !(0 == ~cond); {6940#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:35,826 INFO L290 TraceCheckUtils]: 85: Hoare triple {6940#(<= ~counter~0 8)} assume true; {6940#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:35,826 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6940#(<= ~counter~0 8)} {6940#(<= ~counter~0 8)} #63#return; {6940#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:35,827 INFO L290 TraceCheckUtils]: 87: Hoare triple {6940#(<= ~counter~0 8)} assume !!(0 != ~r~0); {6940#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:35,827 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-08 12:41:35,827 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-08 12:41:35,828 INFO L290 TraceCheckUtils]: 90: Hoare triple {6968#(<= |main_#t~post6| 8)} assume !(#t~post6 < 20);havoc #t~post6; {6688#false} is VALID [2022-04-08 12:41:35,828 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-08 12:41:35,828 INFO L290 TraceCheckUtils]: 92: Hoare triple {6688#false} ~cond := #in~cond; {6688#false} is VALID [2022-04-08 12:41:35,828 INFO L290 TraceCheckUtils]: 93: Hoare triple {6688#false} assume 0 == ~cond; {6688#false} is VALID [2022-04-08 12:41:35,828 INFO L290 TraceCheckUtils]: 94: Hoare triple {6688#false} assume !false; {6688#false} is VALID [2022-04-08 12:41:35,828 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-08 12:41:35,828 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:36,289 INFO L290 TraceCheckUtils]: 94: Hoare triple {6688#false} assume !false; {6688#false} is VALID [2022-04-08 12:41:36,290 INFO L290 TraceCheckUtils]: 93: Hoare triple {6688#false} assume 0 == ~cond; {6688#false} is VALID [2022-04-08 12:41:36,290 INFO L290 TraceCheckUtils]: 92: Hoare triple {6688#false} ~cond := #in~cond; {6688#false} is VALID [2022-04-08 12:41:36,290 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-08 12:41:36,290 INFO L290 TraceCheckUtils]: 90: Hoare triple {6996#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {6688#false} is VALID [2022-04-08 12:41:36,290 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-08 12:41:36,291 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-08 12:41:36,291 INFO L290 TraceCheckUtils]: 87: Hoare triple {7000#(< ~counter~0 20)} assume !!(0 != ~r~0); {7000#(< ~counter~0 20)} is VALID [2022-04-08 12:41:36,291 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {6687#true} {7000#(< ~counter~0 20)} #63#return; {7000#(< ~counter~0 20)} is VALID [2022-04-08 12:41:36,292 INFO L290 TraceCheckUtils]: 85: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,292 INFO L290 TraceCheckUtils]: 84: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,292 INFO L290 TraceCheckUtils]: 83: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,292 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-08 12:41:36,292 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-08 12:41:36,292 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-08 12:41:36,293 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-08 12:41:36,293 INFO L290 TraceCheckUtils]: 78: Hoare triple {7028#(< ~counter~0 19)} assume !!(0 != ~r~0); {7028#(< ~counter~0 19)} is VALID [2022-04-08 12:41:36,293 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {6687#true} {7028#(< ~counter~0 19)} #63#return; {7028#(< ~counter~0 19)} is VALID [2022-04-08 12:41:36,294 INFO L290 TraceCheckUtils]: 76: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,294 INFO L290 TraceCheckUtils]: 75: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,294 INFO L290 TraceCheckUtils]: 74: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,294 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-08 12:41:36,294 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-08 12:41:36,294 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-08 12:41:36,295 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-08 12:41:36,295 INFO L290 TraceCheckUtils]: 69: Hoare triple {7056#(< ~counter~0 18)} assume !!(0 != ~r~0); {7056#(< ~counter~0 18)} is VALID [2022-04-08 12:41:36,295 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {6687#true} {7056#(< ~counter~0 18)} #63#return; {7056#(< ~counter~0 18)} is VALID [2022-04-08 12:41:36,295 INFO L290 TraceCheckUtils]: 67: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,296 INFO L290 TraceCheckUtils]: 66: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,296 INFO L290 TraceCheckUtils]: 65: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,296 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-08 12:41:36,296 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-08 12:41:36,296 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-08 12:41:36,297 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-08 12:41:36,297 INFO L290 TraceCheckUtils]: 60: Hoare triple {7084#(< ~counter~0 17)} assume !!(0 != ~r~0); {7084#(< ~counter~0 17)} is VALID [2022-04-08 12:41:36,297 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {6687#true} {7084#(< ~counter~0 17)} #63#return; {7084#(< ~counter~0 17)} is VALID [2022-04-08 12:41:36,297 INFO L290 TraceCheckUtils]: 58: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,297 INFO L290 TraceCheckUtils]: 57: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,298 INFO L290 TraceCheckUtils]: 56: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,298 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-08 12:41:36,298 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-08 12:41:36,298 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-08 12:41:36,298 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-08 12:41:36,299 INFO L290 TraceCheckUtils]: 51: Hoare triple {7112#(< ~counter~0 16)} assume !!(0 != ~r~0); {7112#(< ~counter~0 16)} is VALID [2022-04-08 12:41:36,299 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {6687#true} {7112#(< ~counter~0 16)} #63#return; {7112#(< ~counter~0 16)} is VALID [2022-04-08 12:41:36,299 INFO L290 TraceCheckUtils]: 49: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,299 INFO L290 TraceCheckUtils]: 48: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,299 INFO L290 TraceCheckUtils]: 47: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,300 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-08 12:41:36,300 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-08 12:41:36,300 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-08 12:41:36,300 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-08 12:41:36,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {7140#(< ~counter~0 15)} assume !!(0 != ~r~0); {7140#(< ~counter~0 15)} is VALID [2022-04-08 12:41:36,301 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {6687#true} {7140#(< ~counter~0 15)} #63#return; {7140#(< ~counter~0 15)} is VALID [2022-04-08 12:41:36,301 INFO L290 TraceCheckUtils]: 40: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,301 INFO L290 TraceCheckUtils]: 39: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,301 INFO L290 TraceCheckUtils]: 38: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,301 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-08 12:41:36,302 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-08 12:41:36,302 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-08 12:41:36,302 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-08 12:41:36,303 INFO L290 TraceCheckUtils]: 33: Hoare triple {7168#(< ~counter~0 14)} assume !!(0 != ~r~0); {7168#(< ~counter~0 14)} is VALID [2022-04-08 12:41:36,303 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {6687#true} {7168#(< ~counter~0 14)} #63#return; {7168#(< ~counter~0 14)} is VALID [2022-04-08 12:41:36,303 INFO L290 TraceCheckUtils]: 31: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,303 INFO L290 TraceCheckUtils]: 30: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,303 INFO L290 TraceCheckUtils]: 29: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,303 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-08 12:41:36,304 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-08 12:41:36,304 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-08 12:41:36,304 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-08 12:41:36,304 INFO L290 TraceCheckUtils]: 24: Hoare triple {7196#(< ~counter~0 13)} assume !!(0 != ~r~0); {7196#(< ~counter~0 13)} is VALID [2022-04-08 12:41:36,305 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6687#true} {7196#(< ~counter~0 13)} #63#return; {7196#(< ~counter~0 13)} is VALID [2022-04-08 12:41:36,305 INFO L290 TraceCheckUtils]: 22: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,305 INFO L290 TraceCheckUtils]: 21: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,305 INFO L290 TraceCheckUtils]: 20: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,305 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-08 12:41:36,305 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-08 12:41:36,306 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-08 12:41:36,306 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-08 12:41:36,307 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6687#true} {7224#(< ~counter~0 12)} #61#return; {7224#(< ~counter~0 12)} is VALID [2022-04-08 12:41:36,307 INFO L290 TraceCheckUtils]: 14: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,307 INFO L290 TraceCheckUtils]: 13: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,307 INFO L290 TraceCheckUtils]: 12: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,307 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-08 12:41:36,307 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6687#true} {7224#(< ~counter~0 12)} #59#return; {7224#(< ~counter~0 12)} is VALID [2022-04-08 12:41:36,307 INFO L290 TraceCheckUtils]: 9: Hoare triple {6687#true} assume true; {6687#true} is VALID [2022-04-08 12:41:36,307 INFO L290 TraceCheckUtils]: 8: Hoare triple {6687#true} assume !(0 == ~cond); {6687#true} is VALID [2022-04-08 12:41:36,307 INFO L290 TraceCheckUtils]: 7: Hoare triple {6687#true} ~cond := #in~cond; {6687#true} is VALID [2022-04-08 12:41:36,308 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-08 12:41:36,308 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-08 12:41:36,308 INFO L272 TraceCheckUtils]: 4: Hoare triple {7224#(< ~counter~0 12)} call #t~ret7 := main(); {7224#(< ~counter~0 12)} is VALID [2022-04-08 12:41:36,308 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7224#(< ~counter~0 12)} {6687#true} #67#return; {7224#(< ~counter~0 12)} is VALID [2022-04-08 12:41:36,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {7224#(< ~counter~0 12)} assume true; {7224#(< ~counter~0 12)} is VALID [2022-04-08 12:41:36,309 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-08 12:41:36,309 INFO L272 TraceCheckUtils]: 0: Hoare triple {6687#true} call ULTIMATE.init(); {6687#true} is VALID [2022-04-08 12:41:36,309 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-08 12:41:36,310 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224473088] [2022-04-08 12:41:36,310 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120153558] [2022-04-08 12:41:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120153558] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:36,310 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:36,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-08 12:41:36,310 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:36,310 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1789958272] [2022-04-08 12:41:36,310 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1789958272] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:36,310 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:36,310 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-08 12:41:36,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073951142] [2022-04-08 12:41:36,310 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:36,311 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-08 12:41:36,311 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:36,311 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-08 12:41:36,373 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-08 12:41:36,373 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-08 12:41:36,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:36,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-08 12:41:36,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-08 12:41:36,374 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-08 12:41:36,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:36,681 INFO L93 Difference]: Finished difference Result 106 states and 116 transitions. [2022-04-08 12:41:36,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-08 12:41:36,682 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-08 12:41:36,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:36,682 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-08 12:41:36,683 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-08 12:41:36,684 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-08 12:41:36,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 115 transitions. [2022-04-08 12:41:36,685 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 115 transitions. [2022-04-08 12:41:36,758 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-08 12:41:36,760 INFO L225 Difference]: With dead ends: 106 [2022-04-08 12:41:36,760 INFO L226 Difference]: Without dead ends: 101 [2022-04-08 12:41:36,760 INFO L912 BasicCegarLoop]: 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-08 12:41:36,761 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 31 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-04-08 12:41:36,761 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 146 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-08 12:41:36,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-04-08 12:41:36,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-04-08 12:41:36,845 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:36,845 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-08 12:41:36,846 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-08 12:41:36,846 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-08 12:41:36,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:36,847 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-08 12:41:36,848 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-08 12:41:36,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:36,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:36,848 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-08 12:41:36,848 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-08 12:41:36,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:36,849 INFO L93 Difference]: Finished difference Result 101 states and 111 transitions. [2022-04-08 12:41:36,849 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-08 12:41:36,850 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:36,850 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:36,850 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:36,850 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:36,850 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-08 12:41:36,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2022-04-08 12:41:36,851 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 95 [2022-04-08 12:41:36,851 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:36,851 INFO L478 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2022-04-08 12:41:36,852 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.666666666666667) internal successors, (68), 11 states have internal predecessors, (68), 11 states have call successors, (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-08 12:41:36,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 101 states and 111 transitions. [2022-04-08 12:41:38,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 110 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:38,989 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2022-04-08 12:41:38,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2022-04-08 12:41:38,990 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:38,990 INFO L499 BasicCegarLoop]: 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-08 12:41:39,006 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:39,191 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-04-08 12:41:39,192 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:39,192 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 17 times [2022-04-08 12:41:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:39,192 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2039549215] [2022-04-08 12:41:39,192 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:39,192 INFO L85 PathProgramCache]: Analyzing trace with hash 1717228060, now seen corresponding path program 18 times [2022-04-08 12:41:39,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:39,193 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [840321019] [2022-04-08 12:41:39,193 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:39,193 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:39,204 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:39,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [14840526] [2022-04-08 12:41:39,204 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:41:39,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:39,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:39,205 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:39,206 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-04-08 12:41:39,365 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 10 check-sat command(s) [2022-04-08 12:41:39,365 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:39,367 INFO L263 TraceCheckSpWp]: Trace formula consists of 273 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-08 12:41:39,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:39,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:39,883 INFO L272 TraceCheckUtils]: 0: Hoare triple {7910#true} call ULTIMATE.init(); {7910#true} is VALID [2022-04-08 12:41:39,883 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-08 12:41:39,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {7918#(<= ~counter~0 0)} assume true; {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7918#(<= ~counter~0 0)} {7910#true} #67#return; {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {7918#(<= ~counter~0 0)} call #t~ret7 := main(); {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,884 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-08 12:41:39,885 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-08 12:41:39,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {7918#(<= ~counter~0 0)} ~cond := #in~cond; {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {7918#(<= ~counter~0 0)} assume !(0 == ~cond); {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {7918#(<= ~counter~0 0)} assume true; {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,886 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7918#(<= ~counter~0 0)} {7918#(<= ~counter~0 0)} #59#return; {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,886 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-08 12:41:39,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {7918#(<= ~counter~0 0)} ~cond := #in~cond; {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,887 INFO L290 TraceCheckUtils]: 13: Hoare triple {7918#(<= ~counter~0 0)} assume !(0 == ~cond); {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,887 INFO L290 TraceCheckUtils]: 14: Hoare triple {7918#(<= ~counter~0 0)} assume true; {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,887 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7918#(<= ~counter~0 0)} {7918#(<= ~counter~0 0)} #61#return; {7918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:39,888 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-08 12:41:39,888 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-08 12:41:39,888 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-08 12:41:39,889 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-08 12:41:39,889 INFO L290 TraceCheckUtils]: 20: Hoare triple {7967#(<= ~counter~0 1)} ~cond := #in~cond; {7967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:39,889 INFO L290 TraceCheckUtils]: 21: Hoare triple {7967#(<= ~counter~0 1)} assume !(0 == ~cond); {7967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:39,890 INFO L290 TraceCheckUtils]: 22: Hoare triple {7967#(<= ~counter~0 1)} assume true; {7967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:39,890 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7967#(<= ~counter~0 1)} {7967#(<= ~counter~0 1)} #63#return; {7967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:39,890 INFO L290 TraceCheckUtils]: 24: Hoare triple {7967#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:39,891 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-08 12:41:39,891 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-08 12:41:39,891 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-08 12:41:39,892 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-08 12:41:39,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {7995#(<= ~counter~0 2)} ~cond := #in~cond; {7995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:39,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {7995#(<= ~counter~0 2)} assume !(0 == ~cond); {7995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:39,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {7995#(<= ~counter~0 2)} assume true; {7995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:39,893 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7995#(<= ~counter~0 2)} {7995#(<= ~counter~0 2)} #63#return; {7995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:39,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {7995#(<= ~counter~0 2)} assume !!(0 != ~r~0); {7995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:39,893 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-08 12:41:39,894 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-08 12:41:39,894 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-08 12:41:39,895 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-08 12:41:39,895 INFO L290 TraceCheckUtils]: 38: Hoare triple {8023#(<= ~counter~0 3)} ~cond := #in~cond; {8023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:39,895 INFO L290 TraceCheckUtils]: 39: Hoare triple {8023#(<= ~counter~0 3)} assume !(0 == ~cond); {8023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:39,895 INFO L290 TraceCheckUtils]: 40: Hoare triple {8023#(<= ~counter~0 3)} assume true; {8023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:39,896 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {8023#(<= ~counter~0 3)} {8023#(<= ~counter~0 3)} #63#return; {8023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:39,896 INFO L290 TraceCheckUtils]: 42: Hoare triple {8023#(<= ~counter~0 3)} assume !!(0 != ~r~0); {8023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:39,896 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-08 12:41:39,897 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-08 12:41:39,897 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-08 12:41:39,897 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-08 12:41:39,898 INFO L290 TraceCheckUtils]: 47: Hoare triple {8051#(<= ~counter~0 4)} ~cond := #in~cond; {8051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:39,898 INFO L290 TraceCheckUtils]: 48: Hoare triple {8051#(<= ~counter~0 4)} assume !(0 == ~cond); {8051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:39,898 INFO L290 TraceCheckUtils]: 49: Hoare triple {8051#(<= ~counter~0 4)} assume true; {8051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:39,899 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {8051#(<= ~counter~0 4)} {8051#(<= ~counter~0 4)} #63#return; {8051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:39,899 INFO L290 TraceCheckUtils]: 51: Hoare triple {8051#(<= ~counter~0 4)} assume !!(0 != ~r~0); {8051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:39,899 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-08 12:41:39,900 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-08 12:41:39,900 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-08 12:41:39,900 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-08 12:41:39,900 INFO L290 TraceCheckUtils]: 56: Hoare triple {8079#(<= ~counter~0 5)} ~cond := #in~cond; {8079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:39,901 INFO L290 TraceCheckUtils]: 57: Hoare triple {8079#(<= ~counter~0 5)} assume !(0 == ~cond); {8079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:39,901 INFO L290 TraceCheckUtils]: 58: Hoare triple {8079#(<= ~counter~0 5)} assume true; {8079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:39,901 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {8079#(<= ~counter~0 5)} {8079#(<= ~counter~0 5)} #63#return; {8079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:39,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {8079#(<= ~counter~0 5)} assume !!(0 != ~r~0); {8079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:39,902 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-08 12:41:39,902 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-08 12:41:39,903 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-08 12:41:39,903 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-08 12:41:39,903 INFO L290 TraceCheckUtils]: 65: Hoare triple {8107#(<= ~counter~0 6)} ~cond := #in~cond; {8107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:39,904 INFO L290 TraceCheckUtils]: 66: Hoare triple {8107#(<= ~counter~0 6)} assume !(0 == ~cond); {8107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:39,904 INFO L290 TraceCheckUtils]: 67: Hoare triple {8107#(<= ~counter~0 6)} assume true; {8107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:39,904 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {8107#(<= ~counter~0 6)} {8107#(<= ~counter~0 6)} #63#return; {8107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:39,905 INFO L290 TraceCheckUtils]: 69: Hoare triple {8107#(<= ~counter~0 6)} assume !!(0 != ~r~0); {8107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:39,905 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-08 12:41:39,905 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-08 12:41:39,911 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-08 12:41:39,911 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-08 12:41:39,911 INFO L290 TraceCheckUtils]: 74: Hoare triple {8135#(<= ~counter~0 7)} ~cond := #in~cond; {8135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:39,912 INFO L290 TraceCheckUtils]: 75: Hoare triple {8135#(<= ~counter~0 7)} assume !(0 == ~cond); {8135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:39,912 INFO L290 TraceCheckUtils]: 76: Hoare triple {8135#(<= ~counter~0 7)} assume true; {8135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:39,912 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {8135#(<= ~counter~0 7)} {8135#(<= ~counter~0 7)} #63#return; {8135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:39,913 INFO L290 TraceCheckUtils]: 78: Hoare triple {8135#(<= ~counter~0 7)} assume !!(0 != ~r~0); {8135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:39,913 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-08 12:41:39,913 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-08 12:41:39,914 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-08 12:41:39,914 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-08 12:41:39,914 INFO L290 TraceCheckUtils]: 83: Hoare triple {8163#(<= ~counter~0 8)} ~cond := #in~cond; {8163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:39,915 INFO L290 TraceCheckUtils]: 84: Hoare triple {8163#(<= ~counter~0 8)} assume !(0 == ~cond); {8163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:39,915 INFO L290 TraceCheckUtils]: 85: Hoare triple {8163#(<= ~counter~0 8)} assume true; {8163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:39,915 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {8163#(<= ~counter~0 8)} {8163#(<= ~counter~0 8)} #63#return; {8163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:39,916 INFO L290 TraceCheckUtils]: 87: Hoare triple {8163#(<= ~counter~0 8)} assume !!(0 != ~r~0); {8163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:39,916 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-08 12:41:39,916 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-08 12:41:39,917 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-08 12:41:39,917 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-08 12:41:39,917 INFO L290 TraceCheckUtils]: 92: Hoare triple {8191#(<= ~counter~0 9)} ~cond := #in~cond; {8191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:39,918 INFO L290 TraceCheckUtils]: 93: Hoare triple {8191#(<= ~counter~0 9)} assume !(0 == ~cond); {8191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:39,918 INFO L290 TraceCheckUtils]: 94: Hoare triple {8191#(<= ~counter~0 9)} assume true; {8191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:39,918 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {8191#(<= ~counter~0 9)} {8191#(<= ~counter~0 9)} #63#return; {8191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:39,919 INFO L290 TraceCheckUtils]: 96: Hoare triple {8191#(<= ~counter~0 9)} assume !!(0 != ~r~0); {8191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:39,919 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-08 12:41:39,920 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-08 12:41:39,920 INFO L290 TraceCheckUtils]: 99: Hoare triple {8219#(<= |main_#t~post6| 9)} assume !(#t~post6 < 20);havoc #t~post6; {7911#false} is VALID [2022-04-08 12:41:39,920 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-08 12:41:39,920 INFO L290 TraceCheckUtils]: 101: Hoare triple {7911#false} ~cond := #in~cond; {7911#false} is VALID [2022-04-08 12:41:39,920 INFO L290 TraceCheckUtils]: 102: Hoare triple {7911#false} assume 0 == ~cond; {7911#false} is VALID [2022-04-08 12:41:39,921 INFO L290 TraceCheckUtils]: 103: Hoare triple {7911#false} assume !false; {7911#false} is VALID [2022-04-08 12:41:39,921 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-08 12:41:39,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:40,437 INFO L290 TraceCheckUtils]: 103: Hoare triple {7911#false} assume !false; {7911#false} is VALID [2022-04-08 12:41:40,437 INFO L290 TraceCheckUtils]: 102: Hoare triple {7911#false} assume 0 == ~cond; {7911#false} is VALID [2022-04-08 12:41:40,437 INFO L290 TraceCheckUtils]: 101: Hoare triple {7911#false} ~cond := #in~cond; {7911#false} is VALID [2022-04-08 12:41:40,438 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-08 12:41:40,438 INFO L290 TraceCheckUtils]: 99: Hoare triple {8247#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {7911#false} is VALID [2022-04-08 12:41:40,438 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-08 12:41:40,438 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-08 12:41:40,439 INFO L290 TraceCheckUtils]: 96: Hoare triple {8251#(< ~counter~0 20)} assume !!(0 != ~r~0); {8251#(< ~counter~0 20)} is VALID [2022-04-08 12:41:40,439 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {7910#true} {8251#(< ~counter~0 20)} #63#return; {8251#(< ~counter~0 20)} is VALID [2022-04-08 12:41:40,439 INFO L290 TraceCheckUtils]: 94: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,439 INFO L290 TraceCheckUtils]: 93: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,439 INFO L290 TraceCheckUtils]: 92: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,439 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-08 12:41:40,440 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-08 12:41:40,440 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-08 12:41:40,440 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-08 12:41:40,441 INFO L290 TraceCheckUtils]: 87: Hoare triple {8279#(< ~counter~0 19)} assume !!(0 != ~r~0); {8279#(< ~counter~0 19)} is VALID [2022-04-08 12:41:40,441 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {7910#true} {8279#(< ~counter~0 19)} #63#return; {8279#(< ~counter~0 19)} is VALID [2022-04-08 12:41:40,441 INFO L290 TraceCheckUtils]: 85: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,441 INFO L290 TraceCheckUtils]: 84: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,441 INFO L290 TraceCheckUtils]: 83: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,442 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-08 12:41:40,442 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-08 12:41:40,442 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-08 12:41:40,442 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-08 12:41:40,443 INFO L290 TraceCheckUtils]: 78: Hoare triple {8307#(< ~counter~0 18)} assume !!(0 != ~r~0); {8307#(< ~counter~0 18)} is VALID [2022-04-08 12:41:40,443 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {7910#true} {8307#(< ~counter~0 18)} #63#return; {8307#(< ~counter~0 18)} is VALID [2022-04-08 12:41:40,443 INFO L290 TraceCheckUtils]: 76: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,443 INFO L290 TraceCheckUtils]: 75: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,443 INFO L290 TraceCheckUtils]: 74: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,444 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-08 12:41:40,444 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-08 12:41:40,444 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-08 12:41:40,444 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-08 12:41:40,445 INFO L290 TraceCheckUtils]: 69: Hoare triple {8335#(< ~counter~0 17)} assume !!(0 != ~r~0); {8335#(< ~counter~0 17)} is VALID [2022-04-08 12:41:40,445 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {7910#true} {8335#(< ~counter~0 17)} #63#return; {8335#(< ~counter~0 17)} is VALID [2022-04-08 12:41:40,445 INFO L290 TraceCheckUtils]: 67: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,445 INFO L290 TraceCheckUtils]: 66: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,445 INFO L290 TraceCheckUtils]: 65: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,446 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-08 12:41:40,446 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-08 12:41:40,446 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-08 12:41:40,446 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-08 12:41:40,450 INFO L290 TraceCheckUtils]: 60: Hoare triple {8363#(< ~counter~0 16)} assume !!(0 != ~r~0); {8363#(< ~counter~0 16)} is VALID [2022-04-08 12:41:40,451 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {7910#true} {8363#(< ~counter~0 16)} #63#return; {8363#(< ~counter~0 16)} is VALID [2022-04-08 12:41:40,451 INFO L290 TraceCheckUtils]: 58: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,451 INFO L290 TraceCheckUtils]: 57: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,451 INFO L290 TraceCheckUtils]: 56: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,451 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-08 12:41:40,452 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-08 12:41:40,452 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-08 12:41:40,452 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-08 12:41:40,453 INFO L290 TraceCheckUtils]: 51: Hoare triple {8391#(< ~counter~0 15)} assume !!(0 != ~r~0); {8391#(< ~counter~0 15)} is VALID [2022-04-08 12:41:40,453 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {7910#true} {8391#(< ~counter~0 15)} #63#return; {8391#(< ~counter~0 15)} is VALID [2022-04-08 12:41:40,453 INFO L290 TraceCheckUtils]: 49: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,453 INFO L290 TraceCheckUtils]: 48: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,453 INFO L290 TraceCheckUtils]: 47: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,455 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-08 12:41:40,456 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-08 12:41:40,457 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-08 12:41:40,457 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-08 12:41:40,457 INFO L290 TraceCheckUtils]: 42: Hoare triple {8419#(< ~counter~0 14)} assume !!(0 != ~r~0); {8419#(< ~counter~0 14)} is VALID [2022-04-08 12:41:40,458 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {7910#true} {8419#(< ~counter~0 14)} #63#return; {8419#(< ~counter~0 14)} is VALID [2022-04-08 12:41:40,458 INFO L290 TraceCheckUtils]: 40: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,458 INFO L290 TraceCheckUtils]: 39: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,458 INFO L290 TraceCheckUtils]: 38: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,458 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-08 12:41:40,458 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-08 12:41:40,459 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-08 12:41:40,459 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-08 12:41:40,459 INFO L290 TraceCheckUtils]: 33: Hoare triple {8447#(< ~counter~0 13)} assume !!(0 != ~r~0); {8447#(< ~counter~0 13)} is VALID [2022-04-08 12:41:40,460 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {7910#true} {8447#(< ~counter~0 13)} #63#return; {8447#(< ~counter~0 13)} is VALID [2022-04-08 12:41:40,460 INFO L290 TraceCheckUtils]: 31: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,460 INFO L290 TraceCheckUtils]: 30: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,460 INFO L290 TraceCheckUtils]: 29: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,460 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-08 12:41:40,463 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-08 12:41:40,472 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-08 12:41:40,472 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-08 12:41:40,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {8475#(< ~counter~0 12)} assume !!(0 != ~r~0); {8475#(< ~counter~0 12)} is VALID [2022-04-08 12:41:40,473 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7910#true} {8475#(< ~counter~0 12)} #63#return; {8475#(< ~counter~0 12)} is VALID [2022-04-08 12:41:40,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,473 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-08 12:41:40,474 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-08 12:41:40,474 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-08 12:41:40,474 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-08 12:41:40,475 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7910#true} {8503#(< ~counter~0 11)} #61#return; {8503#(< ~counter~0 11)} is VALID [2022-04-08 12:41:40,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,475 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-08 12:41:40,475 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7910#true} {8503#(< ~counter~0 11)} #59#return; {8503#(< ~counter~0 11)} is VALID [2022-04-08 12:41:40,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {7910#true} assume true; {7910#true} is VALID [2022-04-08 12:41:40,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {7910#true} assume !(0 == ~cond); {7910#true} is VALID [2022-04-08 12:41:40,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {7910#true} ~cond := #in~cond; {7910#true} is VALID [2022-04-08 12:41:40,476 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-08 12:41:40,476 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-08 12:41:40,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {8503#(< ~counter~0 11)} call #t~ret7 := main(); {8503#(< ~counter~0 11)} is VALID [2022-04-08 12:41:40,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8503#(< ~counter~0 11)} {7910#true} #67#return; {8503#(< ~counter~0 11)} is VALID [2022-04-08 12:41:40,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {8503#(< ~counter~0 11)} assume true; {8503#(< ~counter~0 11)} is VALID [2022-04-08 12:41:40,477 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-08 12:41:40,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {7910#true} call ULTIMATE.init(); {7910#true} is VALID [2022-04-08 12:41:40,478 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-08 12:41:40,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:40,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [840321019] [2022-04-08 12:41:40,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:40,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [14840526] [2022-04-08 12:41:40,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [14840526] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:40,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:40,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-08 12:41:40,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:40,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2039549215] [2022-04-08 12:41:40,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2039549215] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:40,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:40,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-08 12:41:40,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344086465] [2022-04-08 12:41:40,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:40,479 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-08 12:41:40,480 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:40,480 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-08 12:41:40,542 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:40,542 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-08 12:41:40,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:40,543 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-08 12:41:40,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:41:40,543 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-08 12:41:40,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:40,908 INFO L93 Difference]: Finished difference Result 115 states and 126 transitions. [2022-04-08 12:41:40,908 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-08 12:41:40,908 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-08 12:41:40,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:40,908 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-08 12:41:40,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-08 12:41:40,910 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-08 12:41:40,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 125 transitions. [2022-04-08 12:41:40,912 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 125 transitions. [2022-04-08 12:41:40,989 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-08 12:41:40,991 INFO L225 Difference]: With dead ends: 115 [2022-04-08 12:41:40,991 INFO L226 Difference]: Without dead ends: 110 [2022-04-08 12:41:40,991 INFO L912 BasicCegarLoop]: 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-08 12:41:40,992 INFO L913 BasicCegarLoop]: 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-08 12:41:40,992 INFO L914 BasicCegarLoop]: 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-08 12:41:40,992 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2022-04-08 12:41:41,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2022-04-08 12:41:41,129 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:41,129 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-08 12:41:41,130 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-08 12:41:41,130 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-08 12:41:41,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:41,131 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-08 12:41:41,131 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-08 12:41:41,132 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:41,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:41,132 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-08 12:41:41,132 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-08 12:41:41,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:41,134 INFO L93 Difference]: Finished difference Result 110 states and 121 transitions. [2022-04-08 12:41:41,134 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-08 12:41:41,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:41,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:41,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:41,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:41,134 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-08 12:41:41,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 121 transitions. [2022-04-08 12:41:41,136 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 121 transitions. Word has length 104 [2022-04-08 12:41:41,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:41,136 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 121 transitions. [2022-04-08 12:41:41,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.769230769230769) internal successors, (75), 12 states have internal predecessors, (75), 12 states have call successors, (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-08 12:41:41,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 121 transitions. [2022-04-08 12:41:43,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 120 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:43,304 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 121 transitions. [2022-04-08 12:41:43,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-08 12:41:43,305 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:43,305 INFO L499 BasicCegarLoop]: 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-08 12:41:43,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:43,509 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-04-08 12:41:43,509 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:43,509 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 19 times [2022-04-08 12:41:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:43,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [617714667] [2022-04-08 12:41:43,510 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:43,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1468805930, now seen corresponding path program 20 times [2022-04-08 12:41:43,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:43,510 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [931473879] [2022-04-08 12:41:43,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:43,510 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:43,523 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:43,523 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [779283384] [2022-04-08 12:41:43,523 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:41:43,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:43,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:43,524 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:43,525 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2022-04-08 12:41:43,579 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:41:43,579 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:43,580 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-08 12:41:43,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:43,601 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:44,126 INFO L272 TraceCheckUtils]: 0: Hoare triple {9245#true} call ULTIMATE.init(); {9245#true} is VALID [2022-04-08 12:41:44,127 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-08 12:41:44,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {9253#(<= ~counter~0 0)} assume true; {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,128 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9253#(<= ~counter~0 0)} {9245#true} #67#return; {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,128 INFO L272 TraceCheckUtils]: 4: Hoare triple {9253#(<= ~counter~0 0)} call #t~ret7 := main(); {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,128 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-08 12:41:44,129 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-08 12:41:44,129 INFO L290 TraceCheckUtils]: 7: Hoare triple {9253#(<= ~counter~0 0)} ~cond := #in~cond; {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {9253#(<= ~counter~0 0)} assume !(0 == ~cond); {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {9253#(<= ~counter~0 0)} assume true; {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,130 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9253#(<= ~counter~0 0)} {9253#(<= ~counter~0 0)} #59#return; {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,130 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-08 12:41:44,131 INFO L290 TraceCheckUtils]: 12: Hoare triple {9253#(<= ~counter~0 0)} ~cond := #in~cond; {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {9253#(<= ~counter~0 0)} assume !(0 == ~cond); {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {9253#(<= ~counter~0 0)} assume true; {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,131 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9253#(<= ~counter~0 0)} {9253#(<= ~counter~0 0)} #61#return; {9253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:44,132 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-08 12:41:44,132 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-08 12:41:44,132 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-08 12:41:44,133 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-08 12:41:44,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {9302#(<= ~counter~0 1)} ~cond := #in~cond; {9302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:44,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {9302#(<= ~counter~0 1)} assume !(0 == ~cond); {9302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:44,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {9302#(<= ~counter~0 1)} assume true; {9302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:44,136 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9302#(<= ~counter~0 1)} {9302#(<= ~counter~0 1)} #63#return; {9302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:44,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {9302#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:44,137 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-08 12:41:44,137 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-08 12:41:44,138 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-08 12:41:44,163 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-08 12:41:44,164 INFO L290 TraceCheckUtils]: 29: Hoare triple {9330#(<= ~counter~0 2)} ~cond := #in~cond; {9330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:44,164 INFO L290 TraceCheckUtils]: 30: Hoare triple {9330#(<= ~counter~0 2)} assume !(0 == ~cond); {9330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:44,164 INFO L290 TraceCheckUtils]: 31: Hoare triple {9330#(<= ~counter~0 2)} assume true; {9330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:44,165 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9330#(<= ~counter~0 2)} {9330#(<= ~counter~0 2)} #63#return; {9330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:44,165 INFO L290 TraceCheckUtils]: 33: Hoare triple {9330#(<= ~counter~0 2)} assume !!(0 != ~r~0); {9330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:44,165 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-08 12:41:44,166 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-08 12:41:44,166 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-08 12:41:44,166 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-08 12:41:44,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {9358#(<= ~counter~0 3)} ~cond := #in~cond; {9358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:44,167 INFO L290 TraceCheckUtils]: 39: Hoare triple {9358#(<= ~counter~0 3)} assume !(0 == ~cond); {9358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:44,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {9358#(<= ~counter~0 3)} assume true; {9358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:44,167 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9358#(<= ~counter~0 3)} {9358#(<= ~counter~0 3)} #63#return; {9358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:44,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {9358#(<= ~counter~0 3)} assume !!(0 != ~r~0); {9358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:44,168 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-08 12:41:44,168 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-08 12:41:44,169 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-08 12:41:44,169 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-08 12:41:44,169 INFO L290 TraceCheckUtils]: 47: Hoare triple {9386#(<= ~counter~0 4)} ~cond := #in~cond; {9386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:44,170 INFO L290 TraceCheckUtils]: 48: Hoare triple {9386#(<= ~counter~0 4)} assume !(0 == ~cond); {9386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:44,170 INFO L290 TraceCheckUtils]: 49: Hoare triple {9386#(<= ~counter~0 4)} assume true; {9386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:44,170 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9386#(<= ~counter~0 4)} {9386#(<= ~counter~0 4)} #63#return; {9386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:44,170 INFO L290 TraceCheckUtils]: 51: Hoare triple {9386#(<= ~counter~0 4)} assume !!(0 != ~r~0); {9386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:44,171 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-08 12:41:44,171 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-08 12:41:44,171 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-08 12:41:44,172 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-08 12:41:44,172 INFO L290 TraceCheckUtils]: 56: Hoare triple {9414#(<= ~counter~0 5)} ~cond := #in~cond; {9414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:44,172 INFO L290 TraceCheckUtils]: 57: Hoare triple {9414#(<= ~counter~0 5)} assume !(0 == ~cond); {9414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:44,173 INFO L290 TraceCheckUtils]: 58: Hoare triple {9414#(<= ~counter~0 5)} assume true; {9414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:44,173 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9414#(<= ~counter~0 5)} {9414#(<= ~counter~0 5)} #63#return; {9414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:44,173 INFO L290 TraceCheckUtils]: 60: Hoare triple {9414#(<= ~counter~0 5)} assume !!(0 != ~r~0); {9414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:44,174 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-08 12:41:44,174 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-08 12:41:44,174 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-08 12:41:44,175 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-08 12:41:44,175 INFO L290 TraceCheckUtils]: 65: Hoare triple {9442#(<= ~counter~0 6)} ~cond := #in~cond; {9442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:44,175 INFO L290 TraceCheckUtils]: 66: Hoare triple {9442#(<= ~counter~0 6)} assume !(0 == ~cond); {9442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:44,175 INFO L290 TraceCheckUtils]: 67: Hoare triple {9442#(<= ~counter~0 6)} assume true; {9442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:44,176 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9442#(<= ~counter~0 6)} {9442#(<= ~counter~0 6)} #63#return; {9442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:44,176 INFO L290 TraceCheckUtils]: 69: Hoare triple {9442#(<= ~counter~0 6)} assume !!(0 != ~r~0); {9442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:44,176 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-08 12:41:44,187 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-08 12:41:44,188 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-08 12:41:44,188 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-08 12:41:44,189 INFO L290 TraceCheckUtils]: 74: Hoare triple {9470#(<= ~counter~0 7)} ~cond := #in~cond; {9470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:44,189 INFO L290 TraceCheckUtils]: 75: Hoare triple {9470#(<= ~counter~0 7)} assume !(0 == ~cond); {9470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:44,189 INFO L290 TraceCheckUtils]: 76: Hoare triple {9470#(<= ~counter~0 7)} assume true; {9470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:44,190 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {9470#(<= ~counter~0 7)} {9470#(<= ~counter~0 7)} #63#return; {9470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:44,190 INFO L290 TraceCheckUtils]: 78: Hoare triple {9470#(<= ~counter~0 7)} assume !!(0 != ~r~0); {9470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:44,190 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-08 12:41:44,191 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-08 12:41:44,191 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-08 12:41:44,191 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-08 12:41:44,192 INFO L290 TraceCheckUtils]: 83: Hoare triple {9498#(<= ~counter~0 8)} ~cond := #in~cond; {9498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:44,192 INFO L290 TraceCheckUtils]: 84: Hoare triple {9498#(<= ~counter~0 8)} assume !(0 == ~cond); {9498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:44,192 INFO L290 TraceCheckUtils]: 85: Hoare triple {9498#(<= ~counter~0 8)} assume true; {9498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:44,193 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9498#(<= ~counter~0 8)} {9498#(<= ~counter~0 8)} #63#return; {9498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:44,193 INFO L290 TraceCheckUtils]: 87: Hoare triple {9498#(<= ~counter~0 8)} assume !!(0 != ~r~0); {9498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:44,193 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-08 12:41:44,194 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-08 12:41:44,194 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-08 12:41:44,194 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-08 12:41:44,195 INFO L290 TraceCheckUtils]: 92: Hoare triple {9526#(<= ~counter~0 9)} ~cond := #in~cond; {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,195 INFO L290 TraceCheckUtils]: 93: Hoare triple {9526#(<= ~counter~0 9)} assume !(0 == ~cond); {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,195 INFO L290 TraceCheckUtils]: 94: Hoare triple {9526#(<= ~counter~0 9)} assume true; {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,196 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9526#(<= ~counter~0 9)} {9526#(<= ~counter~0 9)} #63#return; {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,196 INFO L290 TraceCheckUtils]: 96: Hoare triple {9526#(<= ~counter~0 9)} assume !!(0 != ~r~0); {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,196 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-08 12:41:44,197 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-08 12:41:44,197 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-08 12:41:44,197 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-08 12:41:44,198 INFO L290 TraceCheckUtils]: 101: Hoare triple {9554#(<= ~counter~0 10)} ~cond := #in~cond; {9554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:44,198 INFO L290 TraceCheckUtils]: 102: Hoare triple {9554#(<= ~counter~0 10)} assume !(0 == ~cond); {9554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:44,198 INFO L290 TraceCheckUtils]: 103: Hoare triple {9554#(<= ~counter~0 10)} assume true; {9554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:44,199 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {9554#(<= ~counter~0 10)} {9554#(<= ~counter~0 10)} #63#return; {9554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:44,199 INFO L290 TraceCheckUtils]: 105: Hoare triple {9554#(<= ~counter~0 10)} assume !!(0 != ~r~0); {9554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:44,199 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-08 12:41:44,199 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-08 12:41:44,200 INFO L290 TraceCheckUtils]: 108: Hoare triple {9582#(<= |main_#t~post6| 10)} assume !(#t~post6 < 20);havoc #t~post6; {9246#false} is VALID [2022-04-08 12:41:44,200 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-08 12:41:44,200 INFO L290 TraceCheckUtils]: 110: Hoare triple {9246#false} ~cond := #in~cond; {9246#false} is VALID [2022-04-08 12:41:44,200 INFO L290 TraceCheckUtils]: 111: Hoare triple {9246#false} assume 0 == ~cond; {9246#false} is VALID [2022-04-08 12:41:44,200 INFO L290 TraceCheckUtils]: 112: Hoare triple {9246#false} assume !false; {9246#false} is VALID [2022-04-08 12:41:44,200 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-08 12:41:44,200 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:44,742 INFO L290 TraceCheckUtils]: 112: Hoare triple {9246#false} assume !false; {9246#false} is VALID [2022-04-08 12:41:44,742 INFO L290 TraceCheckUtils]: 111: Hoare triple {9246#false} assume 0 == ~cond; {9246#false} is VALID [2022-04-08 12:41:44,742 INFO L290 TraceCheckUtils]: 110: Hoare triple {9246#false} ~cond := #in~cond; {9246#false} is VALID [2022-04-08 12:41:44,742 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-08 12:41:44,742 INFO L290 TraceCheckUtils]: 108: Hoare triple {9610#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {9246#false} is VALID [2022-04-08 12:41:44,743 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-08 12:41:44,743 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-08 12:41:44,743 INFO L290 TraceCheckUtils]: 105: Hoare triple {9614#(< ~counter~0 20)} assume !!(0 != ~r~0); {9614#(< ~counter~0 20)} is VALID [2022-04-08 12:41:44,744 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {9245#true} {9614#(< ~counter~0 20)} #63#return; {9614#(< ~counter~0 20)} is VALID [2022-04-08 12:41:44,744 INFO L290 TraceCheckUtils]: 103: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,744 INFO L290 TraceCheckUtils]: 102: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,744 INFO L290 TraceCheckUtils]: 101: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,744 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-08 12:41:44,744 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-08 12:41:44,745 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-08 12:41:44,745 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-08 12:41:44,745 INFO L290 TraceCheckUtils]: 96: Hoare triple {9642#(< ~counter~0 19)} assume !!(0 != ~r~0); {9642#(< ~counter~0 19)} is VALID [2022-04-08 12:41:44,746 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {9245#true} {9642#(< ~counter~0 19)} #63#return; {9642#(< ~counter~0 19)} is VALID [2022-04-08 12:41:44,746 INFO L290 TraceCheckUtils]: 94: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,746 INFO L290 TraceCheckUtils]: 93: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,746 INFO L290 TraceCheckUtils]: 92: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,746 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-08 12:41:44,746 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-08 12:41:44,747 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-08 12:41:44,747 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-08 12:41:44,747 INFO L290 TraceCheckUtils]: 87: Hoare triple {9670#(< ~counter~0 18)} assume !!(0 != ~r~0); {9670#(< ~counter~0 18)} is VALID [2022-04-08 12:41:44,748 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {9245#true} {9670#(< ~counter~0 18)} #63#return; {9670#(< ~counter~0 18)} is VALID [2022-04-08 12:41:44,748 INFO L290 TraceCheckUtils]: 85: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,748 INFO L290 TraceCheckUtils]: 84: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,748 INFO L290 TraceCheckUtils]: 83: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,748 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-08 12:41:44,748 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-08 12:41:44,749 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-08 12:41:44,749 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-08 12:41:44,749 INFO L290 TraceCheckUtils]: 78: Hoare triple {9698#(< ~counter~0 17)} assume !!(0 != ~r~0); {9698#(< ~counter~0 17)} is VALID [2022-04-08 12:41:44,750 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {9245#true} {9698#(< ~counter~0 17)} #63#return; {9698#(< ~counter~0 17)} is VALID [2022-04-08 12:41:44,750 INFO L290 TraceCheckUtils]: 76: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,750 INFO L290 TraceCheckUtils]: 75: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,750 INFO L290 TraceCheckUtils]: 74: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,750 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-08 12:41:44,750 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-08 12:41:44,751 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-08 12:41:44,751 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-08 12:41:44,751 INFO L290 TraceCheckUtils]: 69: Hoare triple {9726#(< ~counter~0 16)} assume !!(0 != ~r~0); {9726#(< ~counter~0 16)} is VALID [2022-04-08 12:41:44,752 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {9245#true} {9726#(< ~counter~0 16)} #63#return; {9726#(< ~counter~0 16)} is VALID [2022-04-08 12:41:44,752 INFO L290 TraceCheckUtils]: 67: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,752 INFO L290 TraceCheckUtils]: 66: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,752 INFO L290 TraceCheckUtils]: 65: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,752 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-08 12:41:44,752 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-08 12:41:44,753 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-08 12:41:44,753 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-08 12:41:44,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {9754#(< ~counter~0 15)} assume !!(0 != ~r~0); {9754#(< ~counter~0 15)} is VALID [2022-04-08 12:41:44,754 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {9245#true} {9754#(< ~counter~0 15)} #63#return; {9754#(< ~counter~0 15)} is VALID [2022-04-08 12:41:44,754 INFO L290 TraceCheckUtils]: 58: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,754 INFO L290 TraceCheckUtils]: 57: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,754 INFO L290 TraceCheckUtils]: 56: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,754 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-08 12:41:44,754 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-08 12:41:44,754 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-08 12:41:44,755 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-08 12:41:44,755 INFO L290 TraceCheckUtils]: 51: Hoare triple {9782#(< ~counter~0 14)} assume !!(0 != ~r~0); {9782#(< ~counter~0 14)} is VALID [2022-04-08 12:41:44,755 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {9245#true} {9782#(< ~counter~0 14)} #63#return; {9782#(< ~counter~0 14)} is VALID [2022-04-08 12:41:44,756 INFO L290 TraceCheckUtils]: 49: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,756 INFO L290 TraceCheckUtils]: 48: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,756 INFO L290 TraceCheckUtils]: 47: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,756 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-08 12:41:44,756 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-08 12:41:44,756 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-08 12:41:44,757 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-08 12:41:44,757 INFO L290 TraceCheckUtils]: 42: Hoare triple {9810#(< ~counter~0 13)} assume !!(0 != ~r~0); {9810#(< ~counter~0 13)} is VALID [2022-04-08 12:41:44,758 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {9245#true} {9810#(< ~counter~0 13)} #63#return; {9810#(< ~counter~0 13)} is VALID [2022-04-08 12:41:44,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,758 INFO L290 TraceCheckUtils]: 39: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,758 INFO L290 TraceCheckUtils]: 38: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,758 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-08 12:41:44,758 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-08 12:41:44,759 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-08 12:41:44,759 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-08 12:41:44,759 INFO L290 TraceCheckUtils]: 33: Hoare triple {9838#(< ~counter~0 12)} assume !!(0 != ~r~0); {9838#(< ~counter~0 12)} is VALID [2022-04-08 12:41:44,760 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {9245#true} {9838#(< ~counter~0 12)} #63#return; {9838#(< ~counter~0 12)} is VALID [2022-04-08 12:41:44,760 INFO L290 TraceCheckUtils]: 31: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,760 INFO L290 TraceCheckUtils]: 30: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,760 INFO L290 TraceCheckUtils]: 29: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,760 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-08 12:41:44,760 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-08 12:41:44,761 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-08 12:41:44,761 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-08 12:41:44,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {9554#(<= ~counter~0 10)} assume !!(0 != ~r~0); {9554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:44,762 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9245#true} {9554#(<= ~counter~0 10)} #63#return; {9554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:44,762 INFO L290 TraceCheckUtils]: 22: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,762 INFO L290 TraceCheckUtils]: 21: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,762 INFO L290 TraceCheckUtils]: 20: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,762 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-08 12:41:44,762 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-08 12:41:44,763 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-08 12:41:44,763 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-08 12:41:44,763 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9245#true} {9526#(<= ~counter~0 9)} #61#return; {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,763 INFO L290 TraceCheckUtils]: 14: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,763 INFO L290 TraceCheckUtils]: 13: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,763 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-08 12:41:44,764 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9245#true} {9526#(<= ~counter~0 9)} #59#return; {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {9245#true} assume true; {9245#true} is VALID [2022-04-08 12:41:44,764 INFO L290 TraceCheckUtils]: 8: Hoare triple {9245#true} assume !(0 == ~cond); {9245#true} is VALID [2022-04-08 12:41:44,764 INFO L290 TraceCheckUtils]: 7: Hoare triple {9245#true} ~cond := #in~cond; {9245#true} is VALID [2022-04-08 12:41:44,764 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-08 12:41:44,764 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-08 12:41:44,765 INFO L272 TraceCheckUtils]: 4: Hoare triple {9526#(<= ~counter~0 9)} call #t~ret7 := main(); {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,765 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9526#(<= ~counter~0 9)} {9245#true} #67#return; {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {9526#(<= ~counter~0 9)} assume true; {9526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:44,766 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-08 12:41:44,766 INFO L272 TraceCheckUtils]: 0: Hoare triple {9245#true} call ULTIMATE.init(); {9245#true} is VALID [2022-04-08 12:41:44,766 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-08 12:41:44,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [931473879] [2022-04-08 12:41:44,766 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:44,766 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [779283384] [2022-04-08 12:41:44,767 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [779283384] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:44,767 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:44,767 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 24 [2022-04-08 12:41:44,767 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:44,768 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [617714667] [2022-04-08 12:41:44,768 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [617714667] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:44,768 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:44,768 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-08 12:41:44,768 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942761700] [2022-04-08 12:41:44,768 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:44,768 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-08 12:41:44,771 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:44,771 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-08 12:41:44,847 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-08 12:41:44,847 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-08 12:41:44,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:44,847 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-08 12:41:44,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:41:44,848 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-08 12:41:45,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:45,249 INFO L93 Difference]: Finished difference Result 124 states and 136 transitions. [2022-04-08 12:41:45,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-08 12:41:45,249 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-08 12:41:45,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:45,249 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-08 12:41:45,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 135 transitions. [2022-04-08 12:41:45,252 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-08 12:41:45,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 135 transitions. [2022-04-08 12:41:45,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 135 transitions. [2022-04-08 12:41:45,337 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:45,339 INFO L225 Difference]: With dead ends: 124 [2022-04-08 12:41:45,339 INFO L226 Difference]: Without dead ends: 119 [2022-04-08 12:41:45,339 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 235 GetRequests, 202 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=466, Invalid=656, Unknown=0, NotChecked=0, Total=1122 [2022-04-08 12:41:45,340 INFO L913 BasicCegarLoop]: 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-08 12:41:45,340 INFO L914 BasicCegarLoop]: 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-08 12:41:45,340 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-04-08 12:41:45,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2022-04-08 12:41:45,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:45,464 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-08 12:41:45,464 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-08 12:41:45,465 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-08 12:41:45,471 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:45,471 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-04-08 12:41:45,471 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-04-08 12:41:45,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:45,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:45,472 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-08 12:41:45,472 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-08 12:41:45,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:45,474 INFO L93 Difference]: Finished difference Result 119 states and 131 transitions. [2022-04-08 12:41:45,474 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-04-08 12:41:45,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:45,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:45,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:45,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:45,475 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-08 12:41:45,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 131 transitions. [2022-04-08 12:41:45,477 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 131 transitions. Word has length 113 [2022-04-08 12:41:45,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:45,478 INFO L478 AbstractCegarLoop]: Abstraction has 119 states and 131 transitions. [2022-04-08 12:41:45,478 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.857142857142857) internal successors, (82), 13 states have internal predecessors, (82), 13 states have call successors, (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-08 12:41:45,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 119 states and 131 transitions. [2022-04-08 12:41:46,721 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-08 12:41:46,721 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 131 transitions. [2022-04-08 12:41:46,723 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 123 [2022-04-08 12:41:46,723 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:46,723 INFO L499 BasicCegarLoop]: 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-08 12:41:46,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:46,927 WARN L460 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-08 12:41:46,927 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:46,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1999651676, now seen corresponding path program 21 times [2022-04-08 12:41:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:46,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1582871817] [2022-04-08 12:41:46,928 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:46,928 INFO L85 PathProgramCache]: Analyzing trace with hash 1999651676, now seen corresponding path program 22 times [2022-04-08 12:41:46,928 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:46,928 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1822635548] [2022-04-08 12:41:46,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:46,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:46,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:46,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1346509079] [2022-04-08 12:41:46,942 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:41:46,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:46,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:46,943 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:46,943 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2022-04-08 12:41:47,002 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:41:47,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:47,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-08 12:41:47,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:47,027 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:47,574 INFO L272 TraceCheckUtils]: 0: Hoare triple {10690#true} call ULTIMATE.init(); {10690#true} is VALID [2022-04-08 12:41:47,575 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-08 12:41:47,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {10698#(<= ~counter~0 0)} assume true; {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,575 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10698#(<= ~counter~0 0)} {10690#true} #67#return; {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,576 INFO L272 TraceCheckUtils]: 4: Hoare triple {10698#(<= ~counter~0 0)} call #t~ret7 := main(); {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,576 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-08 12:41:47,576 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-08 12:41:47,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {10698#(<= ~counter~0 0)} ~cond := #in~cond; {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {10698#(<= ~counter~0 0)} assume !(0 == ~cond); {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,577 INFO L290 TraceCheckUtils]: 9: Hoare triple {10698#(<= ~counter~0 0)} assume true; {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,578 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10698#(<= ~counter~0 0)} {10698#(<= ~counter~0 0)} #59#return; {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,578 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-08 12:41:47,578 INFO L290 TraceCheckUtils]: 12: Hoare triple {10698#(<= ~counter~0 0)} ~cond := #in~cond; {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {10698#(<= ~counter~0 0)} assume !(0 == ~cond); {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {10698#(<= ~counter~0 0)} assume true; {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,579 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10698#(<= ~counter~0 0)} {10698#(<= ~counter~0 0)} #61#return; {10698#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:47,579 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-08 12:41:47,580 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-08 12:41:47,580 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-08 12:41:47,581 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-08 12:41:47,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {10747#(<= ~counter~0 1)} ~cond := #in~cond; {10747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:47,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {10747#(<= ~counter~0 1)} assume !(0 == ~cond); {10747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:47,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {10747#(<= ~counter~0 1)} assume true; {10747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:47,582 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10747#(<= ~counter~0 1)} {10747#(<= ~counter~0 1)} #63#return; {10747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:47,582 INFO L290 TraceCheckUtils]: 24: Hoare triple {10747#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10747#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:47,582 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-08 12:41:47,583 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-08 12:41:47,583 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-08 12:41:47,584 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-08 12:41:47,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {10775#(<= ~counter~0 2)} ~cond := #in~cond; {10775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:47,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {10775#(<= ~counter~0 2)} assume !(0 == ~cond); {10775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:47,584 INFO L290 TraceCheckUtils]: 31: Hoare triple {10775#(<= ~counter~0 2)} assume true; {10775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:47,585 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10775#(<= ~counter~0 2)} {10775#(<= ~counter~0 2)} #63#return; {10775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:47,585 INFO L290 TraceCheckUtils]: 33: Hoare triple {10775#(<= ~counter~0 2)} assume !!(0 != ~r~0); {10775#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:47,585 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-08 12:41:47,586 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-08 12:41:47,586 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-08 12:41:47,586 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-08 12:41:47,587 INFO L290 TraceCheckUtils]: 38: Hoare triple {10803#(<= ~counter~0 3)} ~cond := #in~cond; {10803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:47,587 INFO L290 TraceCheckUtils]: 39: Hoare triple {10803#(<= ~counter~0 3)} assume !(0 == ~cond); {10803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:47,587 INFO L290 TraceCheckUtils]: 40: Hoare triple {10803#(<= ~counter~0 3)} assume true; {10803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:47,588 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10803#(<= ~counter~0 3)} {10803#(<= ~counter~0 3)} #63#return; {10803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:47,588 INFO L290 TraceCheckUtils]: 42: Hoare triple {10803#(<= ~counter~0 3)} assume !!(0 != ~r~0); {10803#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:47,588 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-08 12:41:47,589 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-08 12:41:47,589 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-08 12:41:47,589 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-08 12:41:47,589 INFO L290 TraceCheckUtils]: 47: Hoare triple {10831#(<= ~counter~0 4)} ~cond := #in~cond; {10831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:47,590 INFO L290 TraceCheckUtils]: 48: Hoare triple {10831#(<= ~counter~0 4)} assume !(0 == ~cond); {10831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:47,590 INFO L290 TraceCheckUtils]: 49: Hoare triple {10831#(<= ~counter~0 4)} assume true; {10831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:47,590 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10831#(<= ~counter~0 4)} {10831#(<= ~counter~0 4)} #63#return; {10831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:47,591 INFO L290 TraceCheckUtils]: 51: Hoare triple {10831#(<= ~counter~0 4)} assume !!(0 != ~r~0); {10831#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:47,591 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-08 12:41:47,591 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-08 12:41:47,592 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-08 12:41:47,592 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-08 12:41:47,592 INFO L290 TraceCheckUtils]: 56: Hoare triple {10859#(<= ~counter~0 5)} ~cond := #in~cond; {10859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:47,593 INFO L290 TraceCheckUtils]: 57: Hoare triple {10859#(<= ~counter~0 5)} assume !(0 == ~cond); {10859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:47,593 INFO L290 TraceCheckUtils]: 58: Hoare triple {10859#(<= ~counter~0 5)} assume true; {10859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:47,593 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10859#(<= ~counter~0 5)} {10859#(<= ~counter~0 5)} #63#return; {10859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:47,594 INFO L290 TraceCheckUtils]: 60: Hoare triple {10859#(<= ~counter~0 5)} assume !!(0 != ~r~0); {10859#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:47,594 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-08 12:41:47,594 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-08 12:41:47,595 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-08 12:41:47,595 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-08 12:41:47,595 INFO L290 TraceCheckUtils]: 65: Hoare triple {10887#(<= ~counter~0 6)} ~cond := #in~cond; {10887#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:47,595 INFO L290 TraceCheckUtils]: 66: Hoare triple {10887#(<= ~counter~0 6)} assume !(0 == ~cond); {10887#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:47,596 INFO L290 TraceCheckUtils]: 67: Hoare triple {10887#(<= ~counter~0 6)} assume true; {10887#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:47,596 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10887#(<= ~counter~0 6)} {10887#(<= ~counter~0 6)} #63#return; {10887#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:47,596 INFO L290 TraceCheckUtils]: 69: Hoare triple {10887#(<= ~counter~0 6)} assume !!(0 != ~r~0); {10887#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:47,597 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-08 12:41:47,597 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-08 12:41:47,597 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-08 12:41:47,598 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-08 12:41:47,598 INFO L290 TraceCheckUtils]: 74: Hoare triple {10915#(<= ~counter~0 7)} ~cond := #in~cond; {10915#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:47,598 INFO L290 TraceCheckUtils]: 75: Hoare triple {10915#(<= ~counter~0 7)} assume !(0 == ~cond); {10915#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:47,599 INFO L290 TraceCheckUtils]: 76: Hoare triple {10915#(<= ~counter~0 7)} assume true; {10915#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:47,599 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {10915#(<= ~counter~0 7)} {10915#(<= ~counter~0 7)} #63#return; {10915#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:47,599 INFO L290 TraceCheckUtils]: 78: Hoare triple {10915#(<= ~counter~0 7)} assume !!(0 != ~r~0); {10915#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:47,600 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-08 12:41:47,600 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-08 12:41:47,600 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-08 12:41:47,601 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-08 12:41:47,601 INFO L290 TraceCheckUtils]: 83: Hoare triple {10943#(<= ~counter~0 8)} ~cond := #in~cond; {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:47,601 INFO L290 TraceCheckUtils]: 84: Hoare triple {10943#(<= ~counter~0 8)} assume !(0 == ~cond); {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:47,602 INFO L290 TraceCheckUtils]: 85: Hoare triple {10943#(<= ~counter~0 8)} assume true; {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:47,602 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10943#(<= ~counter~0 8)} {10943#(<= ~counter~0 8)} #63#return; {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:47,602 INFO L290 TraceCheckUtils]: 87: Hoare triple {10943#(<= ~counter~0 8)} assume !!(0 != ~r~0); {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:47,602 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-08 12:41:47,603 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-08 12:41:47,603 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-08 12:41:47,604 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-08 12:41:47,604 INFO L290 TraceCheckUtils]: 92: Hoare triple {10971#(<= ~counter~0 9)} ~cond := #in~cond; {10971#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:47,604 INFO L290 TraceCheckUtils]: 93: Hoare triple {10971#(<= ~counter~0 9)} assume !(0 == ~cond); {10971#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:47,604 INFO L290 TraceCheckUtils]: 94: Hoare triple {10971#(<= ~counter~0 9)} assume true; {10971#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:47,605 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {10971#(<= ~counter~0 9)} {10971#(<= ~counter~0 9)} #63#return; {10971#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:47,605 INFO L290 TraceCheckUtils]: 96: Hoare triple {10971#(<= ~counter~0 9)} assume !!(0 != ~r~0); {10971#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:47,605 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-08 12:41:47,606 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-08 12:41:47,606 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-08 12:41:47,607 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-08 12:41:47,607 INFO L290 TraceCheckUtils]: 101: Hoare triple {10999#(<= ~counter~0 10)} ~cond := #in~cond; {10999#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:47,607 INFO L290 TraceCheckUtils]: 102: Hoare triple {10999#(<= ~counter~0 10)} assume !(0 == ~cond); {10999#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:47,607 INFO L290 TraceCheckUtils]: 103: Hoare triple {10999#(<= ~counter~0 10)} assume true; {10999#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:47,608 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10999#(<= ~counter~0 10)} {10999#(<= ~counter~0 10)} #63#return; {10999#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:47,608 INFO L290 TraceCheckUtils]: 105: Hoare triple {10999#(<= ~counter~0 10)} assume !!(0 != ~r~0); {10999#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:47,608 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-08 12:41:47,609 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-08 12:41:47,609 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-08 12:41:47,609 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-08 12:41:47,610 INFO L290 TraceCheckUtils]: 110: Hoare triple {11027#(<= ~counter~0 11)} ~cond := #in~cond; {11027#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:47,610 INFO L290 TraceCheckUtils]: 111: Hoare triple {11027#(<= ~counter~0 11)} assume !(0 == ~cond); {11027#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:47,610 INFO L290 TraceCheckUtils]: 112: Hoare triple {11027#(<= ~counter~0 11)} assume true; {11027#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:47,611 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {11027#(<= ~counter~0 11)} {11027#(<= ~counter~0 11)} #63#return; {11027#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:47,611 INFO L290 TraceCheckUtils]: 114: Hoare triple {11027#(<= ~counter~0 11)} assume !!(0 != ~r~0); {11027#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:47,611 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-08 12:41:47,611 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-08 12:41:47,612 INFO L290 TraceCheckUtils]: 117: Hoare triple {11055#(<= |main_#t~post6| 11)} assume !(#t~post6 < 20);havoc #t~post6; {10691#false} is VALID [2022-04-08 12:41:47,612 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-08 12:41:47,612 INFO L290 TraceCheckUtils]: 119: Hoare triple {10691#false} ~cond := #in~cond; {10691#false} is VALID [2022-04-08 12:41:47,612 INFO L290 TraceCheckUtils]: 120: Hoare triple {10691#false} assume 0 == ~cond; {10691#false} is VALID [2022-04-08 12:41:47,612 INFO L290 TraceCheckUtils]: 121: Hoare triple {10691#false} assume !false; {10691#false} is VALID [2022-04-08 12:41:47,612 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-08 12:41:47,613 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:48,167 INFO L290 TraceCheckUtils]: 121: Hoare triple {10691#false} assume !false; {10691#false} is VALID [2022-04-08 12:41:48,168 INFO L290 TraceCheckUtils]: 120: Hoare triple {10691#false} assume 0 == ~cond; {10691#false} is VALID [2022-04-08 12:41:48,168 INFO L290 TraceCheckUtils]: 119: Hoare triple {10691#false} ~cond := #in~cond; {10691#false} is VALID [2022-04-08 12:41:48,168 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-08 12:41:48,168 INFO L290 TraceCheckUtils]: 117: Hoare triple {11083#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {10691#false} is VALID [2022-04-08 12:41:48,168 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-08 12:41:48,169 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-08 12:41:48,169 INFO L290 TraceCheckUtils]: 114: Hoare triple {11087#(< ~counter~0 20)} assume !!(0 != ~r~0); {11087#(< ~counter~0 20)} is VALID [2022-04-08 12:41:48,169 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {10690#true} {11087#(< ~counter~0 20)} #63#return; {11087#(< ~counter~0 20)} is VALID [2022-04-08 12:41:48,169 INFO L290 TraceCheckUtils]: 112: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,170 INFO L290 TraceCheckUtils]: 111: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,170 INFO L290 TraceCheckUtils]: 110: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,170 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-08 12:41:48,170 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-08 12:41:48,170 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-08 12:41:48,171 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-08 12:41:48,171 INFO L290 TraceCheckUtils]: 105: Hoare triple {11115#(< ~counter~0 19)} assume !!(0 != ~r~0); {11115#(< ~counter~0 19)} is VALID [2022-04-08 12:41:48,171 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {10690#true} {11115#(< ~counter~0 19)} #63#return; {11115#(< ~counter~0 19)} is VALID [2022-04-08 12:41:48,172 INFO L290 TraceCheckUtils]: 103: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,172 INFO L290 TraceCheckUtils]: 102: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,172 INFO L290 TraceCheckUtils]: 101: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,172 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-08 12:41:48,173 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-08 12:41:48,173 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-08 12:41:48,173 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-08 12:41:48,175 INFO L290 TraceCheckUtils]: 96: Hoare triple {11143#(< ~counter~0 18)} assume !!(0 != ~r~0); {11143#(< ~counter~0 18)} is VALID [2022-04-08 12:41:48,176 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {10690#true} {11143#(< ~counter~0 18)} #63#return; {11143#(< ~counter~0 18)} is VALID [2022-04-08 12:41:48,176 INFO L290 TraceCheckUtils]: 94: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,176 INFO L290 TraceCheckUtils]: 93: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,176 INFO L290 TraceCheckUtils]: 92: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,176 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-08 12:41:48,176 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-08 12:41:48,177 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-08 12:41:48,177 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-08 12:41:48,177 INFO L290 TraceCheckUtils]: 87: Hoare triple {11171#(< ~counter~0 17)} assume !!(0 != ~r~0); {11171#(< ~counter~0 17)} is VALID [2022-04-08 12:41:48,178 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {10690#true} {11171#(< ~counter~0 17)} #63#return; {11171#(< ~counter~0 17)} is VALID [2022-04-08 12:41:48,178 INFO L290 TraceCheckUtils]: 85: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,178 INFO L290 TraceCheckUtils]: 84: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,178 INFO L290 TraceCheckUtils]: 83: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,178 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-08 12:41:48,178 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-08 12:41:48,179 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-08 12:41:48,179 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-08 12:41:48,179 INFO L290 TraceCheckUtils]: 78: Hoare triple {11199#(< ~counter~0 16)} assume !!(0 != ~r~0); {11199#(< ~counter~0 16)} is VALID [2022-04-08 12:41:48,179 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {10690#true} {11199#(< ~counter~0 16)} #63#return; {11199#(< ~counter~0 16)} is VALID [2022-04-08 12:41:48,180 INFO L290 TraceCheckUtils]: 76: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,180 INFO L290 TraceCheckUtils]: 75: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,180 INFO L290 TraceCheckUtils]: 74: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,180 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-08 12:41:48,180 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-08 12:41:48,180 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-08 12:41:48,181 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-08 12:41:48,181 INFO L290 TraceCheckUtils]: 69: Hoare triple {11227#(< ~counter~0 15)} assume !!(0 != ~r~0); {11227#(< ~counter~0 15)} is VALID [2022-04-08 12:41:48,181 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {10690#true} {11227#(< ~counter~0 15)} #63#return; {11227#(< ~counter~0 15)} is VALID [2022-04-08 12:41:48,181 INFO L290 TraceCheckUtils]: 67: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,182 INFO L290 TraceCheckUtils]: 66: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,182 INFO L290 TraceCheckUtils]: 65: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,182 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-08 12:41:48,188 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-08 12:41:48,189 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-08 12:41:48,189 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-08 12:41:48,189 INFO L290 TraceCheckUtils]: 60: Hoare triple {11255#(< ~counter~0 14)} assume !!(0 != ~r~0); {11255#(< ~counter~0 14)} is VALID [2022-04-08 12:41:48,190 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {10690#true} {11255#(< ~counter~0 14)} #63#return; {11255#(< ~counter~0 14)} is VALID [2022-04-08 12:41:48,190 INFO L290 TraceCheckUtils]: 58: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,190 INFO L290 TraceCheckUtils]: 57: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,190 INFO L290 TraceCheckUtils]: 56: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,190 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-08 12:41:48,190 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-08 12:41:48,191 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-08 12:41:48,191 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-08 12:41:48,191 INFO L290 TraceCheckUtils]: 51: Hoare triple {11283#(< ~counter~0 13)} assume !!(0 != ~r~0); {11283#(< ~counter~0 13)} is VALID [2022-04-08 12:41:48,192 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {10690#true} {11283#(< ~counter~0 13)} #63#return; {11283#(< ~counter~0 13)} is VALID [2022-04-08 12:41:48,192 INFO L290 TraceCheckUtils]: 49: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,192 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-08 12:41:48,192 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-08 12:41:48,193 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-08 12:41:48,193 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-08 12:41:48,193 INFO L290 TraceCheckUtils]: 42: Hoare triple {11027#(<= ~counter~0 11)} assume !!(0 != ~r~0); {11027#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:48,194 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {10690#true} {11027#(<= ~counter~0 11)} #63#return; {11027#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:48,194 INFO L290 TraceCheckUtils]: 40: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,194 INFO L290 TraceCheckUtils]: 39: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,194 INFO L290 TraceCheckUtils]: 38: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,194 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-08 12:41:48,194 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-08 12:41:48,195 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-08 12:41:48,195 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-08 12:41:48,195 INFO L290 TraceCheckUtils]: 33: Hoare triple {10999#(<= ~counter~0 10)} assume !!(0 != ~r~0); {10999#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:48,196 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {10690#true} {10999#(<= ~counter~0 10)} #63#return; {10999#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:48,196 INFO L290 TraceCheckUtils]: 31: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,196 INFO L290 TraceCheckUtils]: 30: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,196 INFO L290 TraceCheckUtils]: 29: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,196 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-08 12:41:48,196 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-08 12:41:48,197 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-08 12:41:48,197 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-08 12:41:48,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {10971#(<= ~counter~0 9)} assume !!(0 != ~r~0); {10971#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:48,198 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10690#true} {10971#(<= ~counter~0 9)} #63#return; {10971#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:48,198 INFO L290 TraceCheckUtils]: 22: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,198 INFO L290 TraceCheckUtils]: 21: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,198 INFO L290 TraceCheckUtils]: 20: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,198 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-08 12:41:48,198 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-08 12:41:48,199 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-08 12:41:48,199 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-08 12:41:48,199 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10690#true} {10943#(<= ~counter~0 8)} #61#return; {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:48,199 INFO L290 TraceCheckUtils]: 14: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,200 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-08 12:41:48,200 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10690#true} {10943#(<= ~counter~0 8)} #59#return; {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:48,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {10690#true} assume true; {10690#true} is VALID [2022-04-08 12:41:48,200 INFO L290 TraceCheckUtils]: 8: Hoare triple {10690#true} assume !(0 == ~cond); {10690#true} is VALID [2022-04-08 12:41:48,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {10690#true} ~cond := #in~cond; {10690#true} is VALID [2022-04-08 12:41:48,200 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-08 12:41:48,201 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-08 12:41:48,201 INFO L272 TraceCheckUtils]: 4: Hoare triple {10943#(<= ~counter~0 8)} call #t~ret7 := main(); {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:48,201 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10943#(<= ~counter~0 8)} {10690#true} #67#return; {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:48,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {10943#(<= ~counter~0 8)} assume true; {10943#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:48,202 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-08 12:41:48,202 INFO L272 TraceCheckUtils]: 0: Hoare triple {10690#true} call ULTIMATE.init(); {10690#true} is VALID [2022-04-08 12:41:48,202 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-08 12:41:48,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:48,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1822635548] [2022-04-08 12:41:48,203 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:48,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346509079] [2022-04-08 12:41:48,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346509079] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:48,203 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:48,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 24 [2022-04-08 12:41:48,203 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:48,203 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1582871817] [2022-04-08 12:41:48,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1582871817] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:48,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:48,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-08 12:41:48,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [134683120] [2022-04-08 12:41:48,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:48,204 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-08 12:41:48,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:48,204 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-08 12:41:48,282 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-08 12:41:48,282 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-08 12:41:48,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:48,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-08 12:41:48,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:41:48,283 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-08 12:41:48,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:48,690 INFO L93 Difference]: Finished difference Result 133 states and 146 transitions. [2022-04-08 12:41:48,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-08 12:41:48,690 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-08 12:41:48,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:48,691 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-08 12:41:48,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2022-04-08 12:41:48,693 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-08 12:41:48,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 145 transitions. [2022-04-08 12:41:48,695 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 145 transitions. [2022-04-08 12:41:48,783 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-08 12:41:48,784 INFO L225 Difference]: With dead ends: 133 [2022-04-08 12:41:48,785 INFO L226 Difference]: Without dead ends: 128 [2022-04-08 12:41:48,785 INFO L912 BasicCegarLoop]: 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-08 12:41:48,786 INFO L913 BasicCegarLoop]: 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-08 12:41:48,786 INFO L914 BasicCegarLoop]: 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-08 12:41:48,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-04-08 12:41:48,909 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-04-08 12:41:48,909 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:48,909 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-08 12:41:48,910 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-08 12:41:48,919 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-08 12:41:48,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:48,921 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-04-08 12:41:48,921 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-04-08 12:41:48,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:48,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:48,921 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-08 12:41:48,921 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-08 12:41:48,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:48,923 INFO L93 Difference]: Finished difference Result 128 states and 141 transitions. [2022-04-08 12:41:48,923 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-04-08 12:41:48,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:48,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:48,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:48,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:48,924 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-08 12:41:48,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 141 transitions. [2022-04-08 12:41:48,934 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 141 transitions. Word has length 122 [2022-04-08 12:41:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:48,935 INFO L478 AbstractCegarLoop]: Abstraction has 128 states and 141 transitions. [2022-04-08 12:41:48,935 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.933333333333334) internal successors, (89), 14 states have internal predecessors, (89), 14 states have call successors, (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-08 12:41:48,935 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 128 states and 141 transitions. [2022-04-08 12:41:50,410 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:50,410 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 141 transitions. [2022-04-08 12:41:50,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-08 12:41:50,411 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:50,411 INFO L499 BasicCegarLoop]: 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-08 12:41:50,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:50,611 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2022-04-08 12:41:50,611 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:50,612 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 881443734, now seen corresponding path program 23 times [2022-04-08 12:41:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:50,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2075951912] [2022-04-08 12:41:50,612 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:50,612 INFO L85 PathProgramCache]: Analyzing trace with hash 881443734, now seen corresponding path program 24 times [2022-04-08 12:41:50,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:50,612 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365117826] [2022-04-08 12:41:50,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:50,613 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:50,625 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:50,625 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [460238740] [2022-04-08 12:41:50,625 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:41:50,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:50,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:50,626 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:50,627 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2022-04-08 12:41:52,250 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 13 check-sat command(s) [2022-04-08 12:41:52,251 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:52,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 333 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-08 12:41:52,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:52,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:52,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-08 12:41:52,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {12245#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,856 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12253#(<= ~counter~0 0)} {12245#true} #67#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,857 INFO L272 TraceCheckUtils]: 4: Hoare triple {12253#(<= ~counter~0 0)} call #t~ret7 := main(); {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,857 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-08 12:41:52,857 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-08 12:41:52,857 INFO L290 TraceCheckUtils]: 7: Hoare triple {12253#(<= ~counter~0 0)} ~cond := #in~cond; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {12253#(<= ~counter~0 0)} assume !(0 == ~cond); {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,858 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12253#(<= ~counter~0 0)} {12253#(<= ~counter~0 0)} #59#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,859 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-08 12:41:52,859 INFO L290 TraceCheckUtils]: 12: Hoare triple {12253#(<= ~counter~0 0)} ~cond := #in~cond; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,859 INFO L290 TraceCheckUtils]: 13: Hoare triple {12253#(<= ~counter~0 0)} assume !(0 == ~cond); {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {12253#(<= ~counter~0 0)} assume true; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,860 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12253#(<= ~counter~0 0)} {12253#(<= ~counter~0 0)} #61#return; {12253#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:52,860 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-08 12:41:52,861 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-08 12:41:52,861 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-08 12:41:52,861 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-08 12:41:52,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {12302#(<= ~counter~0 1)} ~cond := #in~cond; {12302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:52,862 INFO L290 TraceCheckUtils]: 21: Hoare triple {12302#(<= ~counter~0 1)} assume !(0 == ~cond); {12302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:52,862 INFO L290 TraceCheckUtils]: 22: Hoare triple {12302#(<= ~counter~0 1)} assume true; {12302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:52,863 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12302#(<= ~counter~0 1)} {12302#(<= ~counter~0 1)} #63#return; {12302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:52,863 INFO L290 TraceCheckUtils]: 24: Hoare triple {12302#(<= ~counter~0 1)} assume !!(0 != ~r~0); {12302#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:52,876 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-08 12:41:52,876 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-08 12:41:52,876 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-08 12:41:52,877 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-08 12:41:52,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {12330#(<= ~counter~0 2)} ~cond := #in~cond; {12330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:52,878 INFO L290 TraceCheckUtils]: 30: Hoare triple {12330#(<= ~counter~0 2)} assume !(0 == ~cond); {12330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:52,878 INFO L290 TraceCheckUtils]: 31: Hoare triple {12330#(<= ~counter~0 2)} assume true; {12330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:52,878 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12330#(<= ~counter~0 2)} {12330#(<= ~counter~0 2)} #63#return; {12330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:52,879 INFO L290 TraceCheckUtils]: 33: Hoare triple {12330#(<= ~counter~0 2)} assume !!(0 != ~r~0); {12330#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:52,879 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-08 12:41:52,879 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-08 12:41:52,880 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-08 12:41:52,880 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-08 12:41:52,880 INFO L290 TraceCheckUtils]: 38: Hoare triple {12358#(<= ~counter~0 3)} ~cond := #in~cond; {12358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:52,881 INFO L290 TraceCheckUtils]: 39: Hoare triple {12358#(<= ~counter~0 3)} assume !(0 == ~cond); {12358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:52,881 INFO L290 TraceCheckUtils]: 40: Hoare triple {12358#(<= ~counter~0 3)} assume true; {12358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:52,881 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12358#(<= ~counter~0 3)} {12358#(<= ~counter~0 3)} #63#return; {12358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:52,882 INFO L290 TraceCheckUtils]: 42: Hoare triple {12358#(<= ~counter~0 3)} assume !!(0 != ~r~0); {12358#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:52,882 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-08 12:41:52,882 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-08 12:41:52,883 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-08 12:41:52,883 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-08 12:41:52,883 INFO L290 TraceCheckUtils]: 47: Hoare triple {12386#(<= ~counter~0 4)} ~cond := #in~cond; {12386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:52,883 INFO L290 TraceCheckUtils]: 48: Hoare triple {12386#(<= ~counter~0 4)} assume !(0 == ~cond); {12386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:52,884 INFO L290 TraceCheckUtils]: 49: Hoare triple {12386#(<= ~counter~0 4)} assume true; {12386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:52,884 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12386#(<= ~counter~0 4)} {12386#(<= ~counter~0 4)} #63#return; {12386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:52,884 INFO L290 TraceCheckUtils]: 51: Hoare triple {12386#(<= ~counter~0 4)} assume !!(0 != ~r~0); {12386#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:52,885 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-08 12:41:52,885 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-08 12:41:52,885 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-08 12:41:52,886 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-08 12:41:52,886 INFO L290 TraceCheckUtils]: 56: Hoare triple {12414#(<= ~counter~0 5)} ~cond := #in~cond; {12414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:52,886 INFO L290 TraceCheckUtils]: 57: Hoare triple {12414#(<= ~counter~0 5)} assume !(0 == ~cond); {12414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:52,887 INFO L290 TraceCheckUtils]: 58: Hoare triple {12414#(<= ~counter~0 5)} assume true; {12414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:52,887 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12414#(<= ~counter~0 5)} {12414#(<= ~counter~0 5)} #63#return; {12414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:52,887 INFO L290 TraceCheckUtils]: 60: Hoare triple {12414#(<= ~counter~0 5)} assume !!(0 != ~r~0); {12414#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:52,888 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-08 12:41:52,888 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-08 12:41:52,888 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-08 12:41:52,889 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-08 12:41:52,889 INFO L290 TraceCheckUtils]: 65: Hoare triple {12442#(<= ~counter~0 6)} ~cond := #in~cond; {12442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:52,889 INFO L290 TraceCheckUtils]: 66: Hoare triple {12442#(<= ~counter~0 6)} assume !(0 == ~cond); {12442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:52,890 INFO L290 TraceCheckUtils]: 67: Hoare triple {12442#(<= ~counter~0 6)} assume true; {12442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:52,890 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12442#(<= ~counter~0 6)} {12442#(<= ~counter~0 6)} #63#return; {12442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:52,890 INFO L290 TraceCheckUtils]: 69: Hoare triple {12442#(<= ~counter~0 6)} assume !!(0 != ~r~0); {12442#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:52,890 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-08 12:41:52,891 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-08 12:41:52,891 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-08 12:41:52,892 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-08 12:41:52,892 INFO L290 TraceCheckUtils]: 74: Hoare triple {12470#(<= ~counter~0 7)} ~cond := #in~cond; {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:52,892 INFO L290 TraceCheckUtils]: 75: Hoare triple {12470#(<= ~counter~0 7)} assume !(0 == ~cond); {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:52,892 INFO L290 TraceCheckUtils]: 76: Hoare triple {12470#(<= ~counter~0 7)} assume true; {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:52,897 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12470#(<= ~counter~0 7)} {12470#(<= ~counter~0 7)} #63#return; {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:52,897 INFO L290 TraceCheckUtils]: 78: Hoare triple {12470#(<= ~counter~0 7)} assume !!(0 != ~r~0); {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:52,897 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-08 12:41:52,898 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-08 12:41:52,898 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-08 12:41:52,899 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-08 12:41:52,899 INFO L290 TraceCheckUtils]: 83: Hoare triple {12498#(<= ~counter~0 8)} ~cond := #in~cond; {12498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:52,899 INFO L290 TraceCheckUtils]: 84: Hoare triple {12498#(<= ~counter~0 8)} assume !(0 == ~cond); {12498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:52,899 INFO L290 TraceCheckUtils]: 85: Hoare triple {12498#(<= ~counter~0 8)} assume true; {12498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:52,900 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12498#(<= ~counter~0 8)} {12498#(<= ~counter~0 8)} #63#return; {12498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:52,900 INFO L290 TraceCheckUtils]: 87: Hoare triple {12498#(<= ~counter~0 8)} assume !!(0 != ~r~0); {12498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:52,900 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-08 12:41:52,901 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-08 12:41:52,901 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-08 12:41:52,901 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-08 12:41:52,902 INFO L290 TraceCheckUtils]: 92: Hoare triple {12526#(<= ~counter~0 9)} ~cond := #in~cond; {12526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:52,902 INFO L290 TraceCheckUtils]: 93: Hoare triple {12526#(<= ~counter~0 9)} assume !(0 == ~cond); {12526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:52,902 INFO L290 TraceCheckUtils]: 94: Hoare triple {12526#(<= ~counter~0 9)} assume true; {12526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:52,903 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {12526#(<= ~counter~0 9)} {12526#(<= ~counter~0 9)} #63#return; {12526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:52,903 INFO L290 TraceCheckUtils]: 96: Hoare triple {12526#(<= ~counter~0 9)} assume !!(0 != ~r~0); {12526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:52,903 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-08 12:41:52,904 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-08 12:41:52,904 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-08 12:41:52,904 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-08 12:41:52,905 INFO L290 TraceCheckUtils]: 101: Hoare triple {12554#(<= ~counter~0 10)} ~cond := #in~cond; {12554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:52,905 INFO L290 TraceCheckUtils]: 102: Hoare triple {12554#(<= ~counter~0 10)} assume !(0 == ~cond); {12554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:52,905 INFO L290 TraceCheckUtils]: 103: Hoare triple {12554#(<= ~counter~0 10)} assume true; {12554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:52,906 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12554#(<= ~counter~0 10)} {12554#(<= ~counter~0 10)} #63#return; {12554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:52,906 INFO L290 TraceCheckUtils]: 105: Hoare triple {12554#(<= ~counter~0 10)} assume !!(0 != ~r~0); {12554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:52,906 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-08 12:41:52,907 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-08 12:41:52,907 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-08 12:41:52,907 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-08 12:41:52,907 INFO L290 TraceCheckUtils]: 110: Hoare triple {12582#(<= ~counter~0 11)} ~cond := #in~cond; {12582#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:52,908 INFO L290 TraceCheckUtils]: 111: Hoare triple {12582#(<= ~counter~0 11)} assume !(0 == ~cond); {12582#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:52,908 INFO L290 TraceCheckUtils]: 112: Hoare triple {12582#(<= ~counter~0 11)} assume true; {12582#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:52,908 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {12582#(<= ~counter~0 11)} {12582#(<= ~counter~0 11)} #63#return; {12582#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:52,909 INFO L290 TraceCheckUtils]: 114: Hoare triple {12582#(<= ~counter~0 11)} assume !!(0 != ~r~0); {12582#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:52,909 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-08 12:41:52,909 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-08 12:41:52,910 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-08 12:41:52,910 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-08 12:41:52,910 INFO L290 TraceCheckUtils]: 119: Hoare triple {12610#(<= ~counter~0 12)} ~cond := #in~cond; {12610#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:52,911 INFO L290 TraceCheckUtils]: 120: Hoare triple {12610#(<= ~counter~0 12)} assume !(0 == ~cond); {12610#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:52,911 INFO L290 TraceCheckUtils]: 121: Hoare triple {12610#(<= ~counter~0 12)} assume true; {12610#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:52,911 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12610#(<= ~counter~0 12)} {12610#(<= ~counter~0 12)} #63#return; {12610#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:52,912 INFO L290 TraceCheckUtils]: 123: Hoare triple {12610#(<= ~counter~0 12)} assume !!(0 != ~r~0); {12610#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:52,912 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-08 12:41:52,912 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-08 12:41:52,913 INFO L290 TraceCheckUtils]: 126: Hoare triple {12638#(<= |main_#t~post6| 12)} assume !(#t~post6 < 20);havoc #t~post6; {12246#false} is VALID [2022-04-08 12:41:52,913 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-08 12:41:52,913 INFO L290 TraceCheckUtils]: 128: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-08 12:41:52,913 INFO L290 TraceCheckUtils]: 129: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-08 12:41:52,913 INFO L290 TraceCheckUtils]: 130: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-08 12:41:52,913 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-08 12:41:52,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:53,494 INFO L290 TraceCheckUtils]: 130: Hoare triple {12246#false} assume !false; {12246#false} is VALID [2022-04-08 12:41:53,494 INFO L290 TraceCheckUtils]: 129: Hoare triple {12246#false} assume 0 == ~cond; {12246#false} is VALID [2022-04-08 12:41:53,494 INFO L290 TraceCheckUtils]: 128: Hoare triple {12246#false} ~cond := #in~cond; {12246#false} is VALID [2022-04-08 12:41:53,494 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-08 12:41:53,494 INFO L290 TraceCheckUtils]: 126: Hoare triple {12666#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {12246#false} is VALID [2022-04-08 12:41:53,495 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-08 12:41:53,495 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-08 12:41:53,495 INFO L290 TraceCheckUtils]: 123: Hoare triple {12670#(< ~counter~0 20)} assume !!(0 != ~r~0); {12670#(< ~counter~0 20)} is VALID [2022-04-08 12:41:53,496 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {12245#true} {12670#(< ~counter~0 20)} #63#return; {12670#(< ~counter~0 20)} is VALID [2022-04-08 12:41:53,496 INFO L290 TraceCheckUtils]: 121: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,496 INFO L290 TraceCheckUtils]: 120: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,496 INFO L290 TraceCheckUtils]: 119: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,496 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-08 12:41:53,496 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-08 12:41:53,497 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-08 12:41:53,497 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-08 12:41:53,497 INFO L290 TraceCheckUtils]: 114: Hoare triple {12698#(< ~counter~0 19)} assume !!(0 != ~r~0); {12698#(< ~counter~0 19)} is VALID [2022-04-08 12:41:53,498 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {12245#true} {12698#(< ~counter~0 19)} #63#return; {12698#(< ~counter~0 19)} is VALID [2022-04-08 12:41:53,498 INFO L290 TraceCheckUtils]: 112: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,498 INFO L290 TraceCheckUtils]: 111: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,498 INFO L290 TraceCheckUtils]: 110: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,498 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-08 12:41:53,498 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-08 12:41:53,499 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-08 12:41:53,499 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-08 12:41:53,499 INFO L290 TraceCheckUtils]: 105: Hoare triple {12726#(< ~counter~0 18)} assume !!(0 != ~r~0); {12726#(< ~counter~0 18)} is VALID [2022-04-08 12:41:53,500 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {12245#true} {12726#(< ~counter~0 18)} #63#return; {12726#(< ~counter~0 18)} is VALID [2022-04-08 12:41:53,500 INFO L290 TraceCheckUtils]: 103: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,500 INFO L290 TraceCheckUtils]: 102: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,500 INFO L290 TraceCheckUtils]: 101: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,500 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-08 12:41:53,500 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-08 12:41:53,501 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-08 12:41:53,501 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-08 12:41:53,501 INFO L290 TraceCheckUtils]: 96: Hoare triple {12754#(< ~counter~0 17)} assume !!(0 != ~r~0); {12754#(< ~counter~0 17)} is VALID [2022-04-08 12:41:53,502 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {12245#true} {12754#(< ~counter~0 17)} #63#return; {12754#(< ~counter~0 17)} is VALID [2022-04-08 12:41:53,502 INFO L290 TraceCheckUtils]: 94: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,502 INFO L290 TraceCheckUtils]: 93: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,502 INFO L290 TraceCheckUtils]: 92: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,502 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-08 12:41:53,502 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-08 12:41:53,503 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-08 12:41:53,503 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-08 12:41:53,503 INFO L290 TraceCheckUtils]: 87: Hoare triple {12782#(< ~counter~0 16)} assume !!(0 != ~r~0); {12782#(< ~counter~0 16)} is VALID [2022-04-08 12:41:53,504 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {12245#true} {12782#(< ~counter~0 16)} #63#return; {12782#(< ~counter~0 16)} is VALID [2022-04-08 12:41:53,504 INFO L290 TraceCheckUtils]: 85: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,504 INFO L290 TraceCheckUtils]: 84: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,504 INFO L290 TraceCheckUtils]: 83: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,504 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-08 12:41:53,504 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-08 12:41:53,504 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-08 12:41:53,505 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-08 12:41:53,505 INFO L290 TraceCheckUtils]: 78: Hoare triple {12810#(< ~counter~0 15)} assume !!(0 != ~r~0); {12810#(< ~counter~0 15)} is VALID [2022-04-08 12:41:53,505 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {12245#true} {12810#(< ~counter~0 15)} #63#return; {12810#(< ~counter~0 15)} is VALID [2022-04-08 12:41:53,506 INFO L290 TraceCheckUtils]: 76: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,506 INFO L290 TraceCheckUtils]: 75: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,506 INFO L290 TraceCheckUtils]: 74: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,506 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-08 12:41:53,506 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-08 12:41:53,506 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-08 12:41:53,507 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-08 12:41:53,507 INFO L290 TraceCheckUtils]: 69: Hoare triple {12838#(< ~counter~0 14)} assume !!(0 != ~r~0); {12838#(< ~counter~0 14)} is VALID [2022-04-08 12:41:53,507 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {12245#true} {12838#(< ~counter~0 14)} #63#return; {12838#(< ~counter~0 14)} is VALID [2022-04-08 12:41:53,507 INFO L290 TraceCheckUtils]: 67: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,507 INFO L290 TraceCheckUtils]: 66: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,508 INFO L290 TraceCheckUtils]: 65: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,508 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-08 12:41:53,508 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-08 12:41:53,508 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-08 12:41:53,509 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-08 12:41:53,509 INFO L290 TraceCheckUtils]: 60: Hoare triple {12610#(<= ~counter~0 12)} assume !!(0 != ~r~0); {12610#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:53,509 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {12245#true} {12610#(<= ~counter~0 12)} #63#return; {12610#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:53,509 INFO L290 TraceCheckUtils]: 58: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,509 INFO L290 TraceCheckUtils]: 56: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,510 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-08 12:41:53,510 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-08 12:41:53,510 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-08 12:41:53,510 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-08 12:41:53,511 INFO L290 TraceCheckUtils]: 51: Hoare triple {12582#(<= ~counter~0 11)} assume !!(0 != ~r~0); {12582#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:53,511 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {12245#true} {12582#(<= ~counter~0 11)} #63#return; {12582#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:53,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,511 INFO L290 TraceCheckUtils]: 48: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,511 INFO L290 TraceCheckUtils]: 47: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,511 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-08 12:41:53,512 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-08 12:41:53,512 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-08 12:41:53,512 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-08 12:41:53,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {12554#(<= ~counter~0 10)} assume !!(0 != ~r~0); {12554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:53,513 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {12245#true} {12554#(<= ~counter~0 10)} #63#return; {12554#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:53,513 INFO L290 TraceCheckUtils]: 40: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,513 INFO L290 TraceCheckUtils]: 39: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,513 INFO L290 TraceCheckUtils]: 38: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,513 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-08 12:41:53,515 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-08 12:41:53,515 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-08 12:41:53,516 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-08 12:41:53,516 INFO L290 TraceCheckUtils]: 33: Hoare triple {12526#(<= ~counter~0 9)} assume !!(0 != ~r~0); {12526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:53,517 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {12245#true} {12526#(<= ~counter~0 9)} #63#return; {12526#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:53,517 INFO L290 TraceCheckUtils]: 31: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,517 INFO L290 TraceCheckUtils]: 30: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,517 INFO L290 TraceCheckUtils]: 29: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,517 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-08 12:41:53,517 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-08 12:41:53,518 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-08 12:41:53,518 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-08 12:41:53,518 INFO L290 TraceCheckUtils]: 24: Hoare triple {12498#(<= ~counter~0 8)} assume !!(0 != ~r~0); {12498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:53,519 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12245#true} {12498#(<= ~counter~0 8)} #63#return; {12498#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:53,519 INFO L290 TraceCheckUtils]: 22: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,519 INFO L290 TraceCheckUtils]: 21: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,519 INFO L290 TraceCheckUtils]: 20: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,519 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-08 12:41:53,519 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-08 12:41:53,520 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-08 12:41:53,520 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-08 12:41:53,520 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12245#true} {12470#(<= ~counter~0 7)} #61#return; {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:53,520 INFO L290 TraceCheckUtils]: 14: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,521 INFO L290 TraceCheckUtils]: 13: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,521 INFO L290 TraceCheckUtils]: 12: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,521 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-08 12:41:53,521 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12245#true} {12470#(<= ~counter~0 7)} #59#return; {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:53,521 INFO L290 TraceCheckUtils]: 9: Hoare triple {12245#true} assume true; {12245#true} is VALID [2022-04-08 12:41:53,521 INFO L290 TraceCheckUtils]: 8: Hoare triple {12245#true} assume !(0 == ~cond); {12245#true} is VALID [2022-04-08 12:41:53,521 INFO L290 TraceCheckUtils]: 7: Hoare triple {12245#true} ~cond := #in~cond; {12245#true} is VALID [2022-04-08 12:41:53,521 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-08 12:41:53,522 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-08 12:41:53,522 INFO L272 TraceCheckUtils]: 4: Hoare triple {12470#(<= ~counter~0 7)} call #t~ret7 := main(); {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:53,522 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12470#(<= ~counter~0 7)} {12245#true} #67#return; {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:53,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {12470#(<= ~counter~0 7)} assume true; {12470#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:53,523 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-08 12:41:53,523 INFO L272 TraceCheckUtils]: 0: Hoare triple {12245#true} call ULTIMATE.init(); {12245#true} is VALID [2022-04-08 12:41:53,524 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-08 12:41:53,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365117826] [2022-04-08 12:41:53,524 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [460238740] [2022-04-08 12:41:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [460238740] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:53,524 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:53,524 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 24 [2022-04-08 12:41:53,524 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:53,524 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2075951912] [2022-04-08 12:41:53,524 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2075951912] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:53,525 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:53,525 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-08 12:41:53,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813781362] [2022-04-08 12:41:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:53,525 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-08 12:41:53,525 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:53,525 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-08 12:41:53,601 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:53,601 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-08 12:41:53,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:53,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-08 12:41:53,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:41:53,602 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-08 12:41:54,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:54,033 INFO L93 Difference]: Finished difference Result 142 states and 156 transitions. [2022-04-08 12:41:54,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-08 12:41:54,033 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-08 12:41:54,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:54,034 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-08 12:41:54,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 155 transitions. [2022-04-08 12:41:54,036 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-08 12:41:54,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 155 transitions. [2022-04-08 12:41:54,038 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 155 transitions. [2022-04-08 12:41:54,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:54,133 INFO L225 Difference]: With dead ends: 142 [2022-04-08 12:41:54,133 INFO L226 Difference]: Without dead ends: 137 [2022-04-08 12:41:54,133 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 238 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=512, Invalid=748, Unknown=0, NotChecked=0, Total=1260 [2022-04-08 12:41:54,134 INFO L913 BasicCegarLoop]: 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-08 12:41:54,134 INFO L914 BasicCegarLoop]: 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-08 12:41:54,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-04-08 12:41:54,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-04-08 12:41:54,258 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:54,258 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-08 12:41:54,266 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-08 12:41:54,266 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-08 12:41:54,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:54,268 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-04-08 12:41:54,268 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-04-08 12:41:54,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:54,269 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:54,269 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-08 12:41:54,269 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-08 12:41:54,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:54,270 INFO L93 Difference]: Finished difference Result 137 states and 151 transitions. [2022-04-08 12:41:54,271 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-04-08 12:41:54,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:54,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:54,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:54,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:54,271 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-08 12:41:54,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 151 transitions. [2022-04-08 12:41:54,273 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 151 transitions. Word has length 131 [2022-04-08 12:41:54,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:54,274 INFO L478 AbstractCegarLoop]: Abstraction has 137 states and 151 transitions. [2022-04-08 12:41:54,274 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 6.0) internal successors, (96), 15 states have internal predecessors, (96), 15 states have call successors, (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-08 12:41:54,274 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 137 states and 151 transitions. [2022-04-08 12:41:56,443 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 150 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:41:56,444 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 151 transitions. [2022-04-08 12:41:56,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 141 [2022-04-08 12:41:56,444 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:41:56,444 INFO L499 BasicCegarLoop]: 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-08 12:41:56,452 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2022-04-08 12:41:56,645 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-04-08 12:41:56,645 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:41:56,645 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:41:56,645 INFO L85 PathProgramCache]: Analyzing trace with hash 2089018524, now seen corresponding path program 25 times [2022-04-08 12:41:56,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:56,645 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1342623563] [2022-04-08 12:41:56,646 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:41:56,646 INFO L85 PathProgramCache]: Analyzing trace with hash 2089018524, now seen corresponding path program 26 times [2022-04-08 12:41:56,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:41:56,646 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347071243] [2022-04-08 12:41:56,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:41:56,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:41:56,659 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:41:56,659 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105548198] [2022-04-08 12:41:56,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:41:56,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:41:56,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:41:56,660 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:41:56,661 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2022-04-08 12:41:56,721 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:41:56,721 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:41:56,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 353 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-08 12:41:56,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:41:56,745 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:41:57,375 INFO L272 TraceCheckUtils]: 0: Hoare triple {13910#true} call ULTIMATE.init(); {13910#true} is VALID [2022-04-08 12:41:57,376 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-08 12:41:57,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {13918#(<= ~counter~0 0)} assume true; {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,377 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13918#(<= ~counter~0 0)} {13910#true} #67#return; {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,377 INFO L272 TraceCheckUtils]: 4: Hoare triple {13918#(<= ~counter~0 0)} call #t~ret7 := main(); {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,377 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-08 12:41:57,378 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-08 12:41:57,378 INFO L290 TraceCheckUtils]: 7: Hoare triple {13918#(<= ~counter~0 0)} ~cond := #in~cond; {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,378 INFO L290 TraceCheckUtils]: 8: Hoare triple {13918#(<= ~counter~0 0)} assume !(0 == ~cond); {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,378 INFO L290 TraceCheckUtils]: 9: Hoare triple {13918#(<= ~counter~0 0)} assume true; {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,379 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13918#(<= ~counter~0 0)} {13918#(<= ~counter~0 0)} #59#return; {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,379 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-08 12:41:57,379 INFO L290 TraceCheckUtils]: 12: Hoare triple {13918#(<= ~counter~0 0)} ~cond := #in~cond; {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,380 INFO L290 TraceCheckUtils]: 13: Hoare triple {13918#(<= ~counter~0 0)} assume !(0 == ~cond); {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,380 INFO L290 TraceCheckUtils]: 14: Hoare triple {13918#(<= ~counter~0 0)} assume true; {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,380 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13918#(<= ~counter~0 0)} {13918#(<= ~counter~0 0)} #61#return; {13918#(<= ~counter~0 0)} is VALID [2022-04-08 12:41:57,380 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-08 12:41:57,381 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-08 12:41:57,381 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-08 12:41:57,382 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-08 12:41:57,382 INFO L290 TraceCheckUtils]: 20: Hoare triple {13967#(<= ~counter~0 1)} ~cond := #in~cond; {13967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:57,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {13967#(<= ~counter~0 1)} assume !(0 == ~cond); {13967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:57,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {13967#(<= ~counter~0 1)} assume true; {13967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:57,383 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13967#(<= ~counter~0 1)} {13967#(<= ~counter~0 1)} #63#return; {13967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:57,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {13967#(<= ~counter~0 1)} assume !!(0 != ~r~0); {13967#(<= ~counter~0 1)} is VALID [2022-04-08 12:41:57,383 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-08 12:41:57,384 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-08 12:41:57,384 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-08 12:41:57,385 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-08 12:41:57,385 INFO L290 TraceCheckUtils]: 29: Hoare triple {13995#(<= ~counter~0 2)} ~cond := #in~cond; {13995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:57,385 INFO L290 TraceCheckUtils]: 30: Hoare triple {13995#(<= ~counter~0 2)} assume !(0 == ~cond); {13995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:57,385 INFO L290 TraceCheckUtils]: 31: Hoare triple {13995#(<= ~counter~0 2)} assume true; {13995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:57,386 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13995#(<= ~counter~0 2)} {13995#(<= ~counter~0 2)} #63#return; {13995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:57,386 INFO L290 TraceCheckUtils]: 33: Hoare triple {13995#(<= ~counter~0 2)} assume !!(0 != ~r~0); {13995#(<= ~counter~0 2)} is VALID [2022-04-08 12:41:57,386 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-08 12:41:57,387 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-08 12:41:57,387 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-08 12:41:57,387 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-08 12:41:57,388 INFO L290 TraceCheckUtils]: 38: Hoare triple {14023#(<= ~counter~0 3)} ~cond := #in~cond; {14023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:57,388 INFO L290 TraceCheckUtils]: 39: Hoare triple {14023#(<= ~counter~0 3)} assume !(0 == ~cond); {14023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:57,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {14023#(<= ~counter~0 3)} assume true; {14023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:57,389 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {14023#(<= ~counter~0 3)} {14023#(<= ~counter~0 3)} #63#return; {14023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:57,389 INFO L290 TraceCheckUtils]: 42: Hoare triple {14023#(<= ~counter~0 3)} assume !!(0 != ~r~0); {14023#(<= ~counter~0 3)} is VALID [2022-04-08 12:41:57,389 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-08 12:41:57,390 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-08 12:41:57,390 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-08 12:41:57,390 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-08 12:41:57,391 INFO L290 TraceCheckUtils]: 47: Hoare triple {14051#(<= ~counter~0 4)} ~cond := #in~cond; {14051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:57,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {14051#(<= ~counter~0 4)} assume !(0 == ~cond); {14051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:57,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {14051#(<= ~counter~0 4)} assume true; {14051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:57,392 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {14051#(<= ~counter~0 4)} {14051#(<= ~counter~0 4)} #63#return; {14051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:57,392 INFO L290 TraceCheckUtils]: 51: Hoare triple {14051#(<= ~counter~0 4)} assume !!(0 != ~r~0); {14051#(<= ~counter~0 4)} is VALID [2022-04-08 12:41:57,392 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-08 12:41:57,392 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-08 12:41:57,393 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-08 12:41:57,393 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-08 12:41:57,393 INFO L290 TraceCheckUtils]: 56: Hoare triple {14079#(<= ~counter~0 5)} ~cond := #in~cond; {14079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:57,394 INFO L290 TraceCheckUtils]: 57: Hoare triple {14079#(<= ~counter~0 5)} assume !(0 == ~cond); {14079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:57,394 INFO L290 TraceCheckUtils]: 58: Hoare triple {14079#(<= ~counter~0 5)} assume true; {14079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:57,394 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {14079#(<= ~counter~0 5)} {14079#(<= ~counter~0 5)} #63#return; {14079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:57,395 INFO L290 TraceCheckUtils]: 60: Hoare triple {14079#(<= ~counter~0 5)} assume !!(0 != ~r~0); {14079#(<= ~counter~0 5)} is VALID [2022-04-08 12:41:57,395 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-08 12:41:57,395 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-08 12:41:57,396 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-08 12:41:57,397 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-08 12:41:57,397 INFO L290 TraceCheckUtils]: 65: Hoare triple {14107#(<= ~counter~0 6)} ~cond := #in~cond; {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:57,397 INFO L290 TraceCheckUtils]: 66: Hoare triple {14107#(<= ~counter~0 6)} assume !(0 == ~cond); {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:57,398 INFO L290 TraceCheckUtils]: 67: Hoare triple {14107#(<= ~counter~0 6)} assume true; {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:57,398 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {14107#(<= ~counter~0 6)} {14107#(<= ~counter~0 6)} #63#return; {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:57,398 INFO L290 TraceCheckUtils]: 69: Hoare triple {14107#(<= ~counter~0 6)} assume !!(0 != ~r~0); {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:57,399 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-08 12:41:57,399 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-08 12:41:57,399 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-08 12:41:57,400 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-08 12:41:57,400 INFO L290 TraceCheckUtils]: 74: Hoare triple {14135#(<= ~counter~0 7)} ~cond := #in~cond; {14135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:57,400 INFO L290 TraceCheckUtils]: 75: Hoare triple {14135#(<= ~counter~0 7)} assume !(0 == ~cond); {14135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:57,400 INFO L290 TraceCheckUtils]: 76: Hoare triple {14135#(<= ~counter~0 7)} assume true; {14135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:57,401 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {14135#(<= ~counter~0 7)} {14135#(<= ~counter~0 7)} #63#return; {14135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:57,401 INFO L290 TraceCheckUtils]: 78: Hoare triple {14135#(<= ~counter~0 7)} assume !!(0 != ~r~0); {14135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:57,401 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-08 12:41:57,402 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-08 12:41:57,402 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-08 12:41:57,403 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-08 12:41:57,403 INFO L290 TraceCheckUtils]: 83: Hoare triple {14163#(<= ~counter~0 8)} ~cond := #in~cond; {14163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:57,403 INFO L290 TraceCheckUtils]: 84: Hoare triple {14163#(<= ~counter~0 8)} assume !(0 == ~cond); {14163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:57,403 INFO L290 TraceCheckUtils]: 85: Hoare triple {14163#(<= ~counter~0 8)} assume true; {14163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:57,404 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {14163#(<= ~counter~0 8)} {14163#(<= ~counter~0 8)} #63#return; {14163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:57,404 INFO L290 TraceCheckUtils]: 87: Hoare triple {14163#(<= ~counter~0 8)} assume !!(0 != ~r~0); {14163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:57,405 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-08 12:41:57,405 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-08 12:41:57,405 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-08 12:41:57,406 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-08 12:41:57,406 INFO L290 TraceCheckUtils]: 92: Hoare triple {14191#(<= ~counter~0 9)} ~cond := #in~cond; {14191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:57,406 INFO L290 TraceCheckUtils]: 93: Hoare triple {14191#(<= ~counter~0 9)} assume !(0 == ~cond); {14191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:57,407 INFO L290 TraceCheckUtils]: 94: Hoare triple {14191#(<= ~counter~0 9)} assume true; {14191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:57,407 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {14191#(<= ~counter~0 9)} {14191#(<= ~counter~0 9)} #63#return; {14191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:57,407 INFO L290 TraceCheckUtils]: 96: Hoare triple {14191#(<= ~counter~0 9)} assume !!(0 != ~r~0); {14191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:57,408 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-08 12:41:57,408 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-08 12:41:57,408 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-08 12:41:57,409 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-08 12:41:57,409 INFO L290 TraceCheckUtils]: 101: Hoare triple {14219#(<= ~counter~0 10)} ~cond := #in~cond; {14219#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:57,409 INFO L290 TraceCheckUtils]: 102: Hoare triple {14219#(<= ~counter~0 10)} assume !(0 == ~cond); {14219#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:57,409 INFO L290 TraceCheckUtils]: 103: Hoare triple {14219#(<= ~counter~0 10)} assume true; {14219#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:57,410 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {14219#(<= ~counter~0 10)} {14219#(<= ~counter~0 10)} #63#return; {14219#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:57,410 INFO L290 TraceCheckUtils]: 105: Hoare triple {14219#(<= ~counter~0 10)} assume !!(0 != ~r~0); {14219#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:57,410 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-08 12:41:57,411 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-08 12:41:57,411 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-08 12:41:57,412 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-08 12:41:57,412 INFO L290 TraceCheckUtils]: 110: Hoare triple {14247#(<= ~counter~0 11)} ~cond := #in~cond; {14247#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:57,412 INFO L290 TraceCheckUtils]: 111: Hoare triple {14247#(<= ~counter~0 11)} assume !(0 == ~cond); {14247#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:57,412 INFO L290 TraceCheckUtils]: 112: Hoare triple {14247#(<= ~counter~0 11)} assume true; {14247#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:57,413 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {14247#(<= ~counter~0 11)} {14247#(<= ~counter~0 11)} #63#return; {14247#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:57,413 INFO L290 TraceCheckUtils]: 114: Hoare triple {14247#(<= ~counter~0 11)} assume !!(0 != ~r~0); {14247#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:57,413 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-08 12:41:57,414 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-08 12:41:57,414 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-08 12:41:57,414 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-08 12:41:57,415 INFO L290 TraceCheckUtils]: 119: Hoare triple {14275#(<= ~counter~0 12)} ~cond := #in~cond; {14275#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:57,415 INFO L290 TraceCheckUtils]: 120: Hoare triple {14275#(<= ~counter~0 12)} assume !(0 == ~cond); {14275#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:57,415 INFO L290 TraceCheckUtils]: 121: Hoare triple {14275#(<= ~counter~0 12)} assume true; {14275#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:57,416 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {14275#(<= ~counter~0 12)} {14275#(<= ~counter~0 12)} #63#return; {14275#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:57,416 INFO L290 TraceCheckUtils]: 123: Hoare triple {14275#(<= ~counter~0 12)} assume !!(0 != ~r~0); {14275#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:57,416 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-08 12:41:57,417 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-08 12:41:57,417 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-08 12:41:57,417 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-08 12:41:57,418 INFO L290 TraceCheckUtils]: 128: Hoare triple {14303#(<= ~counter~0 13)} ~cond := #in~cond; {14303#(<= ~counter~0 13)} is VALID [2022-04-08 12:41:57,418 INFO L290 TraceCheckUtils]: 129: Hoare triple {14303#(<= ~counter~0 13)} assume !(0 == ~cond); {14303#(<= ~counter~0 13)} is VALID [2022-04-08 12:41:57,418 INFO L290 TraceCheckUtils]: 130: Hoare triple {14303#(<= ~counter~0 13)} assume true; {14303#(<= ~counter~0 13)} is VALID [2022-04-08 12:41:57,419 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {14303#(<= ~counter~0 13)} {14303#(<= ~counter~0 13)} #63#return; {14303#(<= ~counter~0 13)} is VALID [2022-04-08 12:41:57,419 INFO L290 TraceCheckUtils]: 132: Hoare triple {14303#(<= ~counter~0 13)} assume !!(0 != ~r~0); {14303#(<= ~counter~0 13)} is VALID [2022-04-08 12:41:57,419 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-08 12:41:57,419 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-08 12:41:57,420 INFO L290 TraceCheckUtils]: 135: Hoare triple {14331#(<= |main_#t~post6| 13)} assume !(#t~post6 < 20);havoc #t~post6; {13911#false} is VALID [2022-04-08 12:41:57,420 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-08 12:41:57,420 INFO L290 TraceCheckUtils]: 137: Hoare triple {13911#false} ~cond := #in~cond; {13911#false} is VALID [2022-04-08 12:41:57,420 INFO L290 TraceCheckUtils]: 138: Hoare triple {13911#false} assume 0 == ~cond; {13911#false} is VALID [2022-04-08 12:41:57,420 INFO L290 TraceCheckUtils]: 139: Hoare triple {13911#false} assume !false; {13911#false} is VALID [2022-04-08 12:41:57,421 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-08 12:41:57,421 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:41:58,043 INFO L290 TraceCheckUtils]: 139: Hoare triple {13911#false} assume !false; {13911#false} is VALID [2022-04-08 12:41:58,043 INFO L290 TraceCheckUtils]: 138: Hoare triple {13911#false} assume 0 == ~cond; {13911#false} is VALID [2022-04-08 12:41:58,043 INFO L290 TraceCheckUtils]: 137: Hoare triple {13911#false} ~cond := #in~cond; {13911#false} is VALID [2022-04-08 12:41:58,043 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-08 12:41:58,043 INFO L290 TraceCheckUtils]: 135: Hoare triple {14359#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {13911#false} is VALID [2022-04-08 12:41:58,044 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-08 12:41:58,044 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-08 12:41:58,044 INFO L290 TraceCheckUtils]: 132: Hoare triple {14363#(< ~counter~0 20)} assume !!(0 != ~r~0); {14363#(< ~counter~0 20)} is VALID [2022-04-08 12:41:58,045 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {13910#true} {14363#(< ~counter~0 20)} #63#return; {14363#(< ~counter~0 20)} is VALID [2022-04-08 12:41:58,045 INFO L290 TraceCheckUtils]: 130: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,045 INFO L290 TraceCheckUtils]: 129: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,045 INFO L290 TraceCheckUtils]: 128: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,045 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-08 12:41:58,045 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-08 12:41:58,046 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-08 12:41:58,046 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-08 12:41:58,046 INFO L290 TraceCheckUtils]: 123: Hoare triple {14391#(< ~counter~0 19)} assume !!(0 != ~r~0); {14391#(< ~counter~0 19)} is VALID [2022-04-08 12:41:58,047 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {13910#true} {14391#(< ~counter~0 19)} #63#return; {14391#(< ~counter~0 19)} is VALID [2022-04-08 12:41:58,047 INFO L290 TraceCheckUtils]: 121: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,047 INFO L290 TraceCheckUtils]: 120: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,047 INFO L290 TraceCheckUtils]: 119: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,047 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-08 12:41:58,047 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-08 12:41:58,048 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-08 12:41:58,048 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-08 12:41:58,048 INFO L290 TraceCheckUtils]: 114: Hoare triple {14419#(< ~counter~0 18)} assume !!(0 != ~r~0); {14419#(< ~counter~0 18)} is VALID [2022-04-08 12:41:58,049 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {13910#true} {14419#(< ~counter~0 18)} #63#return; {14419#(< ~counter~0 18)} is VALID [2022-04-08 12:41:58,049 INFO L290 TraceCheckUtils]: 112: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,049 INFO L290 TraceCheckUtils]: 111: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,049 INFO L290 TraceCheckUtils]: 110: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,049 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-08 12:41:58,049 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-08 12:41:58,050 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-08 12:41:58,050 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-08 12:41:58,050 INFO L290 TraceCheckUtils]: 105: Hoare triple {14447#(< ~counter~0 17)} assume !!(0 != ~r~0); {14447#(< ~counter~0 17)} is VALID [2022-04-08 12:41:58,051 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {13910#true} {14447#(< ~counter~0 17)} #63#return; {14447#(< ~counter~0 17)} is VALID [2022-04-08 12:41:58,051 INFO L290 TraceCheckUtils]: 103: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,051 INFO L290 TraceCheckUtils]: 102: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,051 INFO L290 TraceCheckUtils]: 101: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,051 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-08 12:41:58,051 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-08 12:41:58,051 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-08 12:41:58,052 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-08 12:41:58,052 INFO L290 TraceCheckUtils]: 96: Hoare triple {14475#(< ~counter~0 16)} assume !!(0 != ~r~0); {14475#(< ~counter~0 16)} is VALID [2022-04-08 12:41:58,052 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {13910#true} {14475#(< ~counter~0 16)} #63#return; {14475#(< ~counter~0 16)} is VALID [2022-04-08 12:41:58,053 INFO L290 TraceCheckUtils]: 94: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,053 INFO L290 TraceCheckUtils]: 93: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,053 INFO L290 TraceCheckUtils]: 92: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,053 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-08 12:41:58,053 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-08 12:41:58,053 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-08 12:41:58,054 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-08 12:41:58,054 INFO L290 TraceCheckUtils]: 87: Hoare triple {14503#(< ~counter~0 15)} assume !!(0 != ~r~0); {14503#(< ~counter~0 15)} is VALID [2022-04-08 12:41:58,054 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {13910#true} {14503#(< ~counter~0 15)} #63#return; {14503#(< ~counter~0 15)} is VALID [2022-04-08 12:41:58,054 INFO L290 TraceCheckUtils]: 85: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,055 INFO L290 TraceCheckUtils]: 84: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,055 INFO L290 TraceCheckUtils]: 83: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,055 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-08 12:41:58,055 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-08 12:41:58,055 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-08 12:41:58,056 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-08 12:41:58,056 INFO L290 TraceCheckUtils]: 78: Hoare triple {14303#(<= ~counter~0 13)} assume !!(0 != ~r~0); {14303#(<= ~counter~0 13)} is VALID [2022-04-08 12:41:58,056 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {13910#true} {14303#(<= ~counter~0 13)} #63#return; {14303#(<= ~counter~0 13)} is VALID [2022-04-08 12:41:58,056 INFO L290 TraceCheckUtils]: 76: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,056 INFO L290 TraceCheckUtils]: 75: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,057 INFO L290 TraceCheckUtils]: 74: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,057 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-08 12:41:58,057 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-08 12:41:58,057 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-08 12:41:58,058 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-08 12:41:58,058 INFO L290 TraceCheckUtils]: 69: Hoare triple {14275#(<= ~counter~0 12)} assume !!(0 != ~r~0); {14275#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:58,058 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {13910#true} {14275#(<= ~counter~0 12)} #63#return; {14275#(<= ~counter~0 12)} is VALID [2022-04-08 12:41:58,058 INFO L290 TraceCheckUtils]: 67: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,058 INFO L290 TraceCheckUtils]: 66: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,058 INFO L290 TraceCheckUtils]: 65: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,059 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-08 12:41:58,059 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-08 12:41:58,059 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-08 12:41:58,059 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-08 12:41:58,060 INFO L290 TraceCheckUtils]: 60: Hoare triple {14247#(<= ~counter~0 11)} assume !!(0 != ~r~0); {14247#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:58,060 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {13910#true} {14247#(<= ~counter~0 11)} #63#return; {14247#(<= ~counter~0 11)} is VALID [2022-04-08 12:41:58,060 INFO L290 TraceCheckUtils]: 58: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,060 INFO L290 TraceCheckUtils]: 57: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,060 INFO L290 TraceCheckUtils]: 56: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,060 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-08 12:41:58,061 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-08 12:41:58,061 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-08 12:41:58,061 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-08 12:41:58,062 INFO L290 TraceCheckUtils]: 51: Hoare triple {14219#(<= ~counter~0 10)} assume !!(0 != ~r~0); {14219#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:58,062 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {13910#true} {14219#(<= ~counter~0 10)} #63#return; {14219#(<= ~counter~0 10)} is VALID [2022-04-08 12:41:58,062 INFO L290 TraceCheckUtils]: 49: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,062 INFO L290 TraceCheckUtils]: 48: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,062 INFO L290 TraceCheckUtils]: 47: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,062 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-08 12:41:58,063 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-08 12:41:58,063 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-08 12:41:58,063 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-08 12:41:58,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {14191#(<= ~counter~0 9)} assume !!(0 != ~r~0); {14191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:58,064 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {13910#true} {14191#(<= ~counter~0 9)} #63#return; {14191#(<= ~counter~0 9)} is VALID [2022-04-08 12:41:58,064 INFO L290 TraceCheckUtils]: 40: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,064 INFO L290 TraceCheckUtils]: 39: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,064 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-08 12:41:58,065 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-08 12:41:58,065 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-08 12:41:58,065 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-08 12:41:58,065 INFO L290 TraceCheckUtils]: 33: Hoare triple {14163#(<= ~counter~0 8)} assume !!(0 != ~r~0); {14163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:58,066 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {13910#true} {14163#(<= ~counter~0 8)} #63#return; {14163#(<= ~counter~0 8)} is VALID [2022-04-08 12:41:58,066 INFO L290 TraceCheckUtils]: 31: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,066 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-08 12:41:58,066 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-08 12:41:58,067 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-08 12:41:58,067 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-08 12:41:58,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {14135#(<= ~counter~0 7)} assume !!(0 != ~r~0); {14135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:58,068 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13910#true} {14135#(<= ~counter~0 7)} #63#return; {14135#(<= ~counter~0 7)} is VALID [2022-04-08 12:41:58,068 INFO L290 TraceCheckUtils]: 22: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,068 INFO L290 TraceCheckUtils]: 21: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,068 INFO L290 TraceCheckUtils]: 20: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,068 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-08 12:41:58,068 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-08 12:41:58,069 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-08 12:41:58,069 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-08 12:41:58,069 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13910#true} {14107#(<= ~counter~0 6)} #61#return; {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:58,070 INFO L290 TraceCheckUtils]: 14: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,070 INFO L290 TraceCheckUtils]: 13: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,070 INFO L290 TraceCheckUtils]: 12: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,070 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-08 12:41:58,070 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13910#true} {14107#(<= ~counter~0 6)} #59#return; {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:58,070 INFO L290 TraceCheckUtils]: 9: Hoare triple {13910#true} assume true; {13910#true} is VALID [2022-04-08 12:41:58,070 INFO L290 TraceCheckUtils]: 8: Hoare triple {13910#true} assume !(0 == ~cond); {13910#true} is VALID [2022-04-08 12:41:58,070 INFO L290 TraceCheckUtils]: 7: Hoare triple {13910#true} ~cond := #in~cond; {13910#true} is VALID [2022-04-08 12:41:58,070 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-08 12:41:58,072 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-08 12:41:58,072 INFO L272 TraceCheckUtils]: 4: Hoare triple {14107#(<= ~counter~0 6)} call #t~ret7 := main(); {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:58,073 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14107#(<= ~counter~0 6)} {13910#true} #67#return; {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:58,073 INFO L290 TraceCheckUtils]: 2: Hoare triple {14107#(<= ~counter~0 6)} assume true; {14107#(<= ~counter~0 6)} is VALID [2022-04-08 12:41:58,073 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-08 12:41:58,073 INFO L272 TraceCheckUtils]: 0: Hoare triple {13910#true} call ULTIMATE.init(); {13910#true} is VALID [2022-04-08 12:41:58,074 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-08 12:41:58,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:41:58,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347071243] [2022-04-08 12:41:58,074 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:41:58,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105548198] [2022-04-08 12:41:58,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105548198] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:41:58,074 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:41:58,074 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 24 [2022-04-08 12:41:58,075 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:41:58,075 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1342623563] [2022-04-08 12:41:58,075 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1342623563] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:41:58,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:41:58,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-08 12:41:58,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818673292] [2022-04-08 12:41:58,075 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:41:58,075 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-08 12:41:58,076 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:41:58,076 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-08 12:41:58,159 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-08 12:41:58,159 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-08 12:41:58,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:41:58,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-08 12:41:58,160 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:41:58,160 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-08 12:41:58,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:58,655 INFO L93 Difference]: Finished difference Result 151 states and 166 transitions. [2022-04-08 12:41:58,655 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2022-04-08 12:41:58,655 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-08 12:41:58,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:41:58,655 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-08 12:41:58,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 165 transitions. [2022-04-08 12:41:58,658 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-08 12:41:58,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 165 transitions. [2022-04-08 12:41:58,660 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 30 states and 165 transitions. [2022-04-08 12:41:58,762 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-08 12:41:58,765 INFO L225 Difference]: With dead ends: 151 [2022-04-08 12:41:58,765 INFO L226 Difference]: Without dead ends: 146 [2022-04-08 12:41:58,766 INFO L912 BasicCegarLoop]: 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-08 12:41:58,766 INFO L913 BasicCegarLoop]: 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-08 12:41:58,766 INFO L914 BasicCegarLoop]: 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-08 12:41:58,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2022-04-08 12:41:58,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2022-04-08 12:41:58,896 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:41:58,897 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-08 12:41:58,897 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-08 12:41:58,897 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-08 12:41:58,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:58,899 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-04-08 12:41:58,899 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2022-04-08 12:41:58,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:58,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:58,900 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-08 12:41:58,900 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-08 12:41:58,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:41:58,901 INFO L93 Difference]: Finished difference Result 146 states and 161 transitions. [2022-04-08 12:41:58,901 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2022-04-08 12:41:58,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:41:58,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:41:58,902 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:41:58,902 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:41:58,902 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-08 12:41:58,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 161 transitions. [2022-04-08 12:41:58,904 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 161 transitions. Word has length 140 [2022-04-08 12:41:58,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:41:58,904 INFO L478 AbstractCegarLoop]: Abstraction has 146 states and 161 transitions. [2022-04-08 12:41:58,904 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 6.0588235294117645) internal successors, (103), 16 states have internal predecessors, (103), 16 states have call successors, (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-08 12:41:58,904 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 146 states and 161 transitions. [2022-04-08 12:42:01,097 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 160 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-08 12:42:01,097 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 161 transitions. [2022-04-08 12:42:01,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 150 [2022-04-08 12:42:01,098 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:42:01,098 INFO L499 BasicCegarLoop]: 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-08 12:42:01,116 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2022-04-08 12:42:01,307 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2022-04-08 12:42:01,308 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:42:01,308 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:42:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1088976298, now seen corresponding path program 27 times [2022-04-08 12:42:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:01,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [32964373] [2022-04-08 12:42:01,309 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:42:01,309 INFO L85 PathProgramCache]: Analyzing trace with hash -1088976298, now seen corresponding path program 28 times [2022-04-08 12:42:01,309 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:42:01,309 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720392431] [2022-04-08 12:42:01,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:42:01,309 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:42:01,327 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:42:01,327 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [890867556] [2022-04-08 12:42:01,327 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:42:01,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:42:01,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:42:01,328 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:42:01,329 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2022-04-08 12:42:01,561 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:42:01,561 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:42:01,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-08 12:42:01,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:42:01,588 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:42:02,228 INFO L272 TraceCheckUtils]: 0: Hoare triple {15685#true} call ULTIMATE.init(); {15685#true} is VALID [2022-04-08 12:42:02,229 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-08 12:42:02,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {15693#(<= ~counter~0 0)} assume true; {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,229 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15693#(<= ~counter~0 0)} {15685#true} #67#return; {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,230 INFO L272 TraceCheckUtils]: 4: Hoare triple {15693#(<= ~counter~0 0)} call #t~ret7 := main(); {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,230 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-08 12:42:02,230 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-08 12:42:02,231 INFO L290 TraceCheckUtils]: 7: Hoare triple {15693#(<= ~counter~0 0)} ~cond := #in~cond; {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,231 INFO L290 TraceCheckUtils]: 8: Hoare triple {15693#(<= ~counter~0 0)} assume !(0 == ~cond); {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,231 INFO L290 TraceCheckUtils]: 9: Hoare triple {15693#(<= ~counter~0 0)} assume true; {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,231 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15693#(<= ~counter~0 0)} {15693#(<= ~counter~0 0)} #59#return; {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,232 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-08 12:42:02,232 INFO L290 TraceCheckUtils]: 12: Hoare triple {15693#(<= ~counter~0 0)} ~cond := #in~cond; {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,232 INFO L290 TraceCheckUtils]: 13: Hoare triple {15693#(<= ~counter~0 0)} assume !(0 == ~cond); {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,233 INFO L290 TraceCheckUtils]: 14: Hoare triple {15693#(<= ~counter~0 0)} assume true; {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,233 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15693#(<= ~counter~0 0)} {15693#(<= ~counter~0 0)} #61#return; {15693#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:02,233 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-08 12:42:02,234 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-08 12:42:02,234 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-08 12:42:02,234 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-08 12:42:02,235 INFO L290 TraceCheckUtils]: 20: Hoare triple {15742#(<= ~counter~0 1)} ~cond := #in~cond; {15742#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:02,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {15742#(<= ~counter~0 1)} assume !(0 == ~cond); {15742#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:02,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {15742#(<= ~counter~0 1)} assume true; {15742#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:02,236 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15742#(<= ~counter~0 1)} {15742#(<= ~counter~0 1)} #63#return; {15742#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:02,236 INFO L290 TraceCheckUtils]: 24: Hoare triple {15742#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15742#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:02,236 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-08 12:42:02,237 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-08 12:42:02,237 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-08 12:42:02,237 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-08 12:42:02,238 INFO L290 TraceCheckUtils]: 29: Hoare triple {15770#(<= ~counter~0 2)} ~cond := #in~cond; {15770#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:02,238 INFO L290 TraceCheckUtils]: 30: Hoare triple {15770#(<= ~counter~0 2)} assume !(0 == ~cond); {15770#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:02,238 INFO L290 TraceCheckUtils]: 31: Hoare triple {15770#(<= ~counter~0 2)} assume true; {15770#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:02,239 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15770#(<= ~counter~0 2)} {15770#(<= ~counter~0 2)} #63#return; {15770#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:02,239 INFO L290 TraceCheckUtils]: 33: Hoare triple {15770#(<= ~counter~0 2)} assume !!(0 != ~r~0); {15770#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:02,239 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-08 12:42:02,239 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-08 12:42:02,240 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-08 12:42:02,240 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-08 12:42:02,240 INFO L290 TraceCheckUtils]: 38: Hoare triple {15798#(<= ~counter~0 3)} ~cond := #in~cond; {15798#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:02,241 INFO L290 TraceCheckUtils]: 39: Hoare triple {15798#(<= ~counter~0 3)} assume !(0 == ~cond); {15798#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:02,241 INFO L290 TraceCheckUtils]: 40: Hoare triple {15798#(<= ~counter~0 3)} assume true; {15798#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:02,241 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15798#(<= ~counter~0 3)} {15798#(<= ~counter~0 3)} #63#return; {15798#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:02,242 INFO L290 TraceCheckUtils]: 42: Hoare triple {15798#(<= ~counter~0 3)} assume !!(0 != ~r~0); {15798#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:02,242 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-08 12:42:02,242 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-08 12:42:02,243 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-08 12:42:02,243 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-08 12:42:02,243 INFO L290 TraceCheckUtils]: 47: Hoare triple {15826#(<= ~counter~0 4)} ~cond := #in~cond; {15826#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:02,243 INFO L290 TraceCheckUtils]: 48: Hoare triple {15826#(<= ~counter~0 4)} assume !(0 == ~cond); {15826#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:02,244 INFO L290 TraceCheckUtils]: 49: Hoare triple {15826#(<= ~counter~0 4)} assume true; {15826#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:02,244 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15826#(<= ~counter~0 4)} {15826#(<= ~counter~0 4)} #63#return; {15826#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:02,244 INFO L290 TraceCheckUtils]: 51: Hoare triple {15826#(<= ~counter~0 4)} assume !!(0 != ~r~0); {15826#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:02,245 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-08 12:42:02,245 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-08 12:42:02,245 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-08 12:42:02,246 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-08 12:42:02,246 INFO L290 TraceCheckUtils]: 56: Hoare triple {15854#(<= ~counter~0 5)} ~cond := #in~cond; {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,246 INFO L290 TraceCheckUtils]: 57: Hoare triple {15854#(<= ~counter~0 5)} assume !(0 == ~cond); {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,247 INFO L290 TraceCheckUtils]: 58: Hoare triple {15854#(<= ~counter~0 5)} assume true; {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,247 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15854#(<= ~counter~0 5)} {15854#(<= ~counter~0 5)} #63#return; {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,247 INFO L290 TraceCheckUtils]: 60: Hoare triple {15854#(<= ~counter~0 5)} assume !!(0 != ~r~0); {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,248 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-08 12:42:02,248 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-08 12:42:02,248 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-08 12:42:02,249 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-08 12:42:02,249 INFO L290 TraceCheckUtils]: 65: Hoare triple {15882#(<= ~counter~0 6)} ~cond := #in~cond; {15882#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:02,249 INFO L290 TraceCheckUtils]: 66: Hoare triple {15882#(<= ~counter~0 6)} assume !(0 == ~cond); {15882#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:02,249 INFO L290 TraceCheckUtils]: 67: Hoare triple {15882#(<= ~counter~0 6)} assume true; {15882#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:02,250 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15882#(<= ~counter~0 6)} {15882#(<= ~counter~0 6)} #63#return; {15882#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:02,250 INFO L290 TraceCheckUtils]: 69: Hoare triple {15882#(<= ~counter~0 6)} assume !!(0 != ~r~0); {15882#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:02,250 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-08 12:42:02,251 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-08 12:42:02,251 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-08 12:42:02,252 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-08 12:42:02,252 INFO L290 TraceCheckUtils]: 74: Hoare triple {15910#(<= ~counter~0 7)} ~cond := #in~cond; {15910#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:02,252 INFO L290 TraceCheckUtils]: 75: Hoare triple {15910#(<= ~counter~0 7)} assume !(0 == ~cond); {15910#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:02,252 INFO L290 TraceCheckUtils]: 76: Hoare triple {15910#(<= ~counter~0 7)} assume true; {15910#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:02,253 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15910#(<= ~counter~0 7)} {15910#(<= ~counter~0 7)} #63#return; {15910#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:02,253 INFO L290 TraceCheckUtils]: 78: Hoare triple {15910#(<= ~counter~0 7)} assume !!(0 != ~r~0); {15910#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:02,253 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-08 12:42:02,254 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-08 12:42:02,254 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-08 12:42:02,254 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-08 12:42:02,255 INFO L290 TraceCheckUtils]: 83: Hoare triple {15938#(<= ~counter~0 8)} ~cond := #in~cond; {15938#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:02,255 INFO L290 TraceCheckUtils]: 84: Hoare triple {15938#(<= ~counter~0 8)} assume !(0 == ~cond); {15938#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:02,255 INFO L290 TraceCheckUtils]: 85: Hoare triple {15938#(<= ~counter~0 8)} assume true; {15938#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:02,256 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15938#(<= ~counter~0 8)} {15938#(<= ~counter~0 8)} #63#return; {15938#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:02,256 INFO L290 TraceCheckUtils]: 87: Hoare triple {15938#(<= ~counter~0 8)} assume !!(0 != ~r~0); {15938#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:02,256 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-08 12:42:02,257 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-08 12:42:02,257 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-08 12:42:02,257 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-08 12:42:02,258 INFO L290 TraceCheckUtils]: 92: Hoare triple {15966#(<= ~counter~0 9)} ~cond := #in~cond; {15966#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:02,258 INFO L290 TraceCheckUtils]: 93: Hoare triple {15966#(<= ~counter~0 9)} assume !(0 == ~cond); {15966#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:02,258 INFO L290 TraceCheckUtils]: 94: Hoare triple {15966#(<= ~counter~0 9)} assume true; {15966#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:02,259 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {15966#(<= ~counter~0 9)} {15966#(<= ~counter~0 9)} #63#return; {15966#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:02,259 INFO L290 TraceCheckUtils]: 96: Hoare triple {15966#(<= ~counter~0 9)} assume !!(0 != ~r~0); {15966#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:02,259 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-08 12:42:02,259 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-08 12:42:02,260 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-08 12:42:02,260 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-08 12:42:02,260 INFO L290 TraceCheckUtils]: 101: Hoare triple {15994#(<= ~counter~0 10)} ~cond := #in~cond; {15994#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:02,261 INFO L290 TraceCheckUtils]: 102: Hoare triple {15994#(<= ~counter~0 10)} assume !(0 == ~cond); {15994#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:02,261 INFO L290 TraceCheckUtils]: 103: Hoare triple {15994#(<= ~counter~0 10)} assume true; {15994#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:02,261 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {15994#(<= ~counter~0 10)} {15994#(<= ~counter~0 10)} #63#return; {15994#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:02,262 INFO L290 TraceCheckUtils]: 105: Hoare triple {15994#(<= ~counter~0 10)} assume !!(0 != ~r~0); {15994#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:02,262 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-08 12:42:02,262 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-08 12:42:02,263 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-08 12:42:02,263 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-08 12:42:02,263 INFO L290 TraceCheckUtils]: 110: Hoare triple {16022#(<= ~counter~0 11)} ~cond := #in~cond; {16022#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:02,264 INFO L290 TraceCheckUtils]: 111: Hoare triple {16022#(<= ~counter~0 11)} assume !(0 == ~cond); {16022#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:02,264 INFO L290 TraceCheckUtils]: 112: Hoare triple {16022#(<= ~counter~0 11)} assume true; {16022#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:02,264 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {16022#(<= ~counter~0 11)} {16022#(<= ~counter~0 11)} #63#return; {16022#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:02,264 INFO L290 TraceCheckUtils]: 114: Hoare triple {16022#(<= ~counter~0 11)} assume !!(0 != ~r~0); {16022#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:02,265 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-08 12:42:02,265 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-08 12:42:02,265 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-08 12:42:02,266 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-08 12:42:02,266 INFO L290 TraceCheckUtils]: 119: Hoare triple {16050#(<= ~counter~0 12)} ~cond := #in~cond; {16050#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:02,266 INFO L290 TraceCheckUtils]: 120: Hoare triple {16050#(<= ~counter~0 12)} assume !(0 == ~cond); {16050#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:02,267 INFO L290 TraceCheckUtils]: 121: Hoare triple {16050#(<= ~counter~0 12)} assume true; {16050#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:02,267 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {16050#(<= ~counter~0 12)} {16050#(<= ~counter~0 12)} #63#return; {16050#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:02,267 INFO L290 TraceCheckUtils]: 123: Hoare triple {16050#(<= ~counter~0 12)} assume !!(0 != ~r~0); {16050#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:02,268 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-08 12:42:02,268 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-08 12:42:02,268 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-08 12:42:02,269 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-08 12:42:02,269 INFO L290 TraceCheckUtils]: 128: Hoare triple {16078#(<= ~counter~0 13)} ~cond := #in~cond; {16078#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:02,269 INFO L290 TraceCheckUtils]: 129: Hoare triple {16078#(<= ~counter~0 13)} assume !(0 == ~cond); {16078#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:02,269 INFO L290 TraceCheckUtils]: 130: Hoare triple {16078#(<= ~counter~0 13)} assume true; {16078#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:02,270 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {16078#(<= ~counter~0 13)} {16078#(<= ~counter~0 13)} #63#return; {16078#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:02,270 INFO L290 TraceCheckUtils]: 132: Hoare triple {16078#(<= ~counter~0 13)} assume !!(0 != ~r~0); {16078#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:02,270 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-08 12:42:02,271 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-08 12:42:02,271 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-08 12:42:02,272 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-08 12:42:02,272 INFO L290 TraceCheckUtils]: 137: Hoare triple {16106#(<= ~counter~0 14)} ~cond := #in~cond; {16106#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:02,272 INFO L290 TraceCheckUtils]: 138: Hoare triple {16106#(<= ~counter~0 14)} assume !(0 == ~cond); {16106#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:02,272 INFO L290 TraceCheckUtils]: 139: Hoare triple {16106#(<= ~counter~0 14)} assume true; {16106#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:02,273 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {16106#(<= ~counter~0 14)} {16106#(<= ~counter~0 14)} #63#return; {16106#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:02,273 INFO L290 TraceCheckUtils]: 141: Hoare triple {16106#(<= ~counter~0 14)} assume !!(0 != ~r~0); {16106#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:02,273 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-08 12:42:02,274 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-08 12:42:02,274 INFO L290 TraceCheckUtils]: 144: Hoare triple {16134#(<= |main_#t~post6| 14)} assume !(#t~post6 < 20);havoc #t~post6; {15686#false} is VALID [2022-04-08 12:42:02,274 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-08 12:42:02,274 INFO L290 TraceCheckUtils]: 146: Hoare triple {15686#false} ~cond := #in~cond; {15686#false} is VALID [2022-04-08 12:42:02,274 INFO L290 TraceCheckUtils]: 147: Hoare triple {15686#false} assume 0 == ~cond; {15686#false} is VALID [2022-04-08 12:42:02,274 INFO L290 TraceCheckUtils]: 148: Hoare triple {15686#false} assume !false; {15686#false} is VALID [2022-04-08 12:42:02,275 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-08 12:42:02,275 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:42:02,881 INFO L290 TraceCheckUtils]: 148: Hoare triple {15686#false} assume !false; {15686#false} is VALID [2022-04-08 12:42:02,881 INFO L290 TraceCheckUtils]: 147: Hoare triple {15686#false} assume 0 == ~cond; {15686#false} is VALID [2022-04-08 12:42:02,881 INFO L290 TraceCheckUtils]: 146: Hoare triple {15686#false} ~cond := #in~cond; {15686#false} is VALID [2022-04-08 12:42:02,881 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-08 12:42:02,882 INFO L290 TraceCheckUtils]: 144: Hoare triple {16162#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {15686#false} is VALID [2022-04-08 12:42:02,882 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-08 12:42:02,882 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-08 12:42:02,883 INFO L290 TraceCheckUtils]: 141: Hoare triple {16166#(< ~counter~0 20)} assume !!(0 != ~r~0); {16166#(< ~counter~0 20)} is VALID [2022-04-08 12:42:02,883 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {15685#true} {16166#(< ~counter~0 20)} #63#return; {16166#(< ~counter~0 20)} is VALID [2022-04-08 12:42:02,883 INFO L290 TraceCheckUtils]: 139: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,883 INFO L290 TraceCheckUtils]: 138: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,883 INFO L290 TraceCheckUtils]: 137: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,883 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-08 12:42:02,884 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-08 12:42:02,884 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-08 12:42:02,884 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-08 12:42:02,885 INFO L290 TraceCheckUtils]: 132: Hoare triple {16194#(< ~counter~0 19)} assume !!(0 != ~r~0); {16194#(< ~counter~0 19)} is VALID [2022-04-08 12:42:02,885 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {15685#true} {16194#(< ~counter~0 19)} #63#return; {16194#(< ~counter~0 19)} is VALID [2022-04-08 12:42:02,885 INFO L290 TraceCheckUtils]: 130: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,885 INFO L290 TraceCheckUtils]: 129: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,885 INFO L290 TraceCheckUtils]: 128: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,885 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-08 12:42:02,886 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-08 12:42:02,886 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-08 12:42:02,886 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-08 12:42:02,887 INFO L290 TraceCheckUtils]: 123: Hoare triple {16222#(< ~counter~0 18)} assume !!(0 != ~r~0); {16222#(< ~counter~0 18)} is VALID [2022-04-08 12:42:02,887 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {15685#true} {16222#(< ~counter~0 18)} #63#return; {16222#(< ~counter~0 18)} is VALID [2022-04-08 12:42:02,887 INFO L290 TraceCheckUtils]: 121: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,887 INFO L290 TraceCheckUtils]: 120: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,887 INFO L290 TraceCheckUtils]: 119: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,887 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-08 12:42:02,888 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-08 12:42:02,888 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-08 12:42:02,888 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-08 12:42:02,889 INFO L290 TraceCheckUtils]: 114: Hoare triple {16250#(< ~counter~0 17)} assume !!(0 != ~r~0); {16250#(< ~counter~0 17)} is VALID [2022-04-08 12:42:02,889 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {15685#true} {16250#(< ~counter~0 17)} #63#return; {16250#(< ~counter~0 17)} is VALID [2022-04-08 12:42:02,889 INFO L290 TraceCheckUtils]: 112: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,889 INFO L290 TraceCheckUtils]: 111: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,889 INFO L290 TraceCheckUtils]: 110: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,889 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-08 12:42:02,890 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-08 12:42:02,890 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-08 12:42:02,890 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-08 12:42:02,890 INFO L290 TraceCheckUtils]: 105: Hoare triple {16278#(< ~counter~0 16)} assume !!(0 != ~r~0); {16278#(< ~counter~0 16)} is VALID [2022-04-08 12:42:02,891 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {15685#true} {16278#(< ~counter~0 16)} #63#return; {16278#(< ~counter~0 16)} is VALID [2022-04-08 12:42:02,891 INFO L290 TraceCheckUtils]: 103: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,891 INFO L290 TraceCheckUtils]: 102: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,891 INFO L290 TraceCheckUtils]: 101: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,891 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-08 12:42:02,891 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-08 12:42:02,892 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-08 12:42:02,892 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-08 12:42:02,892 INFO L290 TraceCheckUtils]: 96: Hoare triple {16106#(<= ~counter~0 14)} assume !!(0 != ~r~0); {16106#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:02,893 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {15685#true} {16106#(<= ~counter~0 14)} #63#return; {16106#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:02,893 INFO L290 TraceCheckUtils]: 94: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,893 INFO L290 TraceCheckUtils]: 93: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,893 INFO L290 TraceCheckUtils]: 92: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,893 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-08 12:42:02,893 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-08 12:42:02,894 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-08 12:42:02,894 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-08 12:42:02,894 INFO L290 TraceCheckUtils]: 87: Hoare triple {16078#(<= ~counter~0 13)} assume !!(0 != ~r~0); {16078#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:02,895 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {15685#true} {16078#(<= ~counter~0 13)} #63#return; {16078#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:02,895 INFO L290 TraceCheckUtils]: 85: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,895 INFO L290 TraceCheckUtils]: 84: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,895 INFO L290 TraceCheckUtils]: 83: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,895 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-08 12:42:02,897 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-08 12:42:02,897 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-08 12:42:02,898 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-08 12:42:02,898 INFO L290 TraceCheckUtils]: 78: Hoare triple {16050#(<= ~counter~0 12)} assume !!(0 != ~r~0); {16050#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:02,898 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {15685#true} {16050#(<= ~counter~0 12)} #63#return; {16050#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:02,898 INFO L290 TraceCheckUtils]: 76: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,898 INFO L290 TraceCheckUtils]: 75: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,899 INFO L290 TraceCheckUtils]: 74: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,899 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-08 12:42:02,899 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-08 12:42:02,899 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-08 12:42:02,900 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-08 12:42:02,900 INFO L290 TraceCheckUtils]: 69: Hoare triple {16022#(<= ~counter~0 11)} assume !!(0 != ~r~0); {16022#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:02,900 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {15685#true} {16022#(<= ~counter~0 11)} #63#return; {16022#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:02,900 INFO L290 TraceCheckUtils]: 67: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,900 INFO L290 TraceCheckUtils]: 66: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,901 INFO L290 TraceCheckUtils]: 65: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,901 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-08 12:42:02,901 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-08 12:42:02,901 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-08 12:42:02,901 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-08 12:42:02,902 INFO L290 TraceCheckUtils]: 60: Hoare triple {15994#(<= ~counter~0 10)} assume !!(0 != ~r~0); {15994#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:02,902 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {15685#true} {15994#(<= ~counter~0 10)} #63#return; {15994#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:02,902 INFO L290 TraceCheckUtils]: 58: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,902 INFO L290 TraceCheckUtils]: 57: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,902 INFO L290 TraceCheckUtils]: 56: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,903 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-08 12:42:02,903 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-08 12:42:02,903 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-08 12:42:02,903 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-08 12:42:02,904 INFO L290 TraceCheckUtils]: 51: Hoare triple {15966#(<= ~counter~0 9)} assume !!(0 != ~r~0); {15966#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:02,904 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {15685#true} {15966#(<= ~counter~0 9)} #63#return; {15966#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:02,904 INFO L290 TraceCheckUtils]: 49: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,904 INFO L290 TraceCheckUtils]: 48: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,904 INFO L290 TraceCheckUtils]: 47: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,904 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-08 12:42:02,905 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-08 12:42:02,905 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-08 12:42:02,905 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-08 12:42:02,906 INFO L290 TraceCheckUtils]: 42: Hoare triple {15938#(<= ~counter~0 8)} assume !!(0 != ~r~0); {15938#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:02,906 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {15685#true} {15938#(<= ~counter~0 8)} #63#return; {15938#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:02,906 INFO L290 TraceCheckUtils]: 40: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,906 INFO L290 TraceCheckUtils]: 39: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,906 INFO L290 TraceCheckUtils]: 38: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,906 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-08 12:42:02,907 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-08 12:42:02,907 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-08 12:42:02,907 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-08 12:42:02,908 INFO L290 TraceCheckUtils]: 33: Hoare triple {15910#(<= ~counter~0 7)} assume !!(0 != ~r~0); {15910#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:02,908 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {15685#true} {15910#(<= ~counter~0 7)} #63#return; {15910#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:02,908 INFO L290 TraceCheckUtils]: 31: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,908 INFO L290 TraceCheckUtils]: 30: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,908 INFO L290 TraceCheckUtils]: 29: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,908 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-08 12:42:02,909 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-08 12:42:02,909 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-08 12:42:02,909 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-08 12:42:02,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {15882#(<= ~counter~0 6)} assume !!(0 != ~r~0); {15882#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:02,910 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15685#true} {15882#(<= ~counter~0 6)} #63#return; {15882#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:02,910 INFO L290 TraceCheckUtils]: 22: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,910 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-08 12:42:02,910 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-08 12:42:02,911 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-08 12:42:02,911 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-08 12:42:02,911 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {15685#true} {15854#(<= ~counter~0 5)} #61#return; {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,912 INFO L290 TraceCheckUtils]: 14: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,912 INFO L290 TraceCheckUtils]: 13: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,912 INFO L290 TraceCheckUtils]: 12: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,912 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-08 12:42:02,912 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15685#true} {15854#(<= ~counter~0 5)} #59#return; {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,912 INFO L290 TraceCheckUtils]: 9: Hoare triple {15685#true} assume true; {15685#true} is VALID [2022-04-08 12:42:02,912 INFO L290 TraceCheckUtils]: 8: Hoare triple {15685#true} assume !(0 == ~cond); {15685#true} is VALID [2022-04-08 12:42:02,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {15685#true} ~cond := #in~cond; {15685#true} is VALID [2022-04-08 12:42:02,912 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-08 12:42:02,913 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-08 12:42:02,913 INFO L272 TraceCheckUtils]: 4: Hoare triple {15854#(<= ~counter~0 5)} call #t~ret7 := main(); {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,913 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15854#(<= ~counter~0 5)} {15685#true} #67#return; {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {15854#(<= ~counter~0 5)} assume true; {15854#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:02,914 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-08 12:42:02,914 INFO L272 TraceCheckUtils]: 0: Hoare triple {15685#true} call ULTIMATE.init(); {15685#true} is VALID [2022-04-08 12:42:02,914 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-08 12:42:02,915 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:42:02,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [720392431] [2022-04-08 12:42:02,915 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:42:02,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [890867556] [2022-04-08 12:42:02,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [890867556] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:42:02,915 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:42:02,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 24 [2022-04-08 12:42:02,915 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:42:02,915 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [32964373] [2022-04-08 12:42:02,915 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [32964373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:42:02,915 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:42:02,915 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-08 12:42:02,916 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772242313] [2022-04-08 12:42:02,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:42:02,916 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-08 12:42:02,916 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:42:02,916 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-08 12:42:03,004 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-08 12:42:03,004 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-08 12:42:03,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:03,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-08 12:42:03,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:42:03,004 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-08 12:42:03,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:03,508 INFO L93 Difference]: Finished difference Result 160 states and 176 transitions. [2022-04-08 12:42:03,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-08 12:42:03,508 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-08 12:42:03,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:42:03,512 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-08 12:42:03,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 175 transitions. [2022-04-08 12:42:03,515 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-08 12:42:03,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 175 transitions. [2022-04-08 12:42:03,517 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 175 transitions. [2022-04-08 12:42:03,648 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-08 12:42:03,650 INFO L225 Difference]: With dead ends: 160 [2022-04-08 12:42:03,650 INFO L226 Difference]: Without dead ends: 155 [2022-04-08 12:42:03,651 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 311 GetRequests, 274 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=558, Invalid=848, Unknown=0, NotChecked=0, Total=1406 [2022-04-08 12:42:03,651 INFO L913 BasicCegarLoop]: 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-08 12:42:03,651 INFO L914 BasicCegarLoop]: 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-08 12:42:03,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 155 states. [2022-04-08 12:42:03,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 155 to 155. [2022-04-08 12:42:03,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:42:03,805 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-08 12:42:03,805 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-08 12:42:03,805 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-08 12:42:03,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:03,808 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-04-08 12:42:03,808 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-04-08 12:42:03,808 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:03,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:03,809 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-08 12:42:03,809 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-08 12:42:03,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:03,810 INFO L93 Difference]: Finished difference Result 155 states and 171 transitions. [2022-04-08 12:42:03,810 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-04-08 12:42:03,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:03,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:03,811 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:42:03,811 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:42:03,811 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-08 12:42:03,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 155 states to 155 states and 171 transitions. [2022-04-08 12:42:03,813 INFO L78 Accepts]: Start accepts. Automaton has 155 states and 171 transitions. Word has length 149 [2022-04-08 12:42:03,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:42:03,813 INFO L478 AbstractCegarLoop]: Abstraction has 155 states and 171 transitions. [2022-04-08 12:42:03,813 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 6.111111111111111) internal successors, (110), 17 states have internal predecessors, (110), 17 states have call successors, (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-08 12:42:03,813 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 155 states and 171 transitions. [2022-04-08 12:42:06,025 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-08 12:42:06,025 INFO L276 IsEmpty]: Start isEmpty. Operand 155 states and 171 transitions. [2022-04-08 12:42:06,026 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 159 [2022-04-08 12:42:06,026 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:42:06,026 INFO L499 BasicCegarLoop]: 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-08 12:42:06,035 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2022-04-08 12:42:06,226 WARN L460 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-08 12:42:06,226 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:42:06,227 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:42:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2060864036, now seen corresponding path program 29 times [2022-04-08 12:42:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:06,227 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [555722243] [2022-04-08 12:42:06,227 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:42:06,227 INFO L85 PathProgramCache]: Analyzing trace with hash -2060864036, now seen corresponding path program 30 times [2022-04-08 12:42:06,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:42:06,228 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [382574729] [2022-04-08 12:42:06,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:42:06,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:42:06,249 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:42:06,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1384604994] [2022-04-08 12:42:06,249 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:42:06,249 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:42:06,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:42:06,256 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:42:06,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-04-08 12:42:27,756 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 16 check-sat command(s) [2022-04-08 12:42:27,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:42:27,767 INFO L263 TraceCheckSpWp]: Trace formula consists of 393 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-08 12:42:27,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:42:27,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:42:28,465 INFO L272 TraceCheckUtils]: 0: Hoare triple {17570#true} call ULTIMATE.init(); {17570#true} is VALID [2022-04-08 12:42:28,466 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-08 12:42:28,466 INFO L290 TraceCheckUtils]: 2: Hoare triple {17578#(<= ~counter~0 0)} assume true; {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,466 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17578#(<= ~counter~0 0)} {17570#true} #67#return; {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,467 INFO L272 TraceCheckUtils]: 4: Hoare triple {17578#(<= ~counter~0 0)} call #t~ret7 := main(); {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,467 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-08 12:42:28,467 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-08 12:42:28,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {17578#(<= ~counter~0 0)} ~cond := #in~cond; {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {17578#(<= ~counter~0 0)} assume !(0 == ~cond); {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {17578#(<= ~counter~0 0)} assume true; {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,468 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17578#(<= ~counter~0 0)} {17578#(<= ~counter~0 0)} #59#return; {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,469 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-08 12:42:28,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {17578#(<= ~counter~0 0)} ~cond := #in~cond; {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {17578#(<= ~counter~0 0)} assume !(0 == ~cond); {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {17578#(<= ~counter~0 0)} assume true; {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,470 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17578#(<= ~counter~0 0)} {17578#(<= ~counter~0 0)} #61#return; {17578#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:28,470 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-08 12:42:28,471 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-08 12:42:28,471 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-08 12:42:28,471 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-08 12:42:28,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {17627#(<= ~counter~0 1)} ~cond := #in~cond; {17627#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:28,472 INFO L290 TraceCheckUtils]: 21: Hoare triple {17627#(<= ~counter~0 1)} assume !(0 == ~cond); {17627#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:28,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {17627#(<= ~counter~0 1)} assume true; {17627#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:28,473 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17627#(<= ~counter~0 1)} {17627#(<= ~counter~0 1)} #63#return; {17627#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:28,473 INFO L290 TraceCheckUtils]: 24: Hoare triple {17627#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17627#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:28,473 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-08 12:42:28,473 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-08 12:42:28,474 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-08 12:42:28,474 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-08 12:42:28,474 INFO L290 TraceCheckUtils]: 29: Hoare triple {17655#(<= ~counter~0 2)} ~cond := #in~cond; {17655#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:28,475 INFO L290 TraceCheckUtils]: 30: Hoare triple {17655#(<= ~counter~0 2)} assume !(0 == ~cond); {17655#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:28,475 INFO L290 TraceCheckUtils]: 31: Hoare triple {17655#(<= ~counter~0 2)} assume true; {17655#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:28,475 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17655#(<= ~counter~0 2)} {17655#(<= ~counter~0 2)} #63#return; {17655#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:28,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {17655#(<= ~counter~0 2)} assume !!(0 != ~r~0); {17655#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:28,476 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-08 12:42:28,476 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-08 12:42:28,477 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-08 12:42:28,477 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-08 12:42:28,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {17683#(<= ~counter~0 3)} ~cond := #in~cond; {17683#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:28,478 INFO L290 TraceCheckUtils]: 39: Hoare triple {17683#(<= ~counter~0 3)} assume !(0 == ~cond); {17683#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:28,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {17683#(<= ~counter~0 3)} assume true; {17683#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:28,478 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17683#(<= ~counter~0 3)} {17683#(<= ~counter~0 3)} #63#return; {17683#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:28,478 INFO L290 TraceCheckUtils]: 42: Hoare triple {17683#(<= ~counter~0 3)} assume !!(0 != ~r~0); {17683#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:28,479 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-08 12:42:28,479 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-08 12:42:28,479 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-08 12:42:28,480 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-08 12:42:28,480 INFO L290 TraceCheckUtils]: 47: Hoare triple {17711#(<= ~counter~0 4)} ~cond := #in~cond; {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:28,480 INFO L290 TraceCheckUtils]: 48: Hoare triple {17711#(<= ~counter~0 4)} assume !(0 == ~cond); {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:28,481 INFO L290 TraceCheckUtils]: 49: Hoare triple {17711#(<= ~counter~0 4)} assume true; {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:28,481 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17711#(<= ~counter~0 4)} {17711#(<= ~counter~0 4)} #63#return; {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:28,481 INFO L290 TraceCheckUtils]: 51: Hoare triple {17711#(<= ~counter~0 4)} assume !!(0 != ~r~0); {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:28,482 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-08 12:42:28,482 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-08 12:42:28,482 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-08 12:42:28,483 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-08 12:42:28,483 INFO L290 TraceCheckUtils]: 56: Hoare triple {17739#(<= ~counter~0 5)} ~cond := #in~cond; {17739#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:28,483 INFO L290 TraceCheckUtils]: 57: Hoare triple {17739#(<= ~counter~0 5)} assume !(0 == ~cond); {17739#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:28,484 INFO L290 TraceCheckUtils]: 58: Hoare triple {17739#(<= ~counter~0 5)} assume true; {17739#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:28,484 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17739#(<= ~counter~0 5)} {17739#(<= ~counter~0 5)} #63#return; {17739#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:28,484 INFO L290 TraceCheckUtils]: 60: Hoare triple {17739#(<= ~counter~0 5)} assume !!(0 != ~r~0); {17739#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:28,484 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-08 12:42:28,485 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-08 12:42:28,485 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-08 12:42:28,486 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-08 12:42:28,486 INFO L290 TraceCheckUtils]: 65: Hoare triple {17767#(<= ~counter~0 6)} ~cond := #in~cond; {17767#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:28,486 INFO L290 TraceCheckUtils]: 66: Hoare triple {17767#(<= ~counter~0 6)} assume !(0 == ~cond); {17767#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:28,486 INFO L290 TraceCheckUtils]: 67: Hoare triple {17767#(<= ~counter~0 6)} assume true; {17767#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:28,487 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17767#(<= ~counter~0 6)} {17767#(<= ~counter~0 6)} #63#return; {17767#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:28,487 INFO L290 TraceCheckUtils]: 69: Hoare triple {17767#(<= ~counter~0 6)} assume !!(0 != ~r~0); {17767#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:28,487 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-08 12:42:28,488 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-08 12:42:28,488 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-08 12:42:28,488 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-08 12:42:28,489 INFO L290 TraceCheckUtils]: 74: Hoare triple {17795#(<= ~counter~0 7)} ~cond := #in~cond; {17795#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:28,489 INFO L290 TraceCheckUtils]: 75: Hoare triple {17795#(<= ~counter~0 7)} assume !(0 == ~cond); {17795#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:28,489 INFO L290 TraceCheckUtils]: 76: Hoare triple {17795#(<= ~counter~0 7)} assume true; {17795#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:28,490 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {17795#(<= ~counter~0 7)} {17795#(<= ~counter~0 7)} #63#return; {17795#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:28,490 INFO L290 TraceCheckUtils]: 78: Hoare triple {17795#(<= ~counter~0 7)} assume !!(0 != ~r~0); {17795#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:28,490 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-08 12:42:28,491 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-08 12:42:28,491 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-08 12:42:28,491 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-08 12:42:28,492 INFO L290 TraceCheckUtils]: 83: Hoare triple {17823#(<= ~counter~0 8)} ~cond := #in~cond; {17823#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:28,492 INFO L290 TraceCheckUtils]: 84: Hoare triple {17823#(<= ~counter~0 8)} assume !(0 == ~cond); {17823#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:28,492 INFO L290 TraceCheckUtils]: 85: Hoare triple {17823#(<= ~counter~0 8)} assume true; {17823#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:28,493 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17823#(<= ~counter~0 8)} {17823#(<= ~counter~0 8)} #63#return; {17823#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:28,493 INFO L290 TraceCheckUtils]: 87: Hoare triple {17823#(<= ~counter~0 8)} assume !!(0 != ~r~0); {17823#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:28,493 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-08 12:42:28,494 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-08 12:42:28,494 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-08 12:42:28,494 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-08 12:42:28,495 INFO L290 TraceCheckUtils]: 92: Hoare triple {17851#(<= ~counter~0 9)} ~cond := #in~cond; {17851#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:28,495 INFO L290 TraceCheckUtils]: 93: Hoare triple {17851#(<= ~counter~0 9)} assume !(0 == ~cond); {17851#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:28,495 INFO L290 TraceCheckUtils]: 94: Hoare triple {17851#(<= ~counter~0 9)} assume true; {17851#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:28,495 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {17851#(<= ~counter~0 9)} {17851#(<= ~counter~0 9)} #63#return; {17851#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:28,496 INFO L290 TraceCheckUtils]: 96: Hoare triple {17851#(<= ~counter~0 9)} assume !!(0 != ~r~0); {17851#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:28,496 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-08 12:42:28,496 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-08 12:42:28,497 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-08 12:42:28,497 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-08 12:42:28,497 INFO L290 TraceCheckUtils]: 101: Hoare triple {17879#(<= ~counter~0 10)} ~cond := #in~cond; {17879#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:28,498 INFO L290 TraceCheckUtils]: 102: Hoare triple {17879#(<= ~counter~0 10)} assume !(0 == ~cond); {17879#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:28,498 INFO L290 TraceCheckUtils]: 103: Hoare triple {17879#(<= ~counter~0 10)} assume true; {17879#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:28,498 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {17879#(<= ~counter~0 10)} {17879#(<= ~counter~0 10)} #63#return; {17879#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:28,499 INFO L290 TraceCheckUtils]: 105: Hoare triple {17879#(<= ~counter~0 10)} assume !!(0 != ~r~0); {17879#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:28,499 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-08 12:42:28,499 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-08 12:42:28,500 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-08 12:42:28,500 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-08 12:42:28,500 INFO L290 TraceCheckUtils]: 110: Hoare triple {17907#(<= ~counter~0 11)} ~cond := #in~cond; {17907#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:28,501 INFO L290 TraceCheckUtils]: 111: Hoare triple {17907#(<= ~counter~0 11)} assume !(0 == ~cond); {17907#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:28,501 INFO L290 TraceCheckUtils]: 112: Hoare triple {17907#(<= ~counter~0 11)} assume true; {17907#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:28,501 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17907#(<= ~counter~0 11)} {17907#(<= ~counter~0 11)} #63#return; {17907#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:28,502 INFO L290 TraceCheckUtils]: 114: Hoare triple {17907#(<= ~counter~0 11)} assume !!(0 != ~r~0); {17907#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:28,502 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-08 12:42:28,502 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-08 12:42:28,502 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-08 12:42:28,503 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-08 12:42:28,503 INFO L290 TraceCheckUtils]: 119: Hoare triple {17935#(<= ~counter~0 12)} ~cond := #in~cond; {17935#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:28,503 INFO L290 TraceCheckUtils]: 120: Hoare triple {17935#(<= ~counter~0 12)} assume !(0 == ~cond); {17935#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:28,504 INFO L290 TraceCheckUtils]: 121: Hoare triple {17935#(<= ~counter~0 12)} assume true; {17935#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:28,504 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17935#(<= ~counter~0 12)} {17935#(<= ~counter~0 12)} #63#return; {17935#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:28,505 INFO L290 TraceCheckUtils]: 123: Hoare triple {17935#(<= ~counter~0 12)} assume !!(0 != ~r~0); {17935#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:28,505 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-08 12:42:28,505 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-08 12:42:28,506 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-08 12:42:28,506 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-08 12:42:28,507 INFO L290 TraceCheckUtils]: 128: Hoare triple {17963#(<= ~counter~0 13)} ~cond := #in~cond; {17963#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:28,507 INFO L290 TraceCheckUtils]: 129: Hoare triple {17963#(<= ~counter~0 13)} assume !(0 == ~cond); {17963#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:28,507 INFO L290 TraceCheckUtils]: 130: Hoare triple {17963#(<= ~counter~0 13)} assume true; {17963#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:28,535 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {17963#(<= ~counter~0 13)} {17963#(<= ~counter~0 13)} #63#return; {17963#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:28,536 INFO L290 TraceCheckUtils]: 132: Hoare triple {17963#(<= ~counter~0 13)} assume !!(0 != ~r~0); {17963#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:28,536 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-08 12:42:28,537 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-08 12:42:28,537 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-08 12:42:28,538 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-08 12:42:28,538 INFO L290 TraceCheckUtils]: 137: Hoare triple {17991#(<= ~counter~0 14)} ~cond := #in~cond; {17991#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:28,538 INFO L290 TraceCheckUtils]: 138: Hoare triple {17991#(<= ~counter~0 14)} assume !(0 == ~cond); {17991#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:28,538 INFO L290 TraceCheckUtils]: 139: Hoare triple {17991#(<= ~counter~0 14)} assume true; {17991#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:28,539 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {17991#(<= ~counter~0 14)} {17991#(<= ~counter~0 14)} #63#return; {17991#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:28,539 INFO L290 TraceCheckUtils]: 141: Hoare triple {17991#(<= ~counter~0 14)} assume !!(0 != ~r~0); {17991#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:28,539 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-08 12:42:28,540 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-08 12:42:28,540 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-08 12:42:28,541 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-08 12:42:28,541 INFO L290 TraceCheckUtils]: 146: Hoare triple {18019#(<= ~counter~0 15)} ~cond := #in~cond; {18019#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:28,541 INFO L290 TraceCheckUtils]: 147: Hoare triple {18019#(<= ~counter~0 15)} assume !(0 == ~cond); {18019#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:28,542 INFO L290 TraceCheckUtils]: 148: Hoare triple {18019#(<= ~counter~0 15)} assume true; {18019#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:28,542 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {18019#(<= ~counter~0 15)} {18019#(<= ~counter~0 15)} #63#return; {18019#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:28,542 INFO L290 TraceCheckUtils]: 150: Hoare triple {18019#(<= ~counter~0 15)} assume !!(0 != ~r~0); {18019#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:28,543 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-08 12:42:28,543 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-08 12:42:28,543 INFO L290 TraceCheckUtils]: 153: Hoare triple {18047#(<= |main_#t~post6| 15)} assume !(#t~post6 < 20);havoc #t~post6; {17571#false} is VALID [2022-04-08 12:42:28,543 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-08 12:42:28,543 INFO L290 TraceCheckUtils]: 155: Hoare triple {17571#false} ~cond := #in~cond; {17571#false} is VALID [2022-04-08 12:42:28,543 INFO L290 TraceCheckUtils]: 156: Hoare triple {17571#false} assume 0 == ~cond; {17571#false} is VALID [2022-04-08 12:42:28,543 INFO L290 TraceCheckUtils]: 157: Hoare triple {17571#false} assume !false; {17571#false} is VALID [2022-04-08 12:42:28,544 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-08 12:42:28,544 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:42:29,185 INFO L290 TraceCheckUtils]: 157: Hoare triple {17571#false} assume !false; {17571#false} is VALID [2022-04-08 12:42:29,185 INFO L290 TraceCheckUtils]: 156: Hoare triple {17571#false} assume 0 == ~cond; {17571#false} is VALID [2022-04-08 12:42:29,185 INFO L290 TraceCheckUtils]: 155: Hoare triple {17571#false} ~cond := #in~cond; {17571#false} is VALID [2022-04-08 12:42:29,185 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-08 12:42:29,185 INFO L290 TraceCheckUtils]: 153: Hoare triple {18075#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {17571#false} is VALID [2022-04-08 12:42:29,186 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-08 12:42:29,186 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-08 12:42:29,186 INFO L290 TraceCheckUtils]: 150: Hoare triple {18079#(< ~counter~0 20)} assume !!(0 != ~r~0); {18079#(< ~counter~0 20)} is VALID [2022-04-08 12:42:29,187 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {17570#true} {18079#(< ~counter~0 20)} #63#return; {18079#(< ~counter~0 20)} is VALID [2022-04-08 12:42:29,187 INFO L290 TraceCheckUtils]: 148: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,187 INFO L290 TraceCheckUtils]: 147: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,187 INFO L290 TraceCheckUtils]: 146: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,187 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-08 12:42:29,187 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-08 12:42:29,188 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-08 12:42:29,188 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-08 12:42:29,188 INFO L290 TraceCheckUtils]: 141: Hoare triple {18107#(< ~counter~0 19)} assume !!(0 != ~r~0); {18107#(< ~counter~0 19)} is VALID [2022-04-08 12:42:29,189 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {17570#true} {18107#(< ~counter~0 19)} #63#return; {18107#(< ~counter~0 19)} is VALID [2022-04-08 12:42:29,189 INFO L290 TraceCheckUtils]: 139: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,189 INFO L290 TraceCheckUtils]: 138: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,189 INFO L290 TraceCheckUtils]: 137: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,189 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-08 12:42:29,189 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-08 12:42:29,190 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-08 12:42:29,190 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-08 12:42:29,190 INFO L290 TraceCheckUtils]: 132: Hoare triple {18135#(< ~counter~0 18)} assume !!(0 != ~r~0); {18135#(< ~counter~0 18)} is VALID [2022-04-08 12:42:29,191 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {17570#true} {18135#(< ~counter~0 18)} #63#return; {18135#(< ~counter~0 18)} is VALID [2022-04-08 12:42:29,191 INFO L290 TraceCheckUtils]: 130: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,191 INFO L290 TraceCheckUtils]: 129: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,191 INFO L290 TraceCheckUtils]: 128: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,191 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-08 12:42:29,191 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-08 12:42:29,192 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-08 12:42:29,192 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-08 12:42:29,192 INFO L290 TraceCheckUtils]: 123: Hoare triple {18163#(< ~counter~0 17)} assume !!(0 != ~r~0); {18163#(< ~counter~0 17)} is VALID [2022-04-08 12:42:29,193 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {17570#true} {18163#(< ~counter~0 17)} #63#return; {18163#(< ~counter~0 17)} is VALID [2022-04-08 12:42:29,193 INFO L290 TraceCheckUtils]: 121: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,193 INFO L290 TraceCheckUtils]: 120: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,193 INFO L290 TraceCheckUtils]: 119: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,193 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-08 12:42:29,193 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-08 12:42:29,194 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-08 12:42:29,194 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-08 12:42:29,194 INFO L290 TraceCheckUtils]: 114: Hoare triple {18019#(<= ~counter~0 15)} assume !!(0 != ~r~0); {18019#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:29,195 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {17570#true} {18019#(<= ~counter~0 15)} #63#return; {18019#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:29,195 INFO L290 TraceCheckUtils]: 112: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,195 INFO L290 TraceCheckUtils]: 111: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,195 INFO L290 TraceCheckUtils]: 110: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,195 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-08 12:42:29,195 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-08 12:42:29,196 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-08 12:42:29,196 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-08 12:42:29,196 INFO L290 TraceCheckUtils]: 105: Hoare triple {17991#(<= ~counter~0 14)} assume !!(0 != ~r~0); {17991#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:29,196 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {17570#true} {17991#(<= ~counter~0 14)} #63#return; {17991#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:29,197 INFO L290 TraceCheckUtils]: 103: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,197 INFO L290 TraceCheckUtils]: 102: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,197 INFO L290 TraceCheckUtils]: 101: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,197 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-08 12:42:29,197 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-08 12:42:29,197 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-08 12:42:29,198 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-08 12:42:29,198 INFO L290 TraceCheckUtils]: 96: Hoare triple {17963#(<= ~counter~0 13)} assume !!(0 != ~r~0); {17963#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:29,198 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {17570#true} {17963#(<= ~counter~0 13)} #63#return; {17963#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:29,199 INFO L290 TraceCheckUtils]: 94: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,199 INFO L290 TraceCheckUtils]: 93: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,199 INFO L290 TraceCheckUtils]: 92: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,199 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-08 12:42:29,199 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-08 12:42:29,199 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-08 12:42:29,200 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-08 12:42:29,200 INFO L290 TraceCheckUtils]: 87: Hoare triple {17935#(<= ~counter~0 12)} assume !!(0 != ~r~0); {17935#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:29,200 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {17570#true} {17935#(<= ~counter~0 12)} #63#return; {17935#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:29,200 INFO L290 TraceCheckUtils]: 85: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,200 INFO L290 TraceCheckUtils]: 84: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,201 INFO L290 TraceCheckUtils]: 83: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,201 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-08 12:42:29,201 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-08 12:42:29,201 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-08 12:42:29,202 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-08 12:42:29,202 INFO L290 TraceCheckUtils]: 78: Hoare triple {17907#(<= ~counter~0 11)} assume !!(0 != ~r~0); {17907#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:29,202 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {17570#true} {17907#(<= ~counter~0 11)} #63#return; {17907#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:29,202 INFO L290 TraceCheckUtils]: 76: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,202 INFO L290 TraceCheckUtils]: 75: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,202 INFO L290 TraceCheckUtils]: 74: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,202 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-08 12:42:29,203 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-08 12:42:29,203 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-08 12:42:29,203 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-08 12:42:29,204 INFO L290 TraceCheckUtils]: 69: Hoare triple {17879#(<= ~counter~0 10)} assume !!(0 != ~r~0); {17879#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:29,204 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {17570#true} {17879#(<= ~counter~0 10)} #63#return; {17879#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:29,204 INFO L290 TraceCheckUtils]: 67: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,204 INFO L290 TraceCheckUtils]: 66: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,204 INFO L290 TraceCheckUtils]: 65: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,204 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-08 12:42:29,205 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-08 12:42:29,205 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-08 12:42:29,205 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-08 12:42:29,206 INFO L290 TraceCheckUtils]: 60: Hoare triple {17851#(<= ~counter~0 9)} assume !!(0 != ~r~0); {17851#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:29,206 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {17570#true} {17851#(<= ~counter~0 9)} #63#return; {17851#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:29,206 INFO L290 TraceCheckUtils]: 58: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,206 INFO L290 TraceCheckUtils]: 57: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,206 INFO L290 TraceCheckUtils]: 56: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,206 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-08 12:42:29,207 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-08 12:42:29,207 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-08 12:42:29,207 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-08 12:42:29,207 INFO L290 TraceCheckUtils]: 51: Hoare triple {17823#(<= ~counter~0 8)} assume !!(0 != ~r~0); {17823#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:29,208 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {17570#true} {17823#(<= ~counter~0 8)} #63#return; {17823#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:29,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,208 INFO L290 TraceCheckUtils]: 48: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,208 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-08 12:42:29,208 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-08 12:42:29,209 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-08 12:42:29,209 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-08 12:42:29,209 INFO L290 TraceCheckUtils]: 42: Hoare triple {17795#(<= ~counter~0 7)} assume !!(0 != ~r~0); {17795#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:29,210 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {17570#true} {17795#(<= ~counter~0 7)} #63#return; {17795#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:29,210 INFO L290 TraceCheckUtils]: 40: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,210 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-08 12:42:29,210 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-08 12:42:29,211 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-08 12:42:29,211 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-08 12:42:29,211 INFO L290 TraceCheckUtils]: 33: Hoare triple {17767#(<= ~counter~0 6)} assume !!(0 != ~r~0); {17767#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:29,212 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {17570#true} {17767#(<= ~counter~0 6)} #63#return; {17767#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:29,212 INFO L290 TraceCheckUtils]: 31: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,212 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-08 12:42:29,212 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-08 12:42:29,213 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-08 12:42:29,213 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-08 12:42:29,213 INFO L290 TraceCheckUtils]: 24: Hoare triple {17739#(<= ~counter~0 5)} assume !!(0 != ~r~0); {17739#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:29,214 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17570#true} {17739#(<= ~counter~0 5)} #63#return; {17739#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:29,214 INFO L290 TraceCheckUtils]: 22: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,214 INFO L290 TraceCheckUtils]: 20: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,214 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-08 12:42:29,214 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-08 12:42:29,215 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-08 12:42:29,215 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-08 12:42:29,215 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17570#true} {17711#(<= ~counter~0 4)} #61#return; {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:29,215 INFO L290 TraceCheckUtils]: 14: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,215 INFO L290 TraceCheckUtils]: 13: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,215 INFO L290 TraceCheckUtils]: 12: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,215 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-08 12:42:29,216 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17570#true} {17711#(<= ~counter~0 4)} #59#return; {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:29,216 INFO L290 TraceCheckUtils]: 9: Hoare triple {17570#true} assume true; {17570#true} is VALID [2022-04-08 12:42:29,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {17570#true} assume !(0 == ~cond); {17570#true} is VALID [2022-04-08 12:42:29,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {17570#true} ~cond := #in~cond; {17570#true} is VALID [2022-04-08 12:42:29,216 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-08 12:42:29,216 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-08 12:42:29,217 INFO L272 TraceCheckUtils]: 4: Hoare triple {17711#(<= ~counter~0 4)} call #t~ret7 := main(); {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:29,217 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17711#(<= ~counter~0 4)} {17570#true} #67#return; {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:29,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {17711#(<= ~counter~0 4)} assume true; {17711#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:29,218 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-08 12:42:29,218 INFO L272 TraceCheckUtils]: 0: Hoare triple {17570#true} call ULTIMATE.init(); {17570#true} is VALID [2022-04-08 12:42:29,218 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-08 12:42:29,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:42:29,218 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [382574729] [2022-04-08 12:42:29,218 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:42:29,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1384604994] [2022-04-08 12:42:29,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1384604994] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:42:29,219 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:42:29,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 24 [2022-04-08 12:42:29,219 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:42:29,219 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [555722243] [2022-04-08 12:42:29,219 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [555722243] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:42:29,219 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:42:29,219 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-08 12:42:29,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014754469] [2022-04-08 12:42:29,219 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:42:29,220 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-08 12:42:29,220 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:42:29,220 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-08 12:42:29,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:42:29,310 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-08 12:42:29,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:29,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-08 12:42:29,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:42:29,311 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-08 12:42:29,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:29,920 INFO L93 Difference]: Finished difference Result 169 states and 186 transitions. [2022-04-08 12:42:29,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-08 12:42:29,920 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-08 12:42:29,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:42:29,921 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-08 12:42:29,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 185 transitions. [2022-04-08 12:42:29,923 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-08 12:42:29,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 185 transitions. [2022-04-08 12:42:29,925 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 185 transitions. [2022-04-08 12:42:30,045 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-08 12:42:30,047 INFO L225 Difference]: With dead ends: 169 [2022-04-08 12:42:30,047 INFO L226 Difference]: Without dead ends: 164 [2022-04-08 12:42:30,048 INFO L912 BasicCegarLoop]: 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-08 12:42:30,048 INFO L913 BasicCegarLoop]: 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-08 12:42:30,048 INFO L914 BasicCegarLoop]: 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-08 12:42:30,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2022-04-08 12:42:30,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 164. [2022-04-08 12:42:30,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:42:30,205 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-08 12:42:30,205 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-08 12:42:30,205 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-08 12:42:30,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:30,207 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2022-04-08 12:42:30,207 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2022-04-08 12:42:30,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:30,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:30,208 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-08 12:42:30,208 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-08 12:42:30,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:30,210 INFO L93 Difference]: Finished difference Result 164 states and 181 transitions. [2022-04-08 12:42:30,210 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2022-04-08 12:42:30,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:30,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:30,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:42:30,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:42:30,211 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-08 12:42:30,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 181 transitions. [2022-04-08 12:42:30,213 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 181 transitions. Word has length 158 [2022-04-08 12:42:30,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:42:30,213 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 181 transitions. [2022-04-08 12:42:30,213 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 6.157894736842105) internal successors, (117), 18 states have internal predecessors, (117), 18 states have call successors, (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-08 12:42:30,213 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 181 transitions. [2022-04-08 12:42:32,415 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-08 12:42:32,415 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 181 transitions. [2022-04-08 12:42:32,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-08 12:42:32,425 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:42:32,425 INFO L499 BasicCegarLoop]: 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-08 12:42:32,434 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-04-08 12:42:32,634 WARN L460 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-08 12:42:32,634 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:42:32,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:42:32,634 INFO L85 PathProgramCache]: Analyzing trace with hash -1479991018, now seen corresponding path program 31 times [2022-04-08 12:42:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:32,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1448768425] [2022-04-08 12:42:32,635 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:42:32,635 INFO L85 PathProgramCache]: Analyzing trace with hash -1479991018, now seen corresponding path program 32 times [2022-04-08 12:42:32,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:42:32,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [962121464] [2022-04-08 12:42:32,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:42:32,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:42:32,650 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:42:32,650 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [390049370] [2022-04-08 12:42:32,650 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:42:32,650 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:42:32,650 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:42:32,651 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:42:32,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2022-04-08 12:42:32,755 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:42:32,756 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:42:32,757 INFO L263 TraceCheckSpWp]: Trace formula consists of 413 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-08 12:42:32,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:42:32,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:42:33,546 INFO L272 TraceCheckUtils]: 0: Hoare triple {19565#true} call ULTIMATE.init(); {19565#true} is VALID [2022-04-08 12:42:33,547 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-08 12:42:33,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {19573#(<= ~counter~0 0)} assume true; {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,548 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19573#(<= ~counter~0 0)} {19565#true} #67#return; {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,548 INFO L272 TraceCheckUtils]: 4: Hoare triple {19573#(<= ~counter~0 0)} call #t~ret7 := main(); {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,548 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-08 12:42:33,548 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-08 12:42:33,549 INFO L290 TraceCheckUtils]: 7: Hoare triple {19573#(<= ~counter~0 0)} ~cond := #in~cond; {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,549 INFO L290 TraceCheckUtils]: 8: Hoare triple {19573#(<= ~counter~0 0)} assume !(0 == ~cond); {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,549 INFO L290 TraceCheckUtils]: 9: Hoare triple {19573#(<= ~counter~0 0)} assume true; {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,550 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19573#(<= ~counter~0 0)} {19573#(<= ~counter~0 0)} #59#return; {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,550 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-08 12:42:33,550 INFO L290 TraceCheckUtils]: 12: Hoare triple {19573#(<= ~counter~0 0)} ~cond := #in~cond; {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,550 INFO L290 TraceCheckUtils]: 13: Hoare triple {19573#(<= ~counter~0 0)} assume !(0 == ~cond); {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {19573#(<= ~counter~0 0)} assume true; {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,551 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19573#(<= ~counter~0 0)} {19573#(<= ~counter~0 0)} #61#return; {19573#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:33,551 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-08 12:42:33,552 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-08 12:42:33,552 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-08 12:42:33,553 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-08 12:42:33,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {19622#(<= ~counter~0 1)} ~cond := #in~cond; {19622#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:33,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {19622#(<= ~counter~0 1)} assume !(0 == ~cond); {19622#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:33,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {19622#(<= ~counter~0 1)} assume true; {19622#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:33,554 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19622#(<= ~counter~0 1)} {19622#(<= ~counter~0 1)} #63#return; {19622#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:33,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {19622#(<= ~counter~0 1)} assume !!(0 != ~r~0); {19622#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:33,554 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-08 12:42:33,555 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-08 12:42:33,555 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-08 12:42:33,556 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-08 12:42:33,556 INFO L290 TraceCheckUtils]: 29: Hoare triple {19650#(<= ~counter~0 2)} ~cond := #in~cond; {19650#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:33,556 INFO L290 TraceCheckUtils]: 30: Hoare triple {19650#(<= ~counter~0 2)} assume !(0 == ~cond); {19650#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:33,556 INFO L290 TraceCheckUtils]: 31: Hoare triple {19650#(<= ~counter~0 2)} assume true; {19650#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:33,557 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19650#(<= ~counter~0 2)} {19650#(<= ~counter~0 2)} #63#return; {19650#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:33,557 INFO L290 TraceCheckUtils]: 33: Hoare triple {19650#(<= ~counter~0 2)} assume !!(0 != ~r~0); {19650#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:33,557 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-08 12:42:33,558 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-08 12:42:33,558 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-08 12:42:33,558 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-08 12:42:33,559 INFO L290 TraceCheckUtils]: 38: Hoare triple {19678#(<= ~counter~0 3)} ~cond := #in~cond; {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:33,559 INFO L290 TraceCheckUtils]: 39: Hoare triple {19678#(<= ~counter~0 3)} assume !(0 == ~cond); {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:33,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {19678#(<= ~counter~0 3)} assume true; {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:33,560 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19678#(<= ~counter~0 3)} {19678#(<= ~counter~0 3)} #63#return; {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:33,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {19678#(<= ~counter~0 3)} assume !!(0 != ~r~0); {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:33,560 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-08 12:42:33,561 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-08 12:42:33,561 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-08 12:42:33,561 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-08 12:42:33,562 INFO L290 TraceCheckUtils]: 47: Hoare triple {19706#(<= ~counter~0 4)} ~cond := #in~cond; {19706#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:33,562 INFO L290 TraceCheckUtils]: 48: Hoare triple {19706#(<= ~counter~0 4)} assume !(0 == ~cond); {19706#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:33,562 INFO L290 TraceCheckUtils]: 49: Hoare triple {19706#(<= ~counter~0 4)} assume true; {19706#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:33,563 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19706#(<= ~counter~0 4)} {19706#(<= ~counter~0 4)} #63#return; {19706#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:33,563 INFO L290 TraceCheckUtils]: 51: Hoare triple {19706#(<= ~counter~0 4)} assume !!(0 != ~r~0); {19706#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:33,563 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-08 12:42:33,564 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-08 12:42:33,564 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-08 12:42:33,564 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-08 12:42:33,565 INFO L290 TraceCheckUtils]: 56: Hoare triple {19734#(<= ~counter~0 5)} ~cond := #in~cond; {19734#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:33,565 INFO L290 TraceCheckUtils]: 57: Hoare triple {19734#(<= ~counter~0 5)} assume !(0 == ~cond); {19734#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:33,565 INFO L290 TraceCheckUtils]: 58: Hoare triple {19734#(<= ~counter~0 5)} assume true; {19734#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:33,566 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19734#(<= ~counter~0 5)} {19734#(<= ~counter~0 5)} #63#return; {19734#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:33,566 INFO L290 TraceCheckUtils]: 60: Hoare triple {19734#(<= ~counter~0 5)} assume !!(0 != ~r~0); {19734#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:33,566 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-08 12:42:33,566 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-08 12:42:33,567 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-08 12:42:33,567 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-08 12:42:33,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {19762#(<= ~counter~0 6)} ~cond := #in~cond; {19762#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:33,568 INFO L290 TraceCheckUtils]: 66: Hoare triple {19762#(<= ~counter~0 6)} assume !(0 == ~cond); {19762#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:33,568 INFO L290 TraceCheckUtils]: 67: Hoare triple {19762#(<= ~counter~0 6)} assume true; {19762#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:33,568 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19762#(<= ~counter~0 6)} {19762#(<= ~counter~0 6)} #63#return; {19762#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:33,569 INFO L290 TraceCheckUtils]: 69: Hoare triple {19762#(<= ~counter~0 6)} assume !!(0 != ~r~0); {19762#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:33,569 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-08 12:42:33,569 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-08 12:42:33,570 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-08 12:42:33,570 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-08 12:42:33,570 INFO L290 TraceCheckUtils]: 74: Hoare triple {19790#(<= ~counter~0 7)} ~cond := #in~cond; {19790#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:33,571 INFO L290 TraceCheckUtils]: 75: Hoare triple {19790#(<= ~counter~0 7)} assume !(0 == ~cond); {19790#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:33,571 INFO L290 TraceCheckUtils]: 76: Hoare triple {19790#(<= ~counter~0 7)} assume true; {19790#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:33,571 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {19790#(<= ~counter~0 7)} {19790#(<= ~counter~0 7)} #63#return; {19790#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:33,572 INFO L290 TraceCheckUtils]: 78: Hoare triple {19790#(<= ~counter~0 7)} assume !!(0 != ~r~0); {19790#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:33,572 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-08 12:42:33,572 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-08 12:42:33,573 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-08 12:42:33,573 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-08 12:42:33,573 INFO L290 TraceCheckUtils]: 83: Hoare triple {19818#(<= ~counter~0 8)} ~cond := #in~cond; {19818#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:33,574 INFO L290 TraceCheckUtils]: 84: Hoare triple {19818#(<= ~counter~0 8)} assume !(0 == ~cond); {19818#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:33,574 INFO L290 TraceCheckUtils]: 85: Hoare triple {19818#(<= ~counter~0 8)} assume true; {19818#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:33,574 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19818#(<= ~counter~0 8)} {19818#(<= ~counter~0 8)} #63#return; {19818#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:33,575 INFO L290 TraceCheckUtils]: 87: Hoare triple {19818#(<= ~counter~0 8)} assume !!(0 != ~r~0); {19818#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:33,575 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-08 12:42:33,575 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-08 12:42:33,575 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-08 12:42:33,576 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-08 12:42:33,576 INFO L290 TraceCheckUtils]: 92: Hoare triple {19846#(<= ~counter~0 9)} ~cond := #in~cond; {19846#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:33,576 INFO L290 TraceCheckUtils]: 93: Hoare triple {19846#(<= ~counter~0 9)} assume !(0 == ~cond); {19846#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:33,577 INFO L290 TraceCheckUtils]: 94: Hoare triple {19846#(<= ~counter~0 9)} assume true; {19846#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:33,577 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {19846#(<= ~counter~0 9)} {19846#(<= ~counter~0 9)} #63#return; {19846#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:33,577 INFO L290 TraceCheckUtils]: 96: Hoare triple {19846#(<= ~counter~0 9)} assume !!(0 != ~r~0); {19846#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:33,578 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-08 12:42:33,578 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-08 12:42:33,578 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-08 12:42:33,579 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-08 12:42:33,579 INFO L290 TraceCheckUtils]: 101: Hoare triple {19874#(<= ~counter~0 10)} ~cond := #in~cond; {19874#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:33,579 INFO L290 TraceCheckUtils]: 102: Hoare triple {19874#(<= ~counter~0 10)} assume !(0 == ~cond); {19874#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:33,580 INFO L290 TraceCheckUtils]: 103: Hoare triple {19874#(<= ~counter~0 10)} assume true; {19874#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:33,580 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {19874#(<= ~counter~0 10)} {19874#(<= ~counter~0 10)} #63#return; {19874#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:33,580 INFO L290 TraceCheckUtils]: 105: Hoare triple {19874#(<= ~counter~0 10)} assume !!(0 != ~r~0); {19874#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:33,581 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-08 12:42:33,581 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-08 12:42:33,581 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-08 12:42:33,582 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-08 12:42:33,582 INFO L290 TraceCheckUtils]: 110: Hoare triple {19902#(<= ~counter~0 11)} ~cond := #in~cond; {19902#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:33,582 INFO L290 TraceCheckUtils]: 111: Hoare triple {19902#(<= ~counter~0 11)} assume !(0 == ~cond); {19902#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:33,583 INFO L290 TraceCheckUtils]: 112: Hoare triple {19902#(<= ~counter~0 11)} assume true; {19902#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:33,583 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19902#(<= ~counter~0 11)} {19902#(<= ~counter~0 11)} #63#return; {19902#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:33,583 INFO L290 TraceCheckUtils]: 114: Hoare triple {19902#(<= ~counter~0 11)} assume !!(0 != ~r~0); {19902#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:33,583 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-08 12:42:33,584 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-08 12:42:33,584 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-08 12:42:33,585 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-08 12:42:33,585 INFO L290 TraceCheckUtils]: 119: Hoare triple {19930#(<= ~counter~0 12)} ~cond := #in~cond; {19930#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:33,585 INFO L290 TraceCheckUtils]: 120: Hoare triple {19930#(<= ~counter~0 12)} assume !(0 == ~cond); {19930#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:33,585 INFO L290 TraceCheckUtils]: 121: Hoare triple {19930#(<= ~counter~0 12)} assume true; {19930#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:33,586 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19930#(<= ~counter~0 12)} {19930#(<= ~counter~0 12)} #63#return; {19930#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:33,586 INFO L290 TraceCheckUtils]: 123: Hoare triple {19930#(<= ~counter~0 12)} assume !!(0 != ~r~0); {19930#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:33,586 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-08 12:42:33,587 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-08 12:42:33,587 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-08 12:42:33,588 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-08 12:42:33,588 INFO L290 TraceCheckUtils]: 128: Hoare triple {19958#(<= ~counter~0 13)} ~cond := #in~cond; {19958#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:33,588 INFO L290 TraceCheckUtils]: 129: Hoare triple {19958#(<= ~counter~0 13)} assume !(0 == ~cond); {19958#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:33,588 INFO L290 TraceCheckUtils]: 130: Hoare triple {19958#(<= ~counter~0 13)} assume true; {19958#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:33,589 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {19958#(<= ~counter~0 13)} {19958#(<= ~counter~0 13)} #63#return; {19958#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:33,589 INFO L290 TraceCheckUtils]: 132: Hoare triple {19958#(<= ~counter~0 13)} assume !!(0 != ~r~0); {19958#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:33,589 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-08 12:42:33,590 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-08 12:42:33,590 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-08 12:42:33,590 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-08 12:42:33,591 INFO L290 TraceCheckUtils]: 137: Hoare triple {19986#(<= ~counter~0 14)} ~cond := #in~cond; {19986#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:33,591 INFO L290 TraceCheckUtils]: 138: Hoare triple {19986#(<= ~counter~0 14)} assume !(0 == ~cond); {19986#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:33,591 INFO L290 TraceCheckUtils]: 139: Hoare triple {19986#(<= ~counter~0 14)} assume true; {19986#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:33,592 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {19986#(<= ~counter~0 14)} {19986#(<= ~counter~0 14)} #63#return; {19986#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:33,592 INFO L290 TraceCheckUtils]: 141: Hoare triple {19986#(<= ~counter~0 14)} assume !!(0 != ~r~0); {19986#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:33,592 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-08 12:42:33,593 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-08 12:42:33,593 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-08 12:42:33,593 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-08 12:42:33,594 INFO L290 TraceCheckUtils]: 146: Hoare triple {20014#(<= ~counter~0 15)} ~cond := #in~cond; {20014#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:33,594 INFO L290 TraceCheckUtils]: 147: Hoare triple {20014#(<= ~counter~0 15)} assume !(0 == ~cond); {20014#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:33,594 INFO L290 TraceCheckUtils]: 148: Hoare triple {20014#(<= ~counter~0 15)} assume true; {20014#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:33,595 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {20014#(<= ~counter~0 15)} {20014#(<= ~counter~0 15)} #63#return; {20014#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:33,595 INFO L290 TraceCheckUtils]: 150: Hoare triple {20014#(<= ~counter~0 15)} assume !!(0 != ~r~0); {20014#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:33,595 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-08 12:42:33,596 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-08 12:42:33,596 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-08 12:42:33,596 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-08 12:42:33,597 INFO L290 TraceCheckUtils]: 155: Hoare triple {20042#(<= ~counter~0 16)} ~cond := #in~cond; {20042#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:33,597 INFO L290 TraceCheckUtils]: 156: Hoare triple {20042#(<= ~counter~0 16)} assume !(0 == ~cond); {20042#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:33,597 INFO L290 TraceCheckUtils]: 157: Hoare triple {20042#(<= ~counter~0 16)} assume true; {20042#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:33,598 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {20042#(<= ~counter~0 16)} {20042#(<= ~counter~0 16)} #63#return; {20042#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:33,598 INFO L290 TraceCheckUtils]: 159: Hoare triple {20042#(<= ~counter~0 16)} assume !!(0 != ~r~0); {20042#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:33,598 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-08 12:42:33,598 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-08 12:42:33,599 INFO L290 TraceCheckUtils]: 162: Hoare triple {20070#(<= |main_#t~post6| 16)} assume !(#t~post6 < 20);havoc #t~post6; {19566#false} is VALID [2022-04-08 12:42:33,599 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-08 12:42:33,599 INFO L290 TraceCheckUtils]: 164: Hoare triple {19566#false} ~cond := #in~cond; {19566#false} is VALID [2022-04-08 12:42:33,599 INFO L290 TraceCheckUtils]: 165: Hoare triple {19566#false} assume 0 == ~cond; {19566#false} is VALID [2022-04-08 12:42:33,599 INFO L290 TraceCheckUtils]: 166: Hoare triple {19566#false} assume !false; {19566#false} is VALID [2022-04-08 12:42:33,600 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-08 12:42:33,600 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:42:34,315 INFO L290 TraceCheckUtils]: 166: Hoare triple {19566#false} assume !false; {19566#false} is VALID [2022-04-08 12:42:34,315 INFO L290 TraceCheckUtils]: 165: Hoare triple {19566#false} assume 0 == ~cond; {19566#false} is VALID [2022-04-08 12:42:34,315 INFO L290 TraceCheckUtils]: 164: Hoare triple {19566#false} ~cond := #in~cond; {19566#false} is VALID [2022-04-08 12:42:34,315 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-08 12:42:34,315 INFO L290 TraceCheckUtils]: 162: Hoare triple {20098#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {19566#false} is VALID [2022-04-08 12:42:34,316 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-08 12:42:34,316 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-08 12:42:34,316 INFO L290 TraceCheckUtils]: 159: Hoare triple {20102#(< ~counter~0 20)} assume !!(0 != ~r~0); {20102#(< ~counter~0 20)} is VALID [2022-04-08 12:42:34,317 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {19565#true} {20102#(< ~counter~0 20)} #63#return; {20102#(< ~counter~0 20)} is VALID [2022-04-08 12:42:34,317 INFO L290 TraceCheckUtils]: 157: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,317 INFO L290 TraceCheckUtils]: 156: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,317 INFO L290 TraceCheckUtils]: 155: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,317 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-08 12:42:34,317 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-08 12:42:34,318 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-08 12:42:34,318 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-08 12:42:34,318 INFO L290 TraceCheckUtils]: 150: Hoare triple {20130#(< ~counter~0 19)} assume !!(0 != ~r~0); {20130#(< ~counter~0 19)} is VALID [2022-04-08 12:42:34,319 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {19565#true} {20130#(< ~counter~0 19)} #63#return; {20130#(< ~counter~0 19)} is VALID [2022-04-08 12:42:34,319 INFO L290 TraceCheckUtils]: 148: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,319 INFO L290 TraceCheckUtils]: 147: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,319 INFO L290 TraceCheckUtils]: 146: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,319 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-08 12:42:34,319 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-08 12:42:34,320 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-08 12:42:34,320 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-08 12:42:34,320 INFO L290 TraceCheckUtils]: 141: Hoare triple {20158#(< ~counter~0 18)} assume !!(0 != ~r~0); {20158#(< ~counter~0 18)} is VALID [2022-04-08 12:42:34,321 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {19565#true} {20158#(< ~counter~0 18)} #63#return; {20158#(< ~counter~0 18)} is VALID [2022-04-08 12:42:34,321 INFO L290 TraceCheckUtils]: 139: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,321 INFO L290 TraceCheckUtils]: 138: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,321 INFO L290 TraceCheckUtils]: 137: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,321 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-08 12:42:34,321 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-08 12:42:34,322 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-08 12:42:34,322 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-08 12:42:34,322 INFO L290 TraceCheckUtils]: 132: Hoare triple {20042#(<= ~counter~0 16)} assume !!(0 != ~r~0); {20042#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:34,323 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {19565#true} {20042#(<= ~counter~0 16)} #63#return; {20042#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:34,323 INFO L290 TraceCheckUtils]: 130: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,323 INFO L290 TraceCheckUtils]: 129: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,323 INFO L290 TraceCheckUtils]: 128: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,323 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-08 12:42:34,323 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-08 12:42:34,324 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-08 12:42:34,324 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-08 12:42:34,324 INFO L290 TraceCheckUtils]: 123: Hoare triple {20014#(<= ~counter~0 15)} assume !!(0 != ~r~0); {20014#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:34,325 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {19565#true} {20014#(<= ~counter~0 15)} #63#return; {20014#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:34,325 INFO L290 TraceCheckUtils]: 121: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,325 INFO L290 TraceCheckUtils]: 120: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,325 INFO L290 TraceCheckUtils]: 119: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,325 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-08 12:42:34,325 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-08 12:42:34,326 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-08 12:42:34,326 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-08 12:42:34,326 INFO L290 TraceCheckUtils]: 114: Hoare triple {19986#(<= ~counter~0 14)} assume !!(0 != ~r~0); {19986#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:34,327 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {19565#true} {19986#(<= ~counter~0 14)} #63#return; {19986#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:34,327 INFO L290 TraceCheckUtils]: 112: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,327 INFO L290 TraceCheckUtils]: 111: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,327 INFO L290 TraceCheckUtils]: 110: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,327 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-08 12:42:34,327 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-08 12:42:34,328 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-08 12:42:34,328 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-08 12:42:34,328 INFO L290 TraceCheckUtils]: 105: Hoare triple {19958#(<= ~counter~0 13)} assume !!(0 != ~r~0); {19958#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:34,329 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {19565#true} {19958#(<= ~counter~0 13)} #63#return; {19958#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:34,329 INFO L290 TraceCheckUtils]: 103: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,329 INFO L290 TraceCheckUtils]: 102: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,329 INFO L290 TraceCheckUtils]: 101: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,329 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-08 12:42:34,329 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-08 12:42:34,330 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-08 12:42:34,330 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-08 12:42:34,330 INFO L290 TraceCheckUtils]: 96: Hoare triple {19930#(<= ~counter~0 12)} assume !!(0 != ~r~0); {19930#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:34,331 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {19565#true} {19930#(<= ~counter~0 12)} #63#return; {19930#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:34,331 INFO L290 TraceCheckUtils]: 94: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,331 INFO L290 TraceCheckUtils]: 93: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,331 INFO L290 TraceCheckUtils]: 92: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,331 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-08 12:42:34,331 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-08 12:42:34,332 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-08 12:42:34,332 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-08 12:42:34,332 INFO L290 TraceCheckUtils]: 87: Hoare triple {19902#(<= ~counter~0 11)} assume !!(0 != ~r~0); {19902#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:34,333 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {19565#true} {19902#(<= ~counter~0 11)} #63#return; {19902#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:34,333 INFO L290 TraceCheckUtils]: 85: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,333 INFO L290 TraceCheckUtils]: 84: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,333 INFO L290 TraceCheckUtils]: 83: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,333 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-08 12:42:34,333 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-08 12:42:34,334 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-08 12:42:34,334 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-08 12:42:34,334 INFO L290 TraceCheckUtils]: 78: Hoare triple {19874#(<= ~counter~0 10)} assume !!(0 != ~r~0); {19874#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:34,335 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {19565#true} {19874#(<= ~counter~0 10)} #63#return; {19874#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:34,335 INFO L290 TraceCheckUtils]: 76: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,335 INFO L290 TraceCheckUtils]: 75: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,335 INFO L290 TraceCheckUtils]: 74: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,335 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-08 12:42:34,335 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-08 12:42:34,336 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-08 12:42:34,336 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-08 12:42:34,336 INFO L290 TraceCheckUtils]: 69: Hoare triple {19846#(<= ~counter~0 9)} assume !!(0 != ~r~0); {19846#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:34,337 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {19565#true} {19846#(<= ~counter~0 9)} #63#return; {19846#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:34,337 INFO L290 TraceCheckUtils]: 67: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,337 INFO L290 TraceCheckUtils]: 66: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,337 INFO L290 TraceCheckUtils]: 65: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,337 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-08 12:42:34,337 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-08 12:42:34,338 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-08 12:42:34,338 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-08 12:42:34,338 INFO L290 TraceCheckUtils]: 60: Hoare triple {19818#(<= ~counter~0 8)} assume !!(0 != ~r~0); {19818#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:34,339 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {19565#true} {19818#(<= ~counter~0 8)} #63#return; {19818#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:34,339 INFO L290 TraceCheckUtils]: 58: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,339 INFO L290 TraceCheckUtils]: 57: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,339 INFO L290 TraceCheckUtils]: 56: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,339 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-08 12:42:34,339 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-08 12:42:34,340 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-08 12:42:34,340 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-08 12:42:34,340 INFO L290 TraceCheckUtils]: 51: Hoare triple {19790#(<= ~counter~0 7)} assume !!(0 != ~r~0); {19790#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:34,341 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {19565#true} {19790#(<= ~counter~0 7)} #63#return; {19790#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:34,341 INFO L290 TraceCheckUtils]: 49: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,341 INFO L290 TraceCheckUtils]: 48: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,341 INFO L290 TraceCheckUtils]: 47: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,341 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-08 12:42:34,341 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-08 12:42:34,342 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-08 12:42:34,342 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-08 12:42:34,342 INFO L290 TraceCheckUtils]: 42: Hoare triple {19762#(<= ~counter~0 6)} assume !!(0 != ~r~0); {19762#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:34,343 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {19565#true} {19762#(<= ~counter~0 6)} #63#return; {19762#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:34,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,343 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-08 12:42:34,351 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-08 12:42:34,352 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-08 12:42:34,352 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-08 12:42:34,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {19734#(<= ~counter~0 5)} assume !!(0 != ~r~0); {19734#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:34,353 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {19565#true} {19734#(<= ~counter~0 5)} #63#return; {19734#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:34,353 INFO L290 TraceCheckUtils]: 31: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,353 INFO L290 TraceCheckUtils]: 30: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,354 INFO L290 TraceCheckUtils]: 29: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,354 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-08 12:42:34,354 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-08 12:42:34,354 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-08 12:42:34,355 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-08 12:42:34,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {19706#(<= ~counter~0 4)} assume !!(0 != ~r~0); {19706#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:34,356 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19565#true} {19706#(<= ~counter~0 4)} #63#return; {19706#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:34,356 INFO L290 TraceCheckUtils]: 22: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,356 INFO L290 TraceCheckUtils]: 21: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,356 INFO L290 TraceCheckUtils]: 20: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,356 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-08 12:42:34,356 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-08 12:42:34,357 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-08 12:42:34,357 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-08 12:42:34,358 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19565#true} {19678#(<= ~counter~0 3)} #61#return; {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:34,358 INFO L290 TraceCheckUtils]: 14: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,358 INFO L290 TraceCheckUtils]: 13: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,358 INFO L290 TraceCheckUtils]: 12: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,358 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-08 12:42:34,358 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19565#true} {19678#(<= ~counter~0 3)} #59#return; {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:34,358 INFO L290 TraceCheckUtils]: 9: Hoare triple {19565#true} assume true; {19565#true} is VALID [2022-04-08 12:42:34,358 INFO L290 TraceCheckUtils]: 8: Hoare triple {19565#true} assume !(0 == ~cond); {19565#true} is VALID [2022-04-08 12:42:34,359 INFO L290 TraceCheckUtils]: 7: Hoare triple {19565#true} ~cond := #in~cond; {19565#true} is VALID [2022-04-08 12:42:34,359 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-08 12:42:34,359 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-08 12:42:34,359 INFO L272 TraceCheckUtils]: 4: Hoare triple {19678#(<= ~counter~0 3)} call #t~ret7 := main(); {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:34,360 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19678#(<= ~counter~0 3)} {19565#true} #67#return; {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:34,360 INFO L290 TraceCheckUtils]: 2: Hoare triple {19678#(<= ~counter~0 3)} assume true; {19678#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:34,360 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-08 12:42:34,360 INFO L272 TraceCheckUtils]: 0: Hoare triple {19565#true} call ULTIMATE.init(); {19565#true} is VALID [2022-04-08 12:42:34,361 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-08 12:42:34,361 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:42:34,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [962121464] [2022-04-08 12:42:34,361 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:42:34,361 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390049370] [2022-04-08 12:42:34,361 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390049370] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:42:34,361 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:42:34,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 24 [2022-04-08 12:42:34,362 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:42:34,362 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1448768425] [2022-04-08 12:42:34,362 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1448768425] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:42:34,362 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:42:34,362 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-08 12:42:34,362 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535336482] [2022-04-08 12:42:34,362 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:42:34,362 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-08 12:42:34,363 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:42:34,363 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-08 12:42:34,482 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-08 12:42:34,483 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-08 12:42:34,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:34,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-08 12:42:34,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:42:34,483 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-08 12:42:35,146 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:35,146 INFO L93 Difference]: Finished difference Result 178 states and 196 transitions. [2022-04-08 12:42:35,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-08 12:42:35,147 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-08 12:42:35,147 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:42:35,147 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-08 12:42:35,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 195 transitions. [2022-04-08 12:42:35,150 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-08 12:42:35,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 195 transitions. [2022-04-08 12:42:35,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 195 transitions. [2022-04-08 12:42:35,290 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-08 12:42:35,293 INFO L225 Difference]: With dead ends: 178 [2022-04-08 12:42:35,293 INFO L226 Difference]: Without dead ends: 173 [2022-04-08 12:42:35,293 INFO L912 BasicCegarLoop]: 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-08 12:42:35,294 INFO L913 BasicCegarLoop]: 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-08 12:42:35,294 INFO L914 BasicCegarLoop]: 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-08 12:42:35,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-04-08 12:42:35,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 173. [2022-04-08 12:42:35,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:42:35,488 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-08 12:42:35,488 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-08 12:42:35,488 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-08 12:42:35,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:35,490 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2022-04-08 12:42:35,490 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2022-04-08 12:42:35,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:35,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:35,491 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-08 12:42:35,491 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-08 12:42:35,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:35,494 INFO L93 Difference]: Finished difference Result 173 states and 191 transitions. [2022-04-08 12:42:35,494 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2022-04-08 12:42:35,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:35,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:35,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:42:35,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:42:35,494 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-08 12:42:35,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 173 states to 173 states and 191 transitions. [2022-04-08 12:42:35,497 INFO L78 Accepts]: Start accepts. Automaton has 173 states and 191 transitions. Word has length 167 [2022-04-08 12:42:35,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:42:35,497 INFO L478 AbstractCegarLoop]: Abstraction has 173 states and 191 transitions. [2022-04-08 12:42:35,498 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 6.2) internal successors, (124), 19 states have internal predecessors, (124), 19 states have call successors, (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-08 12:42:35,498 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 173 states and 191 transitions. [2022-04-08 12:42:37,603 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-08 12:42:37,603 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 191 transitions. [2022-04-08 12:42:37,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 177 [2022-04-08 12:42:37,604 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:42:37,604 INFO L499 BasicCegarLoop]: 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-08 12:42:37,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2022-04-08 12:42:37,821 WARN L460 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-08 12:42:37,821 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:42:37,821 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:42:37,821 INFO L85 PathProgramCache]: Analyzing trace with hash 318093084, now seen corresponding path program 33 times [2022-04-08 12:42:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:37,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [515185510] [2022-04-08 12:42:37,822 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:42:37,822 INFO L85 PathProgramCache]: Analyzing trace with hash 318093084, now seen corresponding path program 34 times [2022-04-08 12:42:37,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:42:37,822 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1856643659] [2022-04-08 12:42:37,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:42:37,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:42:37,849 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:42:37,849 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1790742470] [2022-04-08 12:42:37,849 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:42:37,850 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:42:37,850 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:42:37,850 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:42:37,864 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2022-04-08 12:42:38,052 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:42:38,052 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:42:38,054 INFO L263 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-08 12:42:38,087 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:42:38,088 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:42:38,880 INFO L272 TraceCheckUtils]: 0: Hoare triple {21670#true} call ULTIMATE.init(); {21670#true} is VALID [2022-04-08 12:42:38,880 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-08 12:42:38,880 INFO L290 TraceCheckUtils]: 2: Hoare triple {21678#(<= ~counter~0 0)} assume true; {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,881 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21678#(<= ~counter~0 0)} {21670#true} #67#return; {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,881 INFO L272 TraceCheckUtils]: 4: Hoare triple {21678#(<= ~counter~0 0)} call #t~ret7 := main(); {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,881 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-08 12:42:38,882 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-08 12:42:38,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {21678#(<= ~counter~0 0)} ~cond := #in~cond; {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {21678#(<= ~counter~0 0)} assume !(0 == ~cond); {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {21678#(<= ~counter~0 0)} assume true; {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,883 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21678#(<= ~counter~0 0)} {21678#(<= ~counter~0 0)} #59#return; {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,883 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-08 12:42:38,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {21678#(<= ~counter~0 0)} ~cond := #in~cond; {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,884 INFO L290 TraceCheckUtils]: 13: Hoare triple {21678#(<= ~counter~0 0)} assume !(0 == ~cond); {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,884 INFO L290 TraceCheckUtils]: 14: Hoare triple {21678#(<= ~counter~0 0)} assume true; {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,884 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21678#(<= ~counter~0 0)} {21678#(<= ~counter~0 0)} #61#return; {21678#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:38,885 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-08 12:42:38,885 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-08 12:42:38,886 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-08 12:42:38,886 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-08 12:42:38,886 INFO L290 TraceCheckUtils]: 20: Hoare triple {21727#(<= ~counter~0 1)} ~cond := #in~cond; {21727#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:38,886 INFO L290 TraceCheckUtils]: 21: Hoare triple {21727#(<= ~counter~0 1)} assume !(0 == ~cond); {21727#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:38,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {21727#(<= ~counter~0 1)} assume true; {21727#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:38,887 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21727#(<= ~counter~0 1)} {21727#(<= ~counter~0 1)} #63#return; {21727#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:38,887 INFO L290 TraceCheckUtils]: 24: Hoare triple {21727#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21727#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:38,888 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-08 12:42:38,888 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-08 12:42:38,888 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-08 12:42:38,889 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-08 12:42:38,889 INFO L290 TraceCheckUtils]: 29: Hoare triple {21755#(<= ~counter~0 2)} ~cond := #in~cond; {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:38,889 INFO L290 TraceCheckUtils]: 30: Hoare triple {21755#(<= ~counter~0 2)} assume !(0 == ~cond); {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:38,890 INFO L290 TraceCheckUtils]: 31: Hoare triple {21755#(<= ~counter~0 2)} assume true; {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:38,890 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21755#(<= ~counter~0 2)} {21755#(<= ~counter~0 2)} #63#return; {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:38,890 INFO L290 TraceCheckUtils]: 33: Hoare triple {21755#(<= ~counter~0 2)} assume !!(0 != ~r~0); {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:38,891 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-08 12:42:38,891 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-08 12:42:38,891 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-08 12:42:38,892 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-08 12:42:38,892 INFO L290 TraceCheckUtils]: 38: Hoare triple {21783#(<= ~counter~0 3)} ~cond := #in~cond; {21783#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:38,892 INFO L290 TraceCheckUtils]: 39: Hoare triple {21783#(<= ~counter~0 3)} assume !(0 == ~cond); {21783#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:38,893 INFO L290 TraceCheckUtils]: 40: Hoare triple {21783#(<= ~counter~0 3)} assume true; {21783#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:38,893 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21783#(<= ~counter~0 3)} {21783#(<= ~counter~0 3)} #63#return; {21783#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:38,893 INFO L290 TraceCheckUtils]: 42: Hoare triple {21783#(<= ~counter~0 3)} assume !!(0 != ~r~0); {21783#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:38,894 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-08 12:42:38,895 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-08 12:42:38,895 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-08 12:42:38,895 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-08 12:42:38,896 INFO L290 TraceCheckUtils]: 47: Hoare triple {21811#(<= ~counter~0 4)} ~cond := #in~cond; {21811#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:38,896 INFO L290 TraceCheckUtils]: 48: Hoare triple {21811#(<= ~counter~0 4)} assume !(0 == ~cond); {21811#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:38,896 INFO L290 TraceCheckUtils]: 49: Hoare triple {21811#(<= ~counter~0 4)} assume true; {21811#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:38,897 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21811#(<= ~counter~0 4)} {21811#(<= ~counter~0 4)} #63#return; {21811#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:38,897 INFO L290 TraceCheckUtils]: 51: Hoare triple {21811#(<= ~counter~0 4)} assume !!(0 != ~r~0); {21811#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:38,897 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-08 12:42:38,898 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-08 12:42:38,898 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-08 12:42:38,898 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-08 12:42:38,899 INFO L290 TraceCheckUtils]: 56: Hoare triple {21839#(<= ~counter~0 5)} ~cond := #in~cond; {21839#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:38,899 INFO L290 TraceCheckUtils]: 57: Hoare triple {21839#(<= ~counter~0 5)} assume !(0 == ~cond); {21839#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:38,899 INFO L290 TraceCheckUtils]: 58: Hoare triple {21839#(<= ~counter~0 5)} assume true; {21839#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:38,900 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21839#(<= ~counter~0 5)} {21839#(<= ~counter~0 5)} #63#return; {21839#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:38,900 INFO L290 TraceCheckUtils]: 60: Hoare triple {21839#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21839#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:38,900 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-08 12:42:38,901 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-08 12:42:38,901 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-08 12:42:38,901 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-08 12:42:38,902 INFO L290 TraceCheckUtils]: 65: Hoare triple {21867#(<= ~counter~0 6)} ~cond := #in~cond; {21867#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:38,902 INFO L290 TraceCheckUtils]: 66: Hoare triple {21867#(<= ~counter~0 6)} assume !(0 == ~cond); {21867#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:38,902 INFO L290 TraceCheckUtils]: 67: Hoare triple {21867#(<= ~counter~0 6)} assume true; {21867#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:38,902 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21867#(<= ~counter~0 6)} {21867#(<= ~counter~0 6)} #63#return; {21867#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:38,903 INFO L290 TraceCheckUtils]: 69: Hoare triple {21867#(<= ~counter~0 6)} assume !!(0 != ~r~0); {21867#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:38,903 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-08 12:42:38,903 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-08 12:42:38,904 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-08 12:42:38,904 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-08 12:42:38,904 INFO L290 TraceCheckUtils]: 74: Hoare triple {21895#(<= ~counter~0 7)} ~cond := #in~cond; {21895#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:38,905 INFO L290 TraceCheckUtils]: 75: Hoare triple {21895#(<= ~counter~0 7)} assume !(0 == ~cond); {21895#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:38,905 INFO L290 TraceCheckUtils]: 76: Hoare triple {21895#(<= ~counter~0 7)} assume true; {21895#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:38,905 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21895#(<= ~counter~0 7)} {21895#(<= ~counter~0 7)} #63#return; {21895#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:38,912 INFO L290 TraceCheckUtils]: 78: Hoare triple {21895#(<= ~counter~0 7)} assume !!(0 != ~r~0); {21895#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:38,912 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-08 12:42:38,913 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-08 12:42:38,913 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-08 12:42:38,914 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-08 12:42:38,914 INFO L290 TraceCheckUtils]: 83: Hoare triple {21923#(<= ~counter~0 8)} ~cond := #in~cond; {21923#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:38,914 INFO L290 TraceCheckUtils]: 84: Hoare triple {21923#(<= ~counter~0 8)} assume !(0 == ~cond); {21923#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:38,914 INFO L290 TraceCheckUtils]: 85: Hoare triple {21923#(<= ~counter~0 8)} assume true; {21923#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:38,915 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21923#(<= ~counter~0 8)} {21923#(<= ~counter~0 8)} #63#return; {21923#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:38,915 INFO L290 TraceCheckUtils]: 87: Hoare triple {21923#(<= ~counter~0 8)} assume !!(0 != ~r~0); {21923#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:38,916 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-08 12:42:38,916 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-08 12:42:38,917 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-08 12:42:38,917 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-08 12:42:38,917 INFO L290 TraceCheckUtils]: 92: Hoare triple {21951#(<= ~counter~0 9)} ~cond := #in~cond; {21951#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:38,918 INFO L290 TraceCheckUtils]: 93: Hoare triple {21951#(<= ~counter~0 9)} assume !(0 == ~cond); {21951#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:38,918 INFO L290 TraceCheckUtils]: 94: Hoare triple {21951#(<= ~counter~0 9)} assume true; {21951#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:38,918 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21951#(<= ~counter~0 9)} {21951#(<= ~counter~0 9)} #63#return; {21951#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:38,919 INFO L290 TraceCheckUtils]: 96: Hoare triple {21951#(<= ~counter~0 9)} assume !!(0 != ~r~0); {21951#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:38,919 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-08 12:42:38,919 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-08 12:42:38,920 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-08 12:42:38,920 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-08 12:42:38,921 INFO L290 TraceCheckUtils]: 101: Hoare triple {21979#(<= ~counter~0 10)} ~cond := #in~cond; {21979#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:38,921 INFO L290 TraceCheckUtils]: 102: Hoare triple {21979#(<= ~counter~0 10)} assume !(0 == ~cond); {21979#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:38,921 INFO L290 TraceCheckUtils]: 103: Hoare triple {21979#(<= ~counter~0 10)} assume true; {21979#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:38,922 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {21979#(<= ~counter~0 10)} {21979#(<= ~counter~0 10)} #63#return; {21979#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:38,922 INFO L290 TraceCheckUtils]: 105: Hoare triple {21979#(<= ~counter~0 10)} assume !!(0 != ~r~0); {21979#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:38,922 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-08 12:42:38,923 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-08 12:42:38,923 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-08 12:42:38,923 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-08 12:42:38,924 INFO L290 TraceCheckUtils]: 110: Hoare triple {22007#(<= ~counter~0 11)} ~cond := #in~cond; {22007#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:38,924 INFO L290 TraceCheckUtils]: 111: Hoare triple {22007#(<= ~counter~0 11)} assume !(0 == ~cond); {22007#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:38,924 INFO L290 TraceCheckUtils]: 112: Hoare triple {22007#(<= ~counter~0 11)} assume true; {22007#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:38,925 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {22007#(<= ~counter~0 11)} {22007#(<= ~counter~0 11)} #63#return; {22007#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:38,925 INFO L290 TraceCheckUtils]: 114: Hoare triple {22007#(<= ~counter~0 11)} assume !!(0 != ~r~0); {22007#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:38,925 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-08 12:42:38,926 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-08 12:42:38,926 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-08 12:42:38,926 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-08 12:42:38,927 INFO L290 TraceCheckUtils]: 119: Hoare triple {22035#(<= ~counter~0 12)} ~cond := #in~cond; {22035#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:38,927 INFO L290 TraceCheckUtils]: 120: Hoare triple {22035#(<= ~counter~0 12)} assume !(0 == ~cond); {22035#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:38,927 INFO L290 TraceCheckUtils]: 121: Hoare triple {22035#(<= ~counter~0 12)} assume true; {22035#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:38,928 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {22035#(<= ~counter~0 12)} {22035#(<= ~counter~0 12)} #63#return; {22035#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:38,928 INFO L290 TraceCheckUtils]: 123: Hoare triple {22035#(<= ~counter~0 12)} assume !!(0 != ~r~0); {22035#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:38,928 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-08 12:42:38,929 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-08 12:42:38,929 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-08 12:42:38,929 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-08 12:42:38,930 INFO L290 TraceCheckUtils]: 128: Hoare triple {22063#(<= ~counter~0 13)} ~cond := #in~cond; {22063#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:38,930 INFO L290 TraceCheckUtils]: 129: Hoare triple {22063#(<= ~counter~0 13)} assume !(0 == ~cond); {22063#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:38,930 INFO L290 TraceCheckUtils]: 130: Hoare triple {22063#(<= ~counter~0 13)} assume true; {22063#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:38,931 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {22063#(<= ~counter~0 13)} {22063#(<= ~counter~0 13)} #63#return; {22063#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:38,931 INFO L290 TraceCheckUtils]: 132: Hoare triple {22063#(<= ~counter~0 13)} assume !!(0 != ~r~0); {22063#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:38,931 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-08 12:42:38,932 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-08 12:42:38,932 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-08 12:42:38,933 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-08 12:42:38,933 INFO L290 TraceCheckUtils]: 137: Hoare triple {22091#(<= ~counter~0 14)} ~cond := #in~cond; {22091#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:38,933 INFO L290 TraceCheckUtils]: 138: Hoare triple {22091#(<= ~counter~0 14)} assume !(0 == ~cond); {22091#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:38,933 INFO L290 TraceCheckUtils]: 139: Hoare triple {22091#(<= ~counter~0 14)} assume true; {22091#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:38,934 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {22091#(<= ~counter~0 14)} {22091#(<= ~counter~0 14)} #63#return; {22091#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:38,934 INFO L290 TraceCheckUtils]: 141: Hoare triple {22091#(<= ~counter~0 14)} assume !!(0 != ~r~0); {22091#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:38,934 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-08 12:42:38,935 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-08 12:42:38,935 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-08 12:42:38,935 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-08 12:42:38,936 INFO L290 TraceCheckUtils]: 146: Hoare triple {22119#(<= ~counter~0 15)} ~cond := #in~cond; {22119#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:38,936 INFO L290 TraceCheckUtils]: 147: Hoare triple {22119#(<= ~counter~0 15)} assume !(0 == ~cond); {22119#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:38,936 INFO L290 TraceCheckUtils]: 148: Hoare triple {22119#(<= ~counter~0 15)} assume true; {22119#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:38,937 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {22119#(<= ~counter~0 15)} {22119#(<= ~counter~0 15)} #63#return; {22119#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:38,937 INFO L290 TraceCheckUtils]: 150: Hoare triple {22119#(<= ~counter~0 15)} assume !!(0 != ~r~0); {22119#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:38,937 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-08 12:42:38,938 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-08 12:42:38,938 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-08 12:42:38,938 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-08 12:42:38,939 INFO L290 TraceCheckUtils]: 155: Hoare triple {22147#(<= ~counter~0 16)} ~cond := #in~cond; {22147#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:38,939 INFO L290 TraceCheckUtils]: 156: Hoare triple {22147#(<= ~counter~0 16)} assume !(0 == ~cond); {22147#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:38,939 INFO L290 TraceCheckUtils]: 157: Hoare triple {22147#(<= ~counter~0 16)} assume true; {22147#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:38,940 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {22147#(<= ~counter~0 16)} {22147#(<= ~counter~0 16)} #63#return; {22147#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:38,940 INFO L290 TraceCheckUtils]: 159: Hoare triple {22147#(<= ~counter~0 16)} assume !!(0 != ~r~0); {22147#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:38,940 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-08 12:42:38,941 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-08 12:42:38,943 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-08 12:42:38,944 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-08 12:42:38,944 INFO L290 TraceCheckUtils]: 164: Hoare triple {22175#(<= ~counter~0 17)} ~cond := #in~cond; {22175#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:38,944 INFO L290 TraceCheckUtils]: 165: Hoare triple {22175#(<= ~counter~0 17)} assume !(0 == ~cond); {22175#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:38,945 INFO L290 TraceCheckUtils]: 166: Hoare triple {22175#(<= ~counter~0 17)} assume true; {22175#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:38,945 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {22175#(<= ~counter~0 17)} {22175#(<= ~counter~0 17)} #63#return; {22175#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:38,945 INFO L290 TraceCheckUtils]: 168: Hoare triple {22175#(<= ~counter~0 17)} assume !!(0 != ~r~0); {22175#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:38,946 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-08 12:42:38,946 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-08 12:42:38,946 INFO L290 TraceCheckUtils]: 171: Hoare triple {22203#(<= |main_#t~post6| 17)} assume !(#t~post6 < 20);havoc #t~post6; {21671#false} is VALID [2022-04-08 12:42:38,946 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-08 12:42:38,947 INFO L290 TraceCheckUtils]: 173: Hoare triple {21671#false} ~cond := #in~cond; {21671#false} is VALID [2022-04-08 12:42:38,947 INFO L290 TraceCheckUtils]: 174: Hoare triple {21671#false} assume 0 == ~cond; {21671#false} is VALID [2022-04-08 12:42:38,947 INFO L290 TraceCheckUtils]: 175: Hoare triple {21671#false} assume !false; {21671#false} is VALID [2022-04-08 12:42:38,947 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-08 12:42:38,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:42:39,638 INFO L290 TraceCheckUtils]: 175: Hoare triple {21671#false} assume !false; {21671#false} is VALID [2022-04-08 12:42:39,639 INFO L290 TraceCheckUtils]: 174: Hoare triple {21671#false} assume 0 == ~cond; {21671#false} is VALID [2022-04-08 12:42:39,639 INFO L290 TraceCheckUtils]: 173: Hoare triple {21671#false} ~cond := #in~cond; {21671#false} is VALID [2022-04-08 12:42:39,639 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-08 12:42:39,639 INFO L290 TraceCheckUtils]: 171: Hoare triple {22231#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {21671#false} is VALID [2022-04-08 12:42:39,639 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-08 12:42:39,640 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-08 12:42:39,640 INFO L290 TraceCheckUtils]: 168: Hoare triple {22235#(< ~counter~0 20)} assume !!(0 != ~r~0); {22235#(< ~counter~0 20)} is VALID [2022-04-08 12:42:39,640 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {21670#true} {22235#(< ~counter~0 20)} #63#return; {22235#(< ~counter~0 20)} is VALID [2022-04-08 12:42:39,641 INFO L290 TraceCheckUtils]: 166: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,641 INFO L290 TraceCheckUtils]: 165: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,641 INFO L290 TraceCheckUtils]: 164: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,641 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-08 12:42:39,641 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-08 12:42:39,642 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-08 12:42:39,642 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-08 12:42:39,642 INFO L290 TraceCheckUtils]: 159: Hoare triple {22263#(< ~counter~0 19)} assume !!(0 != ~r~0); {22263#(< ~counter~0 19)} is VALID [2022-04-08 12:42:39,643 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {21670#true} {22263#(< ~counter~0 19)} #63#return; {22263#(< ~counter~0 19)} is VALID [2022-04-08 12:42:39,643 INFO L290 TraceCheckUtils]: 157: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,643 INFO L290 TraceCheckUtils]: 156: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,643 INFO L290 TraceCheckUtils]: 155: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,643 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-08 12:42:39,643 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-08 12:42:39,644 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-08 12:42:39,644 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-08 12:42:39,644 INFO L290 TraceCheckUtils]: 150: Hoare triple {22175#(<= ~counter~0 17)} assume !!(0 != ~r~0); {22175#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:39,645 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {21670#true} {22175#(<= ~counter~0 17)} #63#return; {22175#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:39,645 INFO L290 TraceCheckUtils]: 148: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,645 INFO L290 TraceCheckUtils]: 147: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,645 INFO L290 TraceCheckUtils]: 146: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,645 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-08 12:42:39,645 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-08 12:42:39,646 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-08 12:42:39,646 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-08 12:42:39,646 INFO L290 TraceCheckUtils]: 141: Hoare triple {22147#(<= ~counter~0 16)} assume !!(0 != ~r~0); {22147#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:39,647 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {21670#true} {22147#(<= ~counter~0 16)} #63#return; {22147#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:39,647 INFO L290 TraceCheckUtils]: 139: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,647 INFO L290 TraceCheckUtils]: 138: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,647 INFO L290 TraceCheckUtils]: 137: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,647 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-08 12:42:39,647 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-08 12:42:39,648 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-08 12:42:39,648 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-08 12:42:39,648 INFO L290 TraceCheckUtils]: 132: Hoare triple {22119#(<= ~counter~0 15)} assume !!(0 != ~r~0); {22119#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:39,649 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {21670#true} {22119#(<= ~counter~0 15)} #63#return; {22119#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:39,649 INFO L290 TraceCheckUtils]: 130: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,649 INFO L290 TraceCheckUtils]: 129: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,649 INFO L290 TraceCheckUtils]: 128: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,649 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-08 12:42:39,649 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-08 12:42:39,650 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-08 12:42:39,650 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-08 12:42:39,650 INFO L290 TraceCheckUtils]: 123: Hoare triple {22091#(<= ~counter~0 14)} assume !!(0 != ~r~0); {22091#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:39,651 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {21670#true} {22091#(<= ~counter~0 14)} #63#return; {22091#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:39,651 INFO L290 TraceCheckUtils]: 121: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,651 INFO L290 TraceCheckUtils]: 120: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,651 INFO L290 TraceCheckUtils]: 119: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,651 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-08 12:42:39,651 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-08 12:42:39,652 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-08 12:42:39,652 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-08 12:42:39,652 INFO L290 TraceCheckUtils]: 114: Hoare triple {22063#(<= ~counter~0 13)} assume !!(0 != ~r~0); {22063#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:39,652 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {21670#true} {22063#(<= ~counter~0 13)} #63#return; {22063#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:39,653 INFO L290 TraceCheckUtils]: 112: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,653 INFO L290 TraceCheckUtils]: 111: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,653 INFO L290 TraceCheckUtils]: 110: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,653 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-08 12:42:39,653 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-08 12:42:39,653 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-08 12:42:39,654 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-08 12:42:39,654 INFO L290 TraceCheckUtils]: 105: Hoare triple {22035#(<= ~counter~0 12)} assume !!(0 != ~r~0); {22035#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:39,654 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {21670#true} {22035#(<= ~counter~0 12)} #63#return; {22035#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:39,655 INFO L290 TraceCheckUtils]: 103: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,655 INFO L290 TraceCheckUtils]: 102: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,655 INFO L290 TraceCheckUtils]: 101: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,655 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-08 12:42:39,655 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-08 12:42:39,655 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-08 12:42:39,656 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-08 12:42:39,656 INFO L290 TraceCheckUtils]: 96: Hoare triple {22007#(<= ~counter~0 11)} assume !!(0 != ~r~0); {22007#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:39,656 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {21670#true} {22007#(<= ~counter~0 11)} #63#return; {22007#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:39,656 INFO L290 TraceCheckUtils]: 94: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,657 INFO L290 TraceCheckUtils]: 93: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,657 INFO L290 TraceCheckUtils]: 92: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,657 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-08 12:42:39,657 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-08 12:42:39,657 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-08 12:42:39,658 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-08 12:42:39,658 INFO L290 TraceCheckUtils]: 87: Hoare triple {21979#(<= ~counter~0 10)} assume !!(0 != ~r~0); {21979#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:39,658 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {21670#true} {21979#(<= ~counter~0 10)} #63#return; {21979#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:39,658 INFO L290 TraceCheckUtils]: 85: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,658 INFO L290 TraceCheckUtils]: 84: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,659 INFO L290 TraceCheckUtils]: 83: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,659 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-08 12:42:39,659 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-08 12:42:39,661 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-08 12:42:39,661 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-08 12:42:39,661 INFO L290 TraceCheckUtils]: 78: Hoare triple {21951#(<= ~counter~0 9)} assume !!(0 != ~r~0); {21951#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:39,662 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {21670#true} {21951#(<= ~counter~0 9)} #63#return; {21951#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:39,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,662 INFO L290 TraceCheckUtils]: 75: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,663 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-08 12:42:39,664 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-08 12:42:39,664 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-08 12:42:39,664 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-08 12:42:39,665 INFO L290 TraceCheckUtils]: 69: Hoare triple {21923#(<= ~counter~0 8)} assume !!(0 != ~r~0); {21923#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:39,665 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {21670#true} {21923#(<= ~counter~0 8)} #63#return; {21923#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:39,665 INFO L290 TraceCheckUtils]: 67: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,665 INFO L290 TraceCheckUtils]: 65: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,665 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-08 12:42:39,671 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-08 12:42:39,672 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-08 12:42:39,672 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-08 12:42:39,672 INFO L290 TraceCheckUtils]: 60: Hoare triple {21895#(<= ~counter~0 7)} assume !!(0 != ~r~0); {21895#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:39,673 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {21670#true} {21895#(<= ~counter~0 7)} #63#return; {21895#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:39,673 INFO L290 TraceCheckUtils]: 58: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,673 INFO L290 TraceCheckUtils]: 57: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,673 INFO L290 TraceCheckUtils]: 56: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,673 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-08 12:42:39,673 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-08 12:42:39,674 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-08 12:42:39,674 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-08 12:42:39,674 INFO L290 TraceCheckUtils]: 51: Hoare triple {21867#(<= ~counter~0 6)} assume !!(0 != ~r~0); {21867#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:39,675 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {21670#true} {21867#(<= ~counter~0 6)} #63#return; {21867#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:39,675 INFO L290 TraceCheckUtils]: 49: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,675 INFO L290 TraceCheckUtils]: 48: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,675 INFO L290 TraceCheckUtils]: 47: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,675 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-08 12:42:39,675 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-08 12:42:39,676 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-08 12:42:39,676 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-08 12:42:39,676 INFO L290 TraceCheckUtils]: 42: Hoare triple {21839#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21839#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:39,677 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {21670#true} {21839#(<= ~counter~0 5)} #63#return; {21839#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:39,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,677 INFO L290 TraceCheckUtils]: 39: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,677 INFO L290 TraceCheckUtils]: 38: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,677 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-08 12:42:39,677 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-08 12:42:39,678 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-08 12:42:39,678 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-08 12:42:39,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {21811#(<= ~counter~0 4)} assume !!(0 != ~r~0); {21811#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:39,679 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {21670#true} {21811#(<= ~counter~0 4)} #63#return; {21811#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:39,679 INFO L290 TraceCheckUtils]: 31: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,679 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-08 12:42:39,679 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-08 12:42:39,680 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-08 12:42:39,680 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-08 12:42:39,680 INFO L290 TraceCheckUtils]: 24: Hoare triple {21783#(<= ~counter~0 3)} assume !!(0 != ~r~0); {21783#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:39,681 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21670#true} {21783#(<= ~counter~0 3)} #63#return; {21783#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:39,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,681 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-08 12:42:39,681 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-08 12:42:39,682 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-08 12:42:39,682 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-08 12:42:39,682 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21670#true} {21755#(<= ~counter~0 2)} #61#return; {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:39,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,683 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-08 12:42:39,683 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21670#true} {21755#(<= ~counter~0 2)} #59#return; {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:39,683 INFO L290 TraceCheckUtils]: 9: Hoare triple {21670#true} assume true; {21670#true} is VALID [2022-04-08 12:42:39,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {21670#true} assume !(0 == ~cond); {21670#true} is VALID [2022-04-08 12:42:39,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {21670#true} ~cond := #in~cond; {21670#true} is VALID [2022-04-08 12:42:39,683 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-08 12:42:39,683 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-08 12:42:39,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {21755#(<= ~counter~0 2)} call #t~ret7 := main(); {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:39,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21755#(<= ~counter~0 2)} {21670#true} #67#return; {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:39,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {21755#(<= ~counter~0 2)} assume true; {21755#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:39,685 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-08 12:42:39,685 INFO L272 TraceCheckUtils]: 0: Hoare triple {21670#true} call ULTIMATE.init(); {21670#true} is VALID [2022-04-08 12:42:39,685 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-08 12:42:39,686 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:42:39,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1856643659] [2022-04-08 12:42:39,686 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:42:39,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1790742470] [2022-04-08 12:42:39,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1790742470] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:42:39,686 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:42:39,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 24 [2022-04-08 12:42:39,686 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:42:39,686 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [515185510] [2022-04-08 12:42:39,686 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [515185510] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:42:39,686 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:42:39,686 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-08 12:42:39,686 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432093824] [2022-04-08 12:42:39,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:42:39,687 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-08 12:42:39,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:42:39,687 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-08 12:42:39,810 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-08 12:42:39,810 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-08 12:42:39,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:39,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-08 12:42:39,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:42:39,811 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-08 12:42:40,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:40,473 INFO L93 Difference]: Finished difference Result 187 states and 206 transitions. [2022-04-08 12:42:40,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-08 12:42:40,473 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-08 12:42:40,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:42:40,473 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-08 12:42:40,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 205 transitions. [2022-04-08 12:42:40,476 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-08 12:42:40,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 205 transitions. [2022-04-08 12:42:40,478 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 205 transitions. [2022-04-08 12:42:40,627 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-08 12:42:40,629 INFO L225 Difference]: With dead ends: 187 [2022-04-08 12:42:40,629 INFO L226 Difference]: Without dead ends: 182 [2022-04-08 12:42:40,630 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 368 GetRequests, 328 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 174 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=627, Invalid=1013, Unknown=0, NotChecked=0, Total=1640 [2022-04-08 12:42:40,630 INFO L913 BasicCegarLoop]: 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-08 12:42:40,630 INFO L914 BasicCegarLoop]: 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-08 12:42:40,632 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-04-08 12:42:40,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-04-08 12:42:40,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:42:40,833 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-08 12:42:40,833 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-08 12:42:40,833 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-08 12:42:40,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:40,835 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-04-08 12:42:40,835 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2022-04-08 12:42:40,836 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:40,836 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:40,836 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-08 12:42:40,836 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-08 12:42:40,839 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:40,839 INFO L93 Difference]: Finished difference Result 182 states and 201 transitions. [2022-04-08 12:42:40,839 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2022-04-08 12:42:40,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:40,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:40,839 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:42:40,839 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:42:40,839 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-08 12:42:40,841 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 201 transitions. [2022-04-08 12:42:40,841 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 201 transitions. Word has length 176 [2022-04-08 12:42:40,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:42:40,842 INFO L478 AbstractCegarLoop]: Abstraction has 182 states and 201 transitions. [2022-04-08 12:42:40,842 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 6.238095238095238) internal successors, (131), 20 states have internal predecessors, (131), 20 states have call successors, (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-08 12:42:40,842 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 182 states and 201 transitions. [2022-04-08 12:42:42,340 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-08 12:42:42,340 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 201 transitions. [2022-04-08 12:42:42,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 186 [2022-04-08 12:42:42,341 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:42:42,341 INFO L499 BasicCegarLoop]: 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-08 12:42:42,347 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Ended with exit code 0 [2022-04-08 12:42:42,541 WARN L460 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-08 12:42:42,541 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:42:42,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:42:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash 994740182, now seen corresponding path program 35 times [2022-04-08 12:42:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:42,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1613224327] [2022-04-08 12:42:42,542 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:42:42,542 INFO L85 PathProgramCache]: Analyzing trace with hash 994740182, now seen corresponding path program 36 times [2022-04-08 12:42:42,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:42:42,542 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091444862] [2022-04-08 12:42:42,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:42:42,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:42:42,558 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:42:42,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1056831574] [2022-04-08 12:42:42,558 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-08 12:42:42,558 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:42:42,558 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:42:42,559 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:42:42,560 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2022-04-08 12:42:44,616 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 19 check-sat command(s) [2022-04-08 12:42:44,616 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:42:44,621 INFO L263 TraceCheckSpWp]: Trace formula consists of 453 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-08 12:42:44,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:42:44,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:42:45,543 INFO L272 TraceCheckUtils]: 0: Hoare triple {23885#true} call ULTIMATE.init(); {23885#true} is VALID [2022-04-08 12:42:45,544 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-08 12:42:45,544 INFO L290 TraceCheckUtils]: 2: Hoare triple {23893#(<= ~counter~0 0)} assume true; {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,545 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23893#(<= ~counter~0 0)} {23885#true} #67#return; {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,545 INFO L272 TraceCheckUtils]: 4: Hoare triple {23893#(<= ~counter~0 0)} call #t~ret7 := main(); {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,545 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-08 12:42:45,546 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-08 12:42:45,546 INFO L290 TraceCheckUtils]: 7: Hoare triple {23893#(<= ~counter~0 0)} ~cond := #in~cond; {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,546 INFO L290 TraceCheckUtils]: 8: Hoare triple {23893#(<= ~counter~0 0)} assume !(0 == ~cond); {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {23893#(<= ~counter~0 0)} assume true; {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,547 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23893#(<= ~counter~0 0)} {23893#(<= ~counter~0 0)} #59#return; {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,547 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-08 12:42:45,548 INFO L290 TraceCheckUtils]: 12: Hoare triple {23893#(<= ~counter~0 0)} ~cond := #in~cond; {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,548 INFO L290 TraceCheckUtils]: 13: Hoare triple {23893#(<= ~counter~0 0)} assume !(0 == ~cond); {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,548 INFO L290 TraceCheckUtils]: 14: Hoare triple {23893#(<= ~counter~0 0)} assume true; {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,549 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23893#(<= ~counter~0 0)} {23893#(<= ~counter~0 0)} #61#return; {23893#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:45,549 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-08 12:42:45,550 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-08 12:42:45,550 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-08 12:42:45,550 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-08 12:42:45,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {23942#(<= ~counter~0 1)} ~cond := #in~cond; {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:45,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {23942#(<= ~counter~0 1)} assume !(0 == ~cond); {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:45,551 INFO L290 TraceCheckUtils]: 22: Hoare triple {23942#(<= ~counter~0 1)} assume true; {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:45,552 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23942#(<= ~counter~0 1)} {23942#(<= ~counter~0 1)} #63#return; {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:45,552 INFO L290 TraceCheckUtils]: 24: Hoare triple {23942#(<= ~counter~0 1)} assume !!(0 != ~r~0); {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:45,552 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-08 12:42:45,553 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-08 12:42:45,553 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-08 12:42:45,554 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-08 12:42:45,554 INFO L290 TraceCheckUtils]: 29: Hoare triple {23970#(<= ~counter~0 2)} ~cond := #in~cond; {23970#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:45,554 INFO L290 TraceCheckUtils]: 30: Hoare triple {23970#(<= ~counter~0 2)} assume !(0 == ~cond); {23970#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:45,554 INFO L290 TraceCheckUtils]: 31: Hoare triple {23970#(<= ~counter~0 2)} assume true; {23970#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:45,555 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23970#(<= ~counter~0 2)} {23970#(<= ~counter~0 2)} #63#return; {23970#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:45,555 INFO L290 TraceCheckUtils]: 33: Hoare triple {23970#(<= ~counter~0 2)} assume !!(0 != ~r~0); {23970#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:45,556 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-08 12:42:45,556 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-08 12:42:45,556 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-08 12:42:45,557 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-08 12:42:45,557 INFO L290 TraceCheckUtils]: 38: Hoare triple {23998#(<= ~counter~0 3)} ~cond := #in~cond; {23998#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:45,557 INFO L290 TraceCheckUtils]: 39: Hoare triple {23998#(<= ~counter~0 3)} assume !(0 == ~cond); {23998#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:45,558 INFO L290 TraceCheckUtils]: 40: Hoare triple {23998#(<= ~counter~0 3)} assume true; {23998#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:45,558 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23998#(<= ~counter~0 3)} {23998#(<= ~counter~0 3)} #63#return; {23998#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:45,558 INFO L290 TraceCheckUtils]: 42: Hoare triple {23998#(<= ~counter~0 3)} assume !!(0 != ~r~0); {23998#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:45,559 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-08 12:42:45,559 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-08 12:42:45,559 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-08 12:42:45,560 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-08 12:42:45,560 INFO L290 TraceCheckUtils]: 47: Hoare triple {24026#(<= ~counter~0 4)} ~cond := #in~cond; {24026#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:45,561 INFO L290 TraceCheckUtils]: 48: Hoare triple {24026#(<= ~counter~0 4)} assume !(0 == ~cond); {24026#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:45,561 INFO L290 TraceCheckUtils]: 49: Hoare triple {24026#(<= ~counter~0 4)} assume true; {24026#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:45,561 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {24026#(<= ~counter~0 4)} {24026#(<= ~counter~0 4)} #63#return; {24026#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:45,562 INFO L290 TraceCheckUtils]: 51: Hoare triple {24026#(<= ~counter~0 4)} assume !!(0 != ~r~0); {24026#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:45,562 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-08 12:42:45,562 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-08 12:42:45,563 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-08 12:42:45,563 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-08 12:42:45,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {24054#(<= ~counter~0 5)} ~cond := #in~cond; {24054#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:45,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {24054#(<= ~counter~0 5)} assume !(0 == ~cond); {24054#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:45,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {24054#(<= ~counter~0 5)} assume true; {24054#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:45,565 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {24054#(<= ~counter~0 5)} {24054#(<= ~counter~0 5)} #63#return; {24054#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:45,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {24054#(<= ~counter~0 5)} assume !!(0 != ~r~0); {24054#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:45,565 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-08 12:42:45,566 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-08 12:42:45,566 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-08 12:42:45,566 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-08 12:42:45,567 INFO L290 TraceCheckUtils]: 65: Hoare triple {24082#(<= ~counter~0 6)} ~cond := #in~cond; {24082#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:45,567 INFO L290 TraceCheckUtils]: 66: Hoare triple {24082#(<= ~counter~0 6)} assume !(0 == ~cond); {24082#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:45,567 INFO L290 TraceCheckUtils]: 67: Hoare triple {24082#(<= ~counter~0 6)} assume true; {24082#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:45,568 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {24082#(<= ~counter~0 6)} {24082#(<= ~counter~0 6)} #63#return; {24082#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:45,568 INFO L290 TraceCheckUtils]: 69: Hoare triple {24082#(<= ~counter~0 6)} assume !!(0 != ~r~0); {24082#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:45,568 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-08 12:42:45,569 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-08 12:42:45,569 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-08 12:42:45,570 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-08 12:42:45,570 INFO L290 TraceCheckUtils]: 74: Hoare triple {24110#(<= ~counter~0 7)} ~cond := #in~cond; {24110#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:45,570 INFO L290 TraceCheckUtils]: 75: Hoare triple {24110#(<= ~counter~0 7)} assume !(0 == ~cond); {24110#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:45,571 INFO L290 TraceCheckUtils]: 76: Hoare triple {24110#(<= ~counter~0 7)} assume true; {24110#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:45,571 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {24110#(<= ~counter~0 7)} {24110#(<= ~counter~0 7)} #63#return; {24110#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:45,572 INFO L290 TraceCheckUtils]: 78: Hoare triple {24110#(<= ~counter~0 7)} assume !!(0 != ~r~0); {24110#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:45,572 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-08 12:42:45,573 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-08 12:42:45,573 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-08 12:42:45,573 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-08 12:42:45,574 INFO L290 TraceCheckUtils]: 83: Hoare triple {24138#(<= ~counter~0 8)} ~cond := #in~cond; {24138#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:45,574 INFO L290 TraceCheckUtils]: 84: Hoare triple {24138#(<= ~counter~0 8)} assume !(0 == ~cond); {24138#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:45,574 INFO L290 TraceCheckUtils]: 85: Hoare triple {24138#(<= ~counter~0 8)} assume true; {24138#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:45,575 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {24138#(<= ~counter~0 8)} {24138#(<= ~counter~0 8)} #63#return; {24138#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:45,575 INFO L290 TraceCheckUtils]: 87: Hoare triple {24138#(<= ~counter~0 8)} assume !!(0 != ~r~0); {24138#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:45,576 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-08 12:42:45,576 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-08 12:42:45,576 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-08 12:42:45,577 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-08 12:42:45,577 INFO L290 TraceCheckUtils]: 92: Hoare triple {24166#(<= ~counter~0 9)} ~cond := #in~cond; {24166#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:45,578 INFO L290 TraceCheckUtils]: 93: Hoare triple {24166#(<= ~counter~0 9)} assume !(0 == ~cond); {24166#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:45,578 INFO L290 TraceCheckUtils]: 94: Hoare triple {24166#(<= ~counter~0 9)} assume true; {24166#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:45,579 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {24166#(<= ~counter~0 9)} {24166#(<= ~counter~0 9)} #63#return; {24166#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:45,579 INFO L290 TraceCheckUtils]: 96: Hoare triple {24166#(<= ~counter~0 9)} assume !!(0 != ~r~0); {24166#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:45,579 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-08 12:42:45,580 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-08 12:42:45,580 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-08 12:42:45,581 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-08 12:42:45,581 INFO L290 TraceCheckUtils]: 101: Hoare triple {24194#(<= ~counter~0 10)} ~cond := #in~cond; {24194#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:45,581 INFO L290 TraceCheckUtils]: 102: Hoare triple {24194#(<= ~counter~0 10)} assume !(0 == ~cond); {24194#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:45,582 INFO L290 TraceCheckUtils]: 103: Hoare triple {24194#(<= ~counter~0 10)} assume true; {24194#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:45,582 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {24194#(<= ~counter~0 10)} {24194#(<= ~counter~0 10)} #63#return; {24194#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:45,583 INFO L290 TraceCheckUtils]: 105: Hoare triple {24194#(<= ~counter~0 10)} assume !!(0 != ~r~0); {24194#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:45,583 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-08 12:42:45,583 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-08 12:42:45,584 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-08 12:42:45,584 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-08 12:42:45,585 INFO L290 TraceCheckUtils]: 110: Hoare triple {24222#(<= ~counter~0 11)} ~cond := #in~cond; {24222#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:45,585 INFO L290 TraceCheckUtils]: 111: Hoare triple {24222#(<= ~counter~0 11)} assume !(0 == ~cond); {24222#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:45,585 INFO L290 TraceCheckUtils]: 112: Hoare triple {24222#(<= ~counter~0 11)} assume true; {24222#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:45,586 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {24222#(<= ~counter~0 11)} {24222#(<= ~counter~0 11)} #63#return; {24222#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:45,586 INFO L290 TraceCheckUtils]: 114: Hoare triple {24222#(<= ~counter~0 11)} assume !!(0 != ~r~0); {24222#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:45,586 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-08 12:42:45,587 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-08 12:42:45,587 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-08 12:42:45,588 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-08 12:42:45,588 INFO L290 TraceCheckUtils]: 119: Hoare triple {24250#(<= ~counter~0 12)} ~cond := #in~cond; {24250#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:45,589 INFO L290 TraceCheckUtils]: 120: Hoare triple {24250#(<= ~counter~0 12)} assume !(0 == ~cond); {24250#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:45,589 INFO L290 TraceCheckUtils]: 121: Hoare triple {24250#(<= ~counter~0 12)} assume true; {24250#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:45,590 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {24250#(<= ~counter~0 12)} {24250#(<= ~counter~0 12)} #63#return; {24250#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:45,590 INFO L290 TraceCheckUtils]: 123: Hoare triple {24250#(<= ~counter~0 12)} assume !!(0 != ~r~0); {24250#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:45,590 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-08 12:42:45,591 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-08 12:42:45,591 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-08 12:42:45,591 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-08 12:42:45,592 INFO L290 TraceCheckUtils]: 128: Hoare triple {24278#(<= ~counter~0 13)} ~cond := #in~cond; {24278#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:45,592 INFO L290 TraceCheckUtils]: 129: Hoare triple {24278#(<= ~counter~0 13)} assume !(0 == ~cond); {24278#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:45,592 INFO L290 TraceCheckUtils]: 130: Hoare triple {24278#(<= ~counter~0 13)} assume true; {24278#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:45,593 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {24278#(<= ~counter~0 13)} {24278#(<= ~counter~0 13)} #63#return; {24278#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:45,593 INFO L290 TraceCheckUtils]: 132: Hoare triple {24278#(<= ~counter~0 13)} assume !!(0 != ~r~0); {24278#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:45,593 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-08 12:42:45,594 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-08 12:42:45,594 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-08 12:42:45,595 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-08 12:42:45,595 INFO L290 TraceCheckUtils]: 137: Hoare triple {24306#(<= ~counter~0 14)} ~cond := #in~cond; {24306#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:45,595 INFO L290 TraceCheckUtils]: 138: Hoare triple {24306#(<= ~counter~0 14)} assume !(0 == ~cond); {24306#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:45,595 INFO L290 TraceCheckUtils]: 139: Hoare triple {24306#(<= ~counter~0 14)} assume true; {24306#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:45,596 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {24306#(<= ~counter~0 14)} {24306#(<= ~counter~0 14)} #63#return; {24306#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:45,596 INFO L290 TraceCheckUtils]: 141: Hoare triple {24306#(<= ~counter~0 14)} assume !!(0 != ~r~0); {24306#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:45,597 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-08 12:42:45,597 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-08 12:42:45,597 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-08 12:42:45,598 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-08 12:42:45,598 INFO L290 TraceCheckUtils]: 146: Hoare triple {24334#(<= ~counter~0 15)} ~cond := #in~cond; {24334#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:45,598 INFO L290 TraceCheckUtils]: 147: Hoare triple {24334#(<= ~counter~0 15)} assume !(0 == ~cond); {24334#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:45,599 INFO L290 TraceCheckUtils]: 148: Hoare triple {24334#(<= ~counter~0 15)} assume true; {24334#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:45,599 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {24334#(<= ~counter~0 15)} {24334#(<= ~counter~0 15)} #63#return; {24334#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:45,600 INFO L290 TraceCheckUtils]: 150: Hoare triple {24334#(<= ~counter~0 15)} assume !!(0 != ~r~0); {24334#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:45,600 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-08 12:42:45,600 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-08 12:42:45,601 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-08 12:42:45,601 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-08 12:42:45,601 INFO L290 TraceCheckUtils]: 155: Hoare triple {24362#(<= ~counter~0 16)} ~cond := #in~cond; {24362#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:45,602 INFO L290 TraceCheckUtils]: 156: Hoare triple {24362#(<= ~counter~0 16)} assume !(0 == ~cond); {24362#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:45,602 INFO L290 TraceCheckUtils]: 157: Hoare triple {24362#(<= ~counter~0 16)} assume true; {24362#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:45,603 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {24362#(<= ~counter~0 16)} {24362#(<= ~counter~0 16)} #63#return; {24362#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:45,603 INFO L290 TraceCheckUtils]: 159: Hoare triple {24362#(<= ~counter~0 16)} assume !!(0 != ~r~0); {24362#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:45,603 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-08 12:42:45,604 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-08 12:42:45,604 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-08 12:42:45,604 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-08 12:42:45,605 INFO L290 TraceCheckUtils]: 164: Hoare triple {24390#(<= ~counter~0 17)} ~cond := #in~cond; {24390#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:45,605 INFO L290 TraceCheckUtils]: 165: Hoare triple {24390#(<= ~counter~0 17)} assume !(0 == ~cond); {24390#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:45,605 INFO L290 TraceCheckUtils]: 166: Hoare triple {24390#(<= ~counter~0 17)} assume true; {24390#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:45,606 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {24390#(<= ~counter~0 17)} {24390#(<= ~counter~0 17)} #63#return; {24390#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:45,606 INFO L290 TraceCheckUtils]: 168: Hoare triple {24390#(<= ~counter~0 17)} assume !!(0 != ~r~0); {24390#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:45,606 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-08 12:42:45,607 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-08 12:42:45,607 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-08 12:42:45,608 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-08 12:42:45,608 INFO L290 TraceCheckUtils]: 173: Hoare triple {24418#(<= ~counter~0 18)} ~cond := #in~cond; {24418#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:45,608 INFO L290 TraceCheckUtils]: 174: Hoare triple {24418#(<= ~counter~0 18)} assume !(0 == ~cond); {24418#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:45,609 INFO L290 TraceCheckUtils]: 175: Hoare triple {24418#(<= ~counter~0 18)} assume true; {24418#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:45,609 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {24418#(<= ~counter~0 18)} {24418#(<= ~counter~0 18)} #63#return; {24418#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:45,609 INFO L290 TraceCheckUtils]: 177: Hoare triple {24418#(<= ~counter~0 18)} assume !!(0 != ~r~0); {24418#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:45,610 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-08 12:42:45,610 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-08 12:42:45,610 INFO L290 TraceCheckUtils]: 180: Hoare triple {24446#(<= |main_#t~post6| 18)} assume !(#t~post6 < 20);havoc #t~post6; {23886#false} is VALID [2022-04-08 12:42:45,610 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-08 12:42:45,610 INFO L290 TraceCheckUtils]: 182: Hoare triple {23886#false} ~cond := #in~cond; {23886#false} is VALID [2022-04-08 12:42:45,611 INFO L290 TraceCheckUtils]: 183: Hoare triple {23886#false} assume 0 == ~cond; {23886#false} is VALID [2022-04-08 12:42:45,611 INFO L290 TraceCheckUtils]: 184: Hoare triple {23886#false} assume !false; {23886#false} is VALID [2022-04-08 12:42:45,611 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-08 12:42:45,611 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:42:46,344 INFO L290 TraceCheckUtils]: 184: Hoare triple {23886#false} assume !false; {23886#false} is VALID [2022-04-08 12:42:46,344 INFO L290 TraceCheckUtils]: 183: Hoare triple {23886#false} assume 0 == ~cond; {23886#false} is VALID [2022-04-08 12:42:46,345 INFO L290 TraceCheckUtils]: 182: Hoare triple {23886#false} ~cond := #in~cond; {23886#false} is VALID [2022-04-08 12:42:46,345 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-08 12:42:46,345 INFO L290 TraceCheckUtils]: 180: Hoare triple {24474#(< |main_#t~post6| 20)} assume !(#t~post6 < 20);havoc #t~post6; {23886#false} is VALID [2022-04-08 12:42:46,345 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-08 12:42:46,345 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-08 12:42:46,346 INFO L290 TraceCheckUtils]: 177: Hoare triple {24478#(< ~counter~0 20)} assume !!(0 != ~r~0); {24478#(< ~counter~0 20)} is VALID [2022-04-08 12:42:46,346 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {23885#true} {24478#(< ~counter~0 20)} #63#return; {24478#(< ~counter~0 20)} is VALID [2022-04-08 12:42:46,346 INFO L290 TraceCheckUtils]: 175: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,346 INFO L290 TraceCheckUtils]: 174: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,346 INFO L290 TraceCheckUtils]: 173: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,347 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-08 12:42:46,347 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-08 12:42:46,347 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-08 12:42:46,348 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-08 12:42:46,348 INFO L290 TraceCheckUtils]: 168: Hoare triple {24418#(<= ~counter~0 18)} assume !!(0 != ~r~0); {24418#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:46,348 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {23885#true} {24418#(<= ~counter~0 18)} #63#return; {24418#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:46,349 INFO L290 TraceCheckUtils]: 166: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,349 INFO L290 TraceCheckUtils]: 165: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,349 INFO L290 TraceCheckUtils]: 164: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,349 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-08 12:42:46,349 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-08 12:42:46,349 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-08 12:42:46,350 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-08 12:42:46,350 INFO L290 TraceCheckUtils]: 159: Hoare triple {24390#(<= ~counter~0 17)} assume !!(0 != ~r~0); {24390#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:46,350 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {23885#true} {24390#(<= ~counter~0 17)} #63#return; {24390#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:46,351 INFO L290 TraceCheckUtils]: 157: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,351 INFO L290 TraceCheckUtils]: 156: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,351 INFO L290 TraceCheckUtils]: 155: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,351 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-08 12:42:46,351 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-08 12:42:46,351 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-08 12:42:46,352 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-08 12:42:46,352 INFO L290 TraceCheckUtils]: 150: Hoare triple {24362#(<= ~counter~0 16)} assume !!(0 != ~r~0); {24362#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:46,352 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {23885#true} {24362#(<= ~counter~0 16)} #63#return; {24362#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:46,353 INFO L290 TraceCheckUtils]: 148: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,353 INFO L290 TraceCheckUtils]: 147: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,353 INFO L290 TraceCheckUtils]: 146: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,353 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-08 12:42:46,353 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-08 12:42:46,353 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-08 12:42:46,354 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-08 12:42:46,354 INFO L290 TraceCheckUtils]: 141: Hoare triple {24334#(<= ~counter~0 15)} assume !!(0 != ~r~0); {24334#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:46,354 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {23885#true} {24334#(<= ~counter~0 15)} #63#return; {24334#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:46,355 INFO L290 TraceCheckUtils]: 139: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,355 INFO L290 TraceCheckUtils]: 138: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,355 INFO L290 TraceCheckUtils]: 137: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,355 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-08 12:42:46,355 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-08 12:42:46,355 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-08 12:42:46,356 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-08 12:42:46,356 INFO L290 TraceCheckUtils]: 132: Hoare triple {24306#(<= ~counter~0 14)} assume !!(0 != ~r~0); {24306#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:46,356 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {23885#true} {24306#(<= ~counter~0 14)} #63#return; {24306#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:46,356 INFO L290 TraceCheckUtils]: 130: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,357 INFO L290 TraceCheckUtils]: 129: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,357 INFO L290 TraceCheckUtils]: 128: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,357 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-08 12:42:46,357 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-08 12:42:46,357 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-08 12:42:46,358 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-08 12:42:46,358 INFO L290 TraceCheckUtils]: 123: Hoare triple {24278#(<= ~counter~0 13)} assume !!(0 != ~r~0); {24278#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:46,358 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {23885#true} {24278#(<= ~counter~0 13)} #63#return; {24278#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:46,358 INFO L290 TraceCheckUtils]: 121: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,359 INFO L290 TraceCheckUtils]: 120: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,359 INFO L290 TraceCheckUtils]: 119: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,359 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-08 12:42:46,359 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-08 12:42:46,359 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-08 12:42:46,360 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-08 12:42:46,360 INFO L290 TraceCheckUtils]: 114: Hoare triple {24250#(<= ~counter~0 12)} assume !!(0 != ~r~0); {24250#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:46,360 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {23885#true} {24250#(<= ~counter~0 12)} #63#return; {24250#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:46,360 INFO L290 TraceCheckUtils]: 112: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,361 INFO L290 TraceCheckUtils]: 111: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,361 INFO L290 TraceCheckUtils]: 110: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,361 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-08 12:42:46,361 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-08 12:42:46,361 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-08 12:42:46,362 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-08 12:42:46,362 INFO L290 TraceCheckUtils]: 105: Hoare triple {24222#(<= ~counter~0 11)} assume !!(0 != ~r~0); {24222#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:46,362 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {23885#true} {24222#(<= ~counter~0 11)} #63#return; {24222#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:46,362 INFO L290 TraceCheckUtils]: 103: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,362 INFO L290 TraceCheckUtils]: 102: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,363 INFO L290 TraceCheckUtils]: 101: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,363 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-08 12:42:46,363 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-08 12:42:46,363 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-08 12:42:46,364 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-08 12:42:46,364 INFO L290 TraceCheckUtils]: 96: Hoare triple {24194#(<= ~counter~0 10)} assume !!(0 != ~r~0); {24194#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:46,364 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {23885#true} {24194#(<= ~counter~0 10)} #63#return; {24194#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:46,364 INFO L290 TraceCheckUtils]: 94: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,364 INFO L290 TraceCheckUtils]: 93: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,365 INFO L290 TraceCheckUtils]: 92: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,365 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-08 12:42:46,365 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-08 12:42:46,365 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-08 12:42:46,366 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-08 12:42:46,366 INFO L290 TraceCheckUtils]: 87: Hoare triple {24166#(<= ~counter~0 9)} assume !!(0 != ~r~0); {24166#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:46,366 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {23885#true} {24166#(<= ~counter~0 9)} #63#return; {24166#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:46,366 INFO L290 TraceCheckUtils]: 85: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,366 INFO L290 TraceCheckUtils]: 84: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,366 INFO L290 TraceCheckUtils]: 83: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,367 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-08 12:42:46,367 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-08 12:42:46,367 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-08 12:42:46,368 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-08 12:42:46,368 INFO L290 TraceCheckUtils]: 78: Hoare triple {24138#(<= ~counter~0 8)} assume !!(0 != ~r~0); {24138#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:46,368 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {23885#true} {24138#(<= ~counter~0 8)} #63#return; {24138#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:46,368 INFO L290 TraceCheckUtils]: 76: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,368 INFO L290 TraceCheckUtils]: 75: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,368 INFO L290 TraceCheckUtils]: 74: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,369 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-08 12:42:46,369 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-08 12:42:46,369 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-08 12:42:46,370 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-08 12:42:46,370 INFO L290 TraceCheckUtils]: 69: Hoare triple {24110#(<= ~counter~0 7)} assume !!(0 != ~r~0); {24110#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:46,370 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {23885#true} {24110#(<= ~counter~0 7)} #63#return; {24110#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:46,370 INFO L290 TraceCheckUtils]: 67: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,370 INFO L290 TraceCheckUtils]: 66: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,370 INFO L290 TraceCheckUtils]: 65: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,371 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-08 12:42:46,371 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-08 12:42:46,371 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-08 12:42:46,371 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-08 12:42:46,372 INFO L290 TraceCheckUtils]: 60: Hoare triple {24082#(<= ~counter~0 6)} assume !!(0 != ~r~0); {24082#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:46,372 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {23885#true} {24082#(<= ~counter~0 6)} #63#return; {24082#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:46,372 INFO L290 TraceCheckUtils]: 58: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,372 INFO L290 TraceCheckUtils]: 57: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,372 INFO L290 TraceCheckUtils]: 56: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,372 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-08 12:42:46,373 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-08 12:42:46,373 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-08 12:42:46,373 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-08 12:42:46,374 INFO L290 TraceCheckUtils]: 51: Hoare triple {24054#(<= ~counter~0 5)} assume !!(0 != ~r~0); {24054#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:46,374 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {23885#true} {24054#(<= ~counter~0 5)} #63#return; {24054#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:46,374 INFO L290 TraceCheckUtils]: 49: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,374 INFO L290 TraceCheckUtils]: 48: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,374 INFO L290 TraceCheckUtils]: 47: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,374 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-08 12:42:46,375 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-08 12:42:46,375 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-08 12:42:46,375 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-08 12:42:46,376 INFO L290 TraceCheckUtils]: 42: Hoare triple {24026#(<= ~counter~0 4)} assume !!(0 != ~r~0); {24026#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:46,376 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {23885#true} {24026#(<= ~counter~0 4)} #63#return; {24026#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:46,376 INFO L290 TraceCheckUtils]: 40: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,376 INFO L290 TraceCheckUtils]: 39: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,376 INFO L290 TraceCheckUtils]: 38: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,376 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-08 12:42:46,377 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-08 12:42:46,377 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-08 12:42:46,377 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-08 12:42:46,378 INFO L290 TraceCheckUtils]: 33: Hoare triple {23998#(<= ~counter~0 3)} assume !!(0 != ~r~0); {23998#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:46,378 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {23885#true} {23998#(<= ~counter~0 3)} #63#return; {23998#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:46,378 INFO L290 TraceCheckUtils]: 31: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,378 INFO L290 TraceCheckUtils]: 30: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,378 INFO L290 TraceCheckUtils]: 29: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,378 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-08 12:42:46,379 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-08 12:42:46,379 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-08 12:42:46,379 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-08 12:42:46,380 INFO L290 TraceCheckUtils]: 24: Hoare triple {23970#(<= ~counter~0 2)} assume !!(0 != ~r~0); {23970#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:46,380 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {23885#true} {23970#(<= ~counter~0 2)} #63#return; {23970#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:46,380 INFO L290 TraceCheckUtils]: 22: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,380 INFO L290 TraceCheckUtils]: 21: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,380 INFO L290 TraceCheckUtils]: 20: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,380 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-08 12:42:46,381 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-08 12:42:46,381 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-08 12:42:46,381 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-08 12:42:46,382 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {23885#true} {23942#(<= ~counter~0 1)} #61#return; {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:46,382 INFO L290 TraceCheckUtils]: 14: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,382 INFO L290 TraceCheckUtils]: 13: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,382 INFO L290 TraceCheckUtils]: 12: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,382 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-08 12:42:46,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {23885#true} {23942#(<= ~counter~0 1)} #59#return; {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:46,383 INFO L290 TraceCheckUtils]: 9: Hoare triple {23885#true} assume true; {23885#true} is VALID [2022-04-08 12:42:46,383 INFO L290 TraceCheckUtils]: 8: Hoare triple {23885#true} assume !(0 == ~cond); {23885#true} is VALID [2022-04-08 12:42:46,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {23885#true} ~cond := #in~cond; {23885#true} is VALID [2022-04-08 12:42:46,383 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-08 12:42:46,383 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-08 12:42:46,383 INFO L272 TraceCheckUtils]: 4: Hoare triple {23942#(<= ~counter~0 1)} call #t~ret7 := main(); {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:46,384 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23942#(<= ~counter~0 1)} {23885#true} #67#return; {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:46,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {23942#(<= ~counter~0 1)} assume true; {23942#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:46,384 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-08 12:42:46,384 INFO L272 TraceCheckUtils]: 0: Hoare triple {23885#true} call ULTIMATE.init(); {23885#true} is VALID [2022-04-08 12:42:46,385 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-08 12:42:46,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:42:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091444862] [2022-04-08 12:42:46,385 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:42:46,385 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1056831574] [2022-04-08 12:42:46,385 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1056831574] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:42:46,385 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:42:46,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 24 [2022-04-08 12:42:46,386 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:42:46,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1613224327] [2022-04-08 12:42:46,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1613224327] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:42:46,386 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:42:46,386 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-08 12:42:46,386 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936113660] [2022-04-08 12:42:46,386 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:42:46,387 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-08 12:42:46,387 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:42:46,387 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-08 12:42:46,500 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-08 12:42:46,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-08 12:42:46,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:46,501 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-08 12:42:46,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-08 12:42:46,501 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-08 12:42:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:47,208 INFO L93 Difference]: Finished difference Result 196 states and 216 transitions. [2022-04-08 12:42:47,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-04-08 12:42:47,209 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-08 12:42:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:42:47,209 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-08 12:42:47,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 215 transitions. [2022-04-08 12:42:47,212 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-08 12:42:47,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 215 transitions. [2022-04-08 12:42:47,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 40 states and 215 transitions. [2022-04-08 12:42:47,353 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-08 12:42:47,355 INFO L225 Difference]: With dead ends: 196 [2022-04-08 12:42:47,355 INFO L226 Difference]: Without dead ends: 191 [2022-04-08 12:42:47,356 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 387 GetRequests, 346 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=650, Invalid=1072, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 12:42:47,356 INFO L913 BasicCegarLoop]: 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-08 12:42:47,357 INFO L914 BasicCegarLoop]: 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-08 12:42:47,357 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-04-08 12:42:47,555 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 191. [2022-04-08 12:42:47,555 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:42:47,555 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-08 12:42:47,555 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-08 12:42:47,556 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-08 12:42:47,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:47,559 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-04-08 12:42:47,559 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-04-08 12:42:47,559 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:47,559 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:47,560 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-08 12:42:47,560 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-08 12:42:47,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:47,562 INFO L93 Difference]: Finished difference Result 191 states and 211 transitions. [2022-04-08 12:42:47,563 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-04-08 12:42:47,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:47,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:47,563 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:42:47,563 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:42:47,563 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-08 12:42:47,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 211 transitions. [2022-04-08 12:42:47,567 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 211 transitions. Word has length 185 [2022-04-08 12:42:47,567 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:42:47,567 INFO L478 AbstractCegarLoop]: Abstraction has 191 states and 211 transitions. [2022-04-08 12:42:47,567 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 6.2727272727272725) internal successors, (138), 21 states have internal predecessors, (138), 21 states have call successors, (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-08 12:42:47,567 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 191 states and 211 transitions. [2022-04-08 12:42:49,726 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 211 edges. 211 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:42:49,726 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 211 transitions. [2022-04-08 12:42:49,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 195 [2022-04-08 12:42:49,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:42:49,728 INFO L499 BasicCegarLoop]: 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-08 12:42:49,736 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Forceful destruction successful, exit code 0 [2022-04-08 12:42:49,934 WARN L460 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-08 12:42:49,934 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:42:49,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:42:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1522264156, now seen corresponding path program 37 times [2022-04-08 12:42:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:49,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [687208334] [2022-04-08 12:42:49,935 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:42:49,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1522264156, now seen corresponding path program 38 times [2022-04-08 12:42:49,935 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:42:49,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [725076261] [2022-04-08 12:42:49,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:42:49,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:42:49,951 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:42:49,951 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1327551394] [2022-04-08 12:42:49,951 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-08 12:42:49,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:42:49,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:42:49,952 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:42:49,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2022-04-08 12:42:50,048 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-08 12:42:50,048 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-08 12:42:50,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 473 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-08 12:42:50,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-08 12:42:50,090 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-08 12:42:50,969 INFO L272 TraceCheckUtils]: 0: Hoare triple {26210#true} call ULTIMATE.init(); {26210#true} is VALID [2022-04-08 12:42:50,969 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-08 12:42:50,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {26218#(<= ~counter~0 0)} assume true; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,970 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26218#(<= ~counter~0 0)} {26210#true} #67#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,970 INFO L272 TraceCheckUtils]: 4: Hoare triple {26218#(<= ~counter~0 0)} call #t~ret7 := main(); {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,970 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-08 12:42:50,971 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-08 12:42:50,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {26218#(<= ~counter~0 0)} ~cond := #in~cond; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {26218#(<= ~counter~0 0)} assume !(0 == ~cond); {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {26218#(<= ~counter~0 0)} assume true; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,972 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26218#(<= ~counter~0 0)} {26218#(<= ~counter~0 0)} #59#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,973 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-08 12:42:50,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {26218#(<= ~counter~0 0)} ~cond := #in~cond; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {26218#(<= ~counter~0 0)} assume !(0 == ~cond); {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {26218#(<= ~counter~0 0)} assume true; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,974 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26218#(<= ~counter~0 0)} {26218#(<= ~counter~0 0)} #61#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:50,975 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-08 12:42:50,975 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-08 12:42:50,976 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-08 12:42:50,976 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-08 12:42:50,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {26267#(<= ~counter~0 1)} ~cond := #in~cond; {26267#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:50,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {26267#(<= ~counter~0 1)} assume !(0 == ~cond); {26267#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:50,977 INFO L290 TraceCheckUtils]: 22: Hoare triple {26267#(<= ~counter~0 1)} assume true; {26267#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:50,977 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26267#(<= ~counter~0 1)} {26267#(<= ~counter~0 1)} #63#return; {26267#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:50,978 INFO L290 TraceCheckUtils]: 24: Hoare triple {26267#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26267#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:50,978 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-08 12:42:50,978 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-08 12:42:50,979 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-08 12:42:50,979 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-08 12:42:50,979 INFO L290 TraceCheckUtils]: 29: Hoare triple {26295#(<= ~counter~0 2)} ~cond := #in~cond; {26295#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:50,980 INFO L290 TraceCheckUtils]: 30: Hoare triple {26295#(<= ~counter~0 2)} assume !(0 == ~cond); {26295#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:50,980 INFO L290 TraceCheckUtils]: 31: Hoare triple {26295#(<= ~counter~0 2)} assume true; {26295#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:50,980 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26295#(<= ~counter~0 2)} {26295#(<= ~counter~0 2)} #63#return; {26295#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:50,980 INFO L290 TraceCheckUtils]: 33: Hoare triple {26295#(<= ~counter~0 2)} assume !!(0 != ~r~0); {26295#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:50,981 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-08 12:42:50,981 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-08 12:42:50,981 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-08 12:42:50,982 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-08 12:42:50,982 INFO L290 TraceCheckUtils]: 38: Hoare triple {26323#(<= ~counter~0 3)} ~cond := #in~cond; {26323#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:50,982 INFO L290 TraceCheckUtils]: 39: Hoare triple {26323#(<= ~counter~0 3)} assume !(0 == ~cond); {26323#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:50,983 INFO L290 TraceCheckUtils]: 40: Hoare triple {26323#(<= ~counter~0 3)} assume true; {26323#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:50,983 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {26323#(<= ~counter~0 3)} {26323#(<= ~counter~0 3)} #63#return; {26323#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:50,983 INFO L290 TraceCheckUtils]: 42: Hoare triple {26323#(<= ~counter~0 3)} assume !!(0 != ~r~0); {26323#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:50,984 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-08 12:42:50,984 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-08 12:42:50,984 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-08 12:42:50,985 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-08 12:42:50,985 INFO L290 TraceCheckUtils]: 47: Hoare triple {26351#(<= ~counter~0 4)} ~cond := #in~cond; {26351#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:50,985 INFO L290 TraceCheckUtils]: 48: Hoare triple {26351#(<= ~counter~0 4)} assume !(0 == ~cond); {26351#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:50,986 INFO L290 TraceCheckUtils]: 49: Hoare triple {26351#(<= ~counter~0 4)} assume true; {26351#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:50,986 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26351#(<= ~counter~0 4)} {26351#(<= ~counter~0 4)} #63#return; {26351#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:50,986 INFO L290 TraceCheckUtils]: 51: Hoare triple {26351#(<= ~counter~0 4)} assume !!(0 != ~r~0); {26351#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:50,987 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-08 12:42:50,987 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-08 12:42:50,987 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-08 12:42:50,994 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-08 12:42:50,994 INFO L290 TraceCheckUtils]: 56: Hoare triple {26379#(<= ~counter~0 5)} ~cond := #in~cond; {26379#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:50,994 INFO L290 TraceCheckUtils]: 57: Hoare triple {26379#(<= ~counter~0 5)} assume !(0 == ~cond); {26379#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:50,994 INFO L290 TraceCheckUtils]: 58: Hoare triple {26379#(<= ~counter~0 5)} assume true; {26379#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:50,995 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26379#(<= ~counter~0 5)} {26379#(<= ~counter~0 5)} #63#return; {26379#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:50,995 INFO L290 TraceCheckUtils]: 60: Hoare triple {26379#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26379#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:50,995 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-08 12:42:50,996 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-08 12:42:50,996 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-08 12:42:50,997 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-08 12:42:50,997 INFO L290 TraceCheckUtils]: 65: Hoare triple {26407#(<= ~counter~0 6)} ~cond := #in~cond; {26407#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:50,997 INFO L290 TraceCheckUtils]: 66: Hoare triple {26407#(<= ~counter~0 6)} assume !(0 == ~cond); {26407#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:50,997 INFO L290 TraceCheckUtils]: 67: Hoare triple {26407#(<= ~counter~0 6)} assume true; {26407#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:50,998 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {26407#(<= ~counter~0 6)} {26407#(<= ~counter~0 6)} #63#return; {26407#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:50,998 INFO L290 TraceCheckUtils]: 69: Hoare triple {26407#(<= ~counter~0 6)} assume !!(0 != ~r~0); {26407#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:50,998 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-08 12:42:50,999 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-08 12:42:50,999 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-08 12:42:51,000 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-08 12:42:51,000 INFO L290 TraceCheckUtils]: 74: Hoare triple {26435#(<= ~counter~0 7)} ~cond := #in~cond; {26435#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:51,001 INFO L290 TraceCheckUtils]: 75: Hoare triple {26435#(<= ~counter~0 7)} assume !(0 == ~cond); {26435#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:51,002 INFO L290 TraceCheckUtils]: 76: Hoare triple {26435#(<= ~counter~0 7)} assume true; {26435#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:51,002 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {26435#(<= ~counter~0 7)} {26435#(<= ~counter~0 7)} #63#return; {26435#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:51,002 INFO L290 TraceCheckUtils]: 78: Hoare triple {26435#(<= ~counter~0 7)} assume !!(0 != ~r~0); {26435#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:51,003 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-08 12:42:51,003 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-08 12:42:51,003 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-08 12:42:51,004 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-08 12:42:51,004 INFO L290 TraceCheckUtils]: 83: Hoare triple {26463#(<= ~counter~0 8)} ~cond := #in~cond; {26463#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:51,004 INFO L290 TraceCheckUtils]: 84: Hoare triple {26463#(<= ~counter~0 8)} assume !(0 == ~cond); {26463#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:51,005 INFO L290 TraceCheckUtils]: 85: Hoare triple {26463#(<= ~counter~0 8)} assume true; {26463#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:51,005 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26463#(<= ~counter~0 8)} {26463#(<= ~counter~0 8)} #63#return; {26463#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:51,005 INFO L290 TraceCheckUtils]: 87: Hoare triple {26463#(<= ~counter~0 8)} assume !!(0 != ~r~0); {26463#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:51,006 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-08 12:42:51,006 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-08 12:42:51,006 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-08 12:42:51,007 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-08 12:42:51,007 INFO L290 TraceCheckUtils]: 92: Hoare triple {26491#(<= ~counter~0 9)} ~cond := #in~cond; {26491#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:51,007 INFO L290 TraceCheckUtils]: 93: Hoare triple {26491#(<= ~counter~0 9)} assume !(0 == ~cond); {26491#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:51,008 INFO L290 TraceCheckUtils]: 94: Hoare triple {26491#(<= ~counter~0 9)} assume true; {26491#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:51,008 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {26491#(<= ~counter~0 9)} {26491#(<= ~counter~0 9)} #63#return; {26491#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:51,008 INFO L290 TraceCheckUtils]: 96: Hoare triple {26491#(<= ~counter~0 9)} assume !!(0 != ~r~0); {26491#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:51,008 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-08 12:42:51,009 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-08 12:42:51,009 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-08 12:42:51,010 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-08 12:42:51,010 INFO L290 TraceCheckUtils]: 101: Hoare triple {26519#(<= ~counter~0 10)} ~cond := #in~cond; {26519#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:51,010 INFO L290 TraceCheckUtils]: 102: Hoare triple {26519#(<= ~counter~0 10)} assume !(0 == ~cond); {26519#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:51,010 INFO L290 TraceCheckUtils]: 103: Hoare triple {26519#(<= ~counter~0 10)} assume true; {26519#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:51,011 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26519#(<= ~counter~0 10)} {26519#(<= ~counter~0 10)} #63#return; {26519#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:51,011 INFO L290 TraceCheckUtils]: 105: Hoare triple {26519#(<= ~counter~0 10)} assume !!(0 != ~r~0); {26519#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:51,011 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-08 12:42:51,012 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-08 12:42:51,012 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-08 12:42:51,013 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-08 12:42:51,013 INFO L290 TraceCheckUtils]: 110: Hoare triple {26547#(<= ~counter~0 11)} ~cond := #in~cond; {26547#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:51,013 INFO L290 TraceCheckUtils]: 111: Hoare triple {26547#(<= ~counter~0 11)} assume !(0 == ~cond); {26547#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:51,013 INFO L290 TraceCheckUtils]: 112: Hoare triple {26547#(<= ~counter~0 11)} assume true; {26547#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:51,014 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {26547#(<= ~counter~0 11)} {26547#(<= ~counter~0 11)} #63#return; {26547#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:51,014 INFO L290 TraceCheckUtils]: 114: Hoare triple {26547#(<= ~counter~0 11)} assume !!(0 != ~r~0); {26547#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:51,014 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-08 12:42:51,015 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-08 12:42:51,015 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-08 12:42:51,015 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-08 12:42:51,016 INFO L290 TraceCheckUtils]: 119: Hoare triple {26575#(<= ~counter~0 12)} ~cond := #in~cond; {26575#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:51,016 INFO L290 TraceCheckUtils]: 120: Hoare triple {26575#(<= ~counter~0 12)} assume !(0 == ~cond); {26575#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:51,016 INFO L290 TraceCheckUtils]: 121: Hoare triple {26575#(<= ~counter~0 12)} assume true; {26575#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:51,017 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26575#(<= ~counter~0 12)} {26575#(<= ~counter~0 12)} #63#return; {26575#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:51,017 INFO L290 TraceCheckUtils]: 123: Hoare triple {26575#(<= ~counter~0 12)} assume !!(0 != ~r~0); {26575#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:51,017 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-08 12:42:51,018 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-08 12:42:51,018 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-08 12:42:51,018 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-08 12:42:51,019 INFO L290 TraceCheckUtils]: 128: Hoare triple {26603#(<= ~counter~0 13)} ~cond := #in~cond; {26603#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:51,019 INFO L290 TraceCheckUtils]: 129: Hoare triple {26603#(<= ~counter~0 13)} assume !(0 == ~cond); {26603#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:51,019 INFO L290 TraceCheckUtils]: 130: Hoare triple {26603#(<= ~counter~0 13)} assume true; {26603#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:51,020 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {26603#(<= ~counter~0 13)} {26603#(<= ~counter~0 13)} #63#return; {26603#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:51,020 INFO L290 TraceCheckUtils]: 132: Hoare triple {26603#(<= ~counter~0 13)} assume !!(0 != ~r~0); {26603#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:51,020 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-08 12:42:51,021 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-08 12:42:51,021 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-08 12:42:51,021 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-08 12:42:51,021 INFO L290 TraceCheckUtils]: 137: Hoare triple {26631#(<= ~counter~0 14)} ~cond := #in~cond; {26631#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:51,022 INFO L290 TraceCheckUtils]: 138: Hoare triple {26631#(<= ~counter~0 14)} assume !(0 == ~cond); {26631#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:51,022 INFO L290 TraceCheckUtils]: 139: Hoare triple {26631#(<= ~counter~0 14)} assume true; {26631#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:51,022 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {26631#(<= ~counter~0 14)} {26631#(<= ~counter~0 14)} #63#return; {26631#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:51,023 INFO L290 TraceCheckUtils]: 141: Hoare triple {26631#(<= ~counter~0 14)} assume !!(0 != ~r~0); {26631#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:51,023 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-08 12:42:51,023 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-08 12:42:51,024 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-08 12:42:51,024 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-08 12:42:51,024 INFO L290 TraceCheckUtils]: 146: Hoare triple {26659#(<= ~counter~0 15)} ~cond := #in~cond; {26659#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:51,025 INFO L290 TraceCheckUtils]: 147: Hoare triple {26659#(<= ~counter~0 15)} assume !(0 == ~cond); {26659#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:51,025 INFO L290 TraceCheckUtils]: 148: Hoare triple {26659#(<= ~counter~0 15)} assume true; {26659#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:51,025 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {26659#(<= ~counter~0 15)} {26659#(<= ~counter~0 15)} #63#return; {26659#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:51,026 INFO L290 TraceCheckUtils]: 150: Hoare triple {26659#(<= ~counter~0 15)} assume !!(0 != ~r~0); {26659#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:51,026 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-08 12:42:51,026 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-08 12:42:51,027 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-08 12:42:51,027 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-08 12:42:51,027 INFO L290 TraceCheckUtils]: 155: Hoare triple {26687#(<= ~counter~0 16)} ~cond := #in~cond; {26687#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:51,028 INFO L290 TraceCheckUtils]: 156: Hoare triple {26687#(<= ~counter~0 16)} assume !(0 == ~cond); {26687#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:51,028 INFO L290 TraceCheckUtils]: 157: Hoare triple {26687#(<= ~counter~0 16)} assume true; {26687#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:51,028 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {26687#(<= ~counter~0 16)} {26687#(<= ~counter~0 16)} #63#return; {26687#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:51,028 INFO L290 TraceCheckUtils]: 159: Hoare triple {26687#(<= ~counter~0 16)} assume !!(0 != ~r~0); {26687#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:51,029 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-08 12:42:51,029 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-08 12:42:51,029 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-08 12:42:51,030 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-08 12:42:51,030 INFO L290 TraceCheckUtils]: 164: Hoare triple {26715#(<= ~counter~0 17)} ~cond := #in~cond; {26715#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:51,030 INFO L290 TraceCheckUtils]: 165: Hoare triple {26715#(<= ~counter~0 17)} assume !(0 == ~cond); {26715#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:51,031 INFO L290 TraceCheckUtils]: 166: Hoare triple {26715#(<= ~counter~0 17)} assume true; {26715#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:51,031 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {26715#(<= ~counter~0 17)} {26715#(<= ~counter~0 17)} #63#return; {26715#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:51,031 INFO L290 TraceCheckUtils]: 168: Hoare triple {26715#(<= ~counter~0 17)} assume !!(0 != ~r~0); {26715#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:51,032 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-08 12:42:51,032 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-08 12:42:51,032 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-08 12:42:51,033 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-08 12:42:51,033 INFO L290 TraceCheckUtils]: 173: Hoare triple {26743#(<= ~counter~0 18)} ~cond := #in~cond; {26743#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:51,033 INFO L290 TraceCheckUtils]: 174: Hoare triple {26743#(<= ~counter~0 18)} assume !(0 == ~cond); {26743#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:51,034 INFO L290 TraceCheckUtils]: 175: Hoare triple {26743#(<= ~counter~0 18)} assume true; {26743#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:51,034 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {26743#(<= ~counter~0 18)} {26743#(<= ~counter~0 18)} #63#return; {26743#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:51,034 INFO L290 TraceCheckUtils]: 177: Hoare triple {26743#(<= ~counter~0 18)} assume !!(0 != ~r~0); {26743#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:51,035 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-08 12:42:51,035 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-08 12:42:51,035 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-08 12:42:51,036 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-08 12:42:51,036 INFO L290 TraceCheckUtils]: 182: Hoare triple {26771#(<= ~counter~0 19)} ~cond := #in~cond; {26771#(<= ~counter~0 19)} is VALID [2022-04-08 12:42:51,036 INFO L290 TraceCheckUtils]: 183: Hoare triple {26771#(<= ~counter~0 19)} assume !(0 == ~cond); {26771#(<= ~counter~0 19)} is VALID [2022-04-08 12:42:51,037 INFO L290 TraceCheckUtils]: 184: Hoare triple {26771#(<= ~counter~0 19)} assume true; {26771#(<= ~counter~0 19)} is VALID [2022-04-08 12:42:51,037 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26771#(<= ~counter~0 19)} {26771#(<= ~counter~0 19)} #63#return; {26771#(<= ~counter~0 19)} is VALID [2022-04-08 12:42:51,037 INFO L290 TraceCheckUtils]: 186: Hoare triple {26771#(<= ~counter~0 19)} assume !!(0 != ~r~0); {26771#(<= ~counter~0 19)} is VALID [2022-04-08 12:42:51,038 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-08 12:42:51,038 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-08 12:42:51,038 INFO L290 TraceCheckUtils]: 189: Hoare triple {26799#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {26211#false} is VALID [2022-04-08 12:42:51,038 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-08 12:42:51,038 INFO L290 TraceCheckUtils]: 191: Hoare triple {26211#false} ~cond := #in~cond; {26211#false} is VALID [2022-04-08 12:42:51,038 INFO L290 TraceCheckUtils]: 192: Hoare triple {26211#false} assume 0 == ~cond; {26211#false} is VALID [2022-04-08 12:42:51,038 INFO L290 TraceCheckUtils]: 193: Hoare triple {26211#false} assume !false; {26211#false} is VALID [2022-04-08 12:42:51,039 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-08 12:42:51,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-08 12:42:51,804 INFO L290 TraceCheckUtils]: 193: Hoare triple {26211#false} assume !false; {26211#false} is VALID [2022-04-08 12:42:51,805 INFO L290 TraceCheckUtils]: 192: Hoare triple {26211#false} assume 0 == ~cond; {26211#false} is VALID [2022-04-08 12:42:51,805 INFO L290 TraceCheckUtils]: 191: Hoare triple {26211#false} ~cond := #in~cond; {26211#false} is VALID [2022-04-08 12:42:51,805 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-08 12:42:51,805 INFO L290 TraceCheckUtils]: 189: Hoare triple {26799#(<= |main_#t~post6| 19)} assume !(#t~post6 < 20);havoc #t~post6; {26211#false} is VALID [2022-04-08 12:42:51,805 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-08 12:42:51,806 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-08 12:42:51,806 INFO L290 TraceCheckUtils]: 186: Hoare triple {26771#(<= ~counter~0 19)} assume !!(0 != ~r~0); {26771#(<= ~counter~0 19)} is VALID [2022-04-08 12:42:51,806 INFO L284 TraceCheckUtils]: 185: Hoare quadruple {26210#true} {26771#(<= ~counter~0 19)} #63#return; {26771#(<= ~counter~0 19)} is VALID [2022-04-08 12:42:51,807 INFO L290 TraceCheckUtils]: 184: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,807 INFO L290 TraceCheckUtils]: 183: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,807 INFO L290 TraceCheckUtils]: 182: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,807 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-08 12:42:51,807 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-08 12:42:51,808 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-08 12:42:51,808 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-08 12:42:51,808 INFO L290 TraceCheckUtils]: 177: Hoare triple {26743#(<= ~counter~0 18)} assume !!(0 != ~r~0); {26743#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:51,809 INFO L284 TraceCheckUtils]: 176: Hoare quadruple {26210#true} {26743#(<= ~counter~0 18)} #63#return; {26743#(<= ~counter~0 18)} is VALID [2022-04-08 12:42:51,809 INFO L290 TraceCheckUtils]: 175: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,809 INFO L290 TraceCheckUtils]: 174: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,809 INFO L290 TraceCheckUtils]: 173: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,809 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-08 12:42:51,809 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-08 12:42:51,810 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-08 12:42:51,810 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-08 12:42:51,810 INFO L290 TraceCheckUtils]: 168: Hoare triple {26715#(<= ~counter~0 17)} assume !!(0 != ~r~0); {26715#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:51,811 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {26210#true} {26715#(<= ~counter~0 17)} #63#return; {26715#(<= ~counter~0 17)} is VALID [2022-04-08 12:42:51,811 INFO L290 TraceCheckUtils]: 166: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,811 INFO L290 TraceCheckUtils]: 165: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,811 INFO L290 TraceCheckUtils]: 164: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,811 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-08 12:42:51,811 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-08 12:42:51,812 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-08 12:42:51,812 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-08 12:42:51,812 INFO L290 TraceCheckUtils]: 159: Hoare triple {26687#(<= ~counter~0 16)} assume !!(0 != ~r~0); {26687#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:51,813 INFO L284 TraceCheckUtils]: 158: Hoare quadruple {26210#true} {26687#(<= ~counter~0 16)} #63#return; {26687#(<= ~counter~0 16)} is VALID [2022-04-08 12:42:51,813 INFO L290 TraceCheckUtils]: 157: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,813 INFO L290 TraceCheckUtils]: 156: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,813 INFO L290 TraceCheckUtils]: 155: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,813 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-08 12:42:51,813 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-08 12:42:51,814 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-08 12:42:51,814 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-08 12:42:51,814 INFO L290 TraceCheckUtils]: 150: Hoare triple {26659#(<= ~counter~0 15)} assume !!(0 != ~r~0); {26659#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:51,815 INFO L284 TraceCheckUtils]: 149: Hoare quadruple {26210#true} {26659#(<= ~counter~0 15)} #63#return; {26659#(<= ~counter~0 15)} is VALID [2022-04-08 12:42:51,815 INFO L290 TraceCheckUtils]: 148: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,815 INFO L290 TraceCheckUtils]: 147: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,815 INFO L290 TraceCheckUtils]: 146: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,815 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-08 12:42:51,815 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-08 12:42:51,816 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-08 12:42:51,816 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-08 12:42:51,816 INFO L290 TraceCheckUtils]: 141: Hoare triple {26631#(<= ~counter~0 14)} assume !!(0 != ~r~0); {26631#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:51,817 INFO L284 TraceCheckUtils]: 140: Hoare quadruple {26210#true} {26631#(<= ~counter~0 14)} #63#return; {26631#(<= ~counter~0 14)} is VALID [2022-04-08 12:42:51,817 INFO L290 TraceCheckUtils]: 139: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,817 INFO L290 TraceCheckUtils]: 138: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,817 INFO L290 TraceCheckUtils]: 137: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,817 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-08 12:42:51,817 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-08 12:42:51,818 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-08 12:42:51,818 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-08 12:42:51,818 INFO L290 TraceCheckUtils]: 132: Hoare triple {26603#(<= ~counter~0 13)} assume !!(0 != ~r~0); {26603#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:51,819 INFO L284 TraceCheckUtils]: 131: Hoare quadruple {26210#true} {26603#(<= ~counter~0 13)} #63#return; {26603#(<= ~counter~0 13)} is VALID [2022-04-08 12:42:51,819 INFO L290 TraceCheckUtils]: 130: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,819 INFO L290 TraceCheckUtils]: 129: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,819 INFO L290 TraceCheckUtils]: 128: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,819 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-08 12:42:51,819 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-08 12:42:51,820 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-08 12:42:51,820 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-08 12:42:51,830 INFO L290 TraceCheckUtils]: 123: Hoare triple {26575#(<= ~counter~0 12)} assume !!(0 != ~r~0); {26575#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:51,831 INFO L284 TraceCheckUtils]: 122: Hoare quadruple {26210#true} {26575#(<= ~counter~0 12)} #63#return; {26575#(<= ~counter~0 12)} is VALID [2022-04-08 12:42:51,831 INFO L290 TraceCheckUtils]: 121: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,831 INFO L290 TraceCheckUtils]: 120: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,831 INFO L290 TraceCheckUtils]: 119: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,831 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-08 12:42:51,832 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-08 12:42:51,832 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-08 12:42:51,833 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-08 12:42:51,833 INFO L290 TraceCheckUtils]: 114: Hoare triple {26547#(<= ~counter~0 11)} assume !!(0 != ~r~0); {26547#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:51,833 INFO L284 TraceCheckUtils]: 113: Hoare quadruple {26210#true} {26547#(<= ~counter~0 11)} #63#return; {26547#(<= ~counter~0 11)} is VALID [2022-04-08 12:42:51,834 INFO L290 TraceCheckUtils]: 112: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,834 INFO L290 TraceCheckUtils]: 111: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,834 INFO L290 TraceCheckUtils]: 110: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,834 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-08 12:42:51,834 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-08 12:42:51,835 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-08 12:42:51,835 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-08 12:42:51,835 INFO L290 TraceCheckUtils]: 105: Hoare triple {26519#(<= ~counter~0 10)} assume !!(0 != ~r~0); {26519#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:51,836 INFO L284 TraceCheckUtils]: 104: Hoare quadruple {26210#true} {26519#(<= ~counter~0 10)} #63#return; {26519#(<= ~counter~0 10)} is VALID [2022-04-08 12:42:51,836 INFO L290 TraceCheckUtils]: 103: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,836 INFO L290 TraceCheckUtils]: 102: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,836 INFO L290 TraceCheckUtils]: 101: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,836 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-08 12:42:51,836 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-08 12:42:51,837 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-08 12:42:51,837 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-08 12:42:51,837 INFO L290 TraceCheckUtils]: 96: Hoare triple {26491#(<= ~counter~0 9)} assume !!(0 != ~r~0); {26491#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:51,838 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {26210#true} {26491#(<= ~counter~0 9)} #63#return; {26491#(<= ~counter~0 9)} is VALID [2022-04-08 12:42:51,838 INFO L290 TraceCheckUtils]: 94: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,838 INFO L290 TraceCheckUtils]: 93: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,838 INFO L290 TraceCheckUtils]: 92: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,838 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-08 12:42:51,839 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-08 12:42:51,839 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-08 12:42:51,840 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-08 12:42:51,840 INFO L290 TraceCheckUtils]: 87: Hoare triple {26463#(<= ~counter~0 8)} assume !!(0 != ~r~0); {26463#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:51,840 INFO L284 TraceCheckUtils]: 86: Hoare quadruple {26210#true} {26463#(<= ~counter~0 8)} #63#return; {26463#(<= ~counter~0 8)} is VALID [2022-04-08 12:42:51,840 INFO L290 TraceCheckUtils]: 85: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,841 INFO L290 TraceCheckUtils]: 84: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,841 INFO L290 TraceCheckUtils]: 83: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,841 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-08 12:42:51,841 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-08 12:42:51,842 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-08 12:42:51,842 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-08 12:42:51,842 INFO L290 TraceCheckUtils]: 78: Hoare triple {26435#(<= ~counter~0 7)} assume !!(0 != ~r~0); {26435#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:51,843 INFO L284 TraceCheckUtils]: 77: Hoare quadruple {26210#true} {26435#(<= ~counter~0 7)} #63#return; {26435#(<= ~counter~0 7)} is VALID [2022-04-08 12:42:51,843 INFO L290 TraceCheckUtils]: 76: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,843 INFO L290 TraceCheckUtils]: 75: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,843 INFO L290 TraceCheckUtils]: 74: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,843 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-08 12:42:51,843 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-08 12:42:51,844 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-08 12:42:51,844 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-08 12:42:51,844 INFO L290 TraceCheckUtils]: 69: Hoare triple {26407#(<= ~counter~0 6)} assume !!(0 != ~r~0); {26407#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:51,845 INFO L284 TraceCheckUtils]: 68: Hoare quadruple {26210#true} {26407#(<= ~counter~0 6)} #63#return; {26407#(<= ~counter~0 6)} is VALID [2022-04-08 12:42:51,845 INFO L290 TraceCheckUtils]: 67: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,845 INFO L290 TraceCheckUtils]: 66: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,845 INFO L290 TraceCheckUtils]: 65: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,845 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-08 12:42:51,846 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-08 12:42:51,846 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-08 12:42:51,846 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-08 12:42:51,847 INFO L290 TraceCheckUtils]: 60: Hoare triple {26379#(<= ~counter~0 5)} assume !!(0 != ~r~0); {26379#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:51,847 INFO L284 TraceCheckUtils]: 59: Hoare quadruple {26210#true} {26379#(<= ~counter~0 5)} #63#return; {26379#(<= ~counter~0 5)} is VALID [2022-04-08 12:42:51,847 INFO L290 TraceCheckUtils]: 58: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,847 INFO L290 TraceCheckUtils]: 57: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,848 INFO L290 TraceCheckUtils]: 56: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,848 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-08 12:42:51,848 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-08 12:42:51,848 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-08 12:42:51,849 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-08 12:42:51,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {26351#(<= ~counter~0 4)} assume !!(0 != ~r~0); {26351#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:51,850 INFO L284 TraceCheckUtils]: 50: Hoare quadruple {26210#true} {26351#(<= ~counter~0 4)} #63#return; {26351#(<= ~counter~0 4)} is VALID [2022-04-08 12:42:51,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,850 INFO L290 TraceCheckUtils]: 48: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,850 INFO L290 TraceCheckUtils]: 47: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,850 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-08 12:42:51,850 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-08 12:42:51,851 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-08 12:42:51,851 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-08 12:42:51,851 INFO L290 TraceCheckUtils]: 42: Hoare triple {26323#(<= ~counter~0 3)} assume !!(0 != ~r~0); {26323#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:51,852 INFO L284 TraceCheckUtils]: 41: Hoare quadruple {26210#true} {26323#(<= ~counter~0 3)} #63#return; {26323#(<= ~counter~0 3)} is VALID [2022-04-08 12:42:51,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,852 INFO L290 TraceCheckUtils]: 39: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,852 INFO L290 TraceCheckUtils]: 38: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,852 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-08 12:42:51,852 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-08 12:42:51,853 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-08 12:42:51,853 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-08 12:42:51,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {26295#(<= ~counter~0 2)} assume !!(0 != ~r~0); {26295#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:51,854 INFO L284 TraceCheckUtils]: 32: Hoare quadruple {26210#true} {26295#(<= ~counter~0 2)} #63#return; {26295#(<= ~counter~0 2)} is VALID [2022-04-08 12:42:51,854 INFO L290 TraceCheckUtils]: 31: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,854 INFO L290 TraceCheckUtils]: 30: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,854 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-08 12:42:51,855 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-08 12:42:51,855 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-08 12:42:51,855 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-08 12:42:51,856 INFO L290 TraceCheckUtils]: 24: Hoare triple {26267#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26267#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:51,856 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26210#true} {26267#(<= ~counter~0 1)} #63#return; {26267#(<= ~counter~0 1)} is VALID [2022-04-08 12:42:51,856 INFO L290 TraceCheckUtils]: 22: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,856 INFO L290 TraceCheckUtils]: 21: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,856 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-08 12:42:51,857 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-08 12:42:51,857 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-08 12:42:51,857 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-08 12:42:51,858 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26210#true} {26218#(<= ~counter~0 0)} #61#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:51,858 INFO L290 TraceCheckUtils]: 14: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,858 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-08 12:42:51,859 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26210#true} {26218#(<= ~counter~0 0)} #59#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:51,859 INFO L290 TraceCheckUtils]: 9: Hoare triple {26210#true} assume true; {26210#true} is VALID [2022-04-08 12:42:51,859 INFO L290 TraceCheckUtils]: 8: Hoare triple {26210#true} assume !(0 == ~cond); {26210#true} is VALID [2022-04-08 12:42:51,859 INFO L290 TraceCheckUtils]: 7: Hoare triple {26210#true} ~cond := #in~cond; {26210#true} is VALID [2022-04-08 12:42:51,859 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-08 12:42:51,859 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-08 12:42:51,859 INFO L272 TraceCheckUtils]: 4: Hoare triple {26218#(<= ~counter~0 0)} call #t~ret7 := main(); {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:51,860 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26218#(<= ~counter~0 0)} {26210#true} #67#return; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:51,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {26218#(<= ~counter~0 0)} assume true; {26218#(<= ~counter~0 0)} is VALID [2022-04-08 12:42:51,860 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-08 12:42:51,860 INFO L272 TraceCheckUtils]: 0: Hoare triple {26210#true} call ULTIMATE.init(); {26210#true} is VALID [2022-04-08 12:42:51,861 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-08 12:42:51,861 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-08 12:42:51,861 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [725076261] [2022-04-08 12:42:51,861 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-08 12:42:51,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1327551394] [2022-04-08 12:42:51,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1327551394] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-08 12:42:51,862 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-08 12:42:51,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 23 [2022-04-08 12:42:51,862 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-08 12:42:51,862 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [687208334] [2022-04-08 12:42:51,862 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [687208334] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-08 12:42:51,862 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-08 12:42:51,862 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-08 12:42:51,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1608579974] [2022-04-08 12:42:51,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-08 12:42:51,863 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-08 12:42:51,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-08 12:42:51,864 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-08 12:42:51,979 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-08 12:42:51,979 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-08 12:42:51,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:51,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-08 12:42:51,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=233, Invalid=273, Unknown=0, NotChecked=0, Total=506 [2022-04-08 12:42:51,980 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-08 12:42:52,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:52,855 INFO L93 Difference]: Finished difference Result 205 states and 226 transitions. [2022-04-08 12:42:52,855 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2022-04-08 12:42:52,855 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-08 12:42:52,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-08 12:42:52,856 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-08 12:42:52,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 225 transitions. [2022-04-08 12:42:52,859 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-08 12:42:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 225 transitions. [2022-04-08 12:42:52,863 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 42 states and 225 transitions. [2022-04-08 12:42:53,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 225 edges. 225 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:42:53,025 INFO L225 Difference]: With dead ends: 205 [2022-04-08 12:42:53,025 INFO L226 Difference]: Without dead ends: 200 [2022-04-08 12:42:53,026 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 406 GetRequests, 365 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=651, Invalid=1071, Unknown=0, NotChecked=0, Total=1722 [2022-04-08 12:42:53,026 INFO L913 BasicCegarLoop]: 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-08 12:42:53,026 INFO L914 BasicCegarLoop]: 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-08 12:42:53,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-04-08 12:42:53,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 200. [2022-04-08 12:42:53,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-08 12:42:53,244 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-08 12:42:53,244 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-08 12:42:53,244 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-08 12:42:53,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:53,247 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-08 12:42:53,248 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-08 12:42:53,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:53,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:53,248 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-08 12:42:53,248 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-08 12:42:53,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-08 12:42:53,251 INFO L93 Difference]: Finished difference Result 200 states and 221 transitions. [2022-04-08 12:42:53,251 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-08 12:42:53,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-08 12:42:53,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-08 12:42:53,251 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-08 12:42:53,251 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-08 12:42:53,251 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-08 12:42:53,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 221 transitions. [2022-04-08 12:42:53,254 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 221 transitions. Word has length 194 [2022-04-08 12:42:53,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-08 12:42:53,254 INFO L478 AbstractCegarLoop]: Abstraction has 200 states and 221 transitions. [2022-04-08 12:42:53,254 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 6.304347826086956) internal successors, (145), 22 states have internal predecessors, (145), 22 states have call successors, (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-08 12:42:53,254 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 200 states and 221 transitions. [2022-04-08 12:42:54,069 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 221 edges. 221 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-08 12:42:54,069 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 221 transitions. [2022-04-08 12:42:54,070 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 204 [2022-04-08 12:42:54,070 INFO L491 BasicCegarLoop]: Found error trace [2022-04-08 12:42:54,070 INFO L499 BasicCegarLoop]: 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-08 12:42:54,076 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Ended with exit code 0 [2022-04-08 12:42:54,274 WARN L460 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-08 12:42:54,275 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-08 12:42:54,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-08 12:42:54,275 INFO L85 PathProgramCache]: Analyzing trace with hash 1934081686, now seen corresponding path program 39 times [2022-04-08 12:42:54,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-08 12:42:54,275 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1535094266] [2022-04-08 12:42:54,276 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-08 12:42:54,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1934081686, now seen corresponding path program 40 times [2022-04-08 12:42:54,276 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-08 12:42:54,276 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [195478873] [2022-04-08 12:42:54,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-08 12:42:54,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-08 12:42:54,293 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-08 12:42:54,293 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [81307548] [2022-04-08 12:42:54,294 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-08 12:42:54,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-08 12:42:54,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-08 12:42:54,294 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-08 12:42:54,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2022-04-08 12:42:54,464 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-08 12:42:54,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2022-04-08 12:42:54,464 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-04-08 12:42:54,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-04-08 12:42:54,670 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-04-08 12:42:54,670 INFO L130 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found a feasible trace [2022-04-08 12:42:54,670 INFO L618 BasicCegarLoop]: Counterexample is feasible [2022-04-08 12:42:54,673 INFO L788 garLoopResultBuilder]: Registering result UNSAFE for location __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-04-08 12:42:54,685 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-08 12:42:54,879 WARN L460 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-08 12:42:54,882 INFO L719 BasicCegarLoop]: Path program histogram: [40, 2, 2, 2, 2] [2022-04-08 12:42:54,885 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: reach_errorENTRY has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: ULTIMATE.initENTRY has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: assume_abort_if_notENTRY has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: mainENTRY has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: __VERIFIER_assertENTRY has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: reach_errorFINAL has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: ULTIMATE.initFINAL has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: L9 has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: L26 has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: L12 has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: ULTIMATE.initEXIT has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-04-08 12:42:54,905 WARN L170 areAnnotationChecker]: L9-2 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L26-1 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L13 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L12-2 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: assume_abort_if_notEXIT has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L28 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: __VERIFIER_assertEXIT has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L38-2 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L35-1 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L34-3 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L34-1 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L38 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: mainFINAL has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: L35 has no Hoare annotation [2022-04-08 12:42:54,906 WARN L170 areAnnotationChecker]: mainEXIT has no Hoare annotation [2022-04-08 12:42:54,906 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-08 12:42:54,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 08.04 12:42:54 BoogieIcfgContainer [2022-04-08 12:42:54,907 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-04-08 12:42:54,908 INFO L158 Benchmark]: Toolchain (without parser) took 123734.59ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 126.3MB in the beginning and 202.5MB in the end (delta: -76.2MB). There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:42:54,908 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 182.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-04-08 12:42:54,908 INFO L158 Benchmark]: CACSL2BoogieTranslator took 174.52ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 126.2MB in the beginning and 219.6MB in the end (delta: -93.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. [2022-04-08 12:42:54,908 INFO L158 Benchmark]: Boogie Preprocessor took 32.76ms. Allocated memory is still 249.6MB. Free memory was 219.2MB in the beginning and 217.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. [2022-04-08 12:42:54,908 INFO L158 Benchmark]: RCFGBuilder took 213.92ms. Allocated memory is still 249.6MB. Free memory was 217.6MB in the beginning and 206.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. [2022-04-08 12:42:54,908 INFO L158 Benchmark]: TraceAbstraction took 123309.98ms. Allocated memory is still 249.6MB. Free memory was 205.9MB in the beginning and 202.5MB in the end (delta: 3.5MB). Peak memory consumption was 5.1MB. Max. memory is 8.0GB. [2022-04-08 12:42:54,910 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 182.5MB. Free memory is still 143.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 174.52ms. Allocated memory was 182.5MB in the beginning and 249.6MB in the end (delta: 67.1MB). Free memory was 126.2MB in the beginning and 219.6MB in the end (delta: -93.4MB). Peak memory consumption was 8.4MB. Max. memory is 8.0GB. * Boogie Preprocessor took 32.76ms. Allocated memory is still 249.6MB. Free memory was 219.2MB in the beginning and 217.6MB in the end (delta: 1.5MB). Peak memory consumption was 1.0MB. Max. memory is 8.0GB. * RCFGBuilder took 213.92ms. Allocated memory is still 249.6MB. Free memory was 217.6MB in the beginning and 206.2MB in the end (delta: 11.5MB). Peak memory consumption was 11.5MB. Max. memory is 8.0GB. * TraceAbstraction took 123309.98ms. Allocated memory is still 249.6MB. Free memory was 205.9MB in the beginning and 202.5MB in the end (delta: 3.5MB). Peak memory consumption was 5.1MB. 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: 123.2s, OverallIterations: 24, TraceHistogramMax: 21, PathProgramHistogramMax: 40, EmptinessCheckTime: 0.0s, AutomataDifference: 21.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 739 SdHoareTripleChecker+Valid, 5.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 738 mSDsluCounter, 3313 SdHoareTripleChecker+Invalid, 5.2s 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, 3.7s 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: 2.5s 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-08 12:42:54,925 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...