/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/fermat1-ll_unwindbound100.c -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-e106359-m [2022-04-15 15:10:21,189 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-04-15 15:10:21,226 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-04-15 15:10:21,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-04-15 15:10:21,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-04-15 15:10:21,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-04-15 15:10:21,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-04-15 15:10:21,280 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-04-15 15:10:21,283 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-04-15 15:10:21,288 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-04-15 15:10:21,289 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-04-15 15:10:21,290 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-04-15 15:10:21,290 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-04-15 15:10:21,292 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-04-15 15:10:21,293 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-04-15 15:10:21,295 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-04-15 15:10:21,296 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-04-15 15:10:21,297 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-04-15 15:10:21,300 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-04-15 15:10:21,301 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-04-15 15:10:21,302 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-04-15 15:10:21,304 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-04-15 15:10:21,305 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-04-15 15:10:21,306 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-04-15 15:10:21,306 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-04-15 15:10:21,308 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-04-15 15:10:21,308 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-04-15 15:10:21,309 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-04-15 15:10:21,309 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-04-15 15:10:21,309 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-04-15 15:10:21,310 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-04-15 15:10:21,310 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-04-15 15:10:21,311 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-04-15 15:10:21,311 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-04-15 15:10:21,312 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-04-15 15:10:21,312 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-04-15 15:10:21,313 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-04-15 15:10:21,313 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-04-15 15:10:21,313 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-04-15 15:10:21,314 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-04-15 15:10:21,314 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-04-15 15:10:21,318 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-04-15 15:10:21,319 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/acceleratedInterpolation/acceleratedInterpolationQvasr_64.epf [2022-04-15 15:10:21,328 INFO L113 SettingsManager]: Loading preferences was successful [2022-04-15 15:10:21,328 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-04-15 15:10:21,329 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-04-15 15:10:21,329 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-04-15 15:10:21,330 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-04-15 15:10:21,330 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-04-15 15:10:21,330 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-04-15 15:10:21,330 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-04-15 15:10:21,330 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-04-15 15:10:21,330 INFO L138 SettingsManager]: * Use constant arrays=true [2022-04-15 15:10:21,330 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-04-15 15:10:21,331 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-04-15 15:10:21,331 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-04-15 15:10:21,331 INFO L138 SettingsManager]: * To the following directory=./dump/ [2022-04-15 15:10:21,331 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-04-15 15:10:21,331 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:10:21,331 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-04-15 15:10:21,331 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=Craig_NestedInterpolation [2022-04-15 15:10:21,331 INFO L138 SettingsManager]: * Trace refinement strategy=ACCELERATED_INTERPOLATION [2022-04-15 15:10:21,332 INFO L138 SettingsManager]: * Trace refinement strategy used in Accelerated Interpolation=CAMEL [2022-04-15 15:10:21,332 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-04-15 15:10:21,332 INFO L138 SettingsManager]: * Loop acceleration method that is used by accelerated interpolation=QVASR [2022-04-15 15:10:21,332 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-15 15:10:21,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-04-15 15:10:21,574 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-04-15 15:10:21,576 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-04-15 15:10:21,577 INFO L271 PluginConnector]: Initializing CDTParser... [2022-04-15 15:10:21,577 INFO L275 PluginConnector]: CDTParser initialized [2022-04-15 15:10:21,578 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-15 15:10:21,639 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6270da787/2070a7ee33d74e9db343e118746d12f3/FLAG3737fb5f1 [2022-04-15 15:10:22,038 INFO L306 CDTParser]: Found 1 translation units. [2022-04-15 15:10:22,038 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/nla-digbench-scaling/fermat1-ll_unwindbound100.c [2022-04-15 15:10:22,048 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6270da787/2070a7ee33d74e9db343e118746d12f3/FLAG3737fb5f1 [2022-04-15 15:10:22,058 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6270da787/2070a7ee33d74e9db343e118746d12f3 [2022-04-15 15:10:22,060 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-04-15 15:10:22,061 INFO L131 ToolchainWalker]: Walking toolchain with 4 elements. [2022-04-15 15:10:22,063 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-04-15 15:10:22,063 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-04-15 15:10:22,067 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-04-15 15:10:22,071 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,072 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@bb4c6d9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22, skipping insertion in model container [2022-04-15 15:10:22,072 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,078 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-04-15 15:10:22,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-04-15 15:10:22,268 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/fermat1-ll_unwindbound100.c[535,548] [2022-04-15 15:10:22,306 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:10:22,313 INFO L203 MainTranslator]: Completed pre-run [2022-04-15 15:10:22,332 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/fermat1-ll_unwindbound100.c[535,548] [2022-04-15 15:10:22,341 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-04-15 15:10:22,351 INFO L208 MainTranslator]: Completed translation [2022-04-15 15:10:22,352 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22 WrapperNode [2022-04-15 15:10:22,352 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-04-15 15:10:22,353 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-04-15 15:10:22,353 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-04-15 15:10:22,353 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-04-15 15:10:22,362 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,362 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,376 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,376 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,386 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,390 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,391 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,392 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-04-15 15:10:22,393 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-04-15 15:10:22,393 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-04-15 15:10:22,393 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-04-15 15:10:22,396 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22" (1/1) ... [2022-04-15 15:10:22,402 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-04-15 15:10:22,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:10:22,424 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-15 15:10:22,432 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-15 15:10:22,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2022-04-15 15:10:22,463 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-04-15 15:10:22,463 INFO L138 BoogieDeclarations]: Found implementation of procedure reach_error [2022-04-15 15:10:22,463 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2022-04-15 15:10:22,464 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2022-04-15 15:10:22,464 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2022-04-15 15:10:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure abort [2022-04-15 15:10:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure __assert_fail [2022-04-15 15:10:22,464 INFO L130 BoogieDeclarations]: Found specification of procedure reach_error [2022-04-15 15:10:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-04-15 15:10:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_nondet_int [2022-04-15 15:10:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2022-04-15 15:10:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2022-04-15 15:10:22,465 INFO L130 BoogieDeclarations]: Found specification of procedure main [2022-04-15 15:10:22,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2022-04-15 15:10:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-04-15 15:10:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-04-15 15:10:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-04-15 15:10:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-04-15 15:10:22,468 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-04-15 15:10:22,520 INFO L234 CfgBuilder]: Building ICFG [2022-04-15 15:10:22,522 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-04-15 15:10:22,720 INFO L275 CfgBuilder]: Performing block encoding [2022-04-15 15:10:22,743 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-04-15 15:10:22,743 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-04-15 15:10:22,745 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:10:22 BoogieIcfgContainer [2022-04-15 15:10:22,745 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-04-15 15:10:22,747 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-04-15 15:10:22,747 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-04-15 15:10:22,749 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-04-15 15:10:22,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.04 03:10:22" (1/3) ... [2022-04-15 15:10:22,750 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7419639a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:10:22, skipping insertion in model container [2022-04-15 15:10:22,750 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.04 03:10:22" (2/3) ... [2022-04-15 15:10:22,751 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7419639a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.04 03:10:22, skipping insertion in model container [2022-04-15 15:10:22,751 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.04 03:10:22" (3/3) ... [2022-04-15 15:10:22,752 INFO L111 eAbstractionObserver]: Analyzing ICFG fermat1-ll_unwindbound100.c [2022-04-15 15:10:22,755 INFO L202 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:Craig_NestedInterpolation Determinization: PREDICATE_ABSTRACTION [2022-04-15 15:10:22,755 INFO L161 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-04-15 15:10:22,801 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-04-15 15:10:22,826 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-15 15:10:22,826 INFO L341 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-04-15 15:10:22,849 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2022-04-15 15:10:22,855 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-04-15 15:10:22,855 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:10:22,856 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-15 15:10:22,856 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:10:22,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:10:22,860 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 1 times [2022-04-15 15:10:22,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:10:22,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1158433636] [2022-04-15 15:10:22,897 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:10:22,898 INFO L85 PathProgramCache]: Analyzing trace with hash 928708300, now seen corresponding path program 2 times [2022-04-15 15:10:22,901 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:10:22,901 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129547626] [2022-04-15 15:10:22,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:10:22,902 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:10:23,028 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:10:23,029 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1464785845] [2022-04-15 15:10:23,029 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:10:23,029 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:10:23,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:10:23,034 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-15 15:10:23,035 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-15 15:10:23,117 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:10:23,117 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:10:23,119 INFO L263 TraceCheckSpWp]: Trace formula consists of 80 conjuncts, 1 conjunts are in the unsatisfiable core [2022-04-15 15:10:23,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:10:23,137 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:10:23,239 INFO L272 TraceCheckUtils]: 0: Hoare triple {40#true} call ULTIMATE.init(); {40#true} is VALID [2022-04-15 15:10:23,240 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#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; {40#true} is VALID [2022-04-15 15:10:23,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:10:23,240 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {40#true} {40#true} #102#return; {40#true} is VALID [2022-04-15 15:10:23,240 INFO L272 TraceCheckUtils]: 4: Hoare triple {40#true} call #t~ret9 := main(); {40#true} is VALID [2022-04-15 15:10:23,241 INFO L290 TraceCheckUtils]: 5: Hoare triple {40#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; {40#true} is VALID [2022-04-15 15:10:23,241 INFO L272 TraceCheckUtils]: 6: Hoare triple {40#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {40#true} is VALID [2022-04-15 15:10:23,242 INFO L290 TraceCheckUtils]: 7: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:10:23,242 INFO L290 TraceCheckUtils]: 8: Hoare triple {40#true} assume 0 == ~cond;assume false; {40#true} is VALID [2022-04-15 15:10:23,243 INFO L290 TraceCheckUtils]: 9: Hoare triple {40#true} assume true; {40#true} is VALID [2022-04-15 15:10:23,243 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {40#true} {40#true} #90#return; {40#true} is VALID [2022-04-15 15:10:23,243 INFO L272 TraceCheckUtils]: 11: Hoare triple {40#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)); {40#true} is VALID [2022-04-15 15:10:23,243 INFO L290 TraceCheckUtils]: 12: Hoare triple {40#true} ~cond := #in~cond; {40#true} is VALID [2022-04-15 15:10:23,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {40#true} assume 0 == ~cond;assume false; {41#false} is VALID [2022-04-15 15:10:23,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {41#false} assume true; {41#false} is VALID [2022-04-15 15:10:23,245 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41#false} {40#true} #92#return; {41#false} is VALID [2022-04-15 15:10:23,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {41#false} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41#false} is VALID [2022-04-15 15:10:23,246 INFO L290 TraceCheckUtils]: 17: Hoare triple {41#false} assume !true; {41#false} is VALID [2022-04-15 15:10:23,247 INFO L272 TraceCheckUtils]: 18: Hoare triple {41#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)); {41#false} is VALID [2022-04-15 15:10:23,247 INFO L290 TraceCheckUtils]: 19: Hoare triple {41#false} ~cond := #in~cond; {41#false} is VALID [2022-04-15 15:10:23,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {41#false} assume 0 == ~cond; {41#false} is VALID [2022-04-15 15:10:23,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-04-15 15:10:23,248 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-15 15:10:23,249 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:10:23,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:10:23,249 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129547626] [2022-04-15 15:10:23,249 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:10:23,250 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1464785845] [2022-04-15 15:10:23,250 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1464785845] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:10:23,250 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:10:23,250 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 15:10:23,253 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:10:23,254 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1158433636] [2022-04-15 15:10:23,254 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1158433636] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:10:23,254 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:10:23,254 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-04-15 15:10:23,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [729400339] [2022-04-15 15:10:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:10:23,261 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-15 15:10:23,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:10:23,265 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-15 15:10:23,292 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-15 15:10:23,292 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-04-15 15:10:23,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:10:23,322 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-04-15 15:10:23,322 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-04-15 15:10:23,325 INFO L87 Difference]: Start difference. First operand has 37 states, 23 states have (on average 1.5217391304347827) internal successors, (35), 24 states have internal predecessors, (35), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) 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-15 15:10:23,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:10:23,420 INFO L93 Difference]: Finished difference Result 67 states and 100 transitions. [2022-04-15 15:10:23,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-04-15 15:10:23,421 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-15 15:10:23,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:10:23,422 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-15 15:10:23,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 15:10:23,432 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-15 15:10:23,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 100 transitions. [2022-04-15 15:10:23,436 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 2 states and 100 transitions. [2022-04-15 15:10:23,533 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:10:23,540 INFO L225 Difference]: With dead ends: 67 [2022-04-15 15:10:23,541 INFO L226 Difference]: Without dead ends: 32 [2022-04-15 15:10:23,543 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-15 15:10:23,546 INFO L913 BasicCegarLoop]: 46 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, 46 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-15 15:10:23,547 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:10:23,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-04-15 15:10:23,584 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2022-04-15 15:10:23,584 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:10:23,585 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:10:23,586 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:10:23,587 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:10:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:10:23,594 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 15:10:23,595 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:10:23,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:10:23,598 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:10:23,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 15:10:23,607 INFO L87 Difference]: Start difference. First operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 32 states. [2022-04-15 15:10:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:10:23,612 INFO L93 Difference]: Finished difference Result 32 states and 41 transitions. [2022-04-15 15:10:23,612 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:10:23,614 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:10:23,614 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:10:23,614 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:10:23,614 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:10:23,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 20 states have (on average 1.35) internal successors, (27), 21 states have internal predecessors, (27), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:10:23,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 41 transitions. [2022-04-15 15:10:23,622 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 41 transitions. Word has length 22 [2022-04-15 15:10:23,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:10:23,623 INFO L478 AbstractCegarLoop]: Abstraction has 32 states and 41 transitions. [2022-04-15 15:10:23,623 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-15 15:10:23,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 41 transitions. [2022-04-15 15:10:23,666 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-15 15:10:23,666 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 41 transitions. [2022-04-15 15:10:23,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 15:10:23,667 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:10:23,668 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-15 15:10:23,694 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-04-15 15:10:23,881 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-15 15:10:23,882 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:10:23,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:10:23,883 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 1 times [2022-04-15 15:10:23,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:10:23,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [929540642] [2022-04-15 15:10:23,885 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:10:23,885 INFO L85 PathProgramCache]: Analyzing trace with hash -155606603, now seen corresponding path program 2 times [2022-04-15 15:10:23,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:10:23,885 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402758651] [2022-04-15 15:10:23,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:10:23,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:10:23,910 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:10:23,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [499031611] [2022-04-15 15:10:23,911 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:10:23,911 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:10:23,911 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:10:23,916 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-15 15:10:23,932 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-15 15:10:23,981 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:10:23,982 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:10:23,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 5 conjunts are in the unsatisfiable core [2022-04-15 15:10:23,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:10:23,996 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:10:24,191 INFO L272 TraceCheckUtils]: 0: Hoare triple {369#true} call ULTIMATE.init(); {369#true} is VALID [2022-04-15 15:10:24,192 INFO L290 TraceCheckUtils]: 1: Hoare triple {369#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; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,193 INFO L290 TraceCheckUtils]: 2: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,193 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {377#(<= ~counter~0 0)} {369#true} #102#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,194 INFO L272 TraceCheckUtils]: 4: Hoare triple {377#(<= ~counter~0 0)} call #t~ret9 := main(); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {377#(<= ~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; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,195 INFO L272 TraceCheckUtils]: 6: Hoare triple {377#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #90#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,199 INFO L272 TraceCheckUtils]: 11: Hoare triple {377#(<= ~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)); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {377#(<= ~counter~0 0)} ~cond := #in~cond; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {377#(<= ~counter~0 0)} assume !(0 == ~cond); {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {377#(<= ~counter~0 0)} assume true; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,203 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {377#(<= ~counter~0 0)} {377#(<= ~counter~0 0)} #92#return; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {377#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {377#(<= ~counter~0 0)} is VALID [2022-04-15 15:10:24,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {377#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {426#(<= |main_#t~post6| 0)} is VALID [2022-04-15 15:10:24,206 INFO L290 TraceCheckUtils]: 18: Hoare triple {426#(<= |main_#t~post6| 0)} assume !(#t~post6 < 100);havoc #t~post6; {370#false} is VALID [2022-04-15 15:10:24,206 INFO L272 TraceCheckUtils]: 19: Hoare triple {370#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)); {370#false} is VALID [2022-04-15 15:10:24,206 INFO L290 TraceCheckUtils]: 20: Hoare triple {370#false} ~cond := #in~cond; {370#false} is VALID [2022-04-15 15:10:24,206 INFO L290 TraceCheckUtils]: 21: Hoare triple {370#false} assume 0 == ~cond; {370#false} is VALID [2022-04-15 15:10:24,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {370#false} assume !false; {370#false} is VALID [2022-04-15 15:10:24,207 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-15 15:10:24,207 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:10:24,207 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:10:24,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402758651] [2022-04-15 15:10:24,208 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:10:24,208 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [499031611] [2022-04-15 15:10:24,208 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [499031611] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:10:24,209 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:10:24,209 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:10:24,209 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:10:24,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [929540642] [2022-04-15 15:10:24,210 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [929540642] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:10:24,211 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:10:24,211 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:10:24,211 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1268863711] [2022-04-15 15:10:24,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:10:24,212 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-15 15:10:24,212 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:10:24,213 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-15 15:10:24,231 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-15 15:10:24,232 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:10:24,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:10:24,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:10:24,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:10:24,234 INFO L87 Difference]: Start difference. First operand 32 states and 41 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-15 15:10:24,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:10:24,337 INFO L93 Difference]: Finished difference Result 41 states and 50 transitions. [2022-04-15 15:10:24,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:10:24,338 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-15 15:10:24,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:10:24,338 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-15 15:10:24,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 15:10:24,341 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-15 15:10:24,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 50 transitions. [2022-04-15 15:10:24,342 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 50 transitions. [2022-04-15 15:10:24,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:10:24,392 INFO L225 Difference]: With dead ends: 41 [2022-04-15 15:10:24,393 INFO L226 Difference]: Without dead ends: 34 [2022-04-15 15:10:24,393 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-15 15:10:24,398 INFO L913 BasicCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:10:24,399 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 101 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:10:24,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-04-15 15:10:24,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-04-15 15:10:24,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:10:24,417 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:10:24,417 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:10:24,419 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:10:24,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:10:24,423 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 15:10:24,423 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:10:24,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:10:24,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:10:24,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 15:10:24,425 INFO L87 Difference]: Start difference. First operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand 34 states. [2022-04-15 15:10:24,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:10:24,431 INFO L93 Difference]: Finished difference Result 34 states and 43 transitions. [2022-04-15 15:10:24,431 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:10:24,439 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:10:24,439 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:10:24,439 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:10:24,439 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:10:24,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 22 states have (on average 1.3181818181818181) internal successors, (29), 23 states have internal predecessors, (29), 8 states have call successors, (8), 4 states have call predecessors, (8), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-04-15 15:10:24,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-04-15 15:10:24,441 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 23 [2022-04-15 15:10:24,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:10:24,442 INFO L478 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-04-15 15:10:24,442 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-15 15:10:24,442 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 43 transitions. [2022-04-15 15:10:24,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:10:24,484 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-04-15 15:10:24,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-04-15 15:10:24,485 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:10:24,485 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-15 15:10:24,513 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-15 15:10:24,703 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-15 15:10:24,704 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:10:24,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:10:24,704 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 1 times [2022-04-15 15:10:24,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:10:24,704 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1506304731] [2022-04-15 15:10:24,705 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:10:24,705 INFO L85 PathProgramCache]: Analyzing trace with hash -153938307, now seen corresponding path program 2 times [2022-04-15 15:10:24,705 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:10:24,705 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [848129181] [2022-04-15 15:10:24,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:10:24,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:10:24,719 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:10:24,719 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [120925929] [2022-04-15 15:10:24,719 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:10:24,720 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:10:24,720 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:10:24,721 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-15 15:10:24,743 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-15 15:10:24,780 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-04-15 15:10:24,780 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:10:24,781 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:10:24,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:10:24,793 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:10:25,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {659#true} call ULTIMATE.init(); {659#true} is VALID [2022-04-15 15:10:25,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {659#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; {659#true} is VALID [2022-04-15 15:10:25,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:10:25,094 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {659#true} {659#true} #102#return; {659#true} is VALID [2022-04-15 15:10:25,094 INFO L272 TraceCheckUtils]: 4: Hoare triple {659#true} call #t~ret9 := main(); {659#true} is VALID [2022-04-15 15:10:25,094 INFO L290 TraceCheckUtils]: 5: Hoare triple {659#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; {659#true} is VALID [2022-04-15 15:10:25,094 INFO L272 TraceCheckUtils]: 6: Hoare triple {659#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {659#true} is VALID [2022-04-15 15:10:25,094 INFO L290 TraceCheckUtils]: 7: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 15:10:25,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 15:10:25,095 INFO L290 TraceCheckUtils]: 9: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:10:25,095 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {659#true} {659#true} #90#return; {659#true} is VALID [2022-04-15 15:10:25,095 INFO L272 TraceCheckUtils]: 11: Hoare triple {659#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)); {659#true} is VALID [2022-04-15 15:10:25,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {659#true} ~cond := #in~cond; {659#true} is VALID [2022-04-15 15:10:25,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {659#true} assume !(0 == ~cond); {659#true} is VALID [2022-04-15 15:10:25,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {659#true} assume true; {659#true} is VALID [2022-04-15 15:10:25,096 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {659#true} {659#true} #92#return; {659#true} is VALID [2022-04-15 15:10:26,863 INFO L290 TraceCheckUtils]: 16: Hoare triple {659#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {712#(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-15 15:10:26,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {712#(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; {712#(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-15 15:10:26,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {712#(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 < 100);havoc #t~post6; {712#(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-15 15:10:27,095 INFO L272 TraceCheckUtils]: 19: Hoare triple {712#(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)); {722#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:10:27,096 INFO L290 TraceCheckUtils]: 20: Hoare triple {722#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {726#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:10:27,097 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {660#false} is VALID [2022-04-15 15:10:27,097 INFO L290 TraceCheckUtils]: 22: Hoare triple {660#false} assume !false; {660#false} is VALID [2022-04-15 15:10:27,098 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-15 15:10:27,098 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:10:27,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:10:27,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [848129181] [2022-04-15 15:10:27,098 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:10:27,098 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [120925929] [2022-04-15 15:10:27,098 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [120925929] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:10:27,098 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:10:27,098 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:10:27,099 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:10:27,099 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1506304731] [2022-04-15 15:10:27,099 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1506304731] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:10:27,099 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:10:27,099 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:10:27,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356657128] [2022-04-15 15:10:27,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:10:27,100 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-15 15:10:27,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:10:27,100 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-15 15:10:29,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 19 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:10:29,605 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:10:29,605 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:10:29,606 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:10:29,606 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:10:29,606 INFO L87 Difference]: Start difference. First operand 34 states and 43 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-15 15:10:31,246 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:10:33,126 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.88s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:10:36,015 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:10:38,018 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:10:45,393 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:10:51,080 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:10:51,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:10:51,107 INFO L93 Difference]: Finished difference Result 53 states and 70 transitions. [2022-04-15 15:10:51,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:10:51,107 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-15 15:10:51,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:10:51,108 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-15 15:10:51,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 15:10:51,110 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-15 15:10:51,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 68 transitions. [2022-04-15 15:10:51,116 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 68 transitions. [2022-04-15 15:10:56,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 66 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:10:56,903 INFO L225 Difference]: With dead ends: 53 [2022-04-15 15:10:56,903 INFO L226 Difference]: Without dead ends: 51 [2022-04-15 15:10:56,904 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-15 15:10:56,904 INFO L913 BasicCegarLoop]: 34 mSDtfsCounter, 16 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 11.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 57 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 11.7s IncrementalHoareTripleChecker+Time [2022-04-15 15:10:56,905 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 119 Invalid, 57 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 3 Unknown, 0 Unchecked, 11.7s Time] [2022-04-15 15:10:56,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2022-04-15 15:10:56,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 50. [2022-04-15 15:10:56,931 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:10:56,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:10:56,932 INFO L74 IsIncluded]: Start isIncluded. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:10:56,932 INFO L87 Difference]: Start difference. First operand 51 states. Second operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:10:56,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:10:56,935 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 15:10:56,935 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 15:10:56,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:10:56,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:10:56,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 15:10:56,936 INFO L87 Difference]: Start difference. First operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 51 states. [2022-04-15 15:10:56,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:10:56,939 INFO L93 Difference]: Finished difference Result 51 states and 68 transitions. [2022-04-15 15:10:56,939 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 68 transitions. [2022-04-15 15:10:56,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:10:56,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:10:56,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:10:56,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:10:56,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 35 states have internal predecessors, (47), 11 states have call successors, (11), 5 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:10:56,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 67 transitions. [2022-04-15 15:10:56,942 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 67 transitions. Word has length 23 [2022-04-15 15:10:56,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:10:56,943 INFO L478 AbstractCegarLoop]: Abstraction has 50 states and 67 transitions. [2022-04-15 15:10:56,943 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-15 15:10:56,943 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 50 states and 67 transitions. [2022-04-15 15:11:00,919 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:00,920 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 67 transitions. [2022-04-15 15:11:00,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-04-15 15:11:00,921 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:00,921 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-15 15:11:00,941 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-15 15:11:01,121 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-15 15:11:01,122 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:01,122 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:01,122 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 1 times [2022-04-15 15:11:01,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:01,122 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1927943983] [2022-04-15 15:11:01,123 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:01,123 INFO L85 PathProgramCache]: Analyzing trace with hash -1676885497, now seen corresponding path program 2 times [2022-04-15 15:11:01,123 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:01,123 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79338138] [2022-04-15 15:11:01,123 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:01,123 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:01,139 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:01,139 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1543249122] [2022-04-15 15:11:01,139 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:01,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:01,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:01,142 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-15 15:11:01,179 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-15 15:11:01,222 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:01,222 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:01,223 INFO L263 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 15:11:01,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:01,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:01,440 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 15:11:01,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#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; {1042#true} is VALID [2022-04-15 15:11:01,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:01,440 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 15:11:01,441 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 15:11:01,441 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#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; {1042#true} is VALID [2022-04-15 15:11:01,441 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:01,441 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:01,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:01,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:01,441 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 15:11:01,441 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-15 15:11:01,442 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:01,442 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:01,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:01,442 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 15:11:01,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-15 15:11:01,442 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 15:11:01,442 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 100);havoc #t~post6; {1042#true} is VALID [2022-04-15 15:11:01,443 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-15 15:11:01,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:01,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {1107#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:01,445 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:01,446 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1118#(= (+ (* 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-15 15:11:01,447 INFO L290 TraceCheckUtils]: 24: Hoare triple {1118#(= (+ (* 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); {1122#(= (+ (* 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-15 15:11:01,447 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* 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)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:11:01,448 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:01,449 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 15:11:01,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 15:11:01,449 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-15 15:11:01,449 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:01,901 INFO L290 TraceCheckUtils]: 28: Hoare triple {1043#false} assume !false; {1043#false} is VALID [2022-04-15 15:11:01,902 INFO L290 TraceCheckUtils]: 27: Hoare triple {1130#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {1043#false} is VALID [2022-04-15 15:11:01,902 INFO L290 TraceCheckUtils]: 26: Hoare triple {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {1130#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:11:01,903 INFO L272 TraceCheckUtils]: 25: Hoare triple {1122#(= (+ (* 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)); {1126#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:11:01,904 INFO L290 TraceCheckUtils]: 24: Hoare triple {1149#(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); {1122#(= (+ (* 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-15 15:11:01,905 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} {1042#true} #94#return; {1149#(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-15 15:11:01,906 INFO L290 TraceCheckUtils]: 22: Hoare triple {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:01,906 INFO L290 TraceCheckUtils]: 21: Hoare triple {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} assume !(0 == ~cond); {1111#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:11:01,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {1042#true} ~cond := #in~cond; {1162#(or (not (= |__VERIFIER_assert_#in~cond| 0)) (= __VERIFIER_assert_~cond 0))} is VALID [2022-04-15 15:11:01,907 INFO L272 TraceCheckUtils]: 19: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-15 15:11:01,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {1042#true} assume !!(#t~post6 < 100);havoc #t~post6; {1042#true} is VALID [2022-04-15 15:11:01,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {1042#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1042#true} is VALID [2022-04-15 15:11:01,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {1042#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1042#true} is VALID [2022-04-15 15:11:01,907 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1042#true} {1042#true} #92#return; {1042#true} is VALID [2022-04-15 15:11:01,908 INFO L290 TraceCheckUtils]: 14: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:01,908 INFO L290 TraceCheckUtils]: 13: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:01,908 INFO L290 TraceCheckUtils]: 12: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:01,908 INFO L272 TraceCheckUtils]: 11: Hoare triple {1042#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)); {1042#true} is VALID [2022-04-15 15:11:01,908 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1042#true} {1042#true} #90#return; {1042#true} is VALID [2022-04-15 15:11:01,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:01,909 INFO L290 TraceCheckUtils]: 8: Hoare triple {1042#true} assume !(0 == ~cond); {1042#true} is VALID [2022-04-15 15:11:01,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {1042#true} ~cond := #in~cond; {1042#true} is VALID [2022-04-15 15:11:01,909 INFO L272 TraceCheckUtils]: 6: Hoare triple {1042#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1042#true} is VALID [2022-04-15 15:11:01,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {1042#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; {1042#true} is VALID [2022-04-15 15:11:01,909 INFO L272 TraceCheckUtils]: 4: Hoare triple {1042#true} call #t~ret9 := main(); {1042#true} is VALID [2022-04-15 15:11:01,909 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1042#true} {1042#true} #102#return; {1042#true} is VALID [2022-04-15 15:11:01,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {1042#true} assume true; {1042#true} is VALID [2022-04-15 15:11:01,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {1042#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; {1042#true} is VALID [2022-04-15 15:11:01,910 INFO L272 TraceCheckUtils]: 0: Hoare triple {1042#true} call ULTIMATE.init(); {1042#true} is VALID [2022-04-15 15:11:01,910 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-15 15:11:01,910 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:01,910 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79338138] [2022-04-15 15:11:01,910 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:01,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1543249122] [2022-04-15 15:11:01,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1543249122] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:01,911 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:01,911 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 10 [2022-04-15 15:11:01,911 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:01,911 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1927943983] [2022-04-15 15:11:01,911 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1927943983] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:01,911 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:01,912 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:11:01,912 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1157749317] [2022-04-15 15:11:01,912 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:01,912 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-15 15:11:01,912 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:01,913 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-15 15:11:01,933 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-15 15:11:01,933 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:11:01,933 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:01,934 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:11:01,934 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:11:01,934 INFO L87 Difference]: Start difference. First operand 50 states and 67 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-15 15:11:02,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:02,369 INFO L93 Difference]: Finished difference Result 57 states and 73 transitions. [2022-04-15 15:11:02,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:11:02,369 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-15 15:11:02,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:02,369 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-15 15:11:02,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 15:11:02,371 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-15 15:11:02,372 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 47 transitions. [2022-04-15 15:11:02,372 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 47 transitions. [2022-04-15 15:11:02,420 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-15 15:11:02,421 INFO L225 Difference]: With dead ends: 57 [2022-04-15 15:11:02,421 INFO L226 Difference]: Without dead ends: 52 [2022-04-15 15:11:02,422 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-15 15:11:02,423 INFO L913 BasicCegarLoop]: 29 mSDtfsCounter, 25 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:02,423 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:11:02,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2022-04-15 15:11:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 52. [2022-04-15 15:11:02,449 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:02,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:02,450 INFO L74 IsIncluded]: Start isIncluded. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:02,450 INFO L87 Difference]: Start difference. First operand 52 states. Second operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:02,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:02,453 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 15:11:02,453 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:11:02,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:02,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:02,454 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-15 15:11:02,454 INFO L87 Difference]: Start difference. First operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) Second operand 52 states. [2022-04-15 15:11:02,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:02,457 INFO L93 Difference]: Finished difference Result 52 states and 66 transitions. [2022-04-15 15:11:02,457 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:11:02,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:02,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:02,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:02,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:02,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 36 states have (on average 1.2777777777777777) internal successors, (46), 36 states have internal predecessors, (46), 11 states have call successors, (11), 6 states have call predecessors, (11), 4 states have return successors, (9), 9 states have call predecessors, (9), 9 states have call successors, (9) [2022-04-15 15:11:02,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 66 transitions. [2022-04-15 15:11:02,460 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 66 transitions. Word has length 29 [2022-04-15 15:11:02,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:02,460 INFO L478 AbstractCegarLoop]: Abstraction has 52 states and 66 transitions. [2022-04-15 15:11:02,460 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-15 15:11:02,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 52 states and 66 transitions. [2022-04-15 15:11:04,548 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 65 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:04,548 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 66 transitions. [2022-04-15 15:11:04,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-04-15 15:11:04,549 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:04,549 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, 1, 1, 1] [2022-04-15 15:11:04,565 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-04-15 15:11:04,751 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-15 15:11:04,751 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:04,752 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:04,752 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 1 times [2022-04-15 15:11:04,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:04,752 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [891435632] [2022-04-15 15:11:04,752 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:04,753 INFO L85 PathProgramCache]: Analyzing trace with hash 1154059858, now seen corresponding path program 2 times [2022-04-15 15:11:04,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:04,753 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [918280219] [2022-04-15 15:11:04,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:04,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:04,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:04,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1962395240] [2022-04-15 15:11:04,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:04,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:04,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:04,768 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-15 15:11:04,769 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-15 15:11:04,943 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:04,944 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:04,945 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 7 conjunts are in the unsatisfiable core [2022-04-15 15:11:04,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:04,956 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:05,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {1553#true} call ULTIMATE.init(); {1553#true} is VALID [2022-04-15 15:11:05,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {1553#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; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {1561#(<= ~counter~0 0)} {1553#true} #102#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,141 INFO L272 TraceCheckUtils]: 4: Hoare triple {1561#(<= ~counter~0 0)} call #t~ret9 := main(); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {1561#(<= ~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; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,142 INFO L272 TraceCheckUtils]: 6: Hoare triple {1561#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,143 INFO L290 TraceCheckUtils]: 7: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,143 INFO L290 TraceCheckUtils]: 8: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,144 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #90#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,145 INFO L272 TraceCheckUtils]: 11: Hoare triple {1561#(<= ~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)); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,145 INFO L290 TraceCheckUtils]: 12: Hoare triple {1561#(<= ~counter~0 0)} ~cond := #in~cond; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,145 INFO L290 TraceCheckUtils]: 13: Hoare triple {1561#(<= ~counter~0 0)} assume !(0 == ~cond); {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,146 INFO L290 TraceCheckUtils]: 14: Hoare triple {1561#(<= ~counter~0 0)} assume true; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,146 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {1561#(<= ~counter~0 0)} {1561#(<= ~counter~0 0)} #92#return; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,147 INFO L290 TraceCheckUtils]: 16: Hoare triple {1561#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {1561#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:05,148 INFO L290 TraceCheckUtils]: 17: Hoare triple {1561#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:05,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {1610#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:05,149 INFO L272 TraceCheckUtils]: 19: Hoare triple {1610#(<= ~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)); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:05,149 INFO L290 TraceCheckUtils]: 20: Hoare triple {1610#(<= ~counter~0 1)} ~cond := #in~cond; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:05,149 INFO L290 TraceCheckUtils]: 21: Hoare triple {1610#(<= ~counter~0 1)} assume !(0 == ~cond); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:05,150 INFO L290 TraceCheckUtils]: 22: Hoare triple {1610#(<= ~counter~0 1)} assume true; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:05,151 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {1610#(<= ~counter~0 1)} {1610#(<= ~counter~0 1)} #94#return; {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:05,151 INFO L290 TraceCheckUtils]: 24: Hoare triple {1610#(<= ~counter~0 1)} assume !!(0 != ~r~0); {1610#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:05,152 INFO L290 TraceCheckUtils]: 25: Hoare triple {1610#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {1635#(<= |main_#t~post7| 1)} is VALID [2022-04-15 15:11:05,152 INFO L290 TraceCheckUtils]: 26: Hoare triple {1635#(<= |main_#t~post7| 1)} assume !(#t~post7 < 100);havoc #t~post7; {1554#false} is VALID [2022-04-15 15:11:05,152 INFO L290 TraceCheckUtils]: 27: Hoare triple {1554#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {1554#false} is VALID [2022-04-15 15:11:05,152 INFO L290 TraceCheckUtils]: 28: Hoare triple {1554#false} assume !(#t~post8 < 100);havoc #t~post8; {1554#false} is VALID [2022-04-15 15:11:05,152 INFO L290 TraceCheckUtils]: 29: Hoare triple {1554#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {1554#false} is VALID [2022-04-15 15:11:05,152 INFO L290 TraceCheckUtils]: 30: Hoare triple {1554#false} assume !(#t~post6 < 100);havoc #t~post6; {1554#false} is VALID [2022-04-15 15:11:05,153 INFO L272 TraceCheckUtils]: 31: Hoare triple {1554#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)); {1554#false} is VALID [2022-04-15 15:11:05,153 INFO L290 TraceCheckUtils]: 32: Hoare triple {1554#false} ~cond := #in~cond; {1554#false} is VALID [2022-04-15 15:11:05,153 INFO L290 TraceCheckUtils]: 33: Hoare triple {1554#false} assume 0 == ~cond; {1554#false} is VALID [2022-04-15 15:11:05,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {1554#false} assume !false; {1554#false} is VALID [2022-04-15 15:11:05,153 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:05,153 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:05,154 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:05,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [918280219] [2022-04-15 15:11:05,154 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:05,154 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962395240] [2022-04-15 15:11:05,154 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962395240] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:05,154 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:05,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:05,155 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:05,155 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [891435632] [2022-04-15 15:11:05,155 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [891435632] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:05,155 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:05,155 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-04-15 15:11:05,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [426490753] [2022-04-15 15:11:05,155 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:05,157 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 35 [2022-04-15 15:11:05,158 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:05,158 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-15 15:11:05,184 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:05,184 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-04-15 15:11:05,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:05,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-04-15 15:11:05,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:11:05,185 INFO L87 Difference]: Start difference. First operand 52 states and 66 transitions. Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-15 15:11:05,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:05,313 INFO L93 Difference]: Finished difference Result 97 states and 125 transitions. [2022-04-15 15:11:05,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:11:05,313 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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 35 [2022-04-15 15:11:05,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:05,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-15 15:11:05,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 15:11:05,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-15 15:11:05,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-04-15 15:11:05,317 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-04-15 15:11:05,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:05,378 INFO L225 Difference]: With dead ends: 97 [2022-04-15 15:11:05,378 INFO L226 Difference]: Without dead ends: 60 [2022-04-15 15:11:05,379 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:11:05,379 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 6 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 14 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 14 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:05,380 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 103 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 14 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:05,380 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-04-15 15:11:05,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-04-15 15:11:05,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:05,409 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 15:11:05,409 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 15:11:05,410 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 15:11:05,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:05,412 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 15:11:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 15:11:05,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:05,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:05,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 15:11:05,413 INFO L87 Difference]: Start difference. First operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) Second operand 60 states. [2022-04-15 15:11:05,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:05,416 INFO L93 Difference]: Finished difference Result 60 states and 74 transitions. [2022-04-15 15:11:05,416 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 15:11:05,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:05,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:05,416 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:05,416 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:05,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 42 states have (on average 1.2380952380952381) internal successors, (52), 42 states have internal predecessors, (52), 12 states have call successors, (12), 7 states have call predecessors, (12), 5 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2022-04-15 15:11:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 74 transitions. [2022-04-15 15:11:05,419 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 74 transitions. Word has length 35 [2022-04-15 15:11:05,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:05,419 INFO L478 AbstractCegarLoop]: Abstraction has 60 states and 74 transitions. [2022-04-15 15:11:05,419 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.4) internal successors, (22), 4 states have internal predecessors, (22), 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-15 15:11:05,419 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 60 states and 74 transitions. [2022-04-15 15:11:06,869 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-15 15:11:06,870 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 74 transitions. [2022-04-15 15:11:06,870 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-04-15 15:11:06,870 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:06,871 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:06,877 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-15 15:11:07,071 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-15 15:11:07,071 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:07,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:07,072 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 1 times [2022-04-15 15:11:07,072 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:07,072 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1900504676] [2022-04-15 15:11:07,072 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:07,073 INFO L85 PathProgramCache]: Analyzing trace with hash -174895632, now seen corresponding path program 2 times [2022-04-15 15:11:07,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:07,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791391458] [2022-04-15 15:11:07,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:07,073 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:07,085 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:07,086 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [527212693] [2022-04-15 15:11:07,086 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:07,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:07,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:07,087 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-15 15:11:07,115 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-15 15:11:07,142 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:07,142 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:07,143 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:11:07,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:07,161 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:07,380 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-15 15:11:07,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#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; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,382 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2104#(<= ~counter~0 0)} {2096#true} #102#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,382 INFO L272 TraceCheckUtils]: 4: Hoare triple {2104#(<= ~counter~0 0)} call #t~ret9 := main(); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {2104#(<= ~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; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,383 INFO L272 TraceCheckUtils]: 6: Hoare triple {2104#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,385 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #90#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,386 INFO L272 TraceCheckUtils]: 11: Hoare triple {2104#(<= ~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)); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,386 INFO L290 TraceCheckUtils]: 12: Hoare triple {2104#(<= ~counter~0 0)} ~cond := #in~cond; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,386 INFO L290 TraceCheckUtils]: 13: Hoare triple {2104#(<= ~counter~0 0)} assume !(0 == ~cond); {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,387 INFO L290 TraceCheckUtils]: 14: Hoare triple {2104#(<= ~counter~0 0)} assume true; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,388 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2104#(<= ~counter~0 0)} {2104#(<= ~counter~0 0)} #92#return; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,388 INFO L290 TraceCheckUtils]: 16: Hoare triple {2104#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2104#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:07,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {2104#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:07,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {2153#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:07,390 INFO L272 TraceCheckUtils]: 19: Hoare triple {2153#(<= ~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)); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:07,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {2153#(<= ~counter~0 1)} ~cond := #in~cond; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:07,391 INFO L290 TraceCheckUtils]: 21: Hoare triple {2153#(<= ~counter~0 1)} assume !(0 == ~cond); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:07,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {2153#(<= ~counter~0 1)} assume true; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:07,392 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2153#(<= ~counter~0 1)} {2153#(<= ~counter~0 1)} #94#return; {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:07,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {2153#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2153#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:07,393 INFO L290 TraceCheckUtils]: 25: Hoare triple {2153#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:07,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {2178#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:07,395 INFO L272 TraceCheckUtils]: 27: Hoare triple {2178#(<= ~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)); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:07,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {2178#(<= ~counter~0 2)} ~cond := #in~cond; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:07,396 INFO L290 TraceCheckUtils]: 29: Hoare triple {2178#(<= ~counter~0 2)} assume !(0 == ~cond); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:07,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {2178#(<= ~counter~0 2)} assume true; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:07,397 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2178#(<= ~counter~0 2)} {2178#(<= ~counter~0 2)} #96#return; {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:07,397 INFO L290 TraceCheckUtils]: 32: Hoare triple {2178#(<= ~counter~0 2)} assume !(~r~0 > 0); {2178#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:07,398 INFO L290 TraceCheckUtils]: 33: Hoare triple {2178#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2203#(<= |main_#t~post8| 2)} is VALID [2022-04-15 15:11:07,398 INFO L290 TraceCheckUtils]: 34: Hoare triple {2203#(<= |main_#t~post8| 2)} assume !(#t~post8 < 100);havoc #t~post8; {2097#false} is VALID [2022-04-15 15:11:07,398 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-15 15:11:07,398 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 100);havoc #t~post6; {2097#false} is VALID [2022-04-15 15:11:07,399 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#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)); {2097#false} is VALID [2022-04-15 15:11:07,399 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-15 15:11:07,399 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-15 15:11:07,399 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-15 15:11:07,399 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:07,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:07,653 INFO L290 TraceCheckUtils]: 40: Hoare triple {2097#false} assume !false; {2097#false} is VALID [2022-04-15 15:11:07,654 INFO L290 TraceCheckUtils]: 39: Hoare triple {2097#false} assume 0 == ~cond; {2097#false} is VALID [2022-04-15 15:11:07,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {2097#false} ~cond := #in~cond; {2097#false} is VALID [2022-04-15 15:11:07,654 INFO L272 TraceCheckUtils]: 37: Hoare triple {2097#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)); {2097#false} is VALID [2022-04-15 15:11:07,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {2097#false} assume !(#t~post6 < 100);havoc #t~post6; {2097#false} is VALID [2022-04-15 15:11:07,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {2097#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2097#false} is VALID [2022-04-15 15:11:07,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {2243#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {2097#false} is VALID [2022-04-15 15:11:07,655 INFO L290 TraceCheckUtils]: 33: Hoare triple {2247#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2243#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:11:07,655 INFO L290 TraceCheckUtils]: 32: Hoare triple {2247#(< ~counter~0 100)} assume !(~r~0 > 0); {2247#(< ~counter~0 100)} is VALID [2022-04-15 15:11:07,656 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2096#true} {2247#(< ~counter~0 100)} #96#return; {2247#(< ~counter~0 100)} is VALID [2022-04-15 15:11:07,656 INFO L290 TraceCheckUtils]: 30: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:11:07,657 INFO L290 TraceCheckUtils]: 29: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:11:07,657 INFO L290 TraceCheckUtils]: 28: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:11:07,657 INFO L272 TraceCheckUtils]: 27: Hoare triple {2247#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 15:11:07,657 INFO L290 TraceCheckUtils]: 26: Hoare triple {2247#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {2247#(< ~counter~0 100)} is VALID [2022-04-15 15:11:07,658 INFO L290 TraceCheckUtils]: 25: Hoare triple {2272#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2247#(< ~counter~0 100)} is VALID [2022-04-15 15:11:07,658 INFO L290 TraceCheckUtils]: 24: Hoare triple {2272#(< ~counter~0 99)} assume !!(0 != ~r~0); {2272#(< ~counter~0 99)} is VALID [2022-04-15 15:11:07,659 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2096#true} {2272#(< ~counter~0 99)} #94#return; {2272#(< ~counter~0 99)} is VALID [2022-04-15 15:11:07,659 INFO L290 TraceCheckUtils]: 22: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:11:07,659 INFO L290 TraceCheckUtils]: 21: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:11:07,659 INFO L290 TraceCheckUtils]: 20: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:11:07,660 INFO L272 TraceCheckUtils]: 19: Hoare triple {2272#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 15:11:07,660 INFO L290 TraceCheckUtils]: 18: Hoare triple {2272#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {2272#(< ~counter~0 99)} is VALID [2022-04-15 15:11:07,661 INFO L290 TraceCheckUtils]: 17: Hoare triple {2297#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2272#(< ~counter~0 99)} is VALID [2022-04-15 15:11:07,661 INFO L290 TraceCheckUtils]: 16: Hoare triple {2297#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2297#(< ~counter~0 98)} is VALID [2022-04-15 15:11:07,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2096#true} {2297#(< ~counter~0 98)} #92#return; {2297#(< ~counter~0 98)} is VALID [2022-04-15 15:11:07,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:11:07,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:11:07,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:11:07,662 INFO L272 TraceCheckUtils]: 11: Hoare triple {2297#(< ~counter~0 98)} 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)); {2096#true} is VALID [2022-04-15 15:11:07,663 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2096#true} {2297#(< ~counter~0 98)} #90#return; {2297#(< ~counter~0 98)} is VALID [2022-04-15 15:11:07,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {2096#true} assume true; {2096#true} is VALID [2022-04-15 15:11:07,663 INFO L290 TraceCheckUtils]: 8: Hoare triple {2096#true} assume !(0 == ~cond); {2096#true} is VALID [2022-04-15 15:11:07,663 INFO L290 TraceCheckUtils]: 7: Hoare triple {2096#true} ~cond := #in~cond; {2096#true} is VALID [2022-04-15 15:11:07,663 INFO L272 TraceCheckUtils]: 6: Hoare triple {2297#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2096#true} is VALID [2022-04-15 15:11:07,664 INFO L290 TraceCheckUtils]: 5: Hoare triple {2297#(< ~counter~0 98)} 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; {2297#(< ~counter~0 98)} is VALID [2022-04-15 15:11:07,664 INFO L272 TraceCheckUtils]: 4: Hoare triple {2297#(< ~counter~0 98)} call #t~ret9 := main(); {2297#(< ~counter~0 98)} is VALID [2022-04-15 15:11:07,665 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2297#(< ~counter~0 98)} {2096#true} #102#return; {2297#(< ~counter~0 98)} is VALID [2022-04-15 15:11:07,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {2297#(< ~counter~0 98)} assume true; {2297#(< ~counter~0 98)} is VALID [2022-04-15 15:11:07,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {2096#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; {2297#(< ~counter~0 98)} is VALID [2022-04-15 15:11:07,666 INFO L272 TraceCheckUtils]: 0: Hoare triple {2096#true} call ULTIMATE.init(); {2096#true} is VALID [2022-04-15 15:11:07,666 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 15:11:07,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:07,666 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791391458] [2022-04-15 15:11:07,667 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:07,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [527212693] [2022-04-15 15:11:07,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [527212693] provided 1 perfect and 1 imperfect interpolant sequences [2022-04-15 15:11:07,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:11:07,667 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6] total 10 [2022-04-15 15:11:07,667 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:07,667 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1900504676] [2022-04-15 15:11:07,667 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1900504676] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:07,667 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:07,668 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:11:07,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [65940999] [2022-04-15 15:11:07,668 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:07,668 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 15:11:07,668 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:07,668 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:07,697 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-15 15:11:07,697 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:11:07,697 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:07,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:11:07,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:11:07,698 INFO L87 Difference]: Start difference. First operand 60 states and 74 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:07,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:07,903 INFO L93 Difference]: Finished difference Result 106 states and 135 transitions. [2022-04-15 15:11:07,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-04-15 15:11:07,903 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) Word has length 41 [2022-04-15 15:11:07,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:07,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:07,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 15:11:07,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:07,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-04-15 15:11:07,908 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-04-15 15:11:07,972 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:07,974 INFO L225 Difference]: With dead ends: 106 [2022-04-15 15:11:07,974 INFO L226 Difference]: Without dead ends: 69 [2022-04-15 15:11:07,974 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:11:07,975 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 31 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:07,975 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 109 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:07,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-04-15 15:11:08,036 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 68. [2022-04-15 15:11:08,036 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:08,037 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:08,037 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:08,037 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:08,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:08,040 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 15:11:08,040 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 15:11:08,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:08,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:08,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-15 15:11:08,041 INFO L87 Difference]: Start difference. First operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 69 states. [2022-04-15 15:11:08,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:08,043 INFO L93 Difference]: Finished difference Result 69 states and 84 transitions. [2022-04-15 15:11:08,043 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 84 transitions. [2022-04-15 15:11:08,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:08,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:08,044 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:08,044 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:08,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 48 states have (on average 1.2291666666666667) internal successors, (59), 48 states have internal predecessors, (59), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:08,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 83 transitions. [2022-04-15 15:11:08,046 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 83 transitions. Word has length 41 [2022-04-15 15:11:08,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:08,046 INFO L478 AbstractCegarLoop]: Abstraction has 68 states and 83 transitions. [2022-04-15 15:11:08,047 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 5 states have call successors, (7), 3 states have call predecessors, (7), 2 states have return successors, (5), 3 states have call predecessors, (5), 4 states have call successors, (5) [2022-04-15 15:11:08,047 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 68 states and 83 transitions. [2022-04-15 15:11:10,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 82 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:10,164 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 83 transitions. [2022-04-15 15:11:10,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-04-15 15:11:10,164 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:10,164 INFO L499 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:10,193 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-15 15:11:10,365 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-15 15:11:10,365 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:10,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 1 times [2022-04-15 15:11:10,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:10,366 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [700773092] [2022-04-15 15:11:10,366 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:10,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1292932747, now seen corresponding path program 2 times [2022-04-15 15:11:10,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:10,367 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [847974707] [2022-04-15 15:11:10,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:10,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:10,387 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:10,387 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1009801890] [2022-04-15 15:11:10,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:10,388 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:10,388 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:10,392 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-15 15:11:10,409 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-15 15:11:10,464 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:10,464 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:10,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:11:10,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:10,485 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:10,747 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-15 15:11:10,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#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; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,750 INFO L290 TraceCheckUtils]: 2: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,750 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {2845#(<= ~counter~0 0)} {2837#true} #102#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,751 INFO L272 TraceCheckUtils]: 4: Hoare triple {2845#(<= ~counter~0 0)} call #t~ret9 := main(); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {2845#(<= ~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; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,754 INFO L272 TraceCheckUtils]: 6: Hoare triple {2845#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,757 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #90#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,757 INFO L272 TraceCheckUtils]: 11: Hoare triple {2845#(<= ~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)); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,763 INFO L290 TraceCheckUtils]: 12: Hoare triple {2845#(<= ~counter~0 0)} ~cond := #in~cond; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,764 INFO L290 TraceCheckUtils]: 13: Hoare triple {2845#(<= ~counter~0 0)} assume !(0 == ~cond); {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,764 INFO L290 TraceCheckUtils]: 14: Hoare triple {2845#(<= ~counter~0 0)} assume true; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,764 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2845#(<= ~counter~0 0)} {2845#(<= ~counter~0 0)} #92#return; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,765 INFO L290 TraceCheckUtils]: 16: Hoare triple {2845#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {2845#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:10,765 INFO L290 TraceCheckUtils]: 17: Hoare triple {2845#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:10,766 INFO L290 TraceCheckUtils]: 18: Hoare triple {2894#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:10,767 INFO L272 TraceCheckUtils]: 19: Hoare triple {2894#(<= ~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)); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:10,767 INFO L290 TraceCheckUtils]: 20: Hoare triple {2894#(<= ~counter~0 1)} ~cond := #in~cond; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:10,767 INFO L290 TraceCheckUtils]: 21: Hoare triple {2894#(<= ~counter~0 1)} assume !(0 == ~cond); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:10,768 INFO L290 TraceCheckUtils]: 22: Hoare triple {2894#(<= ~counter~0 1)} assume true; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:10,768 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2894#(<= ~counter~0 1)} {2894#(<= ~counter~0 1)} #94#return; {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:10,769 INFO L290 TraceCheckUtils]: 24: Hoare triple {2894#(<= ~counter~0 1)} assume !!(0 != ~r~0); {2894#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:10,769 INFO L290 TraceCheckUtils]: 25: Hoare triple {2894#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:10,769 INFO L290 TraceCheckUtils]: 26: Hoare triple {2919#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:10,770 INFO L272 TraceCheckUtils]: 27: Hoare triple {2919#(<= ~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)); {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:10,770 INFO L290 TraceCheckUtils]: 28: Hoare triple {2919#(<= ~counter~0 2)} ~cond := #in~cond; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:10,771 INFO L290 TraceCheckUtils]: 29: Hoare triple {2919#(<= ~counter~0 2)} assume !(0 == ~cond); {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:10,771 INFO L290 TraceCheckUtils]: 30: Hoare triple {2919#(<= ~counter~0 2)} assume true; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:10,772 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2919#(<= ~counter~0 2)} {2919#(<= ~counter~0 2)} #96#return; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:10,772 INFO L290 TraceCheckUtils]: 32: Hoare triple {2919#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {2919#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:10,773 INFO L290 TraceCheckUtils]: 33: Hoare triple {2919#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2944#(<= |main_#t~post7| 2)} is VALID [2022-04-15 15:11:10,773 INFO L290 TraceCheckUtils]: 34: Hoare triple {2944#(<= |main_#t~post7| 2)} assume !(#t~post7 < 100);havoc #t~post7; {2838#false} is VALID [2022-04-15 15:11:10,773 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-15 15:11:10,773 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 100);havoc #t~post8; {2838#false} is VALID [2022-04-15 15:11:10,773 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-15 15:11:10,774 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 100);havoc #t~post6; {2838#false} is VALID [2022-04-15 15:11:10,774 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#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)); {2838#false} is VALID [2022-04-15 15:11:10,774 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-15 15:11:10,774 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-15 15:11:10,774 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-15 15:11:10,774 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:10,774 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:10,999 INFO L290 TraceCheckUtils]: 42: Hoare triple {2838#false} assume !false; {2838#false} is VALID [2022-04-15 15:11:10,999 INFO L290 TraceCheckUtils]: 41: Hoare triple {2838#false} assume 0 == ~cond; {2838#false} is VALID [2022-04-15 15:11:10,999 INFO L290 TraceCheckUtils]: 40: Hoare triple {2838#false} ~cond := #in~cond; {2838#false} is VALID [2022-04-15 15:11:10,999 INFO L272 TraceCheckUtils]: 39: Hoare triple {2838#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)); {2838#false} is VALID [2022-04-15 15:11:11,000 INFO L290 TraceCheckUtils]: 38: Hoare triple {2838#false} assume !(#t~post6 < 100);havoc #t~post6; {2838#false} is VALID [2022-04-15 15:11:11,000 INFO L290 TraceCheckUtils]: 37: Hoare triple {2838#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {2838#false} is VALID [2022-04-15 15:11:11,000 INFO L290 TraceCheckUtils]: 36: Hoare triple {2838#false} assume !(#t~post8 < 100);havoc #t~post8; {2838#false} is VALID [2022-04-15 15:11:11,000 INFO L290 TraceCheckUtils]: 35: Hoare triple {2838#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {2838#false} is VALID [2022-04-15 15:11:11,001 INFO L290 TraceCheckUtils]: 34: Hoare triple {2996#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {2838#false} is VALID [2022-04-15 15:11:11,001 INFO L290 TraceCheckUtils]: 33: Hoare triple {3000#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {2996#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:11:11,001 INFO L290 TraceCheckUtils]: 32: Hoare triple {3000#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {3000#(< ~counter~0 100)} is VALID [2022-04-15 15:11:11,002 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {2837#true} {3000#(< ~counter~0 100)} #96#return; {3000#(< ~counter~0 100)} is VALID [2022-04-15 15:11:11,002 INFO L290 TraceCheckUtils]: 30: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:11:11,004 INFO L290 TraceCheckUtils]: 29: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:11:11,004 INFO L290 TraceCheckUtils]: 28: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:11:11,005 INFO L272 TraceCheckUtils]: 27: Hoare triple {3000#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 15:11:11,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {3000#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {3000#(< ~counter~0 100)} is VALID [2022-04-15 15:11:11,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {3025#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3000#(< ~counter~0 100)} is VALID [2022-04-15 15:11:11,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {3025#(< ~counter~0 99)} assume !!(0 != ~r~0); {3025#(< ~counter~0 99)} is VALID [2022-04-15 15:11:11,006 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {2837#true} {3025#(< ~counter~0 99)} #94#return; {3025#(< ~counter~0 99)} is VALID [2022-04-15 15:11:11,010 INFO L290 TraceCheckUtils]: 22: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:11:11,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:11:11,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:11:11,011 INFO L272 TraceCheckUtils]: 19: Hoare triple {3025#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 15:11:11,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {3025#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {3025#(< ~counter~0 99)} is VALID [2022-04-15 15:11:11,012 INFO L290 TraceCheckUtils]: 17: Hoare triple {3050#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3025#(< ~counter~0 99)} is VALID [2022-04-15 15:11:11,012 INFO L290 TraceCheckUtils]: 16: Hoare triple {3050#(< ~counter~0 98)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3050#(< ~counter~0 98)} is VALID [2022-04-15 15:11:11,013 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {2837#true} {3050#(< ~counter~0 98)} #92#return; {3050#(< ~counter~0 98)} is VALID [2022-04-15 15:11:11,013 INFO L290 TraceCheckUtils]: 14: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:11:11,013 INFO L290 TraceCheckUtils]: 13: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:11:11,013 INFO L290 TraceCheckUtils]: 12: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:11:11,013 INFO L272 TraceCheckUtils]: 11: Hoare triple {3050#(< ~counter~0 98)} 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)); {2837#true} is VALID [2022-04-15 15:11:11,014 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {2837#true} {3050#(< ~counter~0 98)} #90#return; {3050#(< ~counter~0 98)} is VALID [2022-04-15 15:11:11,014 INFO L290 TraceCheckUtils]: 9: Hoare triple {2837#true} assume true; {2837#true} is VALID [2022-04-15 15:11:11,014 INFO L290 TraceCheckUtils]: 8: Hoare triple {2837#true} assume !(0 == ~cond); {2837#true} is VALID [2022-04-15 15:11:11,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {2837#true} ~cond := #in~cond; {2837#true} is VALID [2022-04-15 15:11:11,014 INFO L272 TraceCheckUtils]: 6: Hoare triple {3050#(< ~counter~0 98)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {2837#true} is VALID [2022-04-15 15:11:11,015 INFO L290 TraceCheckUtils]: 5: Hoare triple {3050#(< ~counter~0 98)} 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; {3050#(< ~counter~0 98)} is VALID [2022-04-15 15:11:11,015 INFO L272 TraceCheckUtils]: 4: Hoare triple {3050#(< ~counter~0 98)} call #t~ret9 := main(); {3050#(< ~counter~0 98)} is VALID [2022-04-15 15:11:11,015 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3050#(< ~counter~0 98)} {2837#true} #102#return; {3050#(< ~counter~0 98)} is VALID [2022-04-15 15:11:11,016 INFO L290 TraceCheckUtils]: 2: Hoare triple {3050#(< ~counter~0 98)} assume true; {3050#(< ~counter~0 98)} is VALID [2022-04-15 15:11:11,016 INFO L290 TraceCheckUtils]: 1: Hoare triple {2837#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; {3050#(< ~counter~0 98)} is VALID [2022-04-15 15:11:11,016 INFO L272 TraceCheckUtils]: 0: Hoare triple {2837#true} call ULTIMATE.init(); {2837#true} is VALID [2022-04-15 15:11:11,017 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 6 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2022-04-15 15:11:11,017 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [847974707] [2022-04-15 15:11:11,017 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:11,017 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1009801890] [2022-04-15 15:11:11,017 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1009801890] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:11,017 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:11,017 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 15:11:11,018 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:11,018 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [700773092] [2022-04-15 15:11:11,018 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [700773092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:11,018 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:11,018 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:11:11,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401493488] [2022-04-15 15:11:11,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:11,019 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 43 [2022-04-15 15:11:11,019 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:11,019 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-15 15:11:11,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:11,047 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:11:11,047 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:11,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:11:11,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:11:11,048 INFO L87 Difference]: Start difference. First operand 68 states and 83 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-15 15:11:11,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:11,246 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-04-15 15:11:11,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 15:11:11,246 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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 43 [2022-04-15 15:11:11,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:11,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-15 15:11:11,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 15:11:11,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-15 15:11:11,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 87 transitions. [2022-04-15 15:11:11,250 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 87 transitions. [2022-04-15 15:11:11,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:11,326 INFO L225 Difference]: With dead ends: 91 [2022-04-15 15:11:11,326 INFO L226 Difference]: Without dead ends: 70 [2022-04-15 15:11:11,327 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2022-04-15 15:11:11,327 INFO L913 BasicCegarLoop]: 38 mSDtfsCounter, 9 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:11,328 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:11,328 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-04-15 15:11:11,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2022-04-15 15:11:11,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:11,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:11,404 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:11,405 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:11,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:11,407 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-15 15:11:11,407 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 15:11:11,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:11,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:11,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-15 15:11:11,408 INFO L87 Difference]: Start difference. First operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) Second operand 70 states. [2022-04-15 15:11:11,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:11,410 INFO L93 Difference]: Finished difference Result 70 states and 85 transitions. [2022-04-15 15:11:11,410 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 15:11:11,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:11,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:11,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:11,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:11,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 50 states have (on average 1.22) internal successors, (61), 50 states have internal predecessors, (61), 13 states have call successors, (13), 8 states have call predecessors, (13), 6 states have return successors, (11), 11 states have call predecessors, (11), 11 states have call successors, (11) [2022-04-15 15:11:11,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 85 transitions. [2022-04-15 15:11:11,413 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 85 transitions. Word has length 43 [2022-04-15 15:11:11,414 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:11,414 INFO L478 AbstractCegarLoop]: Abstraction has 70 states and 85 transitions. [2022-04-15 15:11:11,414 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 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-15 15:11:11,414 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 70 states and 85 transitions. [2022-04-15 15:11:11,944 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-15 15:11:11,945 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 85 transitions. [2022-04-15 15:11:11,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2022-04-15 15:11:11,945 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:11,945 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:11,961 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-04-15 15:11:12,147 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-15 15:11:12,147 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:12,148 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 1 times [2022-04-15 15:11:12,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:12,148 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [340613805] [2022-04-15 15:11:12,148 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:12,148 INFO L85 PathProgramCache]: Analyzing trace with hash 1407897436, now seen corresponding path program 2 times [2022-04-15 15:11:12,149 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:12,149 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [927596954] [2022-04-15 15:11:12,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:12,149 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:12,170 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:12,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [457342174] [2022-04-15 15:11:12,171 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:12,171 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:12,171 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:12,177 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-15 15:11:12,178 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-15 15:11:12,235 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:12,235 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:12,236 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:11:12,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:12,247 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:12,428 INFO L272 TraceCheckUtils]: 0: Hoare triple {3568#true} call ULTIMATE.init(); {3568#true} is VALID [2022-04-15 15:11:12,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {3568#true} #NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2);call #Ultimate.allocInit(12, 3);~counter~0 := 0; {3568#true} is VALID [2022-04-15 15:11:12,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:12,429 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {3568#true} {3568#true} #102#return; {3568#true} is VALID [2022-04-15 15:11:12,429 INFO L272 TraceCheckUtils]: 4: Hoare triple {3568#true} call #t~ret9 := main(); {3568#true} is VALID [2022-04-15 15:11:12,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {3568#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; {3568#true} is VALID [2022-04-15 15:11:12,429 INFO L272 TraceCheckUtils]: 6: Hoare triple {3568#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {3568#true} is VALID [2022-04-15 15:11:12,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:12,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:12,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:12,430 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {3568#true} {3568#true} #90#return; {3568#true} is VALID [2022-04-15 15:11:12,430 INFO L272 TraceCheckUtils]: 11: Hoare triple {3568#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)); {3568#true} is VALID [2022-04-15 15:11:12,430 INFO L290 TraceCheckUtils]: 12: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:12,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:12,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:12,430 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {3568#true} {3568#true} #92#return; {3568#true} is VALID [2022-04-15 15:11:12,430 INFO L290 TraceCheckUtils]: 16: Hoare triple {3568#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {3568#true} is VALID [2022-04-15 15:11:12,430 INFO L290 TraceCheckUtils]: 17: Hoare triple {3568#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3568#true} is VALID [2022-04-15 15:11:12,431 INFO L290 TraceCheckUtils]: 18: Hoare triple {3568#true} assume !!(#t~post6 < 100);havoc #t~post6; {3568#true} is VALID [2022-04-15 15:11:12,431 INFO L272 TraceCheckUtils]: 19: Hoare triple {3568#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)); {3568#true} is VALID [2022-04-15 15:11:12,431 INFO L290 TraceCheckUtils]: 20: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:12,431 INFO L290 TraceCheckUtils]: 21: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:12,431 INFO L290 TraceCheckUtils]: 22: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:12,431 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {3568#true} {3568#true} #94#return; {3568#true} is VALID [2022-04-15 15:11:12,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {3568#true} assume !!(0 != ~r~0); {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:11:12,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {3645#(not (= main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:11:12,432 INFO L290 TraceCheckUtils]: 26: Hoare triple {3645#(not (= main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:11:12,432 INFO L272 TraceCheckUtils]: 27: Hoare triple {3645#(not (= main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3568#true} is VALID [2022-04-15 15:11:12,433 INFO L290 TraceCheckUtils]: 28: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:12,433 INFO L290 TraceCheckUtils]: 29: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:12,433 INFO L290 TraceCheckUtils]: 30: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:12,433 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {3568#true} {3645#(not (= main_~r~0 0))} #96#return; {3645#(not (= main_~r~0 0))} is VALID [2022-04-15 15:11:12,434 INFO L290 TraceCheckUtils]: 32: Hoare triple {3645#(not (= main_~r~0 0))} assume !(~r~0 > 0); {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:11:12,434 INFO L290 TraceCheckUtils]: 33: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:11:12,435 INFO L290 TraceCheckUtils]: 34: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !!(#t~post8 < 100);havoc #t~post8; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:11:12,435 INFO L272 TraceCheckUtils]: 35: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {3568#true} is VALID [2022-04-15 15:11:12,435 INFO L290 TraceCheckUtils]: 36: Hoare triple {3568#true} ~cond := #in~cond; {3568#true} is VALID [2022-04-15 15:11:12,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {3568#true} assume !(0 == ~cond); {3568#true} is VALID [2022-04-15 15:11:12,435 INFO L290 TraceCheckUtils]: 38: Hoare triple {3568#true} assume true; {3568#true} is VALID [2022-04-15 15:11:12,441 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {3568#true} {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} #98#return; {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:11:12,442 INFO L290 TraceCheckUtils]: 40: Hoare triple {3670#(and (not (= main_~r~0 0)) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {3569#false} is VALID [2022-04-15 15:11:12,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {3569#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {3569#false} is VALID [2022-04-15 15:11:12,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {3569#false} assume !(#t~post6 < 100);havoc #t~post6; {3569#false} is VALID [2022-04-15 15:11:12,442 INFO L272 TraceCheckUtils]: 43: Hoare triple {3569#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)); {3569#false} is VALID [2022-04-15 15:11:12,442 INFO L290 TraceCheckUtils]: 44: Hoare triple {3569#false} ~cond := #in~cond; {3569#false} is VALID [2022-04-15 15:11:12,442 INFO L290 TraceCheckUtils]: 45: Hoare triple {3569#false} assume 0 == ~cond; {3569#false} is VALID [2022-04-15 15:11:12,442 INFO L290 TraceCheckUtils]: 46: Hoare triple {3569#false} assume !false; {3569#false} is VALID [2022-04-15 15:11:12,443 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 15:11:12,443 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:12,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:12,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [927596954] [2022-04-15 15:11:12,443 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:12,443 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [457342174] [2022-04-15 15:11:12,443 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [457342174] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:12,443 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:12,443 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:12,444 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:12,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [340613805] [2022-04-15 15:11:12,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [340613805] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:12,444 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:12,444 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:12,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1231818860] [2022-04-15 15:11:12,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:12,445 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 15:11:12,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:12,445 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:12,476 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-15 15:11:12,476 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:11:12,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:12,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:11:12,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:12,477 INFO L87 Difference]: Start difference. First operand 70 states and 85 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:12,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:12,645 INFO L93 Difference]: Finished difference Result 123 states and 161 transitions. [2022-04-15 15:11:12,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:11:12,645 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 47 [2022-04-15 15:11:12,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:12,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:12,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 15:11:12,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 108 transitions. [2022-04-15 15:11:12,650 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 108 transitions. [2022-04-15 15:11:12,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:12,747 INFO L225 Difference]: With dead ends: 123 [2022-04-15 15:11:12,747 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 15:11:12,748 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:12,748 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 19 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:12,748 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 101 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:12,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 15:11:12,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 75. [2022-04-15 15:11:12,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:12,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 75 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:11:12,827 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 75 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:11:12,827 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 75 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:11:12,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:12,830 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-15 15:11:12,830 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 15:11:12,830 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:12,831 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:12,831 INFO L74 IsIncluded]: Start isIncluded. First operand has 75 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 86 states. [2022-04-15 15:11:12,838 INFO L87 Difference]: Start difference. First operand has 75 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) Second operand 86 states. [2022-04-15 15:11:12,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:12,842 INFO L93 Difference]: Finished difference Result 86 states and 108 transitions. [2022-04-15 15:11:12,842 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 108 transitions. [2022-04-15 15:11:12,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:12,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:12,842 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:12,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:12,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 54 states have internal predecessors, (64), 15 states have call successors, (15), 8 states have call predecessors, (15), 6 states have return successors, (13), 12 states have call predecessors, (13), 13 states have call successors, (13) [2022-04-15 15:11:12,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 92 transitions. [2022-04-15 15:11:12,846 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 92 transitions. Word has length 47 [2022-04-15 15:11:12,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:12,847 INFO L478 AbstractCegarLoop]: Abstraction has 75 states and 92 transitions. [2022-04-15 15:11:12,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 4 states have call successors, (8), 2 states have call predecessors, (8), 1 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2022-04-15 15:11:12,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 75 states and 92 transitions. [2022-04-15 15:11:14,950 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 92 edges. 91 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:14,950 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 92 transitions. [2022-04-15 15:11:14,950 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-04-15 15:11:14,950 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:14,951 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 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, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:14,967 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:15,155 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-15 15:11:15,156 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:15,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:15,156 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 1 times [2022-04-15 15:11:15,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:15,156 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [467983773] [2022-04-15 15:11:15,156 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:15,157 INFO L85 PathProgramCache]: Analyzing trace with hash 1915058849, now seen corresponding path program 2 times [2022-04-15 15:11:15,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:15,157 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733719069] [2022-04-15 15:11:15,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:15,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:15,169 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:15,169 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [636242828] [2022-04-15 15:11:15,169 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:15,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:15,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:15,170 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-15 15:11:15,171 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-15 15:11:15,212 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:15,212 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:15,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:11:15,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:15,229 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:15,507 INFO L272 TraceCheckUtils]: 0: Hoare triple {4280#true} call ULTIMATE.init(); {4280#true} is VALID [2022-04-15 15:11:15,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {4280#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; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {4288#(<= ~counter~0 0)} assume true; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,509 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4288#(<= ~counter~0 0)} {4280#true} #102#return; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,510 INFO L272 TraceCheckUtils]: 4: Hoare triple {4288#(<= ~counter~0 0)} call #t~ret9 := main(); {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {4288#(<= ~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; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,514 INFO L272 TraceCheckUtils]: 6: Hoare triple {4288#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,515 INFO L290 TraceCheckUtils]: 7: Hoare triple {4288#(<= ~counter~0 0)} ~cond := #in~cond; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {4288#(<= ~counter~0 0)} assume !(0 == ~cond); {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {4288#(<= ~counter~0 0)} assume true; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,516 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4288#(<= ~counter~0 0)} {4288#(<= ~counter~0 0)} #90#return; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,516 INFO L272 TraceCheckUtils]: 11: Hoare triple {4288#(<= ~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)); {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,516 INFO L290 TraceCheckUtils]: 12: Hoare triple {4288#(<= ~counter~0 0)} ~cond := #in~cond; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,517 INFO L290 TraceCheckUtils]: 13: Hoare triple {4288#(<= ~counter~0 0)} assume !(0 == ~cond); {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,517 INFO L290 TraceCheckUtils]: 14: Hoare triple {4288#(<= ~counter~0 0)} assume true; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,517 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4288#(<= ~counter~0 0)} {4288#(<= ~counter~0 0)} #92#return; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,518 INFO L290 TraceCheckUtils]: 16: Hoare triple {4288#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4288#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:15,518 INFO L290 TraceCheckUtils]: 17: Hoare triple {4288#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4337#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:15,519 INFO L290 TraceCheckUtils]: 18: Hoare triple {4337#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {4337#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:15,519 INFO L272 TraceCheckUtils]: 19: Hoare triple {4337#(<= ~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)); {4337#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:15,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {4337#(<= ~counter~0 1)} ~cond := #in~cond; {4337#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:15,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {4337#(<= ~counter~0 1)} assume !(0 == ~cond); {4337#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:15,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {4337#(<= ~counter~0 1)} assume true; {4337#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:15,521 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4337#(<= ~counter~0 1)} {4337#(<= ~counter~0 1)} #94#return; {4337#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:15,521 INFO L290 TraceCheckUtils]: 24: Hoare triple {4337#(<= ~counter~0 1)} assume !!(0 != ~r~0); {4337#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:15,522 INFO L290 TraceCheckUtils]: 25: Hoare triple {4337#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4362#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:15,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {4362#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {4362#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:15,523 INFO L272 TraceCheckUtils]: 27: Hoare triple {4362#(<= ~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)); {4362#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:15,523 INFO L290 TraceCheckUtils]: 28: Hoare triple {4362#(<= ~counter~0 2)} ~cond := #in~cond; {4362#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:15,524 INFO L290 TraceCheckUtils]: 29: Hoare triple {4362#(<= ~counter~0 2)} assume !(0 == ~cond); {4362#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:15,524 INFO L290 TraceCheckUtils]: 30: Hoare triple {4362#(<= ~counter~0 2)} assume true; {4362#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:15,525 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4362#(<= ~counter~0 2)} {4362#(<= ~counter~0 2)} #96#return; {4362#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:15,525 INFO L290 TraceCheckUtils]: 32: Hoare triple {4362#(<= ~counter~0 2)} assume !(~r~0 > 0); {4362#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:15,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {4362#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4387#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:15,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {4387#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {4387#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:15,526 INFO L272 TraceCheckUtils]: 35: Hoare triple {4387#(<= ~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)); {4387#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:15,526 INFO L290 TraceCheckUtils]: 36: Hoare triple {4387#(<= ~counter~0 3)} ~cond := #in~cond; {4387#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:15,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {4387#(<= ~counter~0 3)} assume !(0 == ~cond); {4387#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:15,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {4387#(<= ~counter~0 3)} assume true; {4387#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:15,528 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4387#(<= ~counter~0 3)} {4387#(<= ~counter~0 3)} #98#return; {4387#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:15,528 INFO L290 TraceCheckUtils]: 40: Hoare triple {4387#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4387#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:15,528 INFO L290 TraceCheckUtils]: 41: Hoare triple {4387#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4412#(<= |main_#t~post8| 3)} is VALID [2022-04-15 15:11:15,529 INFO L290 TraceCheckUtils]: 42: Hoare triple {4412#(<= |main_#t~post8| 3)} assume !(#t~post8 < 100);havoc #t~post8; {4281#false} is VALID [2022-04-15 15:11:15,529 INFO L290 TraceCheckUtils]: 43: Hoare triple {4281#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4281#false} is VALID [2022-04-15 15:11:15,529 INFO L290 TraceCheckUtils]: 44: Hoare triple {4281#false} assume !(#t~post6 < 100);havoc #t~post6; {4281#false} is VALID [2022-04-15 15:11:15,529 INFO L272 TraceCheckUtils]: 45: Hoare triple {4281#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)); {4281#false} is VALID [2022-04-15 15:11:15,529 INFO L290 TraceCheckUtils]: 46: Hoare triple {4281#false} ~cond := #in~cond; {4281#false} is VALID [2022-04-15 15:11:15,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {4281#false} assume 0 == ~cond; {4281#false} is VALID [2022-04-15 15:11:15,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {4281#false} assume !false; {4281#false} is VALID [2022-04-15 15:11:15,529 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:15,530 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:15,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {4281#false} assume !false; {4281#false} is VALID [2022-04-15 15:11:15,800 INFO L290 TraceCheckUtils]: 47: Hoare triple {4281#false} assume 0 == ~cond; {4281#false} is VALID [2022-04-15 15:11:15,800 INFO L290 TraceCheckUtils]: 46: Hoare triple {4281#false} ~cond := #in~cond; {4281#false} is VALID [2022-04-15 15:11:15,800 INFO L272 TraceCheckUtils]: 45: Hoare triple {4281#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)); {4281#false} is VALID [2022-04-15 15:11:15,800 INFO L290 TraceCheckUtils]: 44: Hoare triple {4281#false} assume !(#t~post6 < 100);havoc #t~post6; {4281#false} is VALID [2022-04-15 15:11:15,800 INFO L290 TraceCheckUtils]: 43: Hoare triple {4281#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4281#false} is VALID [2022-04-15 15:11:15,801 INFO L290 TraceCheckUtils]: 42: Hoare triple {4452#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {4281#false} is VALID [2022-04-15 15:11:15,801 INFO L290 TraceCheckUtils]: 41: Hoare triple {4456#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4452#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:11:15,802 INFO L290 TraceCheckUtils]: 40: Hoare triple {4456#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {4456#(< ~counter~0 100)} is VALID [2022-04-15 15:11:15,804 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {4280#true} {4456#(< ~counter~0 100)} #98#return; {4456#(< ~counter~0 100)} is VALID [2022-04-15 15:11:15,804 INFO L290 TraceCheckUtils]: 38: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-15 15:11:15,804 INFO L290 TraceCheckUtils]: 37: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-15 15:11:15,804 INFO L290 TraceCheckUtils]: 36: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-15 15:11:15,804 INFO L272 TraceCheckUtils]: 35: Hoare triple {4456#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4280#true} is VALID [2022-04-15 15:11:15,805 INFO L290 TraceCheckUtils]: 34: Hoare triple {4456#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {4456#(< ~counter~0 100)} is VALID [2022-04-15 15:11:15,805 INFO L290 TraceCheckUtils]: 33: Hoare triple {4481#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {4456#(< ~counter~0 100)} is VALID [2022-04-15 15:11:15,806 INFO L290 TraceCheckUtils]: 32: Hoare triple {4481#(< ~counter~0 99)} assume !(~r~0 > 0); {4481#(< ~counter~0 99)} is VALID [2022-04-15 15:11:15,807 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {4280#true} {4481#(< ~counter~0 99)} #96#return; {4481#(< ~counter~0 99)} is VALID [2022-04-15 15:11:15,807 INFO L290 TraceCheckUtils]: 30: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-15 15:11:15,807 INFO L290 TraceCheckUtils]: 29: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-15 15:11:15,808 INFO L290 TraceCheckUtils]: 28: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-15 15:11:15,808 INFO L272 TraceCheckUtils]: 27: Hoare triple {4481#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4280#true} is VALID [2022-04-15 15:11:15,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {4481#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {4481#(< ~counter~0 99)} is VALID [2022-04-15 15:11:15,809 INFO L290 TraceCheckUtils]: 25: Hoare triple {4506#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {4481#(< ~counter~0 99)} is VALID [2022-04-15 15:11:15,809 INFO L290 TraceCheckUtils]: 24: Hoare triple {4506#(< ~counter~0 98)} assume !!(0 != ~r~0); {4506#(< ~counter~0 98)} is VALID [2022-04-15 15:11:15,810 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {4280#true} {4506#(< ~counter~0 98)} #94#return; {4506#(< ~counter~0 98)} is VALID [2022-04-15 15:11:15,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-15 15:11:15,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-15 15:11:15,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-15 15:11:15,811 INFO L272 TraceCheckUtils]: 19: Hoare triple {4506#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {4280#true} is VALID [2022-04-15 15:11:15,811 INFO L290 TraceCheckUtils]: 18: Hoare triple {4506#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {4506#(< ~counter~0 98)} is VALID [2022-04-15 15:11:15,812 INFO L290 TraceCheckUtils]: 17: Hoare triple {4531#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {4506#(< ~counter~0 98)} is VALID [2022-04-15 15:11:15,812 INFO L290 TraceCheckUtils]: 16: Hoare triple {4531#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {4531#(< ~counter~0 97)} is VALID [2022-04-15 15:11:15,813 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {4280#true} {4531#(< ~counter~0 97)} #92#return; {4531#(< ~counter~0 97)} is VALID [2022-04-15 15:11:15,813 INFO L290 TraceCheckUtils]: 14: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-15 15:11:15,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-15 15:11:15,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-15 15:11:15,813 INFO L272 TraceCheckUtils]: 11: Hoare triple {4531#(< ~counter~0 97)} 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)); {4280#true} is VALID [2022-04-15 15:11:15,814 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {4280#true} {4531#(< ~counter~0 97)} #90#return; {4531#(< ~counter~0 97)} is VALID [2022-04-15 15:11:15,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {4280#true} assume true; {4280#true} is VALID [2022-04-15 15:11:15,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {4280#true} assume !(0 == ~cond); {4280#true} is VALID [2022-04-15 15:11:15,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {4280#true} ~cond := #in~cond; {4280#true} is VALID [2022-04-15 15:11:15,814 INFO L272 TraceCheckUtils]: 6: Hoare triple {4531#(< ~counter~0 97)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {4280#true} is VALID [2022-04-15 15:11:15,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {4531#(< ~counter~0 97)} 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; {4531#(< ~counter~0 97)} is VALID [2022-04-15 15:11:15,816 INFO L272 TraceCheckUtils]: 4: Hoare triple {4531#(< ~counter~0 97)} call #t~ret9 := main(); {4531#(< ~counter~0 97)} is VALID [2022-04-15 15:11:15,816 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {4531#(< ~counter~0 97)} {4280#true} #102#return; {4531#(< ~counter~0 97)} is VALID [2022-04-15 15:11:15,817 INFO L290 TraceCheckUtils]: 2: Hoare triple {4531#(< ~counter~0 97)} assume true; {4531#(< ~counter~0 97)} is VALID [2022-04-15 15:11:15,817 INFO L290 TraceCheckUtils]: 1: Hoare triple {4280#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; {4531#(< ~counter~0 97)} is VALID [2022-04-15 15:11:15,818 INFO L272 TraceCheckUtils]: 0: Hoare triple {4280#true} call ULTIMATE.init(); {4280#true} is VALID [2022-04-15 15:11:15,818 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 8 proven. 2 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 15:11:15,818 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:15,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733719069] [2022-04-15 15:11:15,818 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:15,818 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [636242828] [2022-04-15 15:11:15,818 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [636242828] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:15,818 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:15,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 15:11:15,819 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:15,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [467983773] [2022-04-15 15:11:15,819 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [467983773] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:15,819 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:15,819 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 15:11:15,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847365295] [2022-04-15 15:11:15,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:15,820 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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 49 [2022-04-15 15:11:15,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:15,820 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-15 15:11:15,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:15,860 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 15:11:15,860 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:15,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 15:11:15,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 15:11:15,861 INFO L87 Difference]: Start difference. First operand 75 states and 92 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-15 15:11:16,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:16,142 INFO L93 Difference]: Finished difference Result 122 states and 156 transitions. [2022-04-15 15:11:16,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-04-15 15:11:16,142 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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 49 [2022-04-15 15:11:16,143 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:16,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-15 15:11:16,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 15:11:16,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-15 15:11:16,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 101 transitions. [2022-04-15 15:11:16,154 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 8 states and 101 transitions. [2022-04-15 15:11:16,239 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-15 15:11:16,240 INFO L225 Difference]: With dead ends: 122 [2022-04-15 15:11:16,240 INFO L226 Difference]: Without dead ends: 85 [2022-04-15 15:11:16,241 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 87 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-04-15 15:11:16,241 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 22 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 149 SdHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:16,242 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 149 Invalid, 56 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:16,242 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-04-15 15:11:16,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2022-04-15 15:11:16,319 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:16,319 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 84 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:16,319 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 84 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:16,320 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 84 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:16,322 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:16,322 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-15 15:11:16,322 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-15 15:11:16,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:16,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:16,322 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 85 states. [2022-04-15 15:11:16,323 INFO L87 Difference]: Start difference. First operand has 84 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 85 states. [2022-04-15 15:11:16,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:16,324 INFO L93 Difference]: Finished difference Result 85 states and 103 transitions. [2022-04-15 15:11:16,325 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 103 transitions. [2022-04-15 15:11:16,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:16,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:16,325 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:16,325 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:16,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 60 states have (on average 1.2) internal successors, (72), 60 states have internal predecessors, (72), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:16,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 102 transitions. [2022-04-15 15:11:16,327 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 102 transitions. Word has length 49 [2022-04-15 15:11:16,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:16,327 INFO L478 AbstractCegarLoop]: Abstraction has 84 states and 102 transitions. [2022-04-15 15:11:16,327 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 6 states have internal predecessors, (32), 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-15 15:11:16,328 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 84 states and 102 transitions. [2022-04-15 15:11:16,727 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:16,727 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 102 transitions. [2022-04-15 15:11:16,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-04-15 15:11:16,728 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:16,728 INFO L499 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:16,748 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-15 15:11:16,928 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-15 15:11:16,929 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:16,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:16,929 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 3 times [2022-04-15 15:11:16,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:16,929 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1026023701] [2022-04-15 15:11:16,930 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:16,930 INFO L85 PathProgramCache]: Analyzing trace with hash -60460648, now seen corresponding path program 4 times [2022-04-15 15:11:16,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:16,930 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427094790] [2022-04-15 15:11:16,930 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:16,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:16,942 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:16,943 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2013878928] [2022-04-15 15:11:16,943 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:11:16,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:16,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:16,944 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-15 15:11:16,982 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-15 15:11:17,041 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:11:17,041 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:17,042 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:11:17,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:17,053 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:17,293 INFO L272 TraceCheckUtils]: 0: Hoare triple {5169#true} call ULTIMATE.init(); {5169#true} is VALID [2022-04-15 15:11:17,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {5169#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; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {5177#(<= ~counter~0 0)} assume true; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,294 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5177#(<= ~counter~0 0)} {5169#true} #102#return; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,295 INFO L272 TraceCheckUtils]: 4: Hoare triple {5177#(<= ~counter~0 0)} call #t~ret9 := main(); {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {5177#(<= ~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; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,295 INFO L272 TraceCheckUtils]: 6: Hoare triple {5177#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {5177#(<= ~counter~0 0)} ~cond := #in~cond; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,296 INFO L290 TraceCheckUtils]: 8: Hoare triple {5177#(<= ~counter~0 0)} assume !(0 == ~cond); {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,296 INFO L290 TraceCheckUtils]: 9: Hoare triple {5177#(<= ~counter~0 0)} assume true; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,297 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5177#(<= ~counter~0 0)} {5177#(<= ~counter~0 0)} #90#return; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,297 INFO L272 TraceCheckUtils]: 11: Hoare triple {5177#(<= ~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)); {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,297 INFO L290 TraceCheckUtils]: 12: Hoare triple {5177#(<= ~counter~0 0)} ~cond := #in~cond; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,298 INFO L290 TraceCheckUtils]: 13: Hoare triple {5177#(<= ~counter~0 0)} assume !(0 == ~cond); {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,298 INFO L290 TraceCheckUtils]: 14: Hoare triple {5177#(<= ~counter~0 0)} assume true; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,298 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5177#(<= ~counter~0 0)} {5177#(<= ~counter~0 0)} #92#return; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,299 INFO L290 TraceCheckUtils]: 16: Hoare triple {5177#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5177#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:17,299 INFO L290 TraceCheckUtils]: 17: Hoare triple {5177#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5226#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:17,300 INFO L290 TraceCheckUtils]: 18: Hoare triple {5226#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {5226#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:17,300 INFO L272 TraceCheckUtils]: 19: Hoare triple {5226#(<= ~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)); {5226#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:17,300 INFO L290 TraceCheckUtils]: 20: Hoare triple {5226#(<= ~counter~0 1)} ~cond := #in~cond; {5226#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:17,301 INFO L290 TraceCheckUtils]: 21: Hoare triple {5226#(<= ~counter~0 1)} assume !(0 == ~cond); {5226#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:17,301 INFO L290 TraceCheckUtils]: 22: Hoare triple {5226#(<= ~counter~0 1)} assume true; {5226#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:17,301 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5226#(<= ~counter~0 1)} {5226#(<= ~counter~0 1)} #94#return; {5226#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:17,302 INFO L290 TraceCheckUtils]: 24: Hoare triple {5226#(<= ~counter~0 1)} assume !!(0 != ~r~0); {5226#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:17,302 INFO L290 TraceCheckUtils]: 25: Hoare triple {5226#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5251#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:17,302 INFO L290 TraceCheckUtils]: 26: Hoare triple {5251#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {5251#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:17,303 INFO L272 TraceCheckUtils]: 27: Hoare triple {5251#(<= ~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)); {5251#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:17,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {5251#(<= ~counter~0 2)} ~cond := #in~cond; {5251#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:17,304 INFO L290 TraceCheckUtils]: 29: Hoare triple {5251#(<= ~counter~0 2)} assume !(0 == ~cond); {5251#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:17,304 INFO L290 TraceCheckUtils]: 30: Hoare triple {5251#(<= ~counter~0 2)} assume true; {5251#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:17,304 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5251#(<= ~counter~0 2)} {5251#(<= ~counter~0 2)} #96#return; {5251#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:17,305 INFO L290 TraceCheckUtils]: 32: Hoare triple {5251#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5251#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:17,305 INFO L290 TraceCheckUtils]: 33: Hoare triple {5251#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5276#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:17,305 INFO L290 TraceCheckUtils]: 34: Hoare triple {5276#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {5276#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:17,306 INFO L272 TraceCheckUtils]: 35: Hoare triple {5276#(<= ~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)); {5276#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:17,306 INFO L290 TraceCheckUtils]: 36: Hoare triple {5276#(<= ~counter~0 3)} ~cond := #in~cond; {5276#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:17,306 INFO L290 TraceCheckUtils]: 37: Hoare triple {5276#(<= ~counter~0 3)} assume !(0 == ~cond); {5276#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:17,307 INFO L290 TraceCheckUtils]: 38: Hoare triple {5276#(<= ~counter~0 3)} assume true; {5276#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:17,307 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5276#(<= ~counter~0 3)} {5276#(<= ~counter~0 3)} #96#return; {5276#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:17,308 INFO L290 TraceCheckUtils]: 40: Hoare triple {5276#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5276#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:17,308 INFO L290 TraceCheckUtils]: 41: Hoare triple {5276#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5301#(<= |main_#t~post7| 3)} is VALID [2022-04-15 15:11:17,308 INFO L290 TraceCheckUtils]: 42: Hoare triple {5301#(<= |main_#t~post7| 3)} assume !(#t~post7 < 100);havoc #t~post7; {5170#false} is VALID [2022-04-15 15:11:17,308 INFO L290 TraceCheckUtils]: 43: Hoare triple {5170#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5170#false} is VALID [2022-04-15 15:11:17,308 INFO L290 TraceCheckUtils]: 44: Hoare triple {5170#false} assume !(#t~post8 < 100);havoc #t~post8; {5170#false} is VALID [2022-04-15 15:11:17,308 INFO L290 TraceCheckUtils]: 45: Hoare triple {5170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5170#false} is VALID [2022-04-15 15:11:17,309 INFO L290 TraceCheckUtils]: 46: Hoare triple {5170#false} assume !(#t~post6 < 100);havoc #t~post6; {5170#false} is VALID [2022-04-15 15:11:17,309 INFO L272 TraceCheckUtils]: 47: Hoare triple {5170#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)); {5170#false} is VALID [2022-04-15 15:11:17,309 INFO L290 TraceCheckUtils]: 48: Hoare triple {5170#false} ~cond := #in~cond; {5170#false} is VALID [2022-04-15 15:11:17,309 INFO L290 TraceCheckUtils]: 49: Hoare triple {5170#false} assume 0 == ~cond; {5170#false} is VALID [2022-04-15 15:11:17,309 INFO L290 TraceCheckUtils]: 50: Hoare triple {5170#false} assume !false; {5170#false} is VALID [2022-04-15 15:11:17,309 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 20 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:17,309 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:17,578 INFO L290 TraceCheckUtils]: 50: Hoare triple {5170#false} assume !false; {5170#false} is VALID [2022-04-15 15:11:17,578 INFO L290 TraceCheckUtils]: 49: Hoare triple {5170#false} assume 0 == ~cond; {5170#false} is VALID [2022-04-15 15:11:17,578 INFO L290 TraceCheckUtils]: 48: Hoare triple {5170#false} ~cond := #in~cond; {5170#false} is VALID [2022-04-15 15:11:17,578 INFO L272 TraceCheckUtils]: 47: Hoare triple {5170#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)); {5170#false} is VALID [2022-04-15 15:11:17,578 INFO L290 TraceCheckUtils]: 46: Hoare triple {5170#false} assume !(#t~post6 < 100);havoc #t~post6; {5170#false} is VALID [2022-04-15 15:11:17,578 INFO L290 TraceCheckUtils]: 45: Hoare triple {5170#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5170#false} is VALID [2022-04-15 15:11:17,578 INFO L290 TraceCheckUtils]: 44: Hoare triple {5170#false} assume !(#t~post8 < 100);havoc #t~post8; {5170#false} is VALID [2022-04-15 15:11:17,578 INFO L290 TraceCheckUtils]: 43: Hoare triple {5170#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {5170#false} is VALID [2022-04-15 15:11:17,578 INFO L290 TraceCheckUtils]: 42: Hoare triple {5353#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {5170#false} is VALID [2022-04-15 15:11:17,579 INFO L290 TraceCheckUtils]: 41: Hoare triple {5357#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5353#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:11:17,579 INFO L290 TraceCheckUtils]: 40: Hoare triple {5357#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5357#(< ~counter~0 100)} is VALID [2022-04-15 15:11:17,580 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {5169#true} {5357#(< ~counter~0 100)} #96#return; {5357#(< ~counter~0 100)} is VALID [2022-04-15 15:11:17,580 INFO L290 TraceCheckUtils]: 38: Hoare triple {5169#true} assume true; {5169#true} is VALID [2022-04-15 15:11:17,580 INFO L290 TraceCheckUtils]: 37: Hoare triple {5169#true} assume !(0 == ~cond); {5169#true} is VALID [2022-04-15 15:11:17,580 INFO L290 TraceCheckUtils]: 36: Hoare triple {5169#true} ~cond := #in~cond; {5169#true} is VALID [2022-04-15 15:11:17,580 INFO L272 TraceCheckUtils]: 35: Hoare triple {5357#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5169#true} is VALID [2022-04-15 15:11:17,580 INFO L290 TraceCheckUtils]: 34: Hoare triple {5357#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {5357#(< ~counter~0 100)} is VALID [2022-04-15 15:11:17,581 INFO L290 TraceCheckUtils]: 33: Hoare triple {5382#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5357#(< ~counter~0 100)} is VALID [2022-04-15 15:11:17,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {5382#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {5382#(< ~counter~0 99)} is VALID [2022-04-15 15:11:17,582 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {5169#true} {5382#(< ~counter~0 99)} #96#return; {5382#(< ~counter~0 99)} is VALID [2022-04-15 15:11:17,582 INFO L290 TraceCheckUtils]: 30: Hoare triple {5169#true} assume true; {5169#true} is VALID [2022-04-15 15:11:17,582 INFO L290 TraceCheckUtils]: 29: Hoare triple {5169#true} assume !(0 == ~cond); {5169#true} is VALID [2022-04-15 15:11:17,582 INFO L290 TraceCheckUtils]: 28: Hoare triple {5169#true} ~cond := #in~cond; {5169#true} is VALID [2022-04-15 15:11:17,582 INFO L272 TraceCheckUtils]: 27: Hoare triple {5382#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5169#true} is VALID [2022-04-15 15:11:17,582 INFO L290 TraceCheckUtils]: 26: Hoare triple {5382#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {5382#(< ~counter~0 99)} is VALID [2022-04-15 15:11:17,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {5407#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {5382#(< ~counter~0 99)} is VALID [2022-04-15 15:11:17,584 INFO L290 TraceCheckUtils]: 24: Hoare triple {5407#(< ~counter~0 98)} assume !!(0 != ~r~0); {5407#(< ~counter~0 98)} is VALID [2022-04-15 15:11:17,584 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {5169#true} {5407#(< ~counter~0 98)} #94#return; {5407#(< ~counter~0 98)} is VALID [2022-04-15 15:11:17,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {5169#true} assume true; {5169#true} is VALID [2022-04-15 15:11:17,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {5169#true} assume !(0 == ~cond); {5169#true} is VALID [2022-04-15 15:11:17,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {5169#true} ~cond := #in~cond; {5169#true} is VALID [2022-04-15 15:11:17,585 INFO L272 TraceCheckUtils]: 19: Hoare triple {5407#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {5169#true} is VALID [2022-04-15 15:11:17,585 INFO L290 TraceCheckUtils]: 18: Hoare triple {5407#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {5407#(< ~counter~0 98)} is VALID [2022-04-15 15:11:17,585 INFO L290 TraceCheckUtils]: 17: Hoare triple {5432#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {5407#(< ~counter~0 98)} is VALID [2022-04-15 15:11:17,585 INFO L290 TraceCheckUtils]: 16: Hoare triple {5432#(< ~counter~0 97)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {5432#(< ~counter~0 97)} is VALID [2022-04-15 15:11:17,586 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {5169#true} {5432#(< ~counter~0 97)} #92#return; {5432#(< ~counter~0 97)} is VALID [2022-04-15 15:11:17,586 INFO L290 TraceCheckUtils]: 14: Hoare triple {5169#true} assume true; {5169#true} is VALID [2022-04-15 15:11:17,586 INFO L290 TraceCheckUtils]: 13: Hoare triple {5169#true} assume !(0 == ~cond); {5169#true} is VALID [2022-04-15 15:11:17,586 INFO L290 TraceCheckUtils]: 12: Hoare triple {5169#true} ~cond := #in~cond; {5169#true} is VALID [2022-04-15 15:11:17,586 INFO L272 TraceCheckUtils]: 11: Hoare triple {5432#(< ~counter~0 97)} 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)); {5169#true} is VALID [2022-04-15 15:11:17,587 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {5169#true} {5432#(< ~counter~0 97)} #90#return; {5432#(< ~counter~0 97)} is VALID [2022-04-15 15:11:17,587 INFO L290 TraceCheckUtils]: 9: Hoare triple {5169#true} assume true; {5169#true} is VALID [2022-04-15 15:11:17,587 INFO L290 TraceCheckUtils]: 8: Hoare triple {5169#true} assume !(0 == ~cond); {5169#true} is VALID [2022-04-15 15:11:17,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {5169#true} ~cond := #in~cond; {5169#true} is VALID [2022-04-15 15:11:17,587 INFO L272 TraceCheckUtils]: 6: Hoare triple {5432#(< ~counter~0 97)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {5169#true} is VALID [2022-04-15 15:11:17,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {5432#(< ~counter~0 97)} 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; {5432#(< ~counter~0 97)} is VALID [2022-04-15 15:11:17,588 INFO L272 TraceCheckUtils]: 4: Hoare triple {5432#(< ~counter~0 97)} call #t~ret9 := main(); {5432#(< ~counter~0 97)} is VALID [2022-04-15 15:11:17,588 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {5432#(< ~counter~0 97)} {5169#true} #102#return; {5432#(< ~counter~0 97)} is VALID [2022-04-15 15:11:17,588 INFO L290 TraceCheckUtils]: 2: Hoare triple {5432#(< ~counter~0 97)} assume true; {5432#(< ~counter~0 97)} is VALID [2022-04-15 15:11:17,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {5169#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; {5432#(< ~counter~0 97)} is VALID [2022-04-15 15:11:17,589 INFO L272 TraceCheckUtils]: 0: Hoare triple {5169#true} call ULTIMATE.init(); {5169#true} is VALID [2022-04-15 15:11:17,589 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 8 proven. 8 refuted. 0 times theorem prover too weak. 16 trivial. 0 not checked. [2022-04-15 15:11:17,589 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:17,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427094790] [2022-04-15 15:11:17,589 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:17,589 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2013878928] [2022-04-15 15:11:17,589 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2013878928] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:17,590 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:17,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-04-15 15:11:17,590 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:17,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1026023701] [2022-04-15 15:11:17,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1026023701] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:17,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:17,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-04-15 15:11:17,590 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369531183] [2022-04-15 15:11:17,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:17,591 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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 51 [2022-04-15 15:11:17,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:17,591 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-15 15:11:17,626 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:17,626 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-04-15 15:11:17,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:17,626 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-04-15 15:11:17,626 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=82, Unknown=0, NotChecked=0, Total=132 [2022-04-15 15:11:17,626 INFO L87 Difference]: Start difference. First operand 84 states and 102 transitions. Second operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-15 15:11:17,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:17,882 INFO L93 Difference]: Finished difference Result 123 states and 157 transitions. [2022-04-15 15:11:17,882 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:11:17,883 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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 51 [2022-04-15 15:11:17,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:17,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-15 15:11:17,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 15:11:17,888 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-15 15:11:17,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 101 transitions. [2022-04-15 15:11:17,890 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 101 transitions. [2022-04-15 15:11:17,967 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-15 15:11:17,968 INFO L225 Difference]: With dead ends: 123 [2022-04-15 15:11:17,968 INFO L226 Difference]: Without dead ends: 86 [2022-04-15 15:11:17,969 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 91 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=70, Invalid=112, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:11:17,969 INFO L913 BasicCegarLoop]: 40 mSDtfsCounter, 29 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:17,970 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:17,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-04-15 15:11:18,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-04-15 15:11:18,057 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:18,057 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:18,057 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:18,058 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:18,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:18,060 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2022-04-15 15:11:18,060 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2022-04-15 15:11:18,060 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:18,060 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:18,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 86 states. [2022-04-15 15:11:18,061 INFO L87 Difference]: Start difference. First operand has 86 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) Second operand 86 states. [2022-04-15 15:11:18,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:18,063 INFO L93 Difference]: Finished difference Result 86 states and 104 transitions. [2022-04-15 15:11:18,063 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2022-04-15 15:11:18,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:18,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:18,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:18,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:18,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 62 states have (on average 1.1935483870967742) internal successors, (74), 62 states have internal predecessors, (74), 16 states have call successors, (16), 9 states have call predecessors, (16), 7 states have return successors, (14), 14 states have call predecessors, (14), 14 states have call successors, (14) [2022-04-15 15:11:18,065 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 104 transitions. [2022-04-15 15:11:18,065 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 104 transitions. Word has length 51 [2022-04-15 15:11:18,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:18,066 INFO L478 AbstractCegarLoop]: Abstraction has 86 states and 104 transitions. [2022-04-15 15:11:18,066 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.857142857142857) internal successors, (34), 6 states have internal predecessors, (34), 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-15 15:11:18,066 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 86 states and 104 transitions. [2022-04-15 15:11:19,397 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:19,397 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 104 transitions. [2022-04-15 15:11:19,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2022-04-15 15:11:19,398 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:19,398 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:19,414 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-15 15:11:19,599 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-15 15:11:19,599 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:19,600 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:19,600 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 1 times [2022-04-15 15:11:19,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:19,600 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1676023955] [2022-04-15 15:11:19,600 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:19,601 INFO L85 PathProgramCache]: Analyzing trace with hash -1067781299, now seen corresponding path program 2 times [2022-04-15 15:11:19,601 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:19,601 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805405604] [2022-04-15 15:11:19,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:19,601 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:19,623 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:19,623 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [453213100] [2022-04-15 15:11:19,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:19,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:19,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:19,630 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-15 15:11:19,631 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-15 15:11:19,678 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:19,678 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:19,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:11:19,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:19,694 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:19,997 INFO L272 TraceCheckUtils]: 0: Hoare triple {6080#true} call ULTIMATE.init(); {6080#true} is VALID [2022-04-15 15:11:19,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {6080#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; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:19,998 INFO L290 TraceCheckUtils]: 2: Hoare triple {6088#(<= ~counter~0 0)} assume true; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:19,998 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6088#(<= ~counter~0 0)} {6080#true} #102#return; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:19,998 INFO L272 TraceCheckUtils]: 4: Hoare triple {6088#(<= ~counter~0 0)} call #t~ret9 := main(); {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:19,999 INFO L290 TraceCheckUtils]: 5: Hoare triple {6088#(<= ~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; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:19,999 INFO L272 TraceCheckUtils]: 6: Hoare triple {6088#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:19,999 INFO L290 TraceCheckUtils]: 7: Hoare triple {6088#(<= ~counter~0 0)} ~cond := #in~cond; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,000 INFO L290 TraceCheckUtils]: 8: Hoare triple {6088#(<= ~counter~0 0)} assume !(0 == ~cond); {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,000 INFO L290 TraceCheckUtils]: 9: Hoare triple {6088#(<= ~counter~0 0)} assume true; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,001 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6088#(<= ~counter~0 0)} {6088#(<= ~counter~0 0)} #90#return; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,001 INFO L272 TraceCheckUtils]: 11: Hoare triple {6088#(<= ~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)); {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,001 INFO L290 TraceCheckUtils]: 12: Hoare triple {6088#(<= ~counter~0 0)} ~cond := #in~cond; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,002 INFO L290 TraceCheckUtils]: 13: Hoare triple {6088#(<= ~counter~0 0)} assume !(0 == ~cond); {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,002 INFO L290 TraceCheckUtils]: 14: Hoare triple {6088#(<= ~counter~0 0)} assume true; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,002 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6088#(<= ~counter~0 0)} {6088#(<= ~counter~0 0)} #92#return; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,003 INFO L290 TraceCheckUtils]: 16: Hoare triple {6088#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6088#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:20,004 INFO L290 TraceCheckUtils]: 17: Hoare triple {6088#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6137#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:20,004 INFO L290 TraceCheckUtils]: 18: Hoare triple {6137#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {6137#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:20,005 INFO L272 TraceCheckUtils]: 19: Hoare triple {6137#(<= ~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)); {6137#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:20,005 INFO L290 TraceCheckUtils]: 20: Hoare triple {6137#(<= ~counter~0 1)} ~cond := #in~cond; {6137#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:20,005 INFO L290 TraceCheckUtils]: 21: Hoare triple {6137#(<= ~counter~0 1)} assume !(0 == ~cond); {6137#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:20,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {6137#(<= ~counter~0 1)} assume true; {6137#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:20,006 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6137#(<= ~counter~0 1)} {6137#(<= ~counter~0 1)} #94#return; {6137#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:20,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {6137#(<= ~counter~0 1)} assume !!(0 != ~r~0); {6137#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:20,007 INFO L290 TraceCheckUtils]: 25: Hoare triple {6137#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6162#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:20,007 INFO L290 TraceCheckUtils]: 26: Hoare triple {6162#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {6162#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:20,008 INFO L272 TraceCheckUtils]: 27: Hoare triple {6162#(<= ~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)); {6162#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:20,008 INFO L290 TraceCheckUtils]: 28: Hoare triple {6162#(<= ~counter~0 2)} ~cond := #in~cond; {6162#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:20,008 INFO L290 TraceCheckUtils]: 29: Hoare triple {6162#(<= ~counter~0 2)} assume !(0 == ~cond); {6162#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:20,009 INFO L290 TraceCheckUtils]: 30: Hoare triple {6162#(<= ~counter~0 2)} assume true; {6162#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:20,009 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6162#(<= ~counter~0 2)} {6162#(<= ~counter~0 2)} #96#return; {6162#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:20,009 INFO L290 TraceCheckUtils]: 32: Hoare triple {6162#(<= ~counter~0 2)} assume !(~r~0 > 0); {6162#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:20,010 INFO L290 TraceCheckUtils]: 33: Hoare triple {6162#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6187#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:20,010 INFO L290 TraceCheckUtils]: 34: Hoare triple {6187#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {6187#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:20,011 INFO L272 TraceCheckUtils]: 35: Hoare triple {6187#(<= ~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)); {6187#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:20,011 INFO L290 TraceCheckUtils]: 36: Hoare triple {6187#(<= ~counter~0 3)} ~cond := #in~cond; {6187#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:20,011 INFO L290 TraceCheckUtils]: 37: Hoare triple {6187#(<= ~counter~0 3)} assume !(0 == ~cond); {6187#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:20,012 INFO L290 TraceCheckUtils]: 38: Hoare triple {6187#(<= ~counter~0 3)} assume true; {6187#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:20,012 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6187#(<= ~counter~0 3)} {6187#(<= ~counter~0 3)} #98#return; {6187#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:20,012 INFO L290 TraceCheckUtils]: 40: Hoare triple {6187#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6187#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:20,013 INFO L290 TraceCheckUtils]: 41: Hoare triple {6187#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6212#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:20,013 INFO L290 TraceCheckUtils]: 42: Hoare triple {6212#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {6212#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:20,014 INFO L272 TraceCheckUtils]: 43: Hoare triple {6212#(<= ~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)); {6212#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:20,014 INFO L290 TraceCheckUtils]: 44: Hoare triple {6212#(<= ~counter~0 4)} ~cond := #in~cond; {6212#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:20,014 INFO L290 TraceCheckUtils]: 45: Hoare triple {6212#(<= ~counter~0 4)} assume !(0 == ~cond); {6212#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:20,015 INFO L290 TraceCheckUtils]: 46: Hoare triple {6212#(<= ~counter~0 4)} assume true; {6212#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:20,015 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6212#(<= ~counter~0 4)} {6212#(<= ~counter~0 4)} #98#return; {6212#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:20,015 INFO L290 TraceCheckUtils]: 48: Hoare triple {6212#(<= ~counter~0 4)} assume !(~r~0 < 0); {6212#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:20,016 INFO L290 TraceCheckUtils]: 49: Hoare triple {6212#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6237#(<= |main_#t~post6| 4)} is VALID [2022-04-15 15:11:20,016 INFO L290 TraceCheckUtils]: 50: Hoare triple {6237#(<= |main_#t~post6| 4)} assume !(#t~post6 < 100);havoc #t~post6; {6081#false} is VALID [2022-04-15 15:11:20,016 INFO L272 TraceCheckUtils]: 51: Hoare triple {6081#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)); {6081#false} is VALID [2022-04-15 15:11:20,016 INFO L290 TraceCheckUtils]: 52: Hoare triple {6081#false} ~cond := #in~cond; {6081#false} is VALID [2022-04-15 15:11:20,016 INFO L290 TraceCheckUtils]: 53: Hoare triple {6081#false} assume 0 == ~cond; {6081#false} is VALID [2022-04-15 15:11:20,016 INFO L290 TraceCheckUtils]: 54: Hoare triple {6081#false} assume !false; {6081#false} is VALID [2022-04-15 15:11:20,017 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 30 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:20,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:20,318 INFO L290 TraceCheckUtils]: 54: Hoare triple {6081#false} assume !false; {6081#false} is VALID [2022-04-15 15:11:20,318 INFO L290 TraceCheckUtils]: 53: Hoare triple {6081#false} assume 0 == ~cond; {6081#false} is VALID [2022-04-15 15:11:20,318 INFO L290 TraceCheckUtils]: 52: Hoare triple {6081#false} ~cond := #in~cond; {6081#false} is VALID [2022-04-15 15:11:20,318 INFO L272 TraceCheckUtils]: 51: Hoare triple {6081#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)); {6081#false} is VALID [2022-04-15 15:11:20,318 INFO L290 TraceCheckUtils]: 50: Hoare triple {6265#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {6081#false} is VALID [2022-04-15 15:11:20,319 INFO L290 TraceCheckUtils]: 49: Hoare triple {6269#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6265#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:11:20,319 INFO L290 TraceCheckUtils]: 48: Hoare triple {6269#(< ~counter~0 100)} assume !(~r~0 < 0); {6269#(< ~counter~0 100)} is VALID [2022-04-15 15:11:20,320 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {6080#true} {6269#(< ~counter~0 100)} #98#return; {6269#(< ~counter~0 100)} is VALID [2022-04-15 15:11:20,320 INFO L290 TraceCheckUtils]: 46: Hoare triple {6080#true} assume true; {6080#true} is VALID [2022-04-15 15:11:20,320 INFO L290 TraceCheckUtils]: 45: Hoare triple {6080#true} assume !(0 == ~cond); {6080#true} is VALID [2022-04-15 15:11:20,320 INFO L290 TraceCheckUtils]: 44: Hoare triple {6080#true} ~cond := #in~cond; {6080#true} is VALID [2022-04-15 15:11:20,321 INFO L272 TraceCheckUtils]: 43: Hoare triple {6269#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6080#true} is VALID [2022-04-15 15:11:20,321 INFO L290 TraceCheckUtils]: 42: Hoare triple {6269#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {6269#(< ~counter~0 100)} is VALID [2022-04-15 15:11:20,321 INFO L290 TraceCheckUtils]: 41: Hoare triple {6294#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6269#(< ~counter~0 100)} is VALID [2022-04-15 15:11:20,322 INFO L290 TraceCheckUtils]: 40: Hoare triple {6294#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {6294#(< ~counter~0 99)} is VALID [2022-04-15 15:11:20,322 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {6080#true} {6294#(< ~counter~0 99)} #98#return; {6294#(< ~counter~0 99)} is VALID [2022-04-15 15:11:20,322 INFO L290 TraceCheckUtils]: 38: Hoare triple {6080#true} assume true; {6080#true} is VALID [2022-04-15 15:11:20,322 INFO L290 TraceCheckUtils]: 37: Hoare triple {6080#true} assume !(0 == ~cond); {6080#true} is VALID [2022-04-15 15:11:20,322 INFO L290 TraceCheckUtils]: 36: Hoare triple {6080#true} ~cond := #in~cond; {6080#true} is VALID [2022-04-15 15:11:20,323 INFO L272 TraceCheckUtils]: 35: Hoare triple {6294#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6080#true} is VALID [2022-04-15 15:11:20,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {6294#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {6294#(< ~counter~0 99)} is VALID [2022-04-15 15:11:20,324 INFO L290 TraceCheckUtils]: 33: Hoare triple {6319#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {6294#(< ~counter~0 99)} is VALID [2022-04-15 15:11:20,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {6319#(< ~counter~0 98)} assume !(~r~0 > 0); {6319#(< ~counter~0 98)} is VALID [2022-04-15 15:11:20,325 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {6080#true} {6319#(< ~counter~0 98)} #96#return; {6319#(< ~counter~0 98)} is VALID [2022-04-15 15:11:20,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {6080#true} assume true; {6080#true} is VALID [2022-04-15 15:11:20,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {6080#true} assume !(0 == ~cond); {6080#true} is VALID [2022-04-15 15:11:20,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {6080#true} ~cond := #in~cond; {6080#true} is VALID [2022-04-15 15:11:20,325 INFO L272 TraceCheckUtils]: 27: Hoare triple {6319#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6080#true} is VALID [2022-04-15 15:11:20,326 INFO L290 TraceCheckUtils]: 26: Hoare triple {6319#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {6319#(< ~counter~0 98)} is VALID [2022-04-15 15:11:20,326 INFO L290 TraceCheckUtils]: 25: Hoare triple {6344#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {6319#(< ~counter~0 98)} is VALID [2022-04-15 15:11:20,326 INFO L290 TraceCheckUtils]: 24: Hoare triple {6344#(< ~counter~0 97)} assume !!(0 != ~r~0); {6344#(< ~counter~0 97)} is VALID [2022-04-15 15:11:20,327 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {6080#true} {6344#(< ~counter~0 97)} #94#return; {6344#(< ~counter~0 97)} is VALID [2022-04-15 15:11:20,327 INFO L290 TraceCheckUtils]: 22: Hoare triple {6080#true} assume true; {6080#true} is VALID [2022-04-15 15:11:20,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {6080#true} assume !(0 == ~cond); {6080#true} is VALID [2022-04-15 15:11:20,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {6080#true} ~cond := #in~cond; {6080#true} is VALID [2022-04-15 15:11:20,328 INFO L272 TraceCheckUtils]: 19: Hoare triple {6344#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {6080#true} is VALID [2022-04-15 15:11:20,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {6344#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {6344#(< ~counter~0 97)} is VALID [2022-04-15 15:11:20,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {6369#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {6344#(< ~counter~0 97)} is VALID [2022-04-15 15:11:20,329 INFO L290 TraceCheckUtils]: 16: Hoare triple {6369#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {6369#(< ~counter~0 96)} is VALID [2022-04-15 15:11:20,329 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {6080#true} {6369#(< ~counter~0 96)} #92#return; {6369#(< ~counter~0 96)} is VALID [2022-04-15 15:11:20,330 INFO L290 TraceCheckUtils]: 14: Hoare triple {6080#true} assume true; {6080#true} is VALID [2022-04-15 15:11:20,330 INFO L290 TraceCheckUtils]: 13: Hoare triple {6080#true} assume !(0 == ~cond); {6080#true} is VALID [2022-04-15 15:11:20,330 INFO L290 TraceCheckUtils]: 12: Hoare triple {6080#true} ~cond := #in~cond; {6080#true} is VALID [2022-04-15 15:11:20,330 INFO L272 TraceCheckUtils]: 11: Hoare triple {6369#(< ~counter~0 96)} 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)); {6080#true} is VALID [2022-04-15 15:11:20,330 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {6080#true} {6369#(< ~counter~0 96)} #90#return; {6369#(< ~counter~0 96)} is VALID [2022-04-15 15:11:20,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {6080#true} assume true; {6080#true} is VALID [2022-04-15 15:11:20,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {6080#true} assume !(0 == ~cond); {6080#true} is VALID [2022-04-15 15:11:20,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {6080#true} ~cond := #in~cond; {6080#true} is VALID [2022-04-15 15:11:20,331 INFO L272 TraceCheckUtils]: 6: Hoare triple {6369#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {6080#true} is VALID [2022-04-15 15:11:20,331 INFO L290 TraceCheckUtils]: 5: Hoare triple {6369#(< ~counter~0 96)} 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; {6369#(< ~counter~0 96)} is VALID [2022-04-15 15:11:20,332 INFO L272 TraceCheckUtils]: 4: Hoare triple {6369#(< ~counter~0 96)} call #t~ret9 := main(); {6369#(< ~counter~0 96)} is VALID [2022-04-15 15:11:20,332 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {6369#(< ~counter~0 96)} {6080#true} #102#return; {6369#(< ~counter~0 96)} is VALID [2022-04-15 15:11:20,333 INFO L290 TraceCheckUtils]: 2: Hoare triple {6369#(< ~counter~0 96)} assume true; {6369#(< ~counter~0 96)} is VALID [2022-04-15 15:11:20,333 INFO L290 TraceCheckUtils]: 1: Hoare triple {6080#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; {6369#(< ~counter~0 96)} is VALID [2022-04-15 15:11:20,333 INFO L272 TraceCheckUtils]: 0: Hoare triple {6080#true} call ULTIMATE.init(); {6080#true} is VALID [2022-04-15 15:11:20,333 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 8 proven. 6 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:11:20,334 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:20,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805405604] [2022-04-15 15:11:20,334 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:20,334 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [453213100] [2022-04-15 15:11:20,334 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [453213100] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:20,334 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:20,334 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:11:20,335 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:20,335 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1676023955] [2022-04-15 15:11:20,335 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1676023955] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:20,335 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:20,335 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:11:20,335 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571105375] [2022-04-15 15:11:20,335 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:20,335 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (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 55 [2022-04-15 15:11:20,336 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:20,336 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (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-15 15:11:20,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:20,375 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:11:20,375 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:11:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:11:20,376 INFO L87 Difference]: Start difference. First operand 86 states and 104 transitions. Second operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (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-15 15:11:20,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:20,662 INFO L93 Difference]: Finished difference Result 103 states and 124 transitions. [2022-04-15 15:11:20,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:11:20,663 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (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 55 [2022-04-15 15:11:20,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:20,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (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-15 15:11:20,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 15:11:20,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (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-15 15:11:20,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 95 transitions. [2022-04-15 15:11:20,666 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 95 transitions. [2022-04-15 15:11:20,741 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-15 15:11:20,742 INFO L225 Difference]: With dead ends: 103 [2022-04-15 15:11:20,743 INFO L226 Difference]: Without dead ends: 98 [2022-04-15 15:11:20,743 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 97 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=84, Invalid=126, Unknown=0, NotChecked=0, Total=210 [2022-04-15 15:11:20,743 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 35 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:20,744 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 143 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:20,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2022-04-15 15:11:20,828 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 95. [2022-04-15 15:11:20,828 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:20,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand has 95 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:20,828 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand has 95 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:20,828 INFO L87 Difference]: Start difference. First operand 98 states. Second operand has 95 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:20,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:20,831 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-04-15 15:11:20,831 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-04-15 15:11:20,832 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:20,832 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:20,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 95 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 98 states. [2022-04-15 15:11:20,832 INFO L87 Difference]: Start difference. First operand has 95 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) Second operand 98 states. [2022-04-15 15:11:20,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:20,834 INFO L93 Difference]: Finished difference Result 98 states and 119 transitions. [2022-04-15 15:11:20,834 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-04-15 15:11:20,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:20,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:20,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:20,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:20,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 68 states have (on average 1.1911764705882353) internal successors, (81), 69 states have internal predecessors, (81), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 15 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:20,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 115 transitions. [2022-04-15 15:11:20,837 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 115 transitions. Word has length 55 [2022-04-15 15:11:20,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:20,837 INFO L478 AbstractCegarLoop]: Abstraction has 95 states and 115 transitions. [2022-04-15 15:11:20,838 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.5) internal successors, (36), 7 states have internal predecessors, (36), 7 states have call successors, (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-15 15:11:20,838 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 95 states and 115 transitions. [2022-04-15 15:11:22,968 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 114 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:22,968 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 115 transitions. [2022-04-15 15:11:22,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2022-04-15 15:11:22,969 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:22,969 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:22,985 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-15 15:11:23,169 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-15 15:11:23,169 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:23,170 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:23,170 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 3 times [2022-04-15 15:11:23,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:23,170 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1056571185] [2022-04-15 15:11:23,170 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:23,171 INFO L85 PathProgramCache]: Analyzing trace with hash -2095290798, now seen corresponding path program 4 times [2022-04-15 15:11:23,171 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:23,171 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416125982] [2022-04-15 15:11:23,171 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:23,171 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:23,203 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:23,204 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [389934056] [2022-04-15 15:11:23,204 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:11:23,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:23,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:23,205 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-15 15:11:23,231 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-15 15:11:23,274 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:11:23,274 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:23,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:11:23,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:23,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:23,545 INFO L272 TraceCheckUtils]: 0: Hoare triple {7017#true} call ULTIMATE.init(); {7017#true} is VALID [2022-04-15 15:11:23,545 INFO L290 TraceCheckUtils]: 1: Hoare triple {7017#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; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {7025#(<= ~counter~0 0)} assume true; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7025#(<= ~counter~0 0)} {7017#true} #102#return; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,546 INFO L272 TraceCheckUtils]: 4: Hoare triple {7025#(<= ~counter~0 0)} call #t~ret9 := main(); {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {7025#(<= ~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; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,547 INFO L272 TraceCheckUtils]: 6: Hoare triple {7025#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {7025#(<= ~counter~0 0)} ~cond := #in~cond; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {7025#(<= ~counter~0 0)} assume !(0 == ~cond); {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {7025#(<= ~counter~0 0)} assume true; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,548 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7025#(<= ~counter~0 0)} {7025#(<= ~counter~0 0)} #90#return; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,549 INFO L272 TraceCheckUtils]: 11: Hoare triple {7025#(<= ~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)); {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {7025#(<= ~counter~0 0)} ~cond := #in~cond; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {7025#(<= ~counter~0 0)} assume !(0 == ~cond); {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,549 INFO L290 TraceCheckUtils]: 14: Hoare triple {7025#(<= ~counter~0 0)} assume true; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,550 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7025#(<= ~counter~0 0)} {7025#(<= ~counter~0 0)} #92#return; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {7025#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7025#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:23,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {7025#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7074#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:23,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {7074#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {7074#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:23,552 INFO L272 TraceCheckUtils]: 19: Hoare triple {7074#(<= ~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)); {7074#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:23,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {7074#(<= ~counter~0 1)} ~cond := #in~cond; {7074#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:23,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {7074#(<= ~counter~0 1)} assume !(0 == ~cond); {7074#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:23,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {7074#(<= ~counter~0 1)} assume true; {7074#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:23,553 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7074#(<= ~counter~0 1)} {7074#(<= ~counter~0 1)} #94#return; {7074#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:23,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {7074#(<= ~counter~0 1)} assume !!(0 != ~r~0); {7074#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:23,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {7074#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7099#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:23,554 INFO L290 TraceCheckUtils]: 26: Hoare triple {7099#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {7099#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:23,554 INFO L272 TraceCheckUtils]: 27: Hoare triple {7099#(<= ~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)); {7099#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:23,555 INFO L290 TraceCheckUtils]: 28: Hoare triple {7099#(<= ~counter~0 2)} ~cond := #in~cond; {7099#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:23,555 INFO L290 TraceCheckUtils]: 29: Hoare triple {7099#(<= ~counter~0 2)} assume !(0 == ~cond); {7099#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:23,555 INFO L290 TraceCheckUtils]: 30: Hoare triple {7099#(<= ~counter~0 2)} assume true; {7099#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:23,556 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7099#(<= ~counter~0 2)} {7099#(<= ~counter~0 2)} #96#return; {7099#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:23,556 INFO L290 TraceCheckUtils]: 32: Hoare triple {7099#(<= ~counter~0 2)} assume !(~r~0 > 0); {7099#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:23,556 INFO L290 TraceCheckUtils]: 33: Hoare triple {7099#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7124#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:23,557 INFO L290 TraceCheckUtils]: 34: Hoare triple {7124#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {7124#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:23,557 INFO L272 TraceCheckUtils]: 35: Hoare triple {7124#(<= ~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)); {7124#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:23,557 INFO L290 TraceCheckUtils]: 36: Hoare triple {7124#(<= ~counter~0 3)} ~cond := #in~cond; {7124#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:23,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {7124#(<= ~counter~0 3)} assume !(0 == ~cond); {7124#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:23,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {7124#(<= ~counter~0 3)} assume true; {7124#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:23,558 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7124#(<= ~counter~0 3)} {7124#(<= ~counter~0 3)} #98#return; {7124#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:23,559 INFO L290 TraceCheckUtils]: 40: Hoare triple {7124#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7124#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:23,559 INFO L290 TraceCheckUtils]: 41: Hoare triple {7124#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7149#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:23,560 INFO L290 TraceCheckUtils]: 42: Hoare triple {7149#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {7149#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:23,560 INFO L272 TraceCheckUtils]: 43: Hoare triple {7149#(<= ~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)); {7149#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:23,560 INFO L290 TraceCheckUtils]: 44: Hoare triple {7149#(<= ~counter~0 4)} ~cond := #in~cond; {7149#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:23,561 INFO L290 TraceCheckUtils]: 45: Hoare triple {7149#(<= ~counter~0 4)} assume !(0 == ~cond); {7149#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:23,561 INFO L290 TraceCheckUtils]: 46: Hoare triple {7149#(<= ~counter~0 4)} assume true; {7149#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:23,561 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7149#(<= ~counter~0 4)} {7149#(<= ~counter~0 4)} #98#return; {7149#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:23,562 INFO L290 TraceCheckUtils]: 48: Hoare triple {7149#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7149#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:23,562 INFO L290 TraceCheckUtils]: 49: Hoare triple {7149#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7174#(<= |main_#t~post8| 4)} is VALID [2022-04-15 15:11:23,562 INFO L290 TraceCheckUtils]: 50: Hoare triple {7174#(<= |main_#t~post8| 4)} assume !(#t~post8 < 100);havoc #t~post8; {7018#false} is VALID [2022-04-15 15:11:23,562 INFO L290 TraceCheckUtils]: 51: Hoare triple {7018#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7018#false} is VALID [2022-04-15 15:11:23,562 INFO L290 TraceCheckUtils]: 52: Hoare triple {7018#false} assume !(#t~post6 < 100);havoc #t~post6; {7018#false} is VALID [2022-04-15 15:11:23,563 INFO L272 TraceCheckUtils]: 53: Hoare triple {7018#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)); {7018#false} is VALID [2022-04-15 15:11:23,563 INFO L290 TraceCheckUtils]: 54: Hoare triple {7018#false} ~cond := #in~cond; {7018#false} is VALID [2022-04-15 15:11:23,563 INFO L290 TraceCheckUtils]: 55: Hoare triple {7018#false} assume 0 == ~cond; {7018#false} is VALID [2022-04-15 15:11:23,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {7018#false} assume !false; {7018#false} is VALID [2022-04-15 15:11:23,563 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 32 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:23,563 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:23,851 INFO L290 TraceCheckUtils]: 56: Hoare triple {7018#false} assume !false; {7018#false} is VALID [2022-04-15 15:11:23,851 INFO L290 TraceCheckUtils]: 55: Hoare triple {7018#false} assume 0 == ~cond; {7018#false} is VALID [2022-04-15 15:11:23,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {7018#false} ~cond := #in~cond; {7018#false} is VALID [2022-04-15 15:11:23,851 INFO L272 TraceCheckUtils]: 53: Hoare triple {7018#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)); {7018#false} is VALID [2022-04-15 15:11:23,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {7018#false} assume !(#t~post6 < 100);havoc #t~post6; {7018#false} is VALID [2022-04-15 15:11:23,851 INFO L290 TraceCheckUtils]: 51: Hoare triple {7018#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7018#false} is VALID [2022-04-15 15:11:23,851 INFO L290 TraceCheckUtils]: 50: Hoare triple {7214#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {7018#false} is VALID [2022-04-15 15:11:23,852 INFO L290 TraceCheckUtils]: 49: Hoare triple {7218#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7214#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:11:23,852 INFO L290 TraceCheckUtils]: 48: Hoare triple {7218#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7218#(< ~counter~0 100)} is VALID [2022-04-15 15:11:23,853 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {7017#true} {7218#(< ~counter~0 100)} #98#return; {7218#(< ~counter~0 100)} is VALID [2022-04-15 15:11:23,853 INFO L290 TraceCheckUtils]: 46: Hoare triple {7017#true} assume true; {7017#true} is VALID [2022-04-15 15:11:23,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {7017#true} assume !(0 == ~cond); {7017#true} is VALID [2022-04-15 15:11:23,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {7017#true} ~cond := #in~cond; {7017#true} is VALID [2022-04-15 15:11:23,853 INFO L272 TraceCheckUtils]: 43: Hoare triple {7218#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7017#true} is VALID [2022-04-15 15:11:23,853 INFO L290 TraceCheckUtils]: 42: Hoare triple {7218#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {7218#(< ~counter~0 100)} is VALID [2022-04-15 15:11:23,854 INFO L290 TraceCheckUtils]: 41: Hoare triple {7243#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7218#(< ~counter~0 100)} is VALID [2022-04-15 15:11:23,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {7243#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {7243#(< ~counter~0 99)} is VALID [2022-04-15 15:11:23,855 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {7017#true} {7243#(< ~counter~0 99)} #98#return; {7243#(< ~counter~0 99)} is VALID [2022-04-15 15:11:23,855 INFO L290 TraceCheckUtils]: 38: Hoare triple {7017#true} assume true; {7017#true} is VALID [2022-04-15 15:11:23,855 INFO L290 TraceCheckUtils]: 37: Hoare triple {7017#true} assume !(0 == ~cond); {7017#true} is VALID [2022-04-15 15:11:23,855 INFO L290 TraceCheckUtils]: 36: Hoare triple {7017#true} ~cond := #in~cond; {7017#true} is VALID [2022-04-15 15:11:23,855 INFO L272 TraceCheckUtils]: 35: Hoare triple {7243#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7017#true} is VALID [2022-04-15 15:11:23,867 INFO L290 TraceCheckUtils]: 34: Hoare triple {7243#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {7243#(< ~counter~0 99)} is VALID [2022-04-15 15:11:23,868 INFO L290 TraceCheckUtils]: 33: Hoare triple {7268#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {7243#(< ~counter~0 99)} is VALID [2022-04-15 15:11:23,869 INFO L290 TraceCheckUtils]: 32: Hoare triple {7268#(< ~counter~0 98)} assume !(~r~0 > 0); {7268#(< ~counter~0 98)} is VALID [2022-04-15 15:11:23,870 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {7017#true} {7268#(< ~counter~0 98)} #96#return; {7268#(< ~counter~0 98)} is VALID [2022-04-15 15:11:23,870 INFO L290 TraceCheckUtils]: 30: Hoare triple {7017#true} assume true; {7017#true} is VALID [2022-04-15 15:11:23,870 INFO L290 TraceCheckUtils]: 29: Hoare triple {7017#true} assume !(0 == ~cond); {7017#true} is VALID [2022-04-15 15:11:23,870 INFO L290 TraceCheckUtils]: 28: Hoare triple {7017#true} ~cond := #in~cond; {7017#true} is VALID [2022-04-15 15:11:23,870 INFO L272 TraceCheckUtils]: 27: Hoare triple {7268#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7017#true} is VALID [2022-04-15 15:11:23,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {7268#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {7268#(< ~counter~0 98)} is VALID [2022-04-15 15:11:23,874 INFO L290 TraceCheckUtils]: 25: Hoare triple {7293#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {7268#(< ~counter~0 98)} is VALID [2022-04-15 15:11:23,878 INFO L290 TraceCheckUtils]: 24: Hoare triple {7293#(< ~counter~0 97)} assume !!(0 != ~r~0); {7293#(< ~counter~0 97)} is VALID [2022-04-15 15:11:23,879 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {7017#true} {7293#(< ~counter~0 97)} #94#return; {7293#(< ~counter~0 97)} is VALID [2022-04-15 15:11:23,879 INFO L290 TraceCheckUtils]: 22: Hoare triple {7017#true} assume true; {7017#true} is VALID [2022-04-15 15:11:23,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {7017#true} assume !(0 == ~cond); {7017#true} is VALID [2022-04-15 15:11:23,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {7017#true} ~cond := #in~cond; {7017#true} is VALID [2022-04-15 15:11:23,880 INFO L272 TraceCheckUtils]: 19: Hoare triple {7293#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {7017#true} is VALID [2022-04-15 15:11:23,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {7293#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {7293#(< ~counter~0 97)} is VALID [2022-04-15 15:11:23,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {7318#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {7293#(< ~counter~0 97)} is VALID [2022-04-15 15:11:23,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {7318#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {7318#(< ~counter~0 96)} is VALID [2022-04-15 15:11:23,882 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {7017#true} {7318#(< ~counter~0 96)} #92#return; {7318#(< ~counter~0 96)} is VALID [2022-04-15 15:11:23,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {7017#true} assume true; {7017#true} is VALID [2022-04-15 15:11:23,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {7017#true} assume !(0 == ~cond); {7017#true} is VALID [2022-04-15 15:11:23,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {7017#true} ~cond := #in~cond; {7017#true} is VALID [2022-04-15 15:11:23,882 INFO L272 TraceCheckUtils]: 11: Hoare triple {7318#(< ~counter~0 96)} 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)); {7017#true} is VALID [2022-04-15 15:11:23,883 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {7017#true} {7318#(< ~counter~0 96)} #90#return; {7318#(< ~counter~0 96)} is VALID [2022-04-15 15:11:23,883 INFO L290 TraceCheckUtils]: 9: Hoare triple {7017#true} assume true; {7017#true} is VALID [2022-04-15 15:11:23,883 INFO L290 TraceCheckUtils]: 8: Hoare triple {7017#true} assume !(0 == ~cond); {7017#true} is VALID [2022-04-15 15:11:23,883 INFO L290 TraceCheckUtils]: 7: Hoare triple {7017#true} ~cond := #in~cond; {7017#true} is VALID [2022-04-15 15:11:23,883 INFO L272 TraceCheckUtils]: 6: Hoare triple {7318#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {7017#true} is VALID [2022-04-15 15:11:23,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {7318#(< ~counter~0 96)} 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; {7318#(< ~counter~0 96)} is VALID [2022-04-15 15:11:23,884 INFO L272 TraceCheckUtils]: 4: Hoare triple {7318#(< ~counter~0 96)} call #t~ret9 := main(); {7318#(< ~counter~0 96)} is VALID [2022-04-15 15:11:23,884 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {7318#(< ~counter~0 96)} {7017#true} #102#return; {7318#(< ~counter~0 96)} is VALID [2022-04-15 15:11:23,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#(< ~counter~0 96)} assume true; {7318#(< ~counter~0 96)} is VALID [2022-04-15 15:11:23,885 INFO L290 TraceCheckUtils]: 1: Hoare triple {7017#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; {7318#(< ~counter~0 96)} is VALID [2022-04-15 15:11:23,885 INFO L272 TraceCheckUtils]: 0: Hoare triple {7017#true} call ULTIMATE.init(); {7017#true} is VALID [2022-04-15 15:11:23,886 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:11:23,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416125982] [2022-04-15 15:11:23,886 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:23,886 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [389934056] [2022-04-15 15:11:23,886 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [389934056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:23,886 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:23,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:11:23,887 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:23,887 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1056571185] [2022-04-15 15:11:23,887 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1056571185] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:23,887 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:23,887 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:11:23,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092848847] [2022-04-15 15:11:23,887 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:23,888 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 57 [2022-04-15 15:11:23,888 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:23,888 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-15 15:11:23,932 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:23,932 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:11:23,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:23,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:11:23,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:11:23,933 INFO L87 Difference]: Start difference. First operand 95 states and 115 transitions. Second operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-15 15:11:24,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:24,237 INFO L93 Difference]: Finished difference Result 136 states and 173 transitions. [2022-04-15 15:11:24,237 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-04-15 15:11:24,238 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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 57 [2022-04-15 15:11:24,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:24,238 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-15 15:11:24,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 15:11:24,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-15 15:11:24,241 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 117 transitions. [2022-04-15 15:11:24,241 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 10 states and 117 transitions. [2022-04-15 15:11:24,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:24,337 INFO L225 Difference]: With dead ends: 136 [2022-04-15 15:11:24,338 INFO L226 Difference]: Without dead ends: 99 [2022-04-15 15:11:24,338 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=147, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:11:24,339 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 42 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 38 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 38 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:24,339 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 136 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [38 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-04-15 15:11:24,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2022-04-15 15:11:24,429 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:24,430 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 98 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:24,430 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 98 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:24,430 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 98 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:24,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:24,432 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-04-15 15:11:24,432 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2022-04-15 15:11:24,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:24,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:24,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 99 states. [2022-04-15 15:11:24,433 INFO L87 Difference]: Start difference. First operand has 98 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 99 states. [2022-04-15 15:11:24,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:24,435 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2022-04-15 15:11:24,435 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 120 transitions. [2022-04-15 15:11:24,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:24,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:24,436 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:24,436 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:24,436 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.1971830985915493) internal successors, (85), 71 states have internal predecessors, (85), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:24,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 119 transitions. [2022-04-15 15:11:24,438 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 119 transitions. Word has length 57 [2022-04-15 15:11:24,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:24,438 INFO L478 AbstractCegarLoop]: Abstraction has 98 states and 119 transitions. [2022-04-15 15:11:24,439 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.75) internal successors, (38), 7 states have internal predecessors, (38), 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-15 15:11:24,439 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 98 states and 119 transitions. [2022-04-15 15:11:26,222 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-15 15:11:26,222 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 119 transitions. [2022-04-15 15:11:26,223 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2022-04-15 15:11:26,223 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:26,223 INFO L499 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:26,239 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-15 15:11:26,427 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-15 15:11:26,427 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:26,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:26,428 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 5 times [2022-04-15 15:11:26,428 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:26,428 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [537629570] [2022-04-15 15:11:26,429 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:26,429 INFO L85 PathProgramCache]: Analyzing trace with hash -659642693, now seen corresponding path program 6 times [2022-04-15 15:11:26,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:26,429 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1299966341] [2022-04-15 15:11:26,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:26,429 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:26,451 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:26,452 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2130752472] [2022-04-15 15:11:26,452 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:11:26,452 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:26,452 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:26,455 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-15 15:11:26,483 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-15 15:11:26,544 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 15:11:26,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:26,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 13 conjunts are in the unsatisfiable core [2022-04-15 15:11:26,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:26,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:26,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {8042#true} call ULTIMATE.init(); {8042#true} is VALID [2022-04-15 15:11:26,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {8042#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; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {8050#(<= ~counter~0 0)} assume true; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,825 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8050#(<= ~counter~0 0)} {8042#true} #102#return; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,825 INFO L272 TraceCheckUtils]: 4: Hoare triple {8050#(<= ~counter~0 0)} call #t~ret9 := main(); {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,830 INFO L290 TraceCheckUtils]: 5: Hoare triple {8050#(<= ~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; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,831 INFO L272 TraceCheckUtils]: 6: Hoare triple {8050#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {8050#(<= ~counter~0 0)} ~cond := #in~cond; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,832 INFO L290 TraceCheckUtils]: 8: Hoare triple {8050#(<= ~counter~0 0)} assume !(0 == ~cond); {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {8050#(<= ~counter~0 0)} assume true; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8050#(<= ~counter~0 0)} {8050#(<= ~counter~0 0)} #90#return; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,834 INFO L272 TraceCheckUtils]: 11: Hoare triple {8050#(<= ~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)); {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {8050#(<= ~counter~0 0)} ~cond := #in~cond; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {8050#(<= ~counter~0 0)} assume !(0 == ~cond); {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {8050#(<= ~counter~0 0)} assume true; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8050#(<= ~counter~0 0)} {8050#(<= ~counter~0 0)} #92#return; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {8050#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8050#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:26,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {8050#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8099#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:26,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {8099#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {8099#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:26,837 INFO L272 TraceCheckUtils]: 19: Hoare triple {8099#(<= ~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)); {8099#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:26,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {8099#(<= ~counter~0 1)} ~cond := #in~cond; {8099#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:26,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {8099#(<= ~counter~0 1)} assume !(0 == ~cond); {8099#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:26,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {8099#(<= ~counter~0 1)} assume true; {8099#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:26,838 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8099#(<= ~counter~0 1)} {8099#(<= ~counter~0 1)} #94#return; {8099#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:26,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {8099#(<= ~counter~0 1)} assume !!(0 != ~r~0); {8099#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:26,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {8099#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8124#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:26,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {8124#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {8124#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:26,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {8124#(<= ~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)); {8124#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:26,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {8124#(<= ~counter~0 2)} ~cond := #in~cond; {8124#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:26,842 INFO L290 TraceCheckUtils]: 29: Hoare triple {8124#(<= ~counter~0 2)} assume !(0 == ~cond); {8124#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:26,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {8124#(<= ~counter~0 2)} assume true; {8124#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:26,843 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8124#(<= ~counter~0 2)} {8124#(<= ~counter~0 2)} #96#return; {8124#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:26,843 INFO L290 TraceCheckUtils]: 32: Hoare triple {8124#(<= ~counter~0 2)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8124#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:26,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {8124#(<= ~counter~0 2)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8149#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:26,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {8149#(<= ~counter~0 3)} assume !!(#t~post7 < 100);havoc #t~post7; {8149#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:26,844 INFO L272 TraceCheckUtils]: 35: Hoare triple {8149#(<= ~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)); {8149#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:26,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {8149#(<= ~counter~0 3)} ~cond := #in~cond; {8149#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:26,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {8149#(<= ~counter~0 3)} assume !(0 == ~cond); {8149#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:26,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {8149#(<= ~counter~0 3)} assume true; {8149#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:26,845 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8149#(<= ~counter~0 3)} {8149#(<= ~counter~0 3)} #96#return; {8149#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:26,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {8149#(<= ~counter~0 3)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8149#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:26,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {8149#(<= ~counter~0 3)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8174#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:26,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {8174#(<= ~counter~0 4)} assume !!(#t~post7 < 100);havoc #t~post7; {8174#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:26,847 INFO L272 TraceCheckUtils]: 43: Hoare triple {8174#(<= ~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)); {8174#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:26,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {8174#(<= ~counter~0 4)} ~cond := #in~cond; {8174#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:26,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {8174#(<= ~counter~0 4)} assume !(0 == ~cond); {8174#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:26,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {8174#(<= ~counter~0 4)} assume true; {8174#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:26,848 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8174#(<= ~counter~0 4)} {8174#(<= ~counter~0 4)} #96#return; {8174#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:26,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {8174#(<= ~counter~0 4)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8174#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:26,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {8174#(<= ~counter~0 4)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8199#(<= |main_#t~post7| 4)} is VALID [2022-04-15 15:11:26,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {8199#(<= |main_#t~post7| 4)} assume !(#t~post7 < 100);havoc #t~post7; {8043#false} is VALID [2022-04-15 15:11:26,849 INFO L290 TraceCheckUtils]: 51: Hoare triple {8043#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8043#false} is VALID [2022-04-15 15:11:26,849 INFO L290 TraceCheckUtils]: 52: Hoare triple {8043#false} assume !(#t~post8 < 100);havoc #t~post8; {8043#false} is VALID [2022-04-15 15:11:26,850 INFO L290 TraceCheckUtils]: 53: Hoare triple {8043#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8043#false} is VALID [2022-04-15 15:11:26,850 INFO L290 TraceCheckUtils]: 54: Hoare triple {8043#false} assume !(#t~post6 < 100);havoc #t~post6; {8043#false} is VALID [2022-04-15 15:11:26,850 INFO L272 TraceCheckUtils]: 55: Hoare triple {8043#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)); {8043#false} is VALID [2022-04-15 15:11:26,850 INFO L290 TraceCheckUtils]: 56: Hoare triple {8043#false} ~cond := #in~cond; {8043#false} is VALID [2022-04-15 15:11:26,850 INFO L290 TraceCheckUtils]: 57: Hoare triple {8043#false} assume 0 == ~cond; {8043#false} is VALID [2022-04-15 15:11:26,850 INFO L290 TraceCheckUtils]: 58: Hoare triple {8043#false} assume !false; {8043#false} is VALID [2022-04-15 15:11:26,850 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 42 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:26,850 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:27,165 INFO L290 TraceCheckUtils]: 58: Hoare triple {8043#false} assume !false; {8043#false} is VALID [2022-04-15 15:11:27,165 INFO L290 TraceCheckUtils]: 57: Hoare triple {8043#false} assume 0 == ~cond; {8043#false} is VALID [2022-04-15 15:11:27,165 INFO L290 TraceCheckUtils]: 56: Hoare triple {8043#false} ~cond := #in~cond; {8043#false} is VALID [2022-04-15 15:11:27,165 INFO L272 TraceCheckUtils]: 55: Hoare triple {8043#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)); {8043#false} is VALID [2022-04-15 15:11:27,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {8043#false} assume !(#t~post6 < 100);havoc #t~post6; {8043#false} is VALID [2022-04-15 15:11:27,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {8043#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8043#false} is VALID [2022-04-15 15:11:27,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {8043#false} assume !(#t~post8 < 100);havoc #t~post8; {8043#false} is VALID [2022-04-15 15:11:27,165 INFO L290 TraceCheckUtils]: 51: Hoare triple {8043#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {8043#false} is VALID [2022-04-15 15:11:27,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {8251#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {8043#false} is VALID [2022-04-15 15:11:27,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {8255#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8251#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:11:27,166 INFO L290 TraceCheckUtils]: 48: Hoare triple {8255#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8255#(< ~counter~0 100)} is VALID [2022-04-15 15:11:27,167 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {8042#true} {8255#(< ~counter~0 100)} #96#return; {8255#(< ~counter~0 100)} is VALID [2022-04-15 15:11:27,167 INFO L290 TraceCheckUtils]: 46: Hoare triple {8042#true} assume true; {8042#true} is VALID [2022-04-15 15:11:27,167 INFO L290 TraceCheckUtils]: 45: Hoare triple {8042#true} assume !(0 == ~cond); {8042#true} is VALID [2022-04-15 15:11:27,167 INFO L290 TraceCheckUtils]: 44: Hoare triple {8042#true} ~cond := #in~cond; {8042#true} is VALID [2022-04-15 15:11:27,167 INFO L272 TraceCheckUtils]: 43: Hoare triple {8255#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8042#true} is VALID [2022-04-15 15:11:27,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {8255#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {8255#(< ~counter~0 100)} is VALID [2022-04-15 15:11:27,168 INFO L290 TraceCheckUtils]: 41: Hoare triple {8280#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8255#(< ~counter~0 100)} is VALID [2022-04-15 15:11:27,168 INFO L290 TraceCheckUtils]: 40: Hoare triple {8280#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8280#(< ~counter~0 99)} is VALID [2022-04-15 15:11:27,169 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {8042#true} {8280#(< ~counter~0 99)} #96#return; {8280#(< ~counter~0 99)} is VALID [2022-04-15 15:11:27,169 INFO L290 TraceCheckUtils]: 38: Hoare triple {8042#true} assume true; {8042#true} is VALID [2022-04-15 15:11:27,169 INFO L290 TraceCheckUtils]: 37: Hoare triple {8042#true} assume !(0 == ~cond); {8042#true} is VALID [2022-04-15 15:11:27,169 INFO L290 TraceCheckUtils]: 36: Hoare triple {8042#true} ~cond := #in~cond; {8042#true} is VALID [2022-04-15 15:11:27,169 INFO L272 TraceCheckUtils]: 35: Hoare triple {8280#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8042#true} is VALID [2022-04-15 15:11:27,187 INFO L290 TraceCheckUtils]: 34: Hoare triple {8280#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {8280#(< ~counter~0 99)} is VALID [2022-04-15 15:11:27,188 INFO L290 TraceCheckUtils]: 33: Hoare triple {8305#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8280#(< ~counter~0 99)} is VALID [2022-04-15 15:11:27,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {8305#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {8305#(< ~counter~0 98)} is VALID [2022-04-15 15:11:27,190 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {8042#true} {8305#(< ~counter~0 98)} #96#return; {8305#(< ~counter~0 98)} is VALID [2022-04-15 15:11:27,190 INFO L290 TraceCheckUtils]: 30: Hoare triple {8042#true} assume true; {8042#true} is VALID [2022-04-15 15:11:27,190 INFO L290 TraceCheckUtils]: 29: Hoare triple {8042#true} assume !(0 == ~cond); {8042#true} is VALID [2022-04-15 15:11:27,190 INFO L290 TraceCheckUtils]: 28: Hoare triple {8042#true} ~cond := #in~cond; {8042#true} is VALID [2022-04-15 15:11:27,190 INFO L272 TraceCheckUtils]: 27: Hoare triple {8305#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8042#true} is VALID [2022-04-15 15:11:27,191 INFO L290 TraceCheckUtils]: 26: Hoare triple {8305#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {8305#(< ~counter~0 98)} is VALID [2022-04-15 15:11:27,192 INFO L290 TraceCheckUtils]: 25: Hoare triple {8330#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {8305#(< ~counter~0 98)} is VALID [2022-04-15 15:11:27,192 INFO L290 TraceCheckUtils]: 24: Hoare triple {8330#(< ~counter~0 97)} assume !!(0 != ~r~0); {8330#(< ~counter~0 97)} is VALID [2022-04-15 15:11:27,193 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {8042#true} {8330#(< ~counter~0 97)} #94#return; {8330#(< ~counter~0 97)} is VALID [2022-04-15 15:11:27,193 INFO L290 TraceCheckUtils]: 22: Hoare triple {8042#true} assume true; {8042#true} is VALID [2022-04-15 15:11:27,193 INFO L290 TraceCheckUtils]: 21: Hoare triple {8042#true} assume !(0 == ~cond); {8042#true} is VALID [2022-04-15 15:11:27,194 INFO L290 TraceCheckUtils]: 20: Hoare triple {8042#true} ~cond := #in~cond; {8042#true} is VALID [2022-04-15 15:11:27,194 INFO L272 TraceCheckUtils]: 19: Hoare triple {8330#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {8042#true} is VALID [2022-04-15 15:11:27,194 INFO L290 TraceCheckUtils]: 18: Hoare triple {8330#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {8330#(< ~counter~0 97)} is VALID [2022-04-15 15:11:27,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {8355#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {8330#(< ~counter~0 97)} is VALID [2022-04-15 15:11:27,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {8355#(< ~counter~0 96)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {8355#(< ~counter~0 96)} is VALID [2022-04-15 15:11:27,196 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {8042#true} {8355#(< ~counter~0 96)} #92#return; {8355#(< ~counter~0 96)} is VALID [2022-04-15 15:11:27,196 INFO L290 TraceCheckUtils]: 14: Hoare triple {8042#true} assume true; {8042#true} is VALID [2022-04-15 15:11:27,196 INFO L290 TraceCheckUtils]: 13: Hoare triple {8042#true} assume !(0 == ~cond); {8042#true} is VALID [2022-04-15 15:11:27,197 INFO L290 TraceCheckUtils]: 12: Hoare triple {8042#true} ~cond := #in~cond; {8042#true} is VALID [2022-04-15 15:11:27,197 INFO L272 TraceCheckUtils]: 11: Hoare triple {8355#(< ~counter~0 96)} 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)); {8042#true} is VALID [2022-04-15 15:11:27,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {8042#true} {8355#(< ~counter~0 96)} #90#return; {8355#(< ~counter~0 96)} is VALID [2022-04-15 15:11:27,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {8042#true} assume true; {8042#true} is VALID [2022-04-15 15:11:27,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {8042#true} assume !(0 == ~cond); {8042#true} is VALID [2022-04-15 15:11:27,198 INFO L290 TraceCheckUtils]: 7: Hoare triple {8042#true} ~cond := #in~cond; {8042#true} is VALID [2022-04-15 15:11:27,198 INFO L272 TraceCheckUtils]: 6: Hoare triple {8355#(< ~counter~0 96)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {8042#true} is VALID [2022-04-15 15:11:27,198 INFO L290 TraceCheckUtils]: 5: Hoare triple {8355#(< ~counter~0 96)} 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; {8355#(< ~counter~0 96)} is VALID [2022-04-15 15:11:27,199 INFO L272 TraceCheckUtils]: 4: Hoare triple {8355#(< ~counter~0 96)} call #t~ret9 := main(); {8355#(< ~counter~0 96)} is VALID [2022-04-15 15:11:27,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8355#(< ~counter~0 96)} {8042#true} #102#return; {8355#(< ~counter~0 96)} is VALID [2022-04-15 15:11:27,200 INFO L290 TraceCheckUtils]: 2: Hoare triple {8355#(< ~counter~0 96)} assume true; {8355#(< ~counter~0 96)} is VALID [2022-04-15 15:11:27,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {8042#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; {8355#(< ~counter~0 96)} is VALID [2022-04-15 15:11:27,201 INFO L272 TraceCheckUtils]: 0: Hoare triple {8042#true} call ULTIMATE.init(); {8042#true} is VALID [2022-04-15 15:11:27,201 INFO L134 CoverageAnalysis]: Checked inductivity of 56 backedges. 10 proven. 18 refuted. 0 times theorem prover too weak. 28 trivial. 0 not checked. [2022-04-15 15:11:27,202 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:27,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1299966341] [2022-04-15 15:11:27,202 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:27,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2130752472] [2022-04-15 15:11:27,202 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2130752472] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:27,202 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:27,202 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:11:27,202 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:27,202 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [537629570] [2022-04-15 15:11:27,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [537629570] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:27,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:27,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:11:27,203 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1162141538] [2022-04-15 15:11:27,203 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:27,203 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-15 15:11:27,204 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:27,204 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-15 15:11:27,246 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-15 15:11:27,247 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:11:27,247 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:27,247 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:11:27,247 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=111, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:11:27,248 INFO L87 Difference]: Start difference. First operand 98 states and 119 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-15 15:11:27,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:27,557 INFO L93 Difference]: Finished difference Result 137 states and 174 transitions. [2022-04-15 15:11:27,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 15:11:27,557 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-15 15:11:27,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:27,558 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-15 15:11:27,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 15:11:27,559 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-15 15:11:27,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 117 transitions. [2022-04-15 15:11:27,561 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 117 transitions. [2022-04-15 15:11:27,653 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:27,655 INFO L225 Difference]: With dead ends: 137 [2022-04-15 15:11:27,655 INFO L226 Difference]: Without dead ends: 100 [2022-04-15 15:11:27,656 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=107, Invalid=165, Unknown=0, NotChecked=0, Total=272 [2022-04-15 15:11:27,656 INFO L913 BasicCegarLoop]: 42 mSDtfsCounter, 32 mSDsluCounter, 108 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:27,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 150 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:27,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-04-15 15:11:27,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2022-04-15 15:11:27,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:27,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 100 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 73 states have internal predecessors, (87), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:27,743 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 100 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 73 states have internal predecessors, (87), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:27,744 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 100 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 73 states have internal predecessors, (87), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:27,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:27,746 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2022-04-15 15:11:27,746 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2022-04-15 15:11:27,746 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:27,746 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:27,747 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 73 states have internal predecessors, (87), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 100 states. [2022-04-15 15:11:27,747 INFO L87 Difference]: Start difference. First operand has 100 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 73 states have internal predecessors, (87), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) Second operand 100 states. [2022-04-15 15:11:27,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:27,749 INFO L93 Difference]: Finished difference Result 100 states and 121 transitions. [2022-04-15 15:11:27,749 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2022-04-15 15:11:27,749 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:27,749 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:27,749 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:27,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:27,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 73 states have (on average 1.1917808219178083) internal successors, (87), 73 states have internal predecessors, (87), 18 states have call successors, (18), 10 states have call predecessors, (18), 8 states have return successors, (16), 16 states have call predecessors, (16), 16 states have call successors, (16) [2022-04-15 15:11:27,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 121 transitions. [2022-04-15 15:11:27,752 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 121 transitions. Word has length 59 [2022-04-15 15:11:27,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:27,752 INFO L478 AbstractCegarLoop]: Abstraction has 100 states and 121 transitions. [2022-04-15 15:11:27,753 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-15 15:11:27,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 100 states and 121 transitions. [2022-04-15 15:11:29,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 121 edges. 121 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:29,277 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 121 transitions. [2022-04-15 15:11:29,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2022-04-15 15:11:29,277 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:29,278 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 3, 3, 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, 1, 1, 1] [2022-04-15 15:11:29,284 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-15 15:11:29,478 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-15 15:11:29,478 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:29,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 3 times [2022-04-15 15:11:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:29,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [119234313] [2022-04-15 15:11:29,479 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:29,479 INFO L85 PathProgramCache]: Analyzing trace with hash -1402694082, now seen corresponding path program 4 times [2022-04-15 15:11:29,479 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:29,479 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [966792007] [2022-04-15 15:11:29,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:29,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:29,490 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:29,490 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [990209424] [2022-04-15 15:11:29,490 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:11:29,490 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:29,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:29,491 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-15 15:11:29,496 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-15 15:11:29,550 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:11:29,551 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:29,551 INFO L263 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 15:11:29,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:29,564 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:29,838 INFO L272 TraceCheckUtils]: 0: Hoare triple {9089#true} call ULTIMATE.init(); {9089#true} is VALID [2022-04-15 15:11:29,838 INFO L290 TraceCheckUtils]: 1: Hoare triple {9089#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; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,838 INFO L290 TraceCheckUtils]: 2: Hoare triple {9097#(<= ~counter~0 0)} assume true; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,839 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9097#(<= ~counter~0 0)} {9089#true} #102#return; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,839 INFO L272 TraceCheckUtils]: 4: Hoare triple {9097#(<= ~counter~0 0)} call #t~ret9 := main(); {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,839 INFO L290 TraceCheckUtils]: 5: Hoare triple {9097#(<= ~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; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,840 INFO L272 TraceCheckUtils]: 6: Hoare triple {9097#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,840 INFO L290 TraceCheckUtils]: 7: Hoare triple {9097#(<= ~counter~0 0)} ~cond := #in~cond; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,840 INFO L290 TraceCheckUtils]: 8: Hoare triple {9097#(<= ~counter~0 0)} assume !(0 == ~cond); {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {9097#(<= ~counter~0 0)} assume true; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9097#(<= ~counter~0 0)} {9097#(<= ~counter~0 0)} #90#return; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,841 INFO L272 TraceCheckUtils]: 11: Hoare triple {9097#(<= ~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)); {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {9097#(<= ~counter~0 0)} ~cond := #in~cond; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,842 INFO L290 TraceCheckUtils]: 13: Hoare triple {9097#(<= ~counter~0 0)} assume !(0 == ~cond); {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,842 INFO L290 TraceCheckUtils]: 14: Hoare triple {9097#(<= ~counter~0 0)} assume true; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,843 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9097#(<= ~counter~0 0)} {9097#(<= ~counter~0 0)} #92#return; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,843 INFO L290 TraceCheckUtils]: 16: Hoare triple {9097#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9097#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:29,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {9097#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9146#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:29,844 INFO L290 TraceCheckUtils]: 18: Hoare triple {9146#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {9146#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:29,844 INFO L272 TraceCheckUtils]: 19: Hoare triple {9146#(<= ~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)); {9146#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:29,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {9146#(<= ~counter~0 1)} ~cond := #in~cond; {9146#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:29,845 INFO L290 TraceCheckUtils]: 21: Hoare triple {9146#(<= ~counter~0 1)} assume !(0 == ~cond); {9146#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:29,845 INFO L290 TraceCheckUtils]: 22: Hoare triple {9146#(<= ~counter~0 1)} assume true; {9146#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:29,846 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9146#(<= ~counter~0 1)} {9146#(<= ~counter~0 1)} #94#return; {9146#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:29,846 INFO L290 TraceCheckUtils]: 24: Hoare triple {9146#(<= ~counter~0 1)} assume !!(0 != ~r~0); {9146#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:29,846 INFO L290 TraceCheckUtils]: 25: Hoare triple {9146#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9171#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:29,847 INFO L290 TraceCheckUtils]: 26: Hoare triple {9171#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {9171#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:29,847 INFO L272 TraceCheckUtils]: 27: Hoare triple {9171#(<= ~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)); {9171#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:29,847 INFO L290 TraceCheckUtils]: 28: Hoare triple {9171#(<= ~counter~0 2)} ~cond := #in~cond; {9171#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:29,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {9171#(<= ~counter~0 2)} assume !(0 == ~cond); {9171#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:29,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {9171#(<= ~counter~0 2)} assume true; {9171#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:29,848 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9171#(<= ~counter~0 2)} {9171#(<= ~counter~0 2)} #96#return; {9171#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:29,849 INFO L290 TraceCheckUtils]: 32: Hoare triple {9171#(<= ~counter~0 2)} assume !(~r~0 > 0); {9171#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:29,849 INFO L290 TraceCheckUtils]: 33: Hoare triple {9171#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9196#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:29,849 INFO L290 TraceCheckUtils]: 34: Hoare triple {9196#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {9196#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:29,850 INFO L272 TraceCheckUtils]: 35: Hoare triple {9196#(<= ~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)); {9196#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:29,850 INFO L290 TraceCheckUtils]: 36: Hoare triple {9196#(<= ~counter~0 3)} ~cond := #in~cond; {9196#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:29,850 INFO L290 TraceCheckUtils]: 37: Hoare triple {9196#(<= ~counter~0 3)} assume !(0 == ~cond); {9196#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:29,851 INFO L290 TraceCheckUtils]: 38: Hoare triple {9196#(<= ~counter~0 3)} assume true; {9196#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:29,851 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9196#(<= ~counter~0 3)} {9196#(<= ~counter~0 3)} #98#return; {9196#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:29,852 INFO L290 TraceCheckUtils]: 40: Hoare triple {9196#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9196#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:29,852 INFO L290 TraceCheckUtils]: 41: Hoare triple {9196#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9221#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:29,852 INFO L290 TraceCheckUtils]: 42: Hoare triple {9221#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {9221#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:29,853 INFO L272 TraceCheckUtils]: 43: Hoare triple {9221#(<= ~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)); {9221#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:29,853 INFO L290 TraceCheckUtils]: 44: Hoare triple {9221#(<= ~counter~0 4)} ~cond := #in~cond; {9221#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:29,853 INFO L290 TraceCheckUtils]: 45: Hoare triple {9221#(<= ~counter~0 4)} assume !(0 == ~cond); {9221#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:29,854 INFO L290 TraceCheckUtils]: 46: Hoare triple {9221#(<= ~counter~0 4)} assume true; {9221#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:29,854 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9221#(<= ~counter~0 4)} {9221#(<= ~counter~0 4)} #98#return; {9221#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:29,854 INFO L290 TraceCheckUtils]: 48: Hoare triple {9221#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9221#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:29,855 INFO L290 TraceCheckUtils]: 49: Hoare triple {9221#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9246#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:29,855 INFO L290 TraceCheckUtils]: 50: Hoare triple {9246#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {9246#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:29,856 INFO L272 TraceCheckUtils]: 51: Hoare triple {9246#(<= ~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)); {9246#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:29,856 INFO L290 TraceCheckUtils]: 52: Hoare triple {9246#(<= ~counter~0 5)} ~cond := #in~cond; {9246#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:29,856 INFO L290 TraceCheckUtils]: 53: Hoare triple {9246#(<= ~counter~0 5)} assume !(0 == ~cond); {9246#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:29,856 INFO L290 TraceCheckUtils]: 54: Hoare triple {9246#(<= ~counter~0 5)} assume true; {9246#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:29,857 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9246#(<= ~counter~0 5)} {9246#(<= ~counter~0 5)} #98#return; {9246#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:29,857 INFO L290 TraceCheckUtils]: 56: Hoare triple {9246#(<= ~counter~0 5)} assume !(~r~0 < 0); {9246#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:29,858 INFO L290 TraceCheckUtils]: 57: Hoare triple {9246#(<= ~counter~0 5)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9271#(<= |main_#t~post6| 5)} is VALID [2022-04-15 15:11:29,858 INFO L290 TraceCheckUtils]: 58: Hoare triple {9271#(<= |main_#t~post6| 5)} assume !(#t~post6 < 100);havoc #t~post6; {9090#false} is VALID [2022-04-15 15:11:29,858 INFO L272 TraceCheckUtils]: 59: Hoare triple {9090#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)); {9090#false} is VALID [2022-04-15 15:11:29,858 INFO L290 TraceCheckUtils]: 60: Hoare triple {9090#false} ~cond := #in~cond; {9090#false} is VALID [2022-04-15 15:11:29,858 INFO L290 TraceCheckUtils]: 61: Hoare triple {9090#false} assume 0 == ~cond; {9090#false} is VALID [2022-04-15 15:11:29,858 INFO L290 TraceCheckUtils]: 62: Hoare triple {9090#false} assume !false; {9090#false} is VALID [2022-04-15 15:11:29,858 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 54 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:29,859 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:30,201 INFO L290 TraceCheckUtils]: 62: Hoare triple {9090#false} assume !false; {9090#false} is VALID [2022-04-15 15:11:30,201 INFO L290 TraceCheckUtils]: 61: Hoare triple {9090#false} assume 0 == ~cond; {9090#false} is VALID [2022-04-15 15:11:30,201 INFO L290 TraceCheckUtils]: 60: Hoare triple {9090#false} ~cond := #in~cond; {9090#false} is VALID [2022-04-15 15:11:30,202 INFO L272 TraceCheckUtils]: 59: Hoare triple {9090#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)); {9090#false} is VALID [2022-04-15 15:11:30,202 INFO L290 TraceCheckUtils]: 58: Hoare triple {9299#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {9090#false} is VALID [2022-04-15 15:11:30,202 INFO L290 TraceCheckUtils]: 57: Hoare triple {9303#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9299#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:11:30,202 INFO L290 TraceCheckUtils]: 56: Hoare triple {9303#(< ~counter~0 100)} assume !(~r~0 < 0); {9303#(< ~counter~0 100)} is VALID [2022-04-15 15:11:30,203 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {9089#true} {9303#(< ~counter~0 100)} #98#return; {9303#(< ~counter~0 100)} is VALID [2022-04-15 15:11:30,203 INFO L290 TraceCheckUtils]: 54: Hoare triple {9089#true} assume true; {9089#true} is VALID [2022-04-15 15:11:30,203 INFO L290 TraceCheckUtils]: 53: Hoare triple {9089#true} assume !(0 == ~cond); {9089#true} is VALID [2022-04-15 15:11:30,203 INFO L290 TraceCheckUtils]: 52: Hoare triple {9089#true} ~cond := #in~cond; {9089#true} is VALID [2022-04-15 15:11:30,203 INFO L272 TraceCheckUtils]: 51: Hoare triple {9303#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9089#true} is VALID [2022-04-15 15:11:30,204 INFO L290 TraceCheckUtils]: 50: Hoare triple {9303#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {9303#(< ~counter~0 100)} is VALID [2022-04-15 15:11:30,205 INFO L290 TraceCheckUtils]: 49: Hoare triple {9328#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9303#(< ~counter~0 100)} is VALID [2022-04-15 15:11:30,205 INFO L290 TraceCheckUtils]: 48: Hoare triple {9328#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9328#(< ~counter~0 99)} is VALID [2022-04-15 15:11:30,205 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {9089#true} {9328#(< ~counter~0 99)} #98#return; {9328#(< ~counter~0 99)} is VALID [2022-04-15 15:11:30,205 INFO L290 TraceCheckUtils]: 46: Hoare triple {9089#true} assume true; {9089#true} is VALID [2022-04-15 15:11:30,205 INFO L290 TraceCheckUtils]: 45: Hoare triple {9089#true} assume !(0 == ~cond); {9089#true} is VALID [2022-04-15 15:11:30,206 INFO L290 TraceCheckUtils]: 44: Hoare triple {9089#true} ~cond := #in~cond; {9089#true} is VALID [2022-04-15 15:11:30,206 INFO L272 TraceCheckUtils]: 43: Hoare triple {9328#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9089#true} is VALID [2022-04-15 15:11:30,206 INFO L290 TraceCheckUtils]: 42: Hoare triple {9328#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {9328#(< ~counter~0 99)} is VALID [2022-04-15 15:11:30,206 INFO L290 TraceCheckUtils]: 41: Hoare triple {9353#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9328#(< ~counter~0 99)} is VALID [2022-04-15 15:11:30,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {9353#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {9353#(< ~counter~0 98)} is VALID [2022-04-15 15:11:30,207 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {9089#true} {9353#(< ~counter~0 98)} #98#return; {9353#(< ~counter~0 98)} is VALID [2022-04-15 15:11:30,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {9089#true} assume true; {9089#true} is VALID [2022-04-15 15:11:30,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {9089#true} assume !(0 == ~cond); {9089#true} is VALID [2022-04-15 15:11:30,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {9089#true} ~cond := #in~cond; {9089#true} is VALID [2022-04-15 15:11:30,207 INFO L272 TraceCheckUtils]: 35: Hoare triple {9353#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9089#true} is VALID [2022-04-15 15:11:30,208 INFO L290 TraceCheckUtils]: 34: Hoare triple {9353#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {9353#(< ~counter~0 98)} is VALID [2022-04-15 15:11:30,208 INFO L290 TraceCheckUtils]: 33: Hoare triple {9378#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {9353#(< ~counter~0 98)} is VALID [2022-04-15 15:11:30,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {9378#(< ~counter~0 97)} assume !(~r~0 > 0); {9378#(< ~counter~0 97)} is VALID [2022-04-15 15:11:30,209 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {9089#true} {9378#(< ~counter~0 97)} #96#return; {9378#(< ~counter~0 97)} is VALID [2022-04-15 15:11:30,209 INFO L290 TraceCheckUtils]: 30: Hoare triple {9089#true} assume true; {9089#true} is VALID [2022-04-15 15:11:30,209 INFO L290 TraceCheckUtils]: 29: Hoare triple {9089#true} assume !(0 == ~cond); {9089#true} is VALID [2022-04-15 15:11:30,209 INFO L290 TraceCheckUtils]: 28: Hoare triple {9089#true} ~cond := #in~cond; {9089#true} is VALID [2022-04-15 15:11:30,209 INFO L272 TraceCheckUtils]: 27: Hoare triple {9378#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9089#true} is VALID [2022-04-15 15:11:30,209 INFO L290 TraceCheckUtils]: 26: Hoare triple {9378#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {9378#(< ~counter~0 97)} is VALID [2022-04-15 15:11:30,210 INFO L290 TraceCheckUtils]: 25: Hoare triple {9403#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {9378#(< ~counter~0 97)} is VALID [2022-04-15 15:11:30,210 INFO L290 TraceCheckUtils]: 24: Hoare triple {9403#(< ~counter~0 96)} assume !!(0 != ~r~0); {9403#(< ~counter~0 96)} is VALID [2022-04-15 15:11:30,211 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {9089#true} {9403#(< ~counter~0 96)} #94#return; {9403#(< ~counter~0 96)} is VALID [2022-04-15 15:11:30,211 INFO L290 TraceCheckUtils]: 22: Hoare triple {9089#true} assume true; {9089#true} is VALID [2022-04-15 15:11:30,211 INFO L290 TraceCheckUtils]: 21: Hoare triple {9089#true} assume !(0 == ~cond); {9089#true} is VALID [2022-04-15 15:11:30,211 INFO L290 TraceCheckUtils]: 20: Hoare triple {9089#true} ~cond := #in~cond; {9089#true} is VALID [2022-04-15 15:11:30,211 INFO L272 TraceCheckUtils]: 19: Hoare triple {9403#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {9089#true} is VALID [2022-04-15 15:11:30,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {9403#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {9403#(< ~counter~0 96)} is VALID [2022-04-15 15:11:30,212 INFO L290 TraceCheckUtils]: 17: Hoare triple {9428#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {9403#(< ~counter~0 96)} is VALID [2022-04-15 15:11:30,212 INFO L290 TraceCheckUtils]: 16: Hoare triple {9428#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {9428#(< ~counter~0 95)} is VALID [2022-04-15 15:11:30,212 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {9089#true} {9428#(< ~counter~0 95)} #92#return; {9428#(< ~counter~0 95)} is VALID [2022-04-15 15:11:30,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {9089#true} assume true; {9089#true} is VALID [2022-04-15 15:11:30,212 INFO L290 TraceCheckUtils]: 13: Hoare triple {9089#true} assume !(0 == ~cond); {9089#true} is VALID [2022-04-15 15:11:30,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {9089#true} ~cond := #in~cond; {9089#true} is VALID [2022-04-15 15:11:30,213 INFO L272 TraceCheckUtils]: 11: Hoare triple {9428#(< ~counter~0 95)} 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)); {9089#true} is VALID [2022-04-15 15:11:30,213 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {9089#true} {9428#(< ~counter~0 95)} #90#return; {9428#(< ~counter~0 95)} is VALID [2022-04-15 15:11:30,213 INFO L290 TraceCheckUtils]: 9: Hoare triple {9089#true} assume true; {9089#true} is VALID [2022-04-15 15:11:30,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {9089#true} assume !(0 == ~cond); {9089#true} is VALID [2022-04-15 15:11:30,213 INFO L290 TraceCheckUtils]: 7: Hoare triple {9089#true} ~cond := #in~cond; {9089#true} is VALID [2022-04-15 15:11:30,213 INFO L272 TraceCheckUtils]: 6: Hoare triple {9428#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {9089#true} is VALID [2022-04-15 15:11:30,214 INFO L290 TraceCheckUtils]: 5: Hoare triple {9428#(< ~counter~0 95)} 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; {9428#(< ~counter~0 95)} is VALID [2022-04-15 15:11:30,214 INFO L272 TraceCheckUtils]: 4: Hoare triple {9428#(< ~counter~0 95)} call #t~ret9 := main(); {9428#(< ~counter~0 95)} is VALID [2022-04-15 15:11:30,214 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {9428#(< ~counter~0 95)} {9089#true} #102#return; {9428#(< ~counter~0 95)} is VALID [2022-04-15 15:11:30,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {9428#(< ~counter~0 95)} assume true; {9428#(< ~counter~0 95)} is VALID [2022-04-15 15:11:30,215 INFO L290 TraceCheckUtils]: 1: Hoare triple {9089#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; {9428#(< ~counter~0 95)} is VALID [2022-04-15 15:11:30,215 INFO L272 TraceCheckUtils]: 0: Hoare triple {9089#true} call ULTIMATE.init(); {9089#true} is VALID [2022-04-15 15:11:30,215 INFO L134 CoverageAnalysis]: Checked inductivity of 68 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 15:11:30,215 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:30,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [966792007] [2022-04-15 15:11:30,216 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:30,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [990209424] [2022-04-15 15:11:30,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [990209424] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:30,216 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:30,216 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 15:11:30,216 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:30,216 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [119234313] [2022-04-15 15:11:30,216 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [119234313] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:30,216 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:30,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:11:30,217 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173231771] [2022-04-15 15:11:30,217 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:30,217 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 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 63 [2022-04-15 15:11:30,217 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:30,217 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 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-15 15:11:30,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:30,259 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:11:30,259 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:30,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:11:30,260 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:11:30,260 INFO L87 Difference]: Start difference. First operand 100 states and 121 transitions. Second operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 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-15 15:11:30,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:30,589 INFO L93 Difference]: Finished difference Result 120 states and 145 transitions. [2022-04-15 15:11:30,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-04-15 15:11:30,589 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 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 63 [2022-04-15 15:11:30,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:30,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 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-15 15:11:30,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 15:11:30,591 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 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-15 15:11:30,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-04-15 15:11:30,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-04-15 15:11:30,669 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-15 15:11:30,671 INFO L225 Difference]: With dead ends: 120 [2022-04-15 15:11:30,671 INFO L226 Difference]: Without dead ends: 115 [2022-04-15 15:11:30,672 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 111 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=123, Invalid=183, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:11:30,672 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 41 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 87 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:30,673 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 173 Invalid, 87 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:30,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-04-15 15:11:30,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 110. [2022-04-15 15:11:30,779 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:30,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 110 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 81 states have internal predecessors, (94), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:30,779 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 110 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 81 states have internal predecessors, (94), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:30,780 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 110 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 81 states have internal predecessors, (94), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:30,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:30,782 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-04-15 15:11:30,782 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2022-04-15 15:11:30,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:30,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:30,782 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 81 states have internal predecessors, (94), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 115 states. [2022-04-15 15:11:30,782 INFO L87 Difference]: Start difference. First operand has 110 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 81 states have internal predecessors, (94), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) Second operand 115 states. [2022-04-15 15:11:30,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:30,785 INFO L93 Difference]: Finished difference Result 115 states and 140 transitions. [2022-04-15 15:11:30,785 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 140 transitions. [2022-04-15 15:11:30,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:30,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:30,785 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:30,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:30,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 79 states have (on average 1.1898734177215189) internal successors, (94), 81 states have internal predecessors, (94), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 17 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:30,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 134 transitions. [2022-04-15 15:11:30,788 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 134 transitions. Word has length 63 [2022-04-15 15:11:30,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:30,789 INFO L478 AbstractCegarLoop]: Abstraction has 110 states and 134 transitions. [2022-04-15 15:11:30,789 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.666666666666667) internal successors, (42), 8 states have internal predecessors, (42), 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-15 15:11:30,789 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 110 states and 134 transitions. [2022-04-15 15:11:32,925 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 133 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 134 transitions. [2022-04-15 15:11:32,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2022-04-15 15:11:32,926 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:32,926 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:32,942 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2022-04-15 15:11:33,127 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-15 15:11:33,127 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:33,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:33,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 5 times [2022-04-15 15:11:33,127 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:33,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [60322911] [2022-04-15 15:11:33,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:33,128 INFO L85 PathProgramCache]: Analyzing trace with hash -1823928061, now seen corresponding path program 6 times [2022-04-15 15:11:33,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:33,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742574673] [2022-04-15 15:11:33,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:33,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:33,140 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:33,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [603900167] [2022-04-15 15:11:33,140 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:11:33,140 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:33,140 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:33,141 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-15 15:11:33,142 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-15 15:11:33,207 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 15:11:33,207 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:33,208 INFO L263 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 15:11:33,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:33,221 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:33,525 INFO L272 TraceCheckUtils]: 0: Hoare triple {10176#true} call ULTIMATE.init(); {10176#true} is VALID [2022-04-15 15:11:33,525 INFO L290 TraceCheckUtils]: 1: Hoare triple {10176#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; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {10184#(<= ~counter~0 0)} assume true; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,526 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10184#(<= ~counter~0 0)} {10176#true} #102#return; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,526 INFO L272 TraceCheckUtils]: 4: Hoare triple {10184#(<= ~counter~0 0)} call #t~ret9 := main(); {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {10184#(<= ~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; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,527 INFO L272 TraceCheckUtils]: 6: Hoare triple {10184#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {10184#(<= ~counter~0 0)} ~cond := #in~cond; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,527 INFO L290 TraceCheckUtils]: 8: Hoare triple {10184#(<= ~counter~0 0)} assume !(0 == ~cond); {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,528 INFO L290 TraceCheckUtils]: 9: Hoare triple {10184#(<= ~counter~0 0)} assume true; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,528 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10184#(<= ~counter~0 0)} {10184#(<= ~counter~0 0)} #90#return; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,529 INFO L272 TraceCheckUtils]: 11: Hoare triple {10184#(<= ~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)); {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {10184#(<= ~counter~0 0)} ~cond := #in~cond; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {10184#(<= ~counter~0 0)} assume !(0 == ~cond); {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {10184#(<= ~counter~0 0)} assume true; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,530 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10184#(<= ~counter~0 0)} {10184#(<= ~counter~0 0)} #92#return; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {10184#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10184#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:33,531 INFO L290 TraceCheckUtils]: 17: Hoare triple {10184#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10233#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:33,531 INFO L290 TraceCheckUtils]: 18: Hoare triple {10233#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {10233#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:33,532 INFO L272 TraceCheckUtils]: 19: Hoare triple {10233#(<= ~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)); {10233#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:33,532 INFO L290 TraceCheckUtils]: 20: Hoare triple {10233#(<= ~counter~0 1)} ~cond := #in~cond; {10233#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:33,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {10233#(<= ~counter~0 1)} assume !(0 == ~cond); {10233#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:33,532 INFO L290 TraceCheckUtils]: 22: Hoare triple {10233#(<= ~counter~0 1)} assume true; {10233#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:33,533 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10233#(<= ~counter~0 1)} {10233#(<= ~counter~0 1)} #94#return; {10233#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:33,533 INFO L290 TraceCheckUtils]: 24: Hoare triple {10233#(<= ~counter~0 1)} assume !!(0 != ~r~0); {10233#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:33,534 INFO L290 TraceCheckUtils]: 25: Hoare triple {10233#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10258#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:33,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {10258#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {10258#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:33,534 INFO L272 TraceCheckUtils]: 27: Hoare triple {10258#(<= ~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)); {10258#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:33,535 INFO L290 TraceCheckUtils]: 28: Hoare triple {10258#(<= ~counter~0 2)} ~cond := #in~cond; {10258#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:33,535 INFO L290 TraceCheckUtils]: 29: Hoare triple {10258#(<= ~counter~0 2)} assume !(0 == ~cond); {10258#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:33,535 INFO L290 TraceCheckUtils]: 30: Hoare triple {10258#(<= ~counter~0 2)} assume true; {10258#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:33,536 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10258#(<= ~counter~0 2)} {10258#(<= ~counter~0 2)} #96#return; {10258#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:33,536 INFO L290 TraceCheckUtils]: 32: Hoare triple {10258#(<= ~counter~0 2)} assume !(~r~0 > 0); {10258#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:33,536 INFO L290 TraceCheckUtils]: 33: Hoare triple {10258#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10283#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:33,537 INFO L290 TraceCheckUtils]: 34: Hoare triple {10283#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {10283#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:33,537 INFO L272 TraceCheckUtils]: 35: Hoare triple {10283#(<= ~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)); {10283#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:33,538 INFO L290 TraceCheckUtils]: 36: Hoare triple {10283#(<= ~counter~0 3)} ~cond := #in~cond; {10283#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:33,538 INFO L290 TraceCheckUtils]: 37: Hoare triple {10283#(<= ~counter~0 3)} assume !(0 == ~cond); {10283#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:33,538 INFO L290 TraceCheckUtils]: 38: Hoare triple {10283#(<= ~counter~0 3)} assume true; {10283#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:33,539 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10283#(<= ~counter~0 3)} {10283#(<= ~counter~0 3)} #98#return; {10283#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:33,539 INFO L290 TraceCheckUtils]: 40: Hoare triple {10283#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10283#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:33,539 INFO L290 TraceCheckUtils]: 41: Hoare triple {10283#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10308#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:33,540 INFO L290 TraceCheckUtils]: 42: Hoare triple {10308#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {10308#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:33,540 INFO L272 TraceCheckUtils]: 43: Hoare triple {10308#(<= ~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)); {10308#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:33,540 INFO L290 TraceCheckUtils]: 44: Hoare triple {10308#(<= ~counter~0 4)} ~cond := #in~cond; {10308#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:33,545 INFO L290 TraceCheckUtils]: 45: Hoare triple {10308#(<= ~counter~0 4)} assume !(0 == ~cond); {10308#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:33,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {10308#(<= ~counter~0 4)} assume true; {10308#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:33,546 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10308#(<= ~counter~0 4)} {10308#(<= ~counter~0 4)} #98#return; {10308#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:33,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {10308#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10308#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:33,547 INFO L290 TraceCheckUtils]: 49: Hoare triple {10308#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10333#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:33,547 INFO L290 TraceCheckUtils]: 50: Hoare triple {10333#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {10333#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:33,548 INFO L272 TraceCheckUtils]: 51: Hoare triple {10333#(<= ~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)); {10333#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:33,548 INFO L290 TraceCheckUtils]: 52: Hoare triple {10333#(<= ~counter~0 5)} ~cond := #in~cond; {10333#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:33,548 INFO L290 TraceCheckUtils]: 53: Hoare triple {10333#(<= ~counter~0 5)} assume !(0 == ~cond); {10333#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:33,549 INFO L290 TraceCheckUtils]: 54: Hoare triple {10333#(<= ~counter~0 5)} assume true; {10333#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:33,549 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10333#(<= ~counter~0 5)} {10333#(<= ~counter~0 5)} #98#return; {10333#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:33,549 INFO L290 TraceCheckUtils]: 56: Hoare triple {10333#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10333#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:33,550 INFO L290 TraceCheckUtils]: 57: Hoare triple {10333#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10358#(<= |main_#t~post8| 5)} is VALID [2022-04-15 15:11:33,550 INFO L290 TraceCheckUtils]: 58: Hoare triple {10358#(<= |main_#t~post8| 5)} assume !(#t~post8 < 100);havoc #t~post8; {10177#false} is VALID [2022-04-15 15:11:33,550 INFO L290 TraceCheckUtils]: 59: Hoare triple {10177#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10177#false} is VALID [2022-04-15 15:11:33,550 INFO L290 TraceCheckUtils]: 60: Hoare triple {10177#false} assume !(#t~post6 < 100);havoc #t~post6; {10177#false} is VALID [2022-04-15 15:11:33,550 INFO L272 TraceCheckUtils]: 61: Hoare triple {10177#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)); {10177#false} is VALID [2022-04-15 15:11:33,550 INFO L290 TraceCheckUtils]: 62: Hoare triple {10177#false} ~cond := #in~cond; {10177#false} is VALID [2022-04-15 15:11:33,550 INFO L290 TraceCheckUtils]: 63: Hoare triple {10177#false} assume 0 == ~cond; {10177#false} is VALID [2022-04-15 15:11:33,550 INFO L290 TraceCheckUtils]: 64: Hoare triple {10177#false} assume !false; {10177#false} is VALID [2022-04-15 15:11:33,551 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 58 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:33,551 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:33,888 INFO L290 TraceCheckUtils]: 64: Hoare triple {10177#false} assume !false; {10177#false} is VALID [2022-04-15 15:11:33,888 INFO L290 TraceCheckUtils]: 63: Hoare triple {10177#false} assume 0 == ~cond; {10177#false} is VALID [2022-04-15 15:11:33,888 INFO L290 TraceCheckUtils]: 62: Hoare triple {10177#false} ~cond := #in~cond; {10177#false} is VALID [2022-04-15 15:11:33,888 INFO L272 TraceCheckUtils]: 61: Hoare triple {10177#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)); {10177#false} is VALID [2022-04-15 15:11:33,888 INFO L290 TraceCheckUtils]: 60: Hoare triple {10177#false} assume !(#t~post6 < 100);havoc #t~post6; {10177#false} is VALID [2022-04-15 15:11:33,889 INFO L290 TraceCheckUtils]: 59: Hoare triple {10177#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10177#false} is VALID [2022-04-15 15:11:33,889 INFO L290 TraceCheckUtils]: 58: Hoare triple {10398#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {10177#false} is VALID [2022-04-15 15:11:33,889 INFO L290 TraceCheckUtils]: 57: Hoare triple {10402#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10398#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:11:33,891 INFO L290 TraceCheckUtils]: 56: Hoare triple {10402#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10402#(< ~counter~0 100)} is VALID [2022-04-15 15:11:33,892 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {10176#true} {10402#(< ~counter~0 100)} #98#return; {10402#(< ~counter~0 100)} is VALID [2022-04-15 15:11:33,892 INFO L290 TraceCheckUtils]: 54: Hoare triple {10176#true} assume true; {10176#true} is VALID [2022-04-15 15:11:33,893 INFO L290 TraceCheckUtils]: 53: Hoare triple {10176#true} assume !(0 == ~cond); {10176#true} is VALID [2022-04-15 15:11:33,893 INFO L290 TraceCheckUtils]: 52: Hoare triple {10176#true} ~cond := #in~cond; {10176#true} is VALID [2022-04-15 15:11:33,893 INFO L272 TraceCheckUtils]: 51: Hoare triple {10402#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10176#true} is VALID [2022-04-15 15:11:33,893 INFO L290 TraceCheckUtils]: 50: Hoare triple {10402#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {10402#(< ~counter~0 100)} is VALID [2022-04-15 15:11:33,894 INFO L290 TraceCheckUtils]: 49: Hoare triple {10427#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10402#(< ~counter~0 100)} is VALID [2022-04-15 15:11:33,894 INFO L290 TraceCheckUtils]: 48: Hoare triple {10427#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10427#(< ~counter~0 99)} is VALID [2022-04-15 15:11:33,895 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {10176#true} {10427#(< ~counter~0 99)} #98#return; {10427#(< ~counter~0 99)} is VALID [2022-04-15 15:11:33,895 INFO L290 TraceCheckUtils]: 46: Hoare triple {10176#true} assume true; {10176#true} is VALID [2022-04-15 15:11:33,895 INFO L290 TraceCheckUtils]: 45: Hoare triple {10176#true} assume !(0 == ~cond); {10176#true} is VALID [2022-04-15 15:11:33,895 INFO L290 TraceCheckUtils]: 44: Hoare triple {10176#true} ~cond := #in~cond; {10176#true} is VALID [2022-04-15 15:11:33,895 INFO L272 TraceCheckUtils]: 43: Hoare triple {10427#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10176#true} is VALID [2022-04-15 15:11:33,895 INFO L290 TraceCheckUtils]: 42: Hoare triple {10427#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {10427#(< ~counter~0 99)} is VALID [2022-04-15 15:11:33,896 INFO L290 TraceCheckUtils]: 41: Hoare triple {10452#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10427#(< ~counter~0 99)} is VALID [2022-04-15 15:11:33,896 INFO L290 TraceCheckUtils]: 40: Hoare triple {10452#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {10452#(< ~counter~0 98)} is VALID [2022-04-15 15:11:33,896 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {10176#true} {10452#(< ~counter~0 98)} #98#return; {10452#(< ~counter~0 98)} is VALID [2022-04-15 15:11:33,897 INFO L290 TraceCheckUtils]: 38: Hoare triple {10176#true} assume true; {10176#true} is VALID [2022-04-15 15:11:33,897 INFO L290 TraceCheckUtils]: 37: Hoare triple {10176#true} assume !(0 == ~cond); {10176#true} is VALID [2022-04-15 15:11:33,897 INFO L290 TraceCheckUtils]: 36: Hoare triple {10176#true} ~cond := #in~cond; {10176#true} is VALID [2022-04-15 15:11:33,897 INFO L272 TraceCheckUtils]: 35: Hoare triple {10452#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10176#true} is VALID [2022-04-15 15:11:33,897 INFO L290 TraceCheckUtils]: 34: Hoare triple {10452#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {10452#(< ~counter~0 98)} is VALID [2022-04-15 15:11:33,897 INFO L290 TraceCheckUtils]: 33: Hoare triple {10477#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {10452#(< ~counter~0 98)} is VALID [2022-04-15 15:11:33,898 INFO L290 TraceCheckUtils]: 32: Hoare triple {10477#(< ~counter~0 97)} assume !(~r~0 > 0); {10477#(< ~counter~0 97)} is VALID [2022-04-15 15:11:33,898 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {10176#true} {10477#(< ~counter~0 97)} #96#return; {10477#(< ~counter~0 97)} is VALID [2022-04-15 15:11:33,898 INFO L290 TraceCheckUtils]: 30: Hoare triple {10176#true} assume true; {10176#true} is VALID [2022-04-15 15:11:33,898 INFO L290 TraceCheckUtils]: 29: Hoare triple {10176#true} assume !(0 == ~cond); {10176#true} is VALID [2022-04-15 15:11:33,899 INFO L290 TraceCheckUtils]: 28: Hoare triple {10176#true} ~cond := #in~cond; {10176#true} is VALID [2022-04-15 15:11:33,899 INFO L272 TraceCheckUtils]: 27: Hoare triple {10477#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10176#true} is VALID [2022-04-15 15:11:33,899 INFO L290 TraceCheckUtils]: 26: Hoare triple {10477#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {10477#(< ~counter~0 97)} is VALID [2022-04-15 15:11:33,899 INFO L290 TraceCheckUtils]: 25: Hoare triple {10502#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {10477#(< ~counter~0 97)} is VALID [2022-04-15 15:11:33,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {10502#(< ~counter~0 96)} assume !!(0 != ~r~0); {10502#(< ~counter~0 96)} is VALID [2022-04-15 15:11:33,900 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {10176#true} {10502#(< ~counter~0 96)} #94#return; {10502#(< ~counter~0 96)} is VALID [2022-04-15 15:11:33,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {10176#true} assume true; {10176#true} is VALID [2022-04-15 15:11:33,900 INFO L290 TraceCheckUtils]: 21: Hoare triple {10176#true} assume !(0 == ~cond); {10176#true} is VALID [2022-04-15 15:11:33,900 INFO L290 TraceCheckUtils]: 20: Hoare triple {10176#true} ~cond := #in~cond; {10176#true} is VALID [2022-04-15 15:11:33,900 INFO L272 TraceCheckUtils]: 19: Hoare triple {10502#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {10176#true} is VALID [2022-04-15 15:11:33,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {10502#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {10502#(< ~counter~0 96)} is VALID [2022-04-15 15:11:33,901 INFO L290 TraceCheckUtils]: 17: Hoare triple {10527#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {10502#(< ~counter~0 96)} is VALID [2022-04-15 15:11:33,901 INFO L290 TraceCheckUtils]: 16: Hoare triple {10527#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {10527#(< ~counter~0 95)} is VALID [2022-04-15 15:11:33,902 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {10176#true} {10527#(< ~counter~0 95)} #92#return; {10527#(< ~counter~0 95)} is VALID [2022-04-15 15:11:33,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {10176#true} assume true; {10176#true} is VALID [2022-04-15 15:11:33,902 INFO L290 TraceCheckUtils]: 13: Hoare triple {10176#true} assume !(0 == ~cond); {10176#true} is VALID [2022-04-15 15:11:33,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {10176#true} ~cond := #in~cond; {10176#true} is VALID [2022-04-15 15:11:33,902 INFO L272 TraceCheckUtils]: 11: Hoare triple {10527#(< ~counter~0 95)} 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)); {10176#true} is VALID [2022-04-15 15:11:33,903 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {10176#true} {10527#(< ~counter~0 95)} #90#return; {10527#(< ~counter~0 95)} is VALID [2022-04-15 15:11:33,903 INFO L290 TraceCheckUtils]: 9: Hoare triple {10176#true} assume true; {10176#true} is VALID [2022-04-15 15:11:33,903 INFO L290 TraceCheckUtils]: 8: Hoare triple {10176#true} assume !(0 == ~cond); {10176#true} is VALID [2022-04-15 15:11:33,903 INFO L290 TraceCheckUtils]: 7: Hoare triple {10176#true} ~cond := #in~cond; {10176#true} is VALID [2022-04-15 15:11:33,903 INFO L272 TraceCheckUtils]: 6: Hoare triple {10527#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {10176#true} is VALID [2022-04-15 15:11:33,903 INFO L290 TraceCheckUtils]: 5: Hoare triple {10527#(< ~counter~0 95)} 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; {10527#(< ~counter~0 95)} is VALID [2022-04-15 15:11:33,903 INFO L272 TraceCheckUtils]: 4: Hoare triple {10527#(< ~counter~0 95)} call #t~ret9 := main(); {10527#(< ~counter~0 95)} is VALID [2022-04-15 15:11:33,904 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10527#(< ~counter~0 95)} {10176#true} #102#return; {10527#(< ~counter~0 95)} is VALID [2022-04-15 15:11:33,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {10527#(< ~counter~0 95)} assume true; {10527#(< ~counter~0 95)} is VALID [2022-04-15 15:11:33,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {10176#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; {10527#(< ~counter~0 95)} is VALID [2022-04-15 15:11:33,905 INFO L272 TraceCheckUtils]: 0: Hoare triple {10176#true} call ULTIMATE.init(); {10176#true} is VALID [2022-04-15 15:11:33,905 INFO L134 CoverageAnalysis]: Checked inductivity of 74 backedges. 12 proven. 18 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 15:11:33,905 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:33,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742574673] [2022-04-15 15:11:33,905 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:33,905 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [603900167] [2022-04-15 15:11:33,905 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [603900167] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:33,905 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:33,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 15:11:33,906 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:33,906 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [60322911] [2022-04-15 15:11:33,906 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [60322911] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:33,906 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:33,906 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:11:33,906 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2122347345] [2022-04-15 15:11:33,906 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:33,907 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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 65 [2022-04-15 15:11:33,907 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:33,907 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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-15 15:11:33,951 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:33,951 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:11:33,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:33,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:11:33,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:11:33,952 INFO L87 Difference]: Start difference. First operand 110 states and 134 transitions. Second operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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-15 15:11:34,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:34,329 INFO L93 Difference]: Finished difference Result 153 states and 194 transitions. [2022-04-15 15:11:34,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 15:11:34,329 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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 65 [2022-04-15 15:11:34,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:34,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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-15 15:11:34,332 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 15:11:34,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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-15 15:11:34,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 137 transitions. [2022-04-15 15:11:34,334 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 137 transitions. [2022-04-15 15:11:34,423 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-15 15:11:34,425 INFO L225 Difference]: With dead ends: 153 [2022-04-15 15:11:34,425 INFO L226 Difference]: Without dead ends: 116 [2022-04-15 15:11:34,425 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=135, Invalid=207, Unknown=0, NotChecked=0, Total=342 [2022-04-15 15:11:34,426 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 43 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 50 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 80 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 50 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:34,426 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 171 Invalid, 80 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 50 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:34,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-04-15 15:11:34,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 113. [2022-04-15 15:11:34,547 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:34,547 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 113 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 83 states have internal predecessors, (98), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:34,548 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 113 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 83 states have internal predecessors, (98), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:34,548 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 113 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 83 states have internal predecessors, (98), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:34,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:34,550 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2022-04-15 15:11:34,550 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2022-04-15 15:11:34,550 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:34,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:34,551 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 83 states have internal predecessors, (98), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 116 states. [2022-04-15 15:11:34,551 INFO L87 Difference]: Start difference. First operand has 113 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 83 states have internal predecessors, (98), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) Second operand 116 states. [2022-04-15 15:11:34,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:34,554 INFO L93 Difference]: Finished difference Result 116 states and 141 transitions. [2022-04-15 15:11:34,554 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 141 transitions. [2022-04-15 15:11:34,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:34,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:34,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:34,555 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:34,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 82 states have (on average 1.1951219512195121) internal successors, (98), 83 states have internal predecessors, (98), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 18 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:34,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 138 transitions. [2022-04-15 15:11:34,557 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 138 transitions. Word has length 65 [2022-04-15 15:11:34,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:34,558 INFO L478 AbstractCegarLoop]: Abstraction has 113 states and 138 transitions. [2022-04-15 15:11:34,558 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.888888888888889) internal successors, (44), 8 states have internal predecessors, (44), 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-15 15:11:34,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 113 states and 138 transitions. [2022-04-15 15:11:36,229 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:36,229 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 138 transitions. [2022-04-15 15:11:36,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-04-15 15:11:36,230 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:36,230 INFO L499 BasicCegarLoop]: trace histogram [6, 5, 5, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:36,247 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-15 15:11:36,435 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-15 15:11:36,436 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:36,436 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:36,436 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 1 times [2022-04-15 15:11:36,436 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:36,436 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [146104651] [2022-04-15 15:11:36,436 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:36,437 INFO L85 PathProgramCache]: Analyzing trace with hash -1211810838, now seen corresponding path program 2 times [2022-04-15 15:11:36,437 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:36,437 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [440482941] [2022-04-15 15:11:36,437 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:36,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:36,447 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:36,447 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743739164] [2022-04-15 15:11:36,447 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:36,447 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:36,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:36,448 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-15 15:11:36,449 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-15 15:11:36,488 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:36,489 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:36,489 INFO L263 TraceCheckSpWp]: Trace formula consists of 182 conjuncts, 15 conjunts are in the unsatisfiable core [2022-04-15 15:11:36,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:36,502 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:36,803 INFO L272 TraceCheckUtils]: 0: Hoare triple {11351#true} call ULTIMATE.init(); {11351#true} is VALID [2022-04-15 15:11:36,804 INFO L290 TraceCheckUtils]: 1: Hoare triple {11351#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; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {11359#(<= ~counter~0 0)} assume true; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,805 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11359#(<= ~counter~0 0)} {11351#true} #102#return; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,805 INFO L272 TraceCheckUtils]: 4: Hoare triple {11359#(<= ~counter~0 0)} call #t~ret9 := main(); {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,805 INFO L290 TraceCheckUtils]: 5: Hoare triple {11359#(<= ~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; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,806 INFO L272 TraceCheckUtils]: 6: Hoare triple {11359#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,806 INFO L290 TraceCheckUtils]: 7: Hoare triple {11359#(<= ~counter~0 0)} ~cond := #in~cond; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,806 INFO L290 TraceCheckUtils]: 8: Hoare triple {11359#(<= ~counter~0 0)} assume !(0 == ~cond); {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,807 INFO L290 TraceCheckUtils]: 9: Hoare triple {11359#(<= ~counter~0 0)} assume true; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,807 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11359#(<= ~counter~0 0)} {11359#(<= ~counter~0 0)} #90#return; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,807 INFO L272 TraceCheckUtils]: 11: Hoare triple {11359#(<= ~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)); {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,808 INFO L290 TraceCheckUtils]: 12: Hoare triple {11359#(<= ~counter~0 0)} ~cond := #in~cond; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,808 INFO L290 TraceCheckUtils]: 13: Hoare triple {11359#(<= ~counter~0 0)} assume !(0 == ~cond); {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,808 INFO L290 TraceCheckUtils]: 14: Hoare triple {11359#(<= ~counter~0 0)} assume true; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,809 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11359#(<= ~counter~0 0)} {11359#(<= ~counter~0 0)} #92#return; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,809 INFO L290 TraceCheckUtils]: 16: Hoare triple {11359#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11359#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:36,810 INFO L290 TraceCheckUtils]: 17: Hoare triple {11359#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11408#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:36,810 INFO L290 TraceCheckUtils]: 18: Hoare triple {11408#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {11408#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:36,810 INFO L272 TraceCheckUtils]: 19: Hoare triple {11408#(<= ~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)); {11408#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:36,811 INFO L290 TraceCheckUtils]: 20: Hoare triple {11408#(<= ~counter~0 1)} ~cond := #in~cond; {11408#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:36,811 INFO L290 TraceCheckUtils]: 21: Hoare triple {11408#(<= ~counter~0 1)} assume !(0 == ~cond); {11408#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:36,811 INFO L290 TraceCheckUtils]: 22: Hoare triple {11408#(<= ~counter~0 1)} assume true; {11408#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:36,812 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11408#(<= ~counter~0 1)} {11408#(<= ~counter~0 1)} #94#return; {11408#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:36,812 INFO L290 TraceCheckUtils]: 24: Hoare triple {11408#(<= ~counter~0 1)} assume !!(0 != ~r~0); {11408#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:36,813 INFO L290 TraceCheckUtils]: 25: Hoare triple {11408#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11433#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:36,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {11433#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {11433#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:36,813 INFO L272 TraceCheckUtils]: 27: Hoare triple {11433#(<= ~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)); {11433#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:36,814 INFO L290 TraceCheckUtils]: 28: Hoare triple {11433#(<= ~counter~0 2)} ~cond := #in~cond; {11433#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:36,814 INFO L290 TraceCheckUtils]: 29: Hoare triple {11433#(<= ~counter~0 2)} assume !(0 == ~cond); {11433#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:36,814 INFO L290 TraceCheckUtils]: 30: Hoare triple {11433#(<= ~counter~0 2)} assume true; {11433#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:36,815 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11433#(<= ~counter~0 2)} {11433#(<= ~counter~0 2)} #96#return; {11433#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:36,815 INFO L290 TraceCheckUtils]: 32: Hoare triple {11433#(<= ~counter~0 2)} assume !(~r~0 > 0); {11433#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:36,815 INFO L290 TraceCheckUtils]: 33: Hoare triple {11433#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11458#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:36,816 INFO L290 TraceCheckUtils]: 34: Hoare triple {11458#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {11458#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:36,816 INFO L272 TraceCheckUtils]: 35: Hoare triple {11458#(<= ~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)); {11458#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:36,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {11458#(<= ~counter~0 3)} ~cond := #in~cond; {11458#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:36,817 INFO L290 TraceCheckUtils]: 37: Hoare triple {11458#(<= ~counter~0 3)} assume !(0 == ~cond); {11458#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:36,817 INFO L290 TraceCheckUtils]: 38: Hoare triple {11458#(<= ~counter~0 3)} assume true; {11458#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:36,818 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11458#(<= ~counter~0 3)} {11458#(<= ~counter~0 3)} #98#return; {11458#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:36,818 INFO L290 TraceCheckUtils]: 40: Hoare triple {11458#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11458#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:36,818 INFO L290 TraceCheckUtils]: 41: Hoare triple {11458#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11483#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:36,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {11483#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {11483#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:36,819 INFO L272 TraceCheckUtils]: 43: Hoare triple {11483#(<= ~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)); {11483#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:36,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {11483#(<= ~counter~0 4)} ~cond := #in~cond; {11483#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:36,820 INFO L290 TraceCheckUtils]: 45: Hoare triple {11483#(<= ~counter~0 4)} assume !(0 == ~cond); {11483#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:36,820 INFO L290 TraceCheckUtils]: 46: Hoare triple {11483#(<= ~counter~0 4)} assume true; {11483#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:36,821 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11483#(<= ~counter~0 4)} {11483#(<= ~counter~0 4)} #98#return; {11483#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:36,821 INFO L290 TraceCheckUtils]: 48: Hoare triple {11483#(<= ~counter~0 4)} assume !(~r~0 < 0); {11483#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:36,821 INFO L290 TraceCheckUtils]: 49: Hoare triple {11483#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11508#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:36,822 INFO L290 TraceCheckUtils]: 50: Hoare triple {11508#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {11508#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:36,822 INFO L272 TraceCheckUtils]: 51: Hoare triple {11508#(<= ~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)); {11508#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:36,822 INFO L290 TraceCheckUtils]: 52: Hoare triple {11508#(<= ~counter~0 5)} ~cond := #in~cond; {11508#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:36,823 INFO L290 TraceCheckUtils]: 53: Hoare triple {11508#(<= ~counter~0 5)} assume !(0 == ~cond); {11508#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:36,823 INFO L290 TraceCheckUtils]: 54: Hoare triple {11508#(<= ~counter~0 5)} assume true; {11508#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:36,823 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11508#(<= ~counter~0 5)} {11508#(<= ~counter~0 5)} #94#return; {11508#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:36,824 INFO L290 TraceCheckUtils]: 56: Hoare triple {11508#(<= ~counter~0 5)} assume !!(0 != ~r~0); {11508#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:36,824 INFO L290 TraceCheckUtils]: 57: Hoare triple {11508#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11533#(<= |main_#t~post7| 5)} is VALID [2022-04-15 15:11:36,824 INFO L290 TraceCheckUtils]: 58: Hoare triple {11533#(<= |main_#t~post7| 5)} assume !(#t~post7 < 100);havoc #t~post7; {11352#false} is VALID [2022-04-15 15:11:36,824 INFO L290 TraceCheckUtils]: 59: Hoare triple {11352#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11352#false} is VALID [2022-04-15 15:11:36,825 INFO L290 TraceCheckUtils]: 60: Hoare triple {11352#false} assume !(#t~post8 < 100);havoc #t~post8; {11352#false} is VALID [2022-04-15 15:11:36,825 INFO L290 TraceCheckUtils]: 61: Hoare triple {11352#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11352#false} is VALID [2022-04-15 15:11:36,825 INFO L290 TraceCheckUtils]: 62: Hoare triple {11352#false} assume !(#t~post6 < 100);havoc #t~post6; {11352#false} is VALID [2022-04-15 15:11:36,825 INFO L272 TraceCheckUtils]: 63: Hoare triple {11352#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)); {11352#false} is VALID [2022-04-15 15:11:36,825 INFO L290 TraceCheckUtils]: 64: Hoare triple {11352#false} ~cond := #in~cond; {11352#false} is VALID [2022-04-15 15:11:36,825 INFO L290 TraceCheckUtils]: 65: Hoare triple {11352#false} assume 0 == ~cond; {11352#false} is VALID [2022-04-15 15:11:36,825 INFO L290 TraceCheckUtils]: 66: Hoare triple {11352#false} assume !false; {11352#false} is VALID [2022-04-15 15:11:36,825 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 50 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:36,825 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:37,162 INFO L290 TraceCheckUtils]: 66: Hoare triple {11352#false} assume !false; {11352#false} is VALID [2022-04-15 15:11:37,162 INFO L290 TraceCheckUtils]: 65: Hoare triple {11352#false} assume 0 == ~cond; {11352#false} is VALID [2022-04-15 15:11:37,162 INFO L290 TraceCheckUtils]: 64: Hoare triple {11352#false} ~cond := #in~cond; {11352#false} is VALID [2022-04-15 15:11:37,163 INFO L272 TraceCheckUtils]: 63: Hoare triple {11352#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)); {11352#false} is VALID [2022-04-15 15:11:37,163 INFO L290 TraceCheckUtils]: 62: Hoare triple {11352#false} assume !(#t~post6 < 100);havoc #t~post6; {11352#false} is VALID [2022-04-15 15:11:37,163 INFO L290 TraceCheckUtils]: 61: Hoare triple {11352#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11352#false} is VALID [2022-04-15 15:11:37,163 INFO L290 TraceCheckUtils]: 60: Hoare triple {11352#false} assume !(#t~post8 < 100);havoc #t~post8; {11352#false} is VALID [2022-04-15 15:11:37,163 INFO L290 TraceCheckUtils]: 59: Hoare triple {11352#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11352#false} is VALID [2022-04-15 15:11:37,163 INFO L290 TraceCheckUtils]: 58: Hoare triple {11585#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {11352#false} is VALID [2022-04-15 15:11:37,164 INFO L290 TraceCheckUtils]: 57: Hoare triple {11589#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11585#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:11:37,164 INFO L290 TraceCheckUtils]: 56: Hoare triple {11589#(< ~counter~0 100)} assume !!(0 != ~r~0); {11589#(< ~counter~0 100)} is VALID [2022-04-15 15:11:37,165 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {11351#true} {11589#(< ~counter~0 100)} #94#return; {11589#(< ~counter~0 100)} is VALID [2022-04-15 15:11:37,165 INFO L290 TraceCheckUtils]: 54: Hoare triple {11351#true} assume true; {11351#true} is VALID [2022-04-15 15:11:37,165 INFO L290 TraceCheckUtils]: 53: Hoare triple {11351#true} assume !(0 == ~cond); {11351#true} is VALID [2022-04-15 15:11:37,165 INFO L290 TraceCheckUtils]: 52: Hoare triple {11351#true} ~cond := #in~cond; {11351#true} is VALID [2022-04-15 15:11:37,165 INFO L272 TraceCheckUtils]: 51: Hoare triple {11589#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11351#true} is VALID [2022-04-15 15:11:37,166 INFO L290 TraceCheckUtils]: 50: Hoare triple {11589#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {11589#(< ~counter~0 100)} is VALID [2022-04-15 15:11:37,166 INFO L290 TraceCheckUtils]: 49: Hoare triple {11614#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11589#(< ~counter~0 100)} is VALID [2022-04-15 15:11:37,167 INFO L290 TraceCheckUtils]: 48: Hoare triple {11614#(< ~counter~0 99)} assume !(~r~0 < 0); {11614#(< ~counter~0 99)} is VALID [2022-04-15 15:11:37,168 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {11351#true} {11614#(< ~counter~0 99)} #98#return; {11614#(< ~counter~0 99)} is VALID [2022-04-15 15:11:37,168 INFO L290 TraceCheckUtils]: 46: Hoare triple {11351#true} assume true; {11351#true} is VALID [2022-04-15 15:11:37,168 INFO L290 TraceCheckUtils]: 45: Hoare triple {11351#true} assume !(0 == ~cond); {11351#true} is VALID [2022-04-15 15:11:37,168 INFO L290 TraceCheckUtils]: 44: Hoare triple {11351#true} ~cond := #in~cond; {11351#true} is VALID [2022-04-15 15:11:37,168 INFO L272 TraceCheckUtils]: 43: Hoare triple {11614#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11351#true} is VALID [2022-04-15 15:11:37,168 INFO L290 TraceCheckUtils]: 42: Hoare triple {11614#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {11614#(< ~counter~0 99)} is VALID [2022-04-15 15:11:37,169 INFO L290 TraceCheckUtils]: 41: Hoare triple {11639#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11614#(< ~counter~0 99)} is VALID [2022-04-15 15:11:37,169 INFO L290 TraceCheckUtils]: 40: Hoare triple {11639#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {11639#(< ~counter~0 98)} is VALID [2022-04-15 15:11:37,170 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {11351#true} {11639#(< ~counter~0 98)} #98#return; {11639#(< ~counter~0 98)} is VALID [2022-04-15 15:11:37,170 INFO L290 TraceCheckUtils]: 38: Hoare triple {11351#true} assume true; {11351#true} is VALID [2022-04-15 15:11:37,170 INFO L290 TraceCheckUtils]: 37: Hoare triple {11351#true} assume !(0 == ~cond); {11351#true} is VALID [2022-04-15 15:11:37,170 INFO L290 TraceCheckUtils]: 36: Hoare triple {11351#true} ~cond := #in~cond; {11351#true} is VALID [2022-04-15 15:11:37,170 INFO L272 TraceCheckUtils]: 35: Hoare triple {11639#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11351#true} is VALID [2022-04-15 15:11:37,170 INFO L290 TraceCheckUtils]: 34: Hoare triple {11639#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {11639#(< ~counter~0 98)} is VALID [2022-04-15 15:11:37,171 INFO L290 TraceCheckUtils]: 33: Hoare triple {11664#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {11639#(< ~counter~0 98)} is VALID [2022-04-15 15:11:37,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {11664#(< ~counter~0 97)} assume !(~r~0 > 0); {11664#(< ~counter~0 97)} is VALID [2022-04-15 15:11:37,172 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {11351#true} {11664#(< ~counter~0 97)} #96#return; {11664#(< ~counter~0 97)} is VALID [2022-04-15 15:11:37,172 INFO L290 TraceCheckUtils]: 30: Hoare triple {11351#true} assume true; {11351#true} is VALID [2022-04-15 15:11:37,172 INFO L290 TraceCheckUtils]: 29: Hoare triple {11351#true} assume !(0 == ~cond); {11351#true} is VALID [2022-04-15 15:11:37,172 INFO L290 TraceCheckUtils]: 28: Hoare triple {11351#true} ~cond := #in~cond; {11351#true} is VALID [2022-04-15 15:11:37,172 INFO L272 TraceCheckUtils]: 27: Hoare triple {11664#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11351#true} is VALID [2022-04-15 15:11:37,172 INFO L290 TraceCheckUtils]: 26: Hoare triple {11664#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {11664#(< ~counter~0 97)} is VALID [2022-04-15 15:11:37,173 INFO L290 TraceCheckUtils]: 25: Hoare triple {11689#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {11664#(< ~counter~0 97)} is VALID [2022-04-15 15:11:37,173 INFO L290 TraceCheckUtils]: 24: Hoare triple {11689#(< ~counter~0 96)} assume !!(0 != ~r~0); {11689#(< ~counter~0 96)} is VALID [2022-04-15 15:11:37,174 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {11351#true} {11689#(< ~counter~0 96)} #94#return; {11689#(< ~counter~0 96)} is VALID [2022-04-15 15:11:37,174 INFO L290 TraceCheckUtils]: 22: Hoare triple {11351#true} assume true; {11351#true} is VALID [2022-04-15 15:11:37,174 INFO L290 TraceCheckUtils]: 21: Hoare triple {11351#true} assume !(0 == ~cond); {11351#true} is VALID [2022-04-15 15:11:37,174 INFO L290 TraceCheckUtils]: 20: Hoare triple {11351#true} ~cond := #in~cond; {11351#true} is VALID [2022-04-15 15:11:37,174 INFO L272 TraceCheckUtils]: 19: Hoare triple {11689#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {11351#true} is VALID [2022-04-15 15:11:37,174 INFO L290 TraceCheckUtils]: 18: Hoare triple {11689#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {11689#(< ~counter~0 96)} is VALID [2022-04-15 15:11:37,175 INFO L290 TraceCheckUtils]: 17: Hoare triple {11714#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {11689#(< ~counter~0 96)} is VALID [2022-04-15 15:11:37,175 INFO L290 TraceCheckUtils]: 16: Hoare triple {11714#(< ~counter~0 95)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {11714#(< ~counter~0 95)} is VALID [2022-04-15 15:11:37,175 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {11351#true} {11714#(< ~counter~0 95)} #92#return; {11714#(< ~counter~0 95)} is VALID [2022-04-15 15:11:37,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {11351#true} assume true; {11351#true} is VALID [2022-04-15 15:11:37,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {11351#true} assume !(0 == ~cond); {11351#true} is VALID [2022-04-15 15:11:37,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {11351#true} ~cond := #in~cond; {11351#true} is VALID [2022-04-15 15:11:37,176 INFO L272 TraceCheckUtils]: 11: Hoare triple {11714#(< ~counter~0 95)} 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)); {11351#true} is VALID [2022-04-15 15:11:37,176 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11351#true} {11714#(< ~counter~0 95)} #90#return; {11714#(< ~counter~0 95)} is VALID [2022-04-15 15:11:37,176 INFO L290 TraceCheckUtils]: 9: Hoare triple {11351#true} assume true; {11351#true} is VALID [2022-04-15 15:11:37,176 INFO L290 TraceCheckUtils]: 8: Hoare triple {11351#true} assume !(0 == ~cond); {11351#true} is VALID [2022-04-15 15:11:37,176 INFO L290 TraceCheckUtils]: 7: Hoare triple {11351#true} ~cond := #in~cond; {11351#true} is VALID [2022-04-15 15:11:37,176 INFO L272 TraceCheckUtils]: 6: Hoare triple {11714#(< ~counter~0 95)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {11351#true} is VALID [2022-04-15 15:11:37,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {11714#(< ~counter~0 95)} 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; {11714#(< ~counter~0 95)} is VALID [2022-04-15 15:11:37,177 INFO L272 TraceCheckUtils]: 4: Hoare triple {11714#(< ~counter~0 95)} call #t~ret9 := main(); {11714#(< ~counter~0 95)} is VALID [2022-04-15 15:11:37,177 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11714#(< ~counter~0 95)} {11351#true} #102#return; {11714#(< ~counter~0 95)} is VALID [2022-04-15 15:11:37,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {11714#(< ~counter~0 95)} assume true; {11714#(< ~counter~0 95)} is VALID [2022-04-15 15:11:37,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {11351#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; {11714#(< ~counter~0 95)} is VALID [2022-04-15 15:11:37,178 INFO L272 TraceCheckUtils]: 0: Hoare triple {11351#true} call ULTIMATE.init(); {11351#true} is VALID [2022-04-15 15:11:37,178 INFO L134 CoverageAnalysis]: Checked inductivity of 72 backedges. 18 proven. 10 refuted. 0 times theorem prover too weak. 44 trivial. 0 not checked. [2022-04-15 15:11:37,179 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:37,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [440482941] [2022-04-15 15:11:37,180 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:37,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743739164] [2022-04-15 15:11:37,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743739164] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:37,180 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:37,180 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2022-04-15 15:11:37,180 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:37,180 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [146104651] [2022-04-15 15:11:37,180 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [146104651] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:37,181 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:37,181 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:11:37,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590109940] [2022-04-15 15:11:37,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:37,181 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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 67 [2022-04-15 15:11:37,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:37,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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-15 15:11:37,226 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:37,226 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:11:37,226 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:37,227 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:11:37,227 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=144, Unknown=0, NotChecked=0, Total=240 [2022-04-15 15:11:37,227 INFO L87 Difference]: Start difference. First operand 113 states and 138 transitions. Second operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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-15 15:11:37,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:37,619 INFO L93 Difference]: Finished difference Result 155 states and 197 transitions. [2022-04-15 15:11:37,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 15:11:37,619 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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 67 [2022-04-15 15:11:37,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:37,619 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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-15 15:11:37,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 15:11:37,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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-15 15:11:37,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 137 transitions. [2022-04-15 15:11:37,623 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 137 transitions. [2022-04-15 15:11:37,733 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-15 15:11:37,735 INFO L225 Difference]: With dead ends: 155 [2022-04-15 15:11:37,735 INFO L226 Difference]: Without dead ends: 118 [2022-04-15 15:11:37,736 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 119 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=152, Invalid=228, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:11:37,736 INFO L913 BasicCegarLoop]: 45 mSDtfsCounter, 35 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:37,736 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 184 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:37,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2022-04-15 15:11:37,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 118. [2022-04-15 15:11:37,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:37,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 118 states. Second operand has 118 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:37,855 INFO L74 IsIncluded]: Start isIncluded. First operand 118 states. Second operand has 118 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:37,856 INFO L87 Difference]: Start difference. First operand 118 states. Second operand has 118 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:37,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:37,858 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-04-15 15:11:37,858 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2022-04-15 15:11:37,859 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:37,859 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:37,859 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 118 states. [2022-04-15 15:11:37,859 INFO L87 Difference]: Start difference. First operand has 118 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) Second operand 118 states. [2022-04-15 15:11:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:37,862 INFO L93 Difference]: Finished difference Result 118 states and 143 transitions. [2022-04-15 15:11:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2022-04-15 15:11:37,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:37,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:37,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:37,863 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:37,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 87 states have (on average 1.1839080459770115) internal successors, (103), 87 states have internal predecessors, (103), 21 states have call successors, (21), 11 states have call predecessors, (21), 9 states have return successors, (19), 19 states have call predecessors, (19), 19 states have call successors, (19) [2022-04-15 15:11:37,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 143 transitions. [2022-04-15 15:11:37,865 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 143 transitions. Word has length 67 [2022-04-15 15:11:37,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:37,866 INFO L478 AbstractCegarLoop]: Abstraction has 118 states and 143 transitions. [2022-04-15 15:11:37,866 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 5.111111111111111) internal successors, (46), 8 states have internal predecessors, (46), 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-15 15:11:37,866 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 118 states and 143 transitions. [2022-04-15 15:11:40,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 142 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:40,025 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 143 transitions. [2022-04-15 15:11:40,025 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 72 [2022-04-15 15:11:40,025 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:40,025 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 4, 4, 4, 4, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:40,051 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-15 15:11:40,239 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-15 15:11:40,239 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:40,240 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 5 times [2022-04-15 15:11:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:40,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [699090266] [2022-04-15 15:11:40,240 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:40,240 INFO L85 PathProgramCache]: Analyzing trace with hash 1645787183, now seen corresponding path program 6 times [2022-04-15 15:11:40,240 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:40,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1481700217] [2022-04-15 15:11:40,240 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:40,240 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:40,255 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:40,255 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563998145] [2022-04-15 15:11:40,255 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:11:40,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:40,256 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:40,256 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-15 15:11:40,257 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-15 15:11:40,323 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:11:40,323 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:40,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 195 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:11:40,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:40,339 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:40,674 INFO L272 TraceCheckUtils]: 0: Hoare triple {12558#true} call ULTIMATE.init(); {12558#true} is VALID [2022-04-15 15:11:40,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {12558#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; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {12566#(<= ~counter~0 0)} assume true; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,676 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12566#(<= ~counter~0 0)} {12558#true} #102#return; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,676 INFO L272 TraceCheckUtils]: 4: Hoare triple {12566#(<= ~counter~0 0)} call #t~ret9 := main(); {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {12566#(<= ~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; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,677 INFO L272 TraceCheckUtils]: 6: Hoare triple {12566#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {12566#(<= ~counter~0 0)} ~cond := #in~cond; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {12566#(<= ~counter~0 0)} assume !(0 == ~cond); {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {12566#(<= ~counter~0 0)} assume true; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,678 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12566#(<= ~counter~0 0)} {12566#(<= ~counter~0 0)} #90#return; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,678 INFO L272 TraceCheckUtils]: 11: Hoare triple {12566#(<= ~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)); {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {12566#(<= ~counter~0 0)} ~cond := #in~cond; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {12566#(<= ~counter~0 0)} assume !(0 == ~cond); {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {12566#(<= ~counter~0 0)} assume true; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,679 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12566#(<= ~counter~0 0)} {12566#(<= ~counter~0 0)} #92#return; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {12566#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12566#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:40,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {12566#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12615#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,681 INFO L290 TraceCheckUtils]: 18: Hoare triple {12615#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {12615#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,681 INFO L272 TraceCheckUtils]: 19: Hoare triple {12615#(<= ~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)); {12615#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,682 INFO L290 TraceCheckUtils]: 20: Hoare triple {12615#(<= ~counter~0 1)} ~cond := #in~cond; {12615#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {12615#(<= ~counter~0 1)} assume !(0 == ~cond); {12615#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {12615#(<= ~counter~0 1)} assume true; {12615#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,683 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12615#(<= ~counter~0 1)} {12615#(<= ~counter~0 1)} #94#return; {12615#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {12615#(<= ~counter~0 1)} assume !!(0 != ~r~0); {12615#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:40,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {12615#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12640#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:40,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {12640#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {12640#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:40,684 INFO L272 TraceCheckUtils]: 27: Hoare triple {12640#(<= ~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)); {12640#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:40,684 INFO L290 TraceCheckUtils]: 28: Hoare triple {12640#(<= ~counter~0 2)} ~cond := #in~cond; {12640#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:40,696 INFO L290 TraceCheckUtils]: 29: Hoare triple {12640#(<= ~counter~0 2)} assume !(0 == ~cond); {12640#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:40,696 INFO L290 TraceCheckUtils]: 30: Hoare triple {12640#(<= ~counter~0 2)} assume true; {12640#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:40,697 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12640#(<= ~counter~0 2)} {12640#(<= ~counter~0 2)} #96#return; {12640#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:40,697 INFO L290 TraceCheckUtils]: 32: Hoare triple {12640#(<= ~counter~0 2)} assume !(~r~0 > 0); {12640#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:40,698 INFO L290 TraceCheckUtils]: 33: Hoare triple {12640#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12665#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:40,698 INFO L290 TraceCheckUtils]: 34: Hoare triple {12665#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {12665#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:40,699 INFO L272 TraceCheckUtils]: 35: Hoare triple {12665#(<= ~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)); {12665#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:40,699 INFO L290 TraceCheckUtils]: 36: Hoare triple {12665#(<= ~counter~0 3)} ~cond := #in~cond; {12665#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:40,699 INFO L290 TraceCheckUtils]: 37: Hoare triple {12665#(<= ~counter~0 3)} assume !(0 == ~cond); {12665#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:40,700 INFO L290 TraceCheckUtils]: 38: Hoare triple {12665#(<= ~counter~0 3)} assume true; {12665#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:40,700 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12665#(<= ~counter~0 3)} {12665#(<= ~counter~0 3)} #98#return; {12665#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:40,700 INFO L290 TraceCheckUtils]: 40: Hoare triple {12665#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12665#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:40,701 INFO L290 TraceCheckUtils]: 41: Hoare triple {12665#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12690#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:40,701 INFO L290 TraceCheckUtils]: 42: Hoare triple {12690#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {12690#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:40,702 INFO L272 TraceCheckUtils]: 43: Hoare triple {12690#(<= ~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)); {12690#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:40,702 INFO L290 TraceCheckUtils]: 44: Hoare triple {12690#(<= ~counter~0 4)} ~cond := #in~cond; {12690#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:40,702 INFO L290 TraceCheckUtils]: 45: Hoare triple {12690#(<= ~counter~0 4)} assume !(0 == ~cond); {12690#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:40,702 INFO L290 TraceCheckUtils]: 46: Hoare triple {12690#(<= ~counter~0 4)} assume true; {12690#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:40,703 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12690#(<= ~counter~0 4)} {12690#(<= ~counter~0 4)} #98#return; {12690#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:40,703 INFO L290 TraceCheckUtils]: 48: Hoare triple {12690#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12690#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:40,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {12690#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12715#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:40,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {12715#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {12715#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:40,704 INFO L272 TraceCheckUtils]: 51: Hoare triple {12715#(<= ~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)); {12715#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:40,705 INFO L290 TraceCheckUtils]: 52: Hoare triple {12715#(<= ~counter~0 5)} ~cond := #in~cond; {12715#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:40,705 INFO L290 TraceCheckUtils]: 53: Hoare triple {12715#(<= ~counter~0 5)} assume !(0 == ~cond); {12715#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:40,705 INFO L290 TraceCheckUtils]: 54: Hoare triple {12715#(<= ~counter~0 5)} assume true; {12715#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:40,706 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12715#(<= ~counter~0 5)} {12715#(<= ~counter~0 5)} #98#return; {12715#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:40,706 INFO L290 TraceCheckUtils]: 56: Hoare triple {12715#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12715#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:40,711 INFO L290 TraceCheckUtils]: 57: Hoare triple {12715#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12740#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:40,712 INFO L290 TraceCheckUtils]: 58: Hoare triple {12740#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {12740#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:40,712 INFO L272 TraceCheckUtils]: 59: Hoare triple {12740#(<= ~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)); {12740#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:40,713 INFO L290 TraceCheckUtils]: 60: Hoare triple {12740#(<= ~counter~0 6)} ~cond := #in~cond; {12740#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:40,713 INFO L290 TraceCheckUtils]: 61: Hoare triple {12740#(<= ~counter~0 6)} assume !(0 == ~cond); {12740#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:40,713 INFO L290 TraceCheckUtils]: 62: Hoare triple {12740#(<= ~counter~0 6)} assume true; {12740#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:40,714 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12740#(<= ~counter~0 6)} {12740#(<= ~counter~0 6)} #98#return; {12740#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:40,714 INFO L290 TraceCheckUtils]: 64: Hoare triple {12740#(<= ~counter~0 6)} assume !(~r~0 < 0); {12740#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:40,715 INFO L290 TraceCheckUtils]: 65: Hoare triple {12740#(<= ~counter~0 6)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12765#(<= |main_#t~post6| 6)} is VALID [2022-04-15 15:11:40,715 INFO L290 TraceCheckUtils]: 66: Hoare triple {12765#(<= |main_#t~post6| 6)} assume !(#t~post6 < 100);havoc #t~post6; {12559#false} is VALID [2022-04-15 15:11:40,715 INFO L272 TraceCheckUtils]: 67: Hoare triple {12559#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)); {12559#false} is VALID [2022-04-15 15:11:40,715 INFO L290 TraceCheckUtils]: 68: Hoare triple {12559#false} ~cond := #in~cond; {12559#false} is VALID [2022-04-15 15:11:40,716 INFO L290 TraceCheckUtils]: 69: Hoare triple {12559#false} assume 0 == ~cond; {12559#false} is VALID [2022-04-15 15:11:40,716 INFO L290 TraceCheckUtils]: 70: Hoare triple {12559#false} assume !false; {12559#false} is VALID [2022-04-15 15:11:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 86 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:40,716 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:41,100 INFO L290 TraceCheckUtils]: 70: Hoare triple {12559#false} assume !false; {12559#false} is VALID [2022-04-15 15:11:41,100 INFO L290 TraceCheckUtils]: 69: Hoare triple {12559#false} assume 0 == ~cond; {12559#false} is VALID [2022-04-15 15:11:41,100 INFO L290 TraceCheckUtils]: 68: Hoare triple {12559#false} ~cond := #in~cond; {12559#false} is VALID [2022-04-15 15:11:41,100 INFO L272 TraceCheckUtils]: 67: Hoare triple {12559#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)); {12559#false} is VALID [2022-04-15 15:11:41,101 INFO L290 TraceCheckUtils]: 66: Hoare triple {12793#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {12559#false} is VALID [2022-04-15 15:11:41,101 INFO L290 TraceCheckUtils]: 65: Hoare triple {12797#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12793#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:11:41,101 INFO L290 TraceCheckUtils]: 64: Hoare triple {12797#(< ~counter~0 100)} assume !(~r~0 < 0); {12797#(< ~counter~0 100)} is VALID [2022-04-15 15:11:41,102 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {12558#true} {12797#(< ~counter~0 100)} #98#return; {12797#(< ~counter~0 100)} is VALID [2022-04-15 15:11:41,102 INFO L290 TraceCheckUtils]: 62: Hoare triple {12558#true} assume true; {12558#true} is VALID [2022-04-15 15:11:41,102 INFO L290 TraceCheckUtils]: 61: Hoare triple {12558#true} assume !(0 == ~cond); {12558#true} is VALID [2022-04-15 15:11:41,102 INFO L290 TraceCheckUtils]: 60: Hoare triple {12558#true} ~cond := #in~cond; {12558#true} is VALID [2022-04-15 15:11:41,102 INFO L272 TraceCheckUtils]: 59: Hoare triple {12797#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12558#true} is VALID [2022-04-15 15:11:41,103 INFO L290 TraceCheckUtils]: 58: Hoare triple {12797#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {12797#(< ~counter~0 100)} is VALID [2022-04-15 15:11:41,103 INFO L290 TraceCheckUtils]: 57: Hoare triple {12822#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12797#(< ~counter~0 100)} is VALID [2022-04-15 15:11:41,104 INFO L290 TraceCheckUtils]: 56: Hoare triple {12822#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12822#(< ~counter~0 99)} is VALID [2022-04-15 15:11:41,104 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {12558#true} {12822#(< ~counter~0 99)} #98#return; {12822#(< ~counter~0 99)} is VALID [2022-04-15 15:11:41,104 INFO L290 TraceCheckUtils]: 54: Hoare triple {12558#true} assume true; {12558#true} is VALID [2022-04-15 15:11:41,104 INFO L290 TraceCheckUtils]: 53: Hoare triple {12558#true} assume !(0 == ~cond); {12558#true} is VALID [2022-04-15 15:11:41,104 INFO L290 TraceCheckUtils]: 52: Hoare triple {12558#true} ~cond := #in~cond; {12558#true} is VALID [2022-04-15 15:11:41,104 INFO L272 TraceCheckUtils]: 51: Hoare triple {12822#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12558#true} is VALID [2022-04-15 15:11:41,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {12822#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {12822#(< ~counter~0 99)} is VALID [2022-04-15 15:11:41,105 INFO L290 TraceCheckUtils]: 49: Hoare triple {12847#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12822#(< ~counter~0 99)} is VALID [2022-04-15 15:11:41,105 INFO L290 TraceCheckUtils]: 48: Hoare triple {12847#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12847#(< ~counter~0 98)} is VALID [2022-04-15 15:11:41,106 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {12558#true} {12847#(< ~counter~0 98)} #98#return; {12847#(< ~counter~0 98)} is VALID [2022-04-15 15:11:41,106 INFO L290 TraceCheckUtils]: 46: Hoare triple {12558#true} assume true; {12558#true} is VALID [2022-04-15 15:11:41,106 INFO L290 TraceCheckUtils]: 45: Hoare triple {12558#true} assume !(0 == ~cond); {12558#true} is VALID [2022-04-15 15:11:41,106 INFO L290 TraceCheckUtils]: 44: Hoare triple {12558#true} ~cond := #in~cond; {12558#true} is VALID [2022-04-15 15:11:41,106 INFO L272 TraceCheckUtils]: 43: Hoare triple {12847#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12558#true} is VALID [2022-04-15 15:11:41,107 INFO L290 TraceCheckUtils]: 42: Hoare triple {12847#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {12847#(< ~counter~0 98)} is VALID [2022-04-15 15:11:41,107 INFO L290 TraceCheckUtils]: 41: Hoare triple {12872#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12847#(< ~counter~0 98)} is VALID [2022-04-15 15:11:41,107 INFO L290 TraceCheckUtils]: 40: Hoare triple {12872#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {12872#(< ~counter~0 97)} is VALID [2022-04-15 15:11:41,108 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {12558#true} {12872#(< ~counter~0 97)} #98#return; {12872#(< ~counter~0 97)} is VALID [2022-04-15 15:11:41,108 INFO L290 TraceCheckUtils]: 38: Hoare triple {12558#true} assume true; {12558#true} is VALID [2022-04-15 15:11:41,108 INFO L290 TraceCheckUtils]: 37: Hoare triple {12558#true} assume !(0 == ~cond); {12558#true} is VALID [2022-04-15 15:11:41,108 INFO L290 TraceCheckUtils]: 36: Hoare triple {12558#true} ~cond := #in~cond; {12558#true} is VALID [2022-04-15 15:11:41,108 INFO L272 TraceCheckUtils]: 35: Hoare triple {12872#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12558#true} is VALID [2022-04-15 15:11:41,108 INFO L290 TraceCheckUtils]: 34: Hoare triple {12872#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {12872#(< ~counter~0 97)} is VALID [2022-04-15 15:11:41,109 INFO L290 TraceCheckUtils]: 33: Hoare triple {12897#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {12872#(< ~counter~0 97)} is VALID [2022-04-15 15:11:41,109 INFO L290 TraceCheckUtils]: 32: Hoare triple {12897#(< ~counter~0 96)} assume !(~r~0 > 0); {12897#(< ~counter~0 96)} is VALID [2022-04-15 15:11:41,110 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {12558#true} {12897#(< ~counter~0 96)} #96#return; {12897#(< ~counter~0 96)} is VALID [2022-04-15 15:11:41,110 INFO L290 TraceCheckUtils]: 30: Hoare triple {12558#true} assume true; {12558#true} is VALID [2022-04-15 15:11:41,110 INFO L290 TraceCheckUtils]: 29: Hoare triple {12558#true} assume !(0 == ~cond); {12558#true} is VALID [2022-04-15 15:11:41,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {12558#true} ~cond := #in~cond; {12558#true} is VALID [2022-04-15 15:11:41,110 INFO L272 TraceCheckUtils]: 27: Hoare triple {12897#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12558#true} is VALID [2022-04-15 15:11:41,110 INFO L290 TraceCheckUtils]: 26: Hoare triple {12897#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {12897#(< ~counter~0 96)} is VALID [2022-04-15 15:11:41,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {12922#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {12897#(< ~counter~0 96)} is VALID [2022-04-15 15:11:41,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {12922#(< ~counter~0 95)} assume !!(0 != ~r~0); {12922#(< ~counter~0 95)} is VALID [2022-04-15 15:11:41,111 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {12558#true} {12922#(< ~counter~0 95)} #94#return; {12922#(< ~counter~0 95)} is VALID [2022-04-15 15:11:41,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {12558#true} assume true; {12558#true} is VALID [2022-04-15 15:11:41,112 INFO L290 TraceCheckUtils]: 21: Hoare triple {12558#true} assume !(0 == ~cond); {12558#true} is VALID [2022-04-15 15:11:41,112 INFO L290 TraceCheckUtils]: 20: Hoare triple {12558#true} ~cond := #in~cond; {12558#true} is VALID [2022-04-15 15:11:41,112 INFO L272 TraceCheckUtils]: 19: Hoare triple {12922#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {12558#true} is VALID [2022-04-15 15:11:41,112 INFO L290 TraceCheckUtils]: 18: Hoare triple {12922#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {12922#(< ~counter~0 95)} is VALID [2022-04-15 15:11:41,112 INFO L290 TraceCheckUtils]: 17: Hoare triple {12947#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {12922#(< ~counter~0 95)} is VALID [2022-04-15 15:11:41,113 INFO L290 TraceCheckUtils]: 16: Hoare triple {12947#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {12947#(< ~counter~0 94)} is VALID [2022-04-15 15:11:41,113 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {12558#true} {12947#(< ~counter~0 94)} #92#return; {12947#(< ~counter~0 94)} is VALID [2022-04-15 15:11:41,113 INFO L290 TraceCheckUtils]: 14: Hoare triple {12558#true} assume true; {12558#true} is VALID [2022-04-15 15:11:41,113 INFO L290 TraceCheckUtils]: 13: Hoare triple {12558#true} assume !(0 == ~cond); {12558#true} is VALID [2022-04-15 15:11:41,113 INFO L290 TraceCheckUtils]: 12: Hoare triple {12558#true} ~cond := #in~cond; {12558#true} is VALID [2022-04-15 15:11:41,113 INFO L272 TraceCheckUtils]: 11: Hoare triple {12947#(< ~counter~0 94)} 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)); {12558#true} is VALID [2022-04-15 15:11:41,114 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {12558#true} {12947#(< ~counter~0 94)} #90#return; {12947#(< ~counter~0 94)} is VALID [2022-04-15 15:11:41,114 INFO L290 TraceCheckUtils]: 9: Hoare triple {12558#true} assume true; {12558#true} is VALID [2022-04-15 15:11:41,114 INFO L290 TraceCheckUtils]: 8: Hoare triple {12558#true} assume !(0 == ~cond); {12558#true} is VALID [2022-04-15 15:11:41,114 INFO L290 TraceCheckUtils]: 7: Hoare triple {12558#true} ~cond := #in~cond; {12558#true} is VALID [2022-04-15 15:11:41,114 INFO L272 TraceCheckUtils]: 6: Hoare triple {12947#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {12558#true} is VALID [2022-04-15 15:11:41,114 INFO L290 TraceCheckUtils]: 5: Hoare triple {12947#(< ~counter~0 94)} 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; {12947#(< ~counter~0 94)} is VALID [2022-04-15 15:11:41,115 INFO L272 TraceCheckUtils]: 4: Hoare triple {12947#(< ~counter~0 94)} call #t~ret9 := main(); {12947#(< ~counter~0 94)} is VALID [2022-04-15 15:11:41,115 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {12947#(< ~counter~0 94)} {12558#true} #102#return; {12947#(< ~counter~0 94)} is VALID [2022-04-15 15:11:41,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {12947#(< ~counter~0 94)} assume true; {12947#(< ~counter~0 94)} is VALID [2022-04-15 15:11:41,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {12558#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; {12947#(< ~counter~0 94)} is VALID [2022-04-15 15:11:41,116 INFO L272 TraceCheckUtils]: 0: Hoare triple {12558#true} call ULTIMATE.init(); {12558#true} is VALID [2022-04-15 15:11:41,116 INFO L134 CoverageAnalysis]: Checked inductivity of 102 backedges. 12 proven. 26 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 15:11:41,116 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:41,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1481700217] [2022-04-15 15:11:41,116 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:41,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563998145] [2022-04-15 15:11:41,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563998145] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:41,117 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:41,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 15:11:41,117 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:41,117 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [699090266] [2022-04-15 15:11:41,117 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [699090266] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:41,117 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:41,117 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:11:41,117 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1500987974] [2022-04-15 15:11:41,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:41,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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 71 [2022-04-15 15:11:41,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:41,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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-15 15:11:41,163 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:41,163 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:11:41,163 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:41,164 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:11:41,164 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:11:41,164 INFO L87 Difference]: Start difference. First operand 118 states and 143 transitions. Second operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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-15 15:11:41,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:41,619 INFO L93 Difference]: Finished difference Result 141 states and 172 transitions. [2022-04-15 15:11:41,619 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-04-15 15:11:41,619 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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 71 [2022-04-15 15:11:41,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:41,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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-15 15:11:41,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 15:11:41,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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-15 15:11:41,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 135 transitions. [2022-04-15 15:11:41,624 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 13 states and 135 transitions. [2022-04-15 15:11:41,747 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-15 15:11:41,749 INFO L225 Difference]: With dead ends: 141 [2022-04-15 15:11:41,749 INFO L226 Difference]: Without dead ends: 136 [2022-04-15 15:11:41,750 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=170, Invalid=250, Unknown=0, NotChecked=0, Total=420 [2022-04-15 15:11:41,750 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 65 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:41,750 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 179 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:41,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-04-15 15:11:41,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 129. [2022-04-15 15:11:41,894 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:41,894 INFO L82 GeneralOperation]: Start isEquivalent. First operand 136 states. Second operand has 129 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 96 states have internal predecessors, (110), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:11:41,894 INFO L74 IsIncluded]: Start isIncluded. First operand 136 states. Second operand has 129 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 96 states have internal predecessors, (110), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:11:41,894 INFO L87 Difference]: Start difference. First operand 136 states. Second operand has 129 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 96 states have internal predecessors, (110), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:11:41,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:41,918 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2022-04-15 15:11:41,918 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2022-04-15 15:11:41,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:41,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:41,919 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 96 states have internal predecessors, (110), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 136 states. [2022-04-15 15:11:41,919 INFO L87 Difference]: Start difference. First operand has 129 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 96 states have internal predecessors, (110), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) Second operand 136 states. [2022-04-15 15:11:41,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:41,922 INFO L93 Difference]: Finished difference Result 136 states and 167 transitions. [2022-04-15 15:11:41,922 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 167 transitions. [2022-04-15 15:11:41,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:41,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:41,922 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:41,922 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:41,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 93 states have (on average 1.1827956989247312) internal successors, (110), 96 states have internal predecessors, (110), 25 states have call successors, (25), 12 states have call predecessors, (25), 10 states have return successors, (23), 20 states have call predecessors, (23), 23 states have call successors, (23) [2022-04-15 15:11:41,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 158 transitions. [2022-04-15 15:11:41,925 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 158 transitions. Word has length 71 [2022-04-15 15:11:41,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:41,926 INFO L478 AbstractCegarLoop]: Abstraction has 129 states and 158 transitions. [2022-04-15 15:11:41,926 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.8) internal successors, (48), 9 states have internal predecessors, (48), 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-15 15:11:41,926 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 129 states and 158 transitions. [2022-04-15 15:11:44,119 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 157 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:44,120 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 158 transitions. [2022-04-15 15:11:44,120 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 15:11:44,120 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:44,120 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:44,136 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2022-04-15 15:11:44,323 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-15 15:11:44,324 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:44,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 1 times [2022-04-15 15:11:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:44,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1034410113] [2022-04-15 15:11:44,325 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:44,325 INFO L85 PathProgramCache]: Analyzing trace with hash -15963768, now seen corresponding path program 2 times [2022-04-15 15:11:44,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:44,325 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703233899] [2022-04-15 15:11:44,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:44,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:44,336 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:44,337 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1022825646] [2022-04-15 15:11:44,337 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:44,337 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:44,337 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:44,338 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-15 15:11:44,353 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-15 15:11:44,388 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:44,388 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:44,389 INFO L263 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:11:44,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:44,398 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:44,581 INFO L272 TraceCheckUtils]: 0: Hoare triple {13819#true} call ULTIMATE.init(); {13819#true} is VALID [2022-04-15 15:11:44,581 INFO L290 TraceCheckUtils]: 1: Hoare triple {13819#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; {13819#true} is VALID [2022-04-15 15:11:44,581 INFO L290 TraceCheckUtils]: 2: Hoare triple {13819#true} assume true; {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13819#true} {13819#true} #102#return; {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L272 TraceCheckUtils]: 4: Hoare triple {13819#true} call #t~ret9 := main(); {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L290 TraceCheckUtils]: 5: Hoare triple {13819#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; {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L272 TraceCheckUtils]: 6: Hoare triple {13819#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {13819#true} ~cond := #in~cond; {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {13819#true} assume !(0 == ~cond); {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L290 TraceCheckUtils]: 9: Hoare triple {13819#true} assume true; {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13819#true} {13819#true} #90#return; {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L272 TraceCheckUtils]: 11: Hoare triple {13819#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)); {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L290 TraceCheckUtils]: 12: Hoare triple {13819#true} ~cond := #in~cond; {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L290 TraceCheckUtils]: 13: Hoare triple {13819#true} assume !(0 == ~cond); {13819#true} is VALID [2022-04-15 15:11:44,582 INFO L290 TraceCheckUtils]: 14: Hoare triple {13819#true} assume true; {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {13819#true} {13819#true} #92#return; {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L290 TraceCheckUtils]: 16: Hoare triple {13819#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L290 TraceCheckUtils]: 17: Hoare triple {13819#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L290 TraceCheckUtils]: 18: Hoare triple {13819#true} assume !!(#t~post6 < 100);havoc #t~post6; {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L272 TraceCheckUtils]: 19: Hoare triple {13819#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)); {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {13819#true} ~cond := #in~cond; {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {13819#true} assume !(0 == ~cond); {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {13819#true} assume true; {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {13819#true} {13819#true} #94#return; {13819#true} is VALID [2022-04-15 15:11:44,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {13819#true} assume !!(0 != ~r~0); {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 25: Hoare triple {13819#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 26: Hoare triple {13819#true} assume !!(#t~post7 < 100);havoc #t~post7; {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L272 TraceCheckUtils]: 27: Hoare triple {13819#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)); {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 28: Hoare triple {13819#true} ~cond := #in~cond; {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 29: Hoare triple {13819#true} assume !(0 == ~cond); {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 30: Hoare triple {13819#true} assume true; {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {13819#true} {13819#true} #96#return; {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 32: Hoare triple {13819#true} assume !(~r~0 > 0); {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 33: Hoare triple {13819#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 34: Hoare triple {13819#true} assume !!(#t~post8 < 100);havoc #t~post8; {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L272 TraceCheckUtils]: 35: Hoare triple {13819#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)); {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 36: Hoare triple {13819#true} ~cond := #in~cond; {13819#true} is VALID [2022-04-15 15:11:44,584 INFO L290 TraceCheckUtils]: 37: Hoare triple {13819#true} assume !(0 == ~cond); {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L290 TraceCheckUtils]: 38: Hoare triple {13819#true} assume true; {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {13819#true} {13819#true} #98#return; {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L290 TraceCheckUtils]: 40: Hoare triple {13819#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L290 TraceCheckUtils]: 41: Hoare triple {13819#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {13819#true} assume !!(#t~post8 < 100);havoc #t~post8; {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L272 TraceCheckUtils]: 43: Hoare triple {13819#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)); {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {13819#true} ~cond := #in~cond; {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {13819#true} assume !(0 == ~cond); {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L290 TraceCheckUtils]: 46: Hoare triple {13819#true} assume true; {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {13819#true} {13819#true} #98#return; {13819#true} is VALID [2022-04-15 15:11:44,585 INFO L290 TraceCheckUtils]: 48: Hoare triple {13819#true} assume !(~r~0 < 0); {13968#(not (< main_~r~0 0))} is VALID [2022-04-15 15:11:44,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {13968#(not (< main_~r~0 0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13968#(not (< main_~r~0 0))} is VALID [2022-04-15 15:11:44,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {13968#(not (< main_~r~0 0))} assume !!(#t~post6 < 100);havoc #t~post6; {13968#(not (< main_~r~0 0))} is VALID [2022-04-15 15:11:44,586 INFO L272 TraceCheckUtils]: 51: Hoare triple {13968#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13819#true} is VALID [2022-04-15 15:11:44,586 INFO L290 TraceCheckUtils]: 52: Hoare triple {13819#true} ~cond := #in~cond; {13819#true} is VALID [2022-04-15 15:11:44,586 INFO L290 TraceCheckUtils]: 53: Hoare triple {13819#true} assume !(0 == ~cond); {13819#true} is VALID [2022-04-15 15:11:44,586 INFO L290 TraceCheckUtils]: 54: Hoare triple {13819#true} assume true; {13819#true} is VALID [2022-04-15 15:11:44,587 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {13819#true} {13968#(not (< main_~r~0 0))} #94#return; {13968#(not (< main_~r~0 0))} is VALID [2022-04-15 15:11:44,587 INFO L290 TraceCheckUtils]: 56: Hoare triple {13968#(not (< main_~r~0 0))} assume !!(0 != ~r~0); {13993#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:11:44,588 INFO L290 TraceCheckUtils]: 57: Hoare triple {13993#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {13993#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:11:44,588 INFO L290 TraceCheckUtils]: 58: Hoare triple {13993#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !!(#t~post7 < 100);havoc #t~post7; {13993#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:11:44,588 INFO L272 TraceCheckUtils]: 59: Hoare triple {13993#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {13819#true} is VALID [2022-04-15 15:11:44,588 INFO L290 TraceCheckUtils]: 60: Hoare triple {13819#true} ~cond := #in~cond; {13819#true} is VALID [2022-04-15 15:11:44,588 INFO L290 TraceCheckUtils]: 61: Hoare triple {13819#true} assume !(0 == ~cond); {13819#true} is VALID [2022-04-15 15:11:44,588 INFO L290 TraceCheckUtils]: 62: Hoare triple {13819#true} assume true; {13819#true} is VALID [2022-04-15 15:11:44,589 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {13819#true} {13993#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} #96#return; {13993#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:11:44,589 INFO L290 TraceCheckUtils]: 64: Hoare triple {13993#(and (not (= main_~r~0 0)) (not (< main_~r~0 0)))} assume !(~r~0 > 0); {13820#false} is VALID [2022-04-15 15:11:44,589 INFO L290 TraceCheckUtils]: 65: Hoare triple {13820#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {13820#false} is VALID [2022-04-15 15:11:44,589 INFO L290 TraceCheckUtils]: 66: Hoare triple {13820#false} assume !(#t~post8 < 100);havoc #t~post8; {13820#false} is VALID [2022-04-15 15:11:44,589 INFO L290 TraceCheckUtils]: 67: Hoare triple {13820#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {13820#false} is VALID [2022-04-15 15:11:44,589 INFO L290 TraceCheckUtils]: 68: Hoare triple {13820#false} assume !(#t~post6 < 100);havoc #t~post6; {13820#false} is VALID [2022-04-15 15:11:44,589 INFO L272 TraceCheckUtils]: 69: Hoare triple {13820#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)); {13820#false} is VALID [2022-04-15 15:11:44,589 INFO L290 TraceCheckUtils]: 70: Hoare triple {13820#false} ~cond := #in~cond; {13820#false} is VALID [2022-04-15 15:11:44,590 INFO L290 TraceCheckUtils]: 71: Hoare triple {13820#false} assume 0 == ~cond; {13820#false} is VALID [2022-04-15 15:11:44,590 INFO L290 TraceCheckUtils]: 72: Hoare triple {13820#false} assume !false; {13820#false} is VALID [2022-04-15 15:11:44,590 INFO L134 CoverageAnalysis]: Checked inductivity of 96 backedges. 28 proven. 0 refuted. 0 times theorem prover too weak. 68 trivial. 0 not checked. [2022-04-15 15:11:44,590 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:11:44,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:44,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703233899] [2022-04-15 15:11:44,590 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:44,590 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1022825646] [2022-04-15 15:11:44,590 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1022825646] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:44,590 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:44,590 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:44,591 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:44,591 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1034410113] [2022-04-15 15:11:44,591 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1034410113] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:44,591 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:44,591 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:11:44,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [697952266] [2022-04-15 15:11:44,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:44,591 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-15 15:11:44,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:44,592 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:11:44,634 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-15 15:11:44,634 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:11:44,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:44,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:11:44,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:44,635 INFO L87 Difference]: Start difference. First operand 129 states and 158 transitions. Second operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:11:44,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:44,849 INFO L93 Difference]: Finished difference Result 184 states and 238 transitions. [2022-04-15 15:11:44,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:11:44,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 73 [2022-04-15 15:11:44,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:44,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:11:44,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:11:44,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:11:44,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:11:44,852 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 15:11:44,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:44,930 INFO L225 Difference]: With dead ends: 184 [2022-04-15 15:11:44,930 INFO L226 Difference]: Without dead ends: 147 [2022-04-15 15:11:44,930 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:11:44,930 INFO L913 BasicCegarLoop]: 59 mSDtfsCounter, 17 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:44,931 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 93 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:11:44,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-04-15 15:11:45,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 141. [2022-04-15 15:11:45,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:45,070 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 141 states, 102 states have (on average 1.196078431372549) internal successors, (122), 105 states have internal predecessors, (122), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:45,071 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 141 states, 102 states have (on average 1.196078431372549) internal successors, (122), 105 states have internal predecessors, (122), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:45,071 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 141 states, 102 states have (on average 1.196078431372549) internal successors, (122), 105 states have internal predecessors, (122), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:45,074 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:45,074 INFO L93 Difference]: Finished difference Result 147 states and 184 transitions. [2022-04-15 15:11:45,074 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 184 transitions. [2022-04-15 15:11:45,075 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:45,075 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:45,075 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 102 states have (on average 1.196078431372549) internal successors, (122), 105 states have internal predecessors, (122), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 147 states. [2022-04-15 15:11:45,076 INFO L87 Difference]: Start difference. First operand has 141 states, 102 states have (on average 1.196078431372549) internal successors, (122), 105 states have internal predecessors, (122), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) Second operand 147 states. [2022-04-15 15:11:45,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:45,084 INFO L93 Difference]: Finished difference Result 147 states and 184 transitions. [2022-04-15 15:11:45,084 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 184 transitions. [2022-04-15 15:11:45,084 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:45,084 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:45,084 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:45,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:45,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 102 states have (on average 1.196078431372549) internal successors, (122), 105 states have internal predecessors, (122), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 23 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:45,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 176 transitions. [2022-04-15 15:11:45,088 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 176 transitions. Word has length 73 [2022-04-15 15:11:45,088 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:45,088 INFO L478 AbstractCegarLoop]: Abstraction has 141 states and 176 transitions. [2022-04-15 15:11:45,088 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.25) internal successors, (33), 4 states have internal predecessors, (33), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:11:45,089 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 141 states and 176 transitions. [2022-04-15 15:11:47,303 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 176 edges. 175 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:47,303 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 176 transitions. [2022-04-15 15:11:47,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2022-04-15 15:11:47,304 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:47,304 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 5, 4, 4, 4, 4, 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, 1, 1, 1] [2022-04-15 15:11:47,327 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-15 15:11:47,504 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-15 15:11:47,505 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:47,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:47,505 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 7 times [2022-04-15 15:11:47,505 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:47,505 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [561704457] [2022-04-15 15:11:47,506 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:47,506 INFO L85 PathProgramCache]: Analyzing trace with hash -1401128268, now seen corresponding path program 8 times [2022-04-15 15:11:47,506 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:47,506 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965788371] [2022-04-15 15:11:47,506 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:47,506 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:47,522 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:47,522 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [105050604] [2022-04-15 15:11:47,522 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:47,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:47,523 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:47,531 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-15 15:11:47,550 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-15 15:11:47,608 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:47,608 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:47,609 INFO L263 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:11:47,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:47,625 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:47,976 INFO L272 TraceCheckUtils]: 0: Hoare triple {14985#true} call ULTIMATE.init(); {14985#true} is VALID [2022-04-15 15:11:47,977 INFO L290 TraceCheckUtils]: 1: Hoare triple {14985#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; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {14993#(<= ~counter~0 0)} assume true; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,977 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {14993#(<= ~counter~0 0)} {14985#true} #102#return; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,978 INFO L272 TraceCheckUtils]: 4: Hoare triple {14993#(<= ~counter~0 0)} call #t~ret9 := main(); {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {14993#(<= ~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; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,978 INFO L272 TraceCheckUtils]: 6: Hoare triple {14993#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {14993#(<= ~counter~0 0)} ~cond := #in~cond; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {14993#(<= ~counter~0 0)} assume !(0 == ~cond); {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {14993#(<= ~counter~0 0)} assume true; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,980 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14993#(<= ~counter~0 0)} {14993#(<= ~counter~0 0)} #90#return; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,980 INFO L272 TraceCheckUtils]: 11: Hoare triple {14993#(<= ~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)); {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,981 INFO L290 TraceCheckUtils]: 12: Hoare triple {14993#(<= ~counter~0 0)} ~cond := #in~cond; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {14993#(<= ~counter~0 0)} assume !(0 == ~cond); {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {14993#(<= ~counter~0 0)} assume true; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,982 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14993#(<= ~counter~0 0)} {14993#(<= ~counter~0 0)} #92#return; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {14993#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {14993#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:47,983 INFO L290 TraceCheckUtils]: 17: Hoare triple {14993#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15042#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:47,983 INFO L290 TraceCheckUtils]: 18: Hoare triple {15042#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {15042#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:47,984 INFO L272 TraceCheckUtils]: 19: Hoare triple {15042#(<= ~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)); {15042#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:47,984 INFO L290 TraceCheckUtils]: 20: Hoare triple {15042#(<= ~counter~0 1)} ~cond := #in~cond; {15042#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:47,984 INFO L290 TraceCheckUtils]: 21: Hoare triple {15042#(<= ~counter~0 1)} assume !(0 == ~cond); {15042#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:47,985 INFO L290 TraceCheckUtils]: 22: Hoare triple {15042#(<= ~counter~0 1)} assume true; {15042#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:47,985 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {15042#(<= ~counter~0 1)} {15042#(<= ~counter~0 1)} #94#return; {15042#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:47,985 INFO L290 TraceCheckUtils]: 24: Hoare triple {15042#(<= ~counter~0 1)} assume !!(0 != ~r~0); {15042#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:47,986 INFO L290 TraceCheckUtils]: 25: Hoare triple {15042#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15067#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:47,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {15067#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {15067#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:47,987 INFO L272 TraceCheckUtils]: 27: Hoare triple {15067#(<= ~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)); {15067#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:47,987 INFO L290 TraceCheckUtils]: 28: Hoare triple {15067#(<= ~counter~0 2)} ~cond := #in~cond; {15067#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:47,987 INFO L290 TraceCheckUtils]: 29: Hoare triple {15067#(<= ~counter~0 2)} assume !(0 == ~cond); {15067#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:47,988 INFO L290 TraceCheckUtils]: 30: Hoare triple {15067#(<= ~counter~0 2)} assume true; {15067#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:47,988 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {15067#(<= ~counter~0 2)} {15067#(<= ~counter~0 2)} #96#return; {15067#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:47,989 INFO L290 TraceCheckUtils]: 32: Hoare triple {15067#(<= ~counter~0 2)} assume !(~r~0 > 0); {15067#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:47,989 INFO L290 TraceCheckUtils]: 33: Hoare triple {15067#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15092#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:47,990 INFO L290 TraceCheckUtils]: 34: Hoare triple {15092#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {15092#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:47,990 INFO L272 TraceCheckUtils]: 35: Hoare triple {15092#(<= ~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)); {15092#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:47,990 INFO L290 TraceCheckUtils]: 36: Hoare triple {15092#(<= ~counter~0 3)} ~cond := #in~cond; {15092#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:47,991 INFO L290 TraceCheckUtils]: 37: Hoare triple {15092#(<= ~counter~0 3)} assume !(0 == ~cond); {15092#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:47,991 INFO L290 TraceCheckUtils]: 38: Hoare triple {15092#(<= ~counter~0 3)} assume true; {15092#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:47,992 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {15092#(<= ~counter~0 3)} {15092#(<= ~counter~0 3)} #98#return; {15092#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:47,992 INFO L290 TraceCheckUtils]: 40: Hoare triple {15092#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15092#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:47,993 INFO L290 TraceCheckUtils]: 41: Hoare triple {15092#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15117#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:47,993 INFO L290 TraceCheckUtils]: 42: Hoare triple {15117#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {15117#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:47,994 INFO L272 TraceCheckUtils]: 43: Hoare triple {15117#(<= ~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)); {15117#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:47,994 INFO L290 TraceCheckUtils]: 44: Hoare triple {15117#(<= ~counter~0 4)} ~cond := #in~cond; {15117#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:47,994 INFO L290 TraceCheckUtils]: 45: Hoare triple {15117#(<= ~counter~0 4)} assume !(0 == ~cond); {15117#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:47,995 INFO L290 TraceCheckUtils]: 46: Hoare triple {15117#(<= ~counter~0 4)} assume true; {15117#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:47,995 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {15117#(<= ~counter~0 4)} {15117#(<= ~counter~0 4)} #98#return; {15117#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:47,996 INFO L290 TraceCheckUtils]: 48: Hoare triple {15117#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15117#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:47,996 INFO L290 TraceCheckUtils]: 49: Hoare triple {15117#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15142#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:47,996 INFO L290 TraceCheckUtils]: 50: Hoare triple {15142#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {15142#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:47,997 INFO L272 TraceCheckUtils]: 51: Hoare triple {15142#(<= ~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)); {15142#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:47,997 INFO L290 TraceCheckUtils]: 52: Hoare triple {15142#(<= ~counter~0 5)} ~cond := #in~cond; {15142#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:47,998 INFO L290 TraceCheckUtils]: 53: Hoare triple {15142#(<= ~counter~0 5)} assume !(0 == ~cond); {15142#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:47,998 INFO L290 TraceCheckUtils]: 54: Hoare triple {15142#(<= ~counter~0 5)} assume true; {15142#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:47,999 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {15142#(<= ~counter~0 5)} {15142#(<= ~counter~0 5)} #98#return; {15142#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:47,999 INFO L290 TraceCheckUtils]: 56: Hoare triple {15142#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15142#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:47,999 INFO L290 TraceCheckUtils]: 57: Hoare triple {15142#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15167#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:48,000 INFO L290 TraceCheckUtils]: 58: Hoare triple {15167#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {15167#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:48,000 INFO L272 TraceCheckUtils]: 59: Hoare triple {15167#(<= ~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)); {15167#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:48,001 INFO L290 TraceCheckUtils]: 60: Hoare triple {15167#(<= ~counter~0 6)} ~cond := #in~cond; {15167#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:48,001 INFO L290 TraceCheckUtils]: 61: Hoare triple {15167#(<= ~counter~0 6)} assume !(0 == ~cond); {15167#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:48,001 INFO L290 TraceCheckUtils]: 62: Hoare triple {15167#(<= ~counter~0 6)} assume true; {15167#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:48,002 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {15167#(<= ~counter~0 6)} {15167#(<= ~counter~0 6)} #98#return; {15167#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:48,002 INFO L290 TraceCheckUtils]: 64: Hoare triple {15167#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15167#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:48,003 INFO L290 TraceCheckUtils]: 65: Hoare triple {15167#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15192#(<= |main_#t~post8| 6)} is VALID [2022-04-15 15:11:48,003 INFO L290 TraceCheckUtils]: 66: Hoare triple {15192#(<= |main_#t~post8| 6)} assume !(#t~post8 < 100);havoc #t~post8; {14986#false} is VALID [2022-04-15 15:11:48,003 INFO L290 TraceCheckUtils]: 67: Hoare triple {14986#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14986#false} is VALID [2022-04-15 15:11:48,003 INFO L290 TraceCheckUtils]: 68: Hoare triple {14986#false} assume !(#t~post6 < 100);havoc #t~post6; {14986#false} is VALID [2022-04-15 15:11:48,003 INFO L272 TraceCheckUtils]: 69: Hoare triple {14986#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)); {14986#false} is VALID [2022-04-15 15:11:48,004 INFO L290 TraceCheckUtils]: 70: Hoare triple {14986#false} ~cond := #in~cond; {14986#false} is VALID [2022-04-15 15:11:48,004 INFO L290 TraceCheckUtils]: 71: Hoare triple {14986#false} assume 0 == ~cond; {14986#false} is VALID [2022-04-15 15:11:48,004 INFO L290 TraceCheckUtils]: 72: Hoare triple {14986#false} assume !false; {14986#false} is VALID [2022-04-15 15:11:48,004 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 92 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:48,005 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:48,386 INFO L290 TraceCheckUtils]: 72: Hoare triple {14986#false} assume !false; {14986#false} is VALID [2022-04-15 15:11:48,386 INFO L290 TraceCheckUtils]: 71: Hoare triple {14986#false} assume 0 == ~cond; {14986#false} is VALID [2022-04-15 15:11:48,386 INFO L290 TraceCheckUtils]: 70: Hoare triple {14986#false} ~cond := #in~cond; {14986#false} is VALID [2022-04-15 15:11:48,386 INFO L272 TraceCheckUtils]: 69: Hoare triple {14986#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)); {14986#false} is VALID [2022-04-15 15:11:48,386 INFO L290 TraceCheckUtils]: 68: Hoare triple {14986#false} assume !(#t~post6 < 100);havoc #t~post6; {14986#false} is VALID [2022-04-15 15:11:48,386 INFO L290 TraceCheckUtils]: 67: Hoare triple {14986#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {14986#false} is VALID [2022-04-15 15:11:48,387 INFO L290 TraceCheckUtils]: 66: Hoare triple {15232#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {14986#false} is VALID [2022-04-15 15:11:48,387 INFO L290 TraceCheckUtils]: 65: Hoare triple {15236#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15232#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:11:48,387 INFO L290 TraceCheckUtils]: 64: Hoare triple {15236#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15236#(< ~counter~0 100)} is VALID [2022-04-15 15:11:48,388 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {14985#true} {15236#(< ~counter~0 100)} #98#return; {15236#(< ~counter~0 100)} is VALID [2022-04-15 15:11:48,388 INFO L290 TraceCheckUtils]: 62: Hoare triple {14985#true} assume true; {14985#true} is VALID [2022-04-15 15:11:48,388 INFO L290 TraceCheckUtils]: 61: Hoare triple {14985#true} assume !(0 == ~cond); {14985#true} is VALID [2022-04-15 15:11:48,388 INFO L290 TraceCheckUtils]: 60: Hoare triple {14985#true} ~cond := #in~cond; {14985#true} is VALID [2022-04-15 15:11:48,388 INFO L272 TraceCheckUtils]: 59: Hoare triple {15236#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14985#true} is VALID [2022-04-15 15:11:48,388 INFO L290 TraceCheckUtils]: 58: Hoare triple {15236#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {15236#(< ~counter~0 100)} is VALID [2022-04-15 15:11:48,389 INFO L290 TraceCheckUtils]: 57: Hoare triple {15261#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15236#(< ~counter~0 100)} is VALID [2022-04-15 15:11:48,389 INFO L290 TraceCheckUtils]: 56: Hoare triple {15261#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15261#(< ~counter~0 99)} is VALID [2022-04-15 15:11:48,390 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {14985#true} {15261#(< ~counter~0 99)} #98#return; {15261#(< ~counter~0 99)} is VALID [2022-04-15 15:11:48,390 INFO L290 TraceCheckUtils]: 54: Hoare triple {14985#true} assume true; {14985#true} is VALID [2022-04-15 15:11:48,390 INFO L290 TraceCheckUtils]: 53: Hoare triple {14985#true} assume !(0 == ~cond); {14985#true} is VALID [2022-04-15 15:11:48,390 INFO L290 TraceCheckUtils]: 52: Hoare triple {14985#true} ~cond := #in~cond; {14985#true} is VALID [2022-04-15 15:11:48,390 INFO L272 TraceCheckUtils]: 51: Hoare triple {15261#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14985#true} is VALID [2022-04-15 15:11:48,390 INFO L290 TraceCheckUtils]: 50: Hoare triple {15261#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {15261#(< ~counter~0 99)} is VALID [2022-04-15 15:11:48,391 INFO L290 TraceCheckUtils]: 49: Hoare triple {15286#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15261#(< ~counter~0 99)} is VALID [2022-04-15 15:11:48,391 INFO L290 TraceCheckUtils]: 48: Hoare triple {15286#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15286#(< ~counter~0 98)} is VALID [2022-04-15 15:11:48,392 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {14985#true} {15286#(< ~counter~0 98)} #98#return; {15286#(< ~counter~0 98)} is VALID [2022-04-15 15:11:48,392 INFO L290 TraceCheckUtils]: 46: Hoare triple {14985#true} assume true; {14985#true} is VALID [2022-04-15 15:11:48,392 INFO L290 TraceCheckUtils]: 45: Hoare triple {14985#true} assume !(0 == ~cond); {14985#true} is VALID [2022-04-15 15:11:48,392 INFO L290 TraceCheckUtils]: 44: Hoare triple {14985#true} ~cond := #in~cond; {14985#true} is VALID [2022-04-15 15:11:48,392 INFO L272 TraceCheckUtils]: 43: Hoare triple {15286#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14985#true} is VALID [2022-04-15 15:11:48,392 INFO L290 TraceCheckUtils]: 42: Hoare triple {15286#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {15286#(< ~counter~0 98)} is VALID [2022-04-15 15:11:48,393 INFO L290 TraceCheckUtils]: 41: Hoare triple {15311#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15286#(< ~counter~0 98)} is VALID [2022-04-15 15:11:48,393 INFO L290 TraceCheckUtils]: 40: Hoare triple {15311#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {15311#(< ~counter~0 97)} is VALID [2022-04-15 15:11:48,393 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {14985#true} {15311#(< ~counter~0 97)} #98#return; {15311#(< ~counter~0 97)} is VALID [2022-04-15 15:11:48,394 INFO L290 TraceCheckUtils]: 38: Hoare triple {14985#true} assume true; {14985#true} is VALID [2022-04-15 15:11:48,394 INFO L290 TraceCheckUtils]: 37: Hoare triple {14985#true} assume !(0 == ~cond); {14985#true} is VALID [2022-04-15 15:11:48,394 INFO L290 TraceCheckUtils]: 36: Hoare triple {14985#true} ~cond := #in~cond; {14985#true} is VALID [2022-04-15 15:11:48,394 INFO L272 TraceCheckUtils]: 35: Hoare triple {15311#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14985#true} is VALID [2022-04-15 15:11:48,394 INFO L290 TraceCheckUtils]: 34: Hoare triple {15311#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {15311#(< ~counter~0 97)} is VALID [2022-04-15 15:11:48,394 INFO L290 TraceCheckUtils]: 33: Hoare triple {15336#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {15311#(< ~counter~0 97)} is VALID [2022-04-15 15:11:48,395 INFO L290 TraceCheckUtils]: 32: Hoare triple {15336#(< ~counter~0 96)} assume !(~r~0 > 0); {15336#(< ~counter~0 96)} is VALID [2022-04-15 15:11:48,395 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {14985#true} {15336#(< ~counter~0 96)} #96#return; {15336#(< ~counter~0 96)} is VALID [2022-04-15 15:11:48,395 INFO L290 TraceCheckUtils]: 30: Hoare triple {14985#true} assume true; {14985#true} is VALID [2022-04-15 15:11:48,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {14985#true} assume !(0 == ~cond); {14985#true} is VALID [2022-04-15 15:11:48,396 INFO L290 TraceCheckUtils]: 28: Hoare triple {14985#true} ~cond := #in~cond; {14985#true} is VALID [2022-04-15 15:11:48,396 INFO L272 TraceCheckUtils]: 27: Hoare triple {15336#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14985#true} is VALID [2022-04-15 15:11:48,396 INFO L290 TraceCheckUtils]: 26: Hoare triple {15336#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {15336#(< ~counter~0 96)} is VALID [2022-04-15 15:11:48,396 INFO L290 TraceCheckUtils]: 25: Hoare triple {15361#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {15336#(< ~counter~0 96)} is VALID [2022-04-15 15:11:48,397 INFO L290 TraceCheckUtils]: 24: Hoare triple {15361#(< ~counter~0 95)} assume !!(0 != ~r~0); {15361#(< ~counter~0 95)} is VALID [2022-04-15 15:11:48,397 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {14985#true} {15361#(< ~counter~0 95)} #94#return; {15361#(< ~counter~0 95)} is VALID [2022-04-15 15:11:48,397 INFO L290 TraceCheckUtils]: 22: Hoare triple {14985#true} assume true; {14985#true} is VALID [2022-04-15 15:11:48,397 INFO L290 TraceCheckUtils]: 21: Hoare triple {14985#true} assume !(0 == ~cond); {14985#true} is VALID [2022-04-15 15:11:48,397 INFO L290 TraceCheckUtils]: 20: Hoare triple {14985#true} ~cond := #in~cond; {14985#true} is VALID [2022-04-15 15:11:48,397 INFO L272 TraceCheckUtils]: 19: Hoare triple {15361#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {14985#true} is VALID [2022-04-15 15:11:48,398 INFO L290 TraceCheckUtils]: 18: Hoare triple {15361#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {15361#(< ~counter~0 95)} is VALID [2022-04-15 15:11:48,398 INFO L290 TraceCheckUtils]: 17: Hoare triple {15386#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {15361#(< ~counter~0 95)} is VALID [2022-04-15 15:11:48,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {15386#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {15386#(< ~counter~0 94)} is VALID [2022-04-15 15:11:48,399 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {14985#true} {15386#(< ~counter~0 94)} #92#return; {15386#(< ~counter~0 94)} is VALID [2022-04-15 15:11:48,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {14985#true} assume true; {14985#true} is VALID [2022-04-15 15:11:48,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {14985#true} assume !(0 == ~cond); {14985#true} is VALID [2022-04-15 15:11:48,399 INFO L290 TraceCheckUtils]: 12: Hoare triple {14985#true} ~cond := #in~cond; {14985#true} is VALID [2022-04-15 15:11:48,399 INFO L272 TraceCheckUtils]: 11: Hoare triple {15386#(< ~counter~0 94)} 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)); {14985#true} is VALID [2022-04-15 15:11:48,400 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {14985#true} {15386#(< ~counter~0 94)} #90#return; {15386#(< ~counter~0 94)} is VALID [2022-04-15 15:11:48,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {14985#true} assume true; {14985#true} is VALID [2022-04-15 15:11:48,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {14985#true} assume !(0 == ~cond); {14985#true} is VALID [2022-04-15 15:11:48,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {14985#true} ~cond := #in~cond; {14985#true} is VALID [2022-04-15 15:11:48,400 INFO L272 TraceCheckUtils]: 6: Hoare triple {15386#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {14985#true} is VALID [2022-04-15 15:11:48,400 INFO L290 TraceCheckUtils]: 5: Hoare triple {15386#(< ~counter~0 94)} 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; {15386#(< ~counter~0 94)} is VALID [2022-04-15 15:11:48,400 INFO L272 TraceCheckUtils]: 4: Hoare triple {15386#(< ~counter~0 94)} call #t~ret9 := main(); {15386#(< ~counter~0 94)} is VALID [2022-04-15 15:11:48,401 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15386#(< ~counter~0 94)} {14985#true} #102#return; {15386#(< ~counter~0 94)} is VALID [2022-04-15 15:11:48,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {15386#(< ~counter~0 94)} assume true; {15386#(< ~counter~0 94)} is VALID [2022-04-15 15:11:48,401 INFO L290 TraceCheckUtils]: 1: Hoare triple {14985#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; {15386#(< ~counter~0 94)} is VALID [2022-04-15 15:11:48,402 INFO L272 TraceCheckUtils]: 0: Hoare triple {14985#true} call ULTIMATE.init(); {14985#true} is VALID [2022-04-15 15:11:48,402 INFO L134 CoverageAnalysis]: Checked inductivity of 110 backedges. 14 proven. 32 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 15:11:48,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:48,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965788371] [2022-04-15 15:11:48,402 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:48,402 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [105050604] [2022-04-15 15:11:48,402 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [105050604] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:48,402 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:48,402 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 15:11:48,403 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:48,403 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [561704457] [2022-04-15 15:11:48,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [561704457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:48,403 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:48,403 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:11:48,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1057410401] [2022-04-15 15:11:48,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:48,403 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 73 [2022-04-15 15:11:48,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:48,404 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-15 15:11:48,466 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-15 15:11:48,466 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:11:48,466 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:48,466 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:11:48,467 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:11:48,467 INFO L87 Difference]: Start difference. First operand 141 states and 176 transitions. Second operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-15 15:11:49,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:49,016 INFO L93 Difference]: Finished difference Result 197 states and 255 transitions. [2022-04-15 15:11:49,016 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-04-15 15:11:49,017 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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 73 [2022-04-15 15:11:49,017 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:49,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-15 15:11:49,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 15:11:49,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-15 15:11:49,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 157 transitions. [2022-04-15 15:11:49,022 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 14 states and 157 transitions. [2022-04-15 15:11:49,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:49,158 INFO L225 Difference]: With dead ends: 197 [2022-04-15 15:11:49,158 INFO L226 Difference]: Without dead ends: 148 [2022-04-15 15:11:49,158 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 149 GetRequests, 129 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 25 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=185, Invalid=277, Unknown=0, NotChecked=0, Total=462 [2022-04-15 15:11:49,159 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 49 mSDsluCounter, 152 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:49,159 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 200 Invalid, 101 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:49,159 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2022-04-15 15:11:49,328 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 144. [2022-04-15 15:11:49,328 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:49,329 INFO L82 GeneralOperation]: Start isEquivalent. First operand 148 states. Second operand has 144 states, 105 states have (on average 1.2) internal successors, (126), 107 states have internal predecessors, (126), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:49,329 INFO L74 IsIncluded]: Start isIncluded. First operand 148 states. Second operand has 144 states, 105 states have (on average 1.2) internal successors, (126), 107 states have internal predecessors, (126), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:49,329 INFO L87 Difference]: Start difference. First operand 148 states. Second operand has 144 states, 105 states have (on average 1.2) internal successors, (126), 107 states have internal predecessors, (126), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:49,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:49,332 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2022-04-15 15:11:49,332 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2022-04-15 15:11:49,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:49,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:49,333 INFO L74 IsIncluded]: Start isIncluded. First operand has 144 states, 105 states have (on average 1.2) internal successors, (126), 107 states have internal predecessors, (126), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 148 states. [2022-04-15 15:11:49,333 INFO L87 Difference]: Start difference. First operand has 144 states, 105 states have (on average 1.2) internal successors, (126), 107 states have internal predecessors, (126), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) Second operand 148 states. [2022-04-15 15:11:49,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:49,336 INFO L93 Difference]: Finished difference Result 148 states and 184 transitions. [2022-04-15 15:11:49,336 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 184 transitions. [2022-04-15 15:11:49,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:49,337 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:49,337 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:49,337 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:49,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 105 states have (on average 1.2) internal successors, (126), 107 states have internal predecessors, (126), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 24 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:49,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 180 transitions. [2022-04-15 15:11:49,341 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 180 transitions. Word has length 73 [2022-04-15 15:11:49,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:49,341 INFO L478 AbstractCegarLoop]: Abstraction has 144 states and 180 transitions. [2022-04-15 15:11:49,341 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.0) internal successors, (50), 9 states have internal predecessors, (50), 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-15 15:11:49,341 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 144 states and 180 transitions. [2022-04-15 15:11:50,561 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:50,561 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 180 transitions. [2022-04-15 15:11:50,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2022-04-15 15:11:50,562 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:50,562 INFO L499 BasicCegarLoop]: trace histogram [7, 6, 6, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:50,578 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Ended with exit code 0 [2022-04-15 15:11:50,767 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-15 15:11:50,767 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:50,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 1 times [2022-04-15 15:11:50,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:50,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [251447829] [2022-04-15 15:11:50,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:50,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1116733197, now seen corresponding path program 2 times [2022-04-15 15:11:50,769 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:50,769 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1262060311] [2022-04-15 15:11:50,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:50,769 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:50,784 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:50,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [844393712] [2022-04-15 15:11:50,784 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:50,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:50,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:50,785 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-15 15:11:50,788 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-15 15:11:50,831 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:50,833 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:50,834 INFO L263 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 17 conjunts are in the unsatisfiable core [2022-04-15 15:11:50,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:50,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:51,194 INFO L272 TraceCheckUtils]: 0: Hoare triple {16426#true} call ULTIMATE.init(); {16426#true} is VALID [2022-04-15 15:11:51,195 INFO L290 TraceCheckUtils]: 1: Hoare triple {16426#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; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,195 INFO L290 TraceCheckUtils]: 2: Hoare triple {16434#(<= ~counter~0 0)} assume true; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,195 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16434#(<= ~counter~0 0)} {16426#true} #102#return; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,196 INFO L272 TraceCheckUtils]: 4: Hoare triple {16434#(<= ~counter~0 0)} call #t~ret9 := main(); {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {16434#(<= ~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; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,197 INFO L272 TraceCheckUtils]: 6: Hoare triple {16434#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {16434#(<= ~counter~0 0)} ~cond := #in~cond; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {16434#(<= ~counter~0 0)} assume !(0 == ~cond); {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {16434#(<= ~counter~0 0)} assume true; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,198 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16434#(<= ~counter~0 0)} {16434#(<= ~counter~0 0)} #90#return; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,199 INFO L272 TraceCheckUtils]: 11: Hoare triple {16434#(<= ~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)); {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {16434#(<= ~counter~0 0)} ~cond := #in~cond; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {16434#(<= ~counter~0 0)} assume !(0 == ~cond); {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {16434#(<= ~counter~0 0)} assume true; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,200 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16434#(<= ~counter~0 0)} {16434#(<= ~counter~0 0)} #92#return; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {16434#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16434#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:51,202 INFO L290 TraceCheckUtils]: 17: Hoare triple {16434#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16483#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,202 INFO L290 TraceCheckUtils]: 18: Hoare triple {16483#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {16483#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,203 INFO L272 TraceCheckUtils]: 19: Hoare triple {16483#(<= ~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)); {16483#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {16483#(<= ~counter~0 1)} ~cond := #in~cond; {16483#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {16483#(<= ~counter~0 1)} assume !(0 == ~cond); {16483#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,204 INFO L290 TraceCheckUtils]: 22: Hoare triple {16483#(<= ~counter~0 1)} assume true; {16483#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,205 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16483#(<= ~counter~0 1)} {16483#(<= ~counter~0 1)} #94#return; {16483#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {16483#(<= ~counter~0 1)} assume !!(0 != ~r~0); {16483#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:51,205 INFO L290 TraceCheckUtils]: 25: Hoare triple {16483#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16508#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {16508#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {16508#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,206 INFO L272 TraceCheckUtils]: 27: Hoare triple {16508#(<= ~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)); {16508#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {16508#(<= ~counter~0 2)} ~cond := #in~cond; {16508#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {16508#(<= ~counter~0 2)} assume !(0 == ~cond); {16508#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {16508#(<= ~counter~0 2)} assume true; {16508#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,208 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16508#(<= ~counter~0 2)} {16508#(<= ~counter~0 2)} #96#return; {16508#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,209 INFO L290 TraceCheckUtils]: 32: Hoare triple {16508#(<= ~counter~0 2)} assume !(~r~0 > 0); {16508#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:51,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {16508#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16533#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:51,210 INFO L290 TraceCheckUtils]: 34: Hoare triple {16533#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {16533#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:51,210 INFO L272 TraceCheckUtils]: 35: Hoare triple {16533#(<= ~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)); {16533#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:51,211 INFO L290 TraceCheckUtils]: 36: Hoare triple {16533#(<= ~counter~0 3)} ~cond := #in~cond; {16533#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:51,211 INFO L290 TraceCheckUtils]: 37: Hoare triple {16533#(<= ~counter~0 3)} assume !(0 == ~cond); {16533#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:51,211 INFO L290 TraceCheckUtils]: 38: Hoare triple {16533#(<= ~counter~0 3)} assume true; {16533#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:51,212 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16533#(<= ~counter~0 3)} {16533#(<= ~counter~0 3)} #98#return; {16533#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:51,212 INFO L290 TraceCheckUtils]: 40: Hoare triple {16533#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16533#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:51,213 INFO L290 TraceCheckUtils]: 41: Hoare triple {16533#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16558#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:51,213 INFO L290 TraceCheckUtils]: 42: Hoare triple {16558#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {16558#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:51,214 INFO L272 TraceCheckUtils]: 43: Hoare triple {16558#(<= ~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)); {16558#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:51,214 INFO L290 TraceCheckUtils]: 44: Hoare triple {16558#(<= ~counter~0 4)} ~cond := #in~cond; {16558#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:51,215 INFO L290 TraceCheckUtils]: 45: Hoare triple {16558#(<= ~counter~0 4)} assume !(0 == ~cond); {16558#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:51,215 INFO L290 TraceCheckUtils]: 46: Hoare triple {16558#(<= ~counter~0 4)} assume true; {16558#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:51,216 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16558#(<= ~counter~0 4)} {16558#(<= ~counter~0 4)} #98#return; {16558#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:51,216 INFO L290 TraceCheckUtils]: 48: Hoare triple {16558#(<= ~counter~0 4)} assume !(~r~0 < 0); {16558#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:51,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {16558#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16583#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:51,217 INFO L290 TraceCheckUtils]: 50: Hoare triple {16583#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {16583#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:51,218 INFO L272 TraceCheckUtils]: 51: Hoare triple {16583#(<= ~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)); {16583#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:51,218 INFO L290 TraceCheckUtils]: 52: Hoare triple {16583#(<= ~counter~0 5)} ~cond := #in~cond; {16583#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:51,219 INFO L290 TraceCheckUtils]: 53: Hoare triple {16583#(<= ~counter~0 5)} assume !(0 == ~cond); {16583#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:51,219 INFO L290 TraceCheckUtils]: 54: Hoare triple {16583#(<= ~counter~0 5)} assume true; {16583#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:51,220 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16583#(<= ~counter~0 5)} {16583#(<= ~counter~0 5)} #94#return; {16583#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:51,220 INFO L290 TraceCheckUtils]: 56: Hoare triple {16583#(<= ~counter~0 5)} assume !!(0 != ~r~0); {16583#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:51,221 INFO L290 TraceCheckUtils]: 57: Hoare triple {16583#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16608#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:51,221 INFO L290 TraceCheckUtils]: 58: Hoare triple {16608#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {16608#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:51,222 INFO L272 TraceCheckUtils]: 59: Hoare triple {16608#(<= ~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)); {16608#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:51,222 INFO L290 TraceCheckUtils]: 60: Hoare triple {16608#(<= ~counter~0 6)} ~cond := #in~cond; {16608#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:51,222 INFO L290 TraceCheckUtils]: 61: Hoare triple {16608#(<= ~counter~0 6)} assume !(0 == ~cond); {16608#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:51,223 INFO L290 TraceCheckUtils]: 62: Hoare triple {16608#(<= ~counter~0 6)} assume true; {16608#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:51,227 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16608#(<= ~counter~0 6)} {16608#(<= ~counter~0 6)} #96#return; {16608#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:51,228 INFO L290 TraceCheckUtils]: 64: Hoare triple {16608#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16608#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:51,228 INFO L290 TraceCheckUtils]: 65: Hoare triple {16608#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16633#(<= |main_#t~post7| 6)} is VALID [2022-04-15 15:11:51,229 INFO L290 TraceCheckUtils]: 66: Hoare triple {16633#(<= |main_#t~post7| 6)} assume !(#t~post7 < 100);havoc #t~post7; {16427#false} is VALID [2022-04-15 15:11:51,229 INFO L290 TraceCheckUtils]: 67: Hoare triple {16427#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16427#false} is VALID [2022-04-15 15:11:51,229 INFO L290 TraceCheckUtils]: 68: Hoare triple {16427#false} assume !(#t~post8 < 100);havoc #t~post8; {16427#false} is VALID [2022-04-15 15:11:51,229 INFO L290 TraceCheckUtils]: 69: Hoare triple {16427#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16427#false} is VALID [2022-04-15 15:11:51,229 INFO L290 TraceCheckUtils]: 70: Hoare triple {16427#false} assume !(#t~post6 < 100);havoc #t~post6; {16427#false} is VALID [2022-04-15 15:11:51,229 INFO L272 TraceCheckUtils]: 71: Hoare triple {16427#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)); {16427#false} is VALID [2022-04-15 15:11:51,229 INFO L290 TraceCheckUtils]: 72: Hoare triple {16427#false} ~cond := #in~cond; {16427#false} is VALID [2022-04-15 15:11:51,229 INFO L290 TraceCheckUtils]: 73: Hoare triple {16427#false} assume 0 == ~cond; {16427#false} is VALID [2022-04-15 15:11:51,229 INFO L290 TraceCheckUtils]: 74: Hoare triple {16427#false} assume !false; {16427#false} is VALID [2022-04-15 15:11:51,230 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 76 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:51,230 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:51,642 INFO L290 TraceCheckUtils]: 74: Hoare triple {16427#false} assume !false; {16427#false} is VALID [2022-04-15 15:11:51,643 INFO L290 TraceCheckUtils]: 73: Hoare triple {16427#false} assume 0 == ~cond; {16427#false} is VALID [2022-04-15 15:11:51,643 INFO L290 TraceCheckUtils]: 72: Hoare triple {16427#false} ~cond := #in~cond; {16427#false} is VALID [2022-04-15 15:11:51,643 INFO L272 TraceCheckUtils]: 71: Hoare triple {16427#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)); {16427#false} is VALID [2022-04-15 15:11:51,643 INFO L290 TraceCheckUtils]: 70: Hoare triple {16427#false} assume !(#t~post6 < 100);havoc #t~post6; {16427#false} is VALID [2022-04-15 15:11:51,643 INFO L290 TraceCheckUtils]: 69: Hoare triple {16427#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16427#false} is VALID [2022-04-15 15:11:51,643 INFO L290 TraceCheckUtils]: 68: Hoare triple {16427#false} assume !(#t~post8 < 100);havoc #t~post8; {16427#false} is VALID [2022-04-15 15:11:51,643 INFO L290 TraceCheckUtils]: 67: Hoare triple {16427#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16427#false} is VALID [2022-04-15 15:11:51,646 INFO L290 TraceCheckUtils]: 66: Hoare triple {16685#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {16427#false} is VALID [2022-04-15 15:11:51,646 INFO L290 TraceCheckUtils]: 65: Hoare triple {16689#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16685#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:11:51,646 INFO L290 TraceCheckUtils]: 64: Hoare triple {16689#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {16689#(< ~counter~0 100)} is VALID [2022-04-15 15:11:51,647 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {16426#true} {16689#(< ~counter~0 100)} #96#return; {16689#(< ~counter~0 100)} is VALID [2022-04-15 15:11:51,647 INFO L290 TraceCheckUtils]: 62: Hoare triple {16426#true} assume true; {16426#true} is VALID [2022-04-15 15:11:51,647 INFO L290 TraceCheckUtils]: 61: Hoare triple {16426#true} assume !(0 == ~cond); {16426#true} is VALID [2022-04-15 15:11:51,647 INFO L290 TraceCheckUtils]: 60: Hoare triple {16426#true} ~cond := #in~cond; {16426#true} is VALID [2022-04-15 15:11:51,647 INFO L272 TraceCheckUtils]: 59: Hoare triple {16689#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16426#true} is VALID [2022-04-15 15:11:51,647 INFO L290 TraceCheckUtils]: 58: Hoare triple {16689#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {16689#(< ~counter~0 100)} is VALID [2022-04-15 15:11:51,648 INFO L290 TraceCheckUtils]: 57: Hoare triple {16714#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16689#(< ~counter~0 100)} is VALID [2022-04-15 15:11:51,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {16714#(< ~counter~0 99)} assume !!(0 != ~r~0); {16714#(< ~counter~0 99)} is VALID [2022-04-15 15:11:51,649 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {16426#true} {16714#(< ~counter~0 99)} #94#return; {16714#(< ~counter~0 99)} is VALID [2022-04-15 15:11:51,649 INFO L290 TraceCheckUtils]: 54: Hoare triple {16426#true} assume true; {16426#true} is VALID [2022-04-15 15:11:51,649 INFO L290 TraceCheckUtils]: 53: Hoare triple {16426#true} assume !(0 == ~cond); {16426#true} is VALID [2022-04-15 15:11:51,649 INFO L290 TraceCheckUtils]: 52: Hoare triple {16426#true} ~cond := #in~cond; {16426#true} is VALID [2022-04-15 15:11:51,649 INFO L272 TraceCheckUtils]: 51: Hoare triple {16714#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16426#true} is VALID [2022-04-15 15:11:51,650 INFO L290 TraceCheckUtils]: 50: Hoare triple {16714#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {16714#(< ~counter~0 99)} is VALID [2022-04-15 15:11:51,650 INFO L290 TraceCheckUtils]: 49: Hoare triple {16739#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16714#(< ~counter~0 99)} is VALID [2022-04-15 15:11:51,650 INFO L290 TraceCheckUtils]: 48: Hoare triple {16739#(< ~counter~0 98)} assume !(~r~0 < 0); {16739#(< ~counter~0 98)} is VALID [2022-04-15 15:11:51,651 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {16426#true} {16739#(< ~counter~0 98)} #98#return; {16739#(< ~counter~0 98)} is VALID [2022-04-15 15:11:51,651 INFO L290 TraceCheckUtils]: 46: Hoare triple {16426#true} assume true; {16426#true} is VALID [2022-04-15 15:11:51,651 INFO L290 TraceCheckUtils]: 45: Hoare triple {16426#true} assume !(0 == ~cond); {16426#true} is VALID [2022-04-15 15:11:51,651 INFO L290 TraceCheckUtils]: 44: Hoare triple {16426#true} ~cond := #in~cond; {16426#true} is VALID [2022-04-15 15:11:51,651 INFO L272 TraceCheckUtils]: 43: Hoare triple {16739#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16426#true} is VALID [2022-04-15 15:11:51,651 INFO L290 TraceCheckUtils]: 42: Hoare triple {16739#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {16739#(< ~counter~0 98)} is VALID [2022-04-15 15:11:51,652 INFO L290 TraceCheckUtils]: 41: Hoare triple {16764#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16739#(< ~counter~0 98)} is VALID [2022-04-15 15:11:51,652 INFO L290 TraceCheckUtils]: 40: Hoare triple {16764#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {16764#(< ~counter~0 97)} is VALID [2022-04-15 15:11:51,653 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {16426#true} {16764#(< ~counter~0 97)} #98#return; {16764#(< ~counter~0 97)} is VALID [2022-04-15 15:11:51,653 INFO L290 TraceCheckUtils]: 38: Hoare triple {16426#true} assume true; {16426#true} is VALID [2022-04-15 15:11:51,653 INFO L290 TraceCheckUtils]: 37: Hoare triple {16426#true} assume !(0 == ~cond); {16426#true} is VALID [2022-04-15 15:11:51,653 INFO L290 TraceCheckUtils]: 36: Hoare triple {16426#true} ~cond := #in~cond; {16426#true} is VALID [2022-04-15 15:11:51,653 INFO L272 TraceCheckUtils]: 35: Hoare triple {16764#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16426#true} is VALID [2022-04-15 15:11:51,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {16764#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {16764#(< ~counter~0 97)} is VALID [2022-04-15 15:11:51,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {16789#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {16764#(< ~counter~0 97)} is VALID [2022-04-15 15:11:51,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {16789#(< ~counter~0 96)} assume !(~r~0 > 0); {16789#(< ~counter~0 96)} is VALID [2022-04-15 15:11:51,655 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {16426#true} {16789#(< ~counter~0 96)} #96#return; {16789#(< ~counter~0 96)} is VALID [2022-04-15 15:11:51,655 INFO L290 TraceCheckUtils]: 30: Hoare triple {16426#true} assume true; {16426#true} is VALID [2022-04-15 15:11:51,655 INFO L290 TraceCheckUtils]: 29: Hoare triple {16426#true} assume !(0 == ~cond); {16426#true} is VALID [2022-04-15 15:11:51,655 INFO L290 TraceCheckUtils]: 28: Hoare triple {16426#true} ~cond := #in~cond; {16426#true} is VALID [2022-04-15 15:11:51,655 INFO L272 TraceCheckUtils]: 27: Hoare triple {16789#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16426#true} is VALID [2022-04-15 15:11:51,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {16789#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {16789#(< ~counter~0 96)} is VALID [2022-04-15 15:11:51,656 INFO L290 TraceCheckUtils]: 25: Hoare triple {16814#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {16789#(< ~counter~0 96)} is VALID [2022-04-15 15:11:51,656 INFO L290 TraceCheckUtils]: 24: Hoare triple {16814#(< ~counter~0 95)} assume !!(0 != ~r~0); {16814#(< ~counter~0 95)} is VALID [2022-04-15 15:11:51,656 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {16426#true} {16814#(< ~counter~0 95)} #94#return; {16814#(< ~counter~0 95)} is VALID [2022-04-15 15:11:51,656 INFO L290 TraceCheckUtils]: 22: Hoare triple {16426#true} assume true; {16426#true} is VALID [2022-04-15 15:11:51,657 INFO L290 TraceCheckUtils]: 21: Hoare triple {16426#true} assume !(0 == ~cond); {16426#true} is VALID [2022-04-15 15:11:51,657 INFO L290 TraceCheckUtils]: 20: Hoare triple {16426#true} ~cond := #in~cond; {16426#true} is VALID [2022-04-15 15:11:51,657 INFO L272 TraceCheckUtils]: 19: Hoare triple {16814#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {16426#true} is VALID [2022-04-15 15:11:51,657 INFO L290 TraceCheckUtils]: 18: Hoare triple {16814#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {16814#(< ~counter~0 95)} is VALID [2022-04-15 15:11:51,657 INFO L290 TraceCheckUtils]: 17: Hoare triple {16839#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {16814#(< ~counter~0 95)} is VALID [2022-04-15 15:11:51,658 INFO L290 TraceCheckUtils]: 16: Hoare triple {16839#(< ~counter~0 94)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {16839#(< ~counter~0 94)} is VALID [2022-04-15 15:11:51,658 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {16426#true} {16839#(< ~counter~0 94)} #92#return; {16839#(< ~counter~0 94)} is VALID [2022-04-15 15:11:51,658 INFO L290 TraceCheckUtils]: 14: Hoare triple {16426#true} assume true; {16426#true} is VALID [2022-04-15 15:11:51,658 INFO L290 TraceCheckUtils]: 13: Hoare triple {16426#true} assume !(0 == ~cond); {16426#true} is VALID [2022-04-15 15:11:51,658 INFO L290 TraceCheckUtils]: 12: Hoare triple {16426#true} ~cond := #in~cond; {16426#true} is VALID [2022-04-15 15:11:51,658 INFO L272 TraceCheckUtils]: 11: Hoare triple {16839#(< ~counter~0 94)} 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)); {16426#true} is VALID [2022-04-15 15:11:51,659 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {16426#true} {16839#(< ~counter~0 94)} #90#return; {16839#(< ~counter~0 94)} is VALID [2022-04-15 15:11:51,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {16426#true} assume true; {16426#true} is VALID [2022-04-15 15:11:51,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {16426#true} assume !(0 == ~cond); {16426#true} is VALID [2022-04-15 15:11:51,659 INFO L290 TraceCheckUtils]: 7: Hoare triple {16426#true} ~cond := #in~cond; {16426#true} is VALID [2022-04-15 15:11:51,659 INFO L272 TraceCheckUtils]: 6: Hoare triple {16839#(< ~counter~0 94)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {16426#true} is VALID [2022-04-15 15:11:51,659 INFO L290 TraceCheckUtils]: 5: Hoare triple {16839#(< ~counter~0 94)} 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; {16839#(< ~counter~0 94)} is VALID [2022-04-15 15:11:51,660 INFO L272 TraceCheckUtils]: 4: Hoare triple {16839#(< ~counter~0 94)} call #t~ret9 := main(); {16839#(< ~counter~0 94)} is VALID [2022-04-15 15:11:51,660 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {16839#(< ~counter~0 94)} {16426#true} #102#return; {16839#(< ~counter~0 94)} is VALID [2022-04-15 15:11:51,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {16839#(< ~counter~0 94)} assume true; {16839#(< ~counter~0 94)} is VALID [2022-04-15 15:11:51,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {16426#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; {16839#(< ~counter~0 94)} is VALID [2022-04-15 15:11:51,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {16426#true} call ULTIMATE.init(); {16426#true} is VALID [2022-04-15 15:11:51,661 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 20 proven. 16 refuted. 0 times theorem prover too weak. 64 trivial. 0 not checked. [2022-04-15 15:11:51,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:51,661 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1262060311] [2022-04-15 15:11:51,661 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:51,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844393712] [2022-04-15 15:11:51,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844393712] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:51,662 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:51,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 18 [2022-04-15 15:11:51,662 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:51,662 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [251447829] [2022-04-15 15:11:51,662 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [251447829] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:51,662 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:51,662 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-04-15 15:11:51,662 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1244377162] [2022-04-15 15:11:51,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:51,663 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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 75 [2022-04-15 15:11:51,663 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:51,663 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-15 15:11:51,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:51,711 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-04-15 15:11:51,711 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:51,712 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-04-15 15:11:51,712 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=181, Unknown=0, NotChecked=0, Total=306 [2022-04-15 15:11:51,712 INFO L87 Difference]: Start difference. First operand 144 states and 180 transitions. Second operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-15 15:11:52,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:52,224 INFO L93 Difference]: Finished difference Result 199 states and 258 transitions. [2022-04-15 15:11:52,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 15:11:52,224 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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 75 [2022-04-15 15:11:52,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:52,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-15 15:11:52,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 15:11:52,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-15 15:11:52,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 157 transitions. [2022-04-15 15:11:52,230 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 157 transitions. [2022-04-15 15:11:52,357 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:52,360 INFO L225 Difference]: With dead ends: 199 [2022-04-15 15:11:52,360 INFO L226 Difference]: Without dead ends: 150 [2022-04-15 15:11:52,360 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 154 GetRequests, 133 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=205, Invalid=301, Unknown=0, NotChecked=0, Total=506 [2022-04-15 15:11:52,361 INFO L913 BasicCegarLoop]: 48 mSDtfsCounter, 64 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 55 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 55 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:52,361 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 179 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [55 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:52,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-04-15 15:11:52,543 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2022-04-15 15:11:52,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:52,544 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 150 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:52,544 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 150 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:52,545 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 150 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:52,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:52,549 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2022-04-15 15:11:52,549 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2022-04-15 15:11:52,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:52,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:52,549 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 150 states. [2022-04-15 15:11:52,550 INFO L87 Difference]: Start difference. First operand has 150 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) Second operand 150 states. [2022-04-15 15:11:52,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:52,553 INFO L93 Difference]: Finished difference Result 150 states and 186 transitions. [2022-04-15 15:11:52,553 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2022-04-15 15:11:52,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:52,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:52,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:52,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:52,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 111 states have (on average 1.1891891891891893) internal successors, (132), 111 states have internal predecessors, (132), 28 states have call successors, (28), 12 states have call predecessors, (28), 10 states have return successors, (26), 26 states have call predecessors, (26), 26 states have call successors, (26) [2022-04-15 15:11:52,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 186 transitions. [2022-04-15 15:11:52,559 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 186 transitions. Word has length 75 [2022-04-15 15:11:52,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:52,559 INFO L478 AbstractCegarLoop]: Abstraction has 150 states and 186 transitions. [2022-04-15 15:11:52,559 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 5.2) internal successors, (52), 9 states have internal predecessors, (52), 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-15 15:11:52,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 150 states and 186 transitions. [2022-04-15 15:11:53,324 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:53,324 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 186 transitions. [2022-04-15 15:11:53,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-04-15 15:11:53,326 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:53,326 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 5, 5, 5, 5, 4, 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, 1, 1, 1] [2022-04-15 15:11:53,345 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-15 15:11:53,539 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-15 15:11:53,539 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:53,540 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 7 times [2022-04-15 15:11:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:53,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1244256424] [2022-04-15 15:11:53,540 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:53,540 INFO L85 PathProgramCache]: Analyzing trace with hash -1970775776, now seen corresponding path program 8 times [2022-04-15 15:11:53,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:53,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601350049] [2022-04-15 15:11:53,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:53,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:53,552 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:53,552 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1298216751] [2022-04-15 15:11:53,552 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:53,552 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:53,553 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:53,553 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-15 15:11:53,555 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-15 15:11:53,607 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:53,607 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:53,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 15:11:53,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:53,626 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:54,044 INFO L272 TraceCheckUtils]: 0: Hoare triple {17901#true} call ULTIMATE.init(); {17901#true} is VALID [2022-04-15 15:11:54,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {17901#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; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {17909#(<= ~counter~0 0)} assume true; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,045 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17909#(<= ~counter~0 0)} {17901#true} #102#return; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,046 INFO L272 TraceCheckUtils]: 4: Hoare triple {17909#(<= ~counter~0 0)} call #t~ret9 := main(); {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,046 INFO L290 TraceCheckUtils]: 5: Hoare triple {17909#(<= ~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; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,046 INFO L272 TraceCheckUtils]: 6: Hoare triple {17909#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,047 INFO L290 TraceCheckUtils]: 7: Hoare triple {17909#(<= ~counter~0 0)} ~cond := #in~cond; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,047 INFO L290 TraceCheckUtils]: 8: Hoare triple {17909#(<= ~counter~0 0)} assume !(0 == ~cond); {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,047 INFO L290 TraceCheckUtils]: 9: Hoare triple {17909#(<= ~counter~0 0)} assume true; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,048 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17909#(<= ~counter~0 0)} {17909#(<= ~counter~0 0)} #90#return; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,048 INFO L272 TraceCheckUtils]: 11: Hoare triple {17909#(<= ~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)); {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,048 INFO L290 TraceCheckUtils]: 12: Hoare triple {17909#(<= ~counter~0 0)} ~cond := #in~cond; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,048 INFO L290 TraceCheckUtils]: 13: Hoare triple {17909#(<= ~counter~0 0)} assume !(0 == ~cond); {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {17909#(<= ~counter~0 0)} assume true; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,049 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17909#(<= ~counter~0 0)} {17909#(<= ~counter~0 0)} #92#return; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,049 INFO L290 TraceCheckUtils]: 16: Hoare triple {17909#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {17909#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:54,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {17909#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {17958#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:54,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {17958#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {17958#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:54,051 INFO L272 TraceCheckUtils]: 19: Hoare triple {17958#(<= ~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)); {17958#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:54,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {17958#(<= ~counter~0 1)} ~cond := #in~cond; {17958#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:54,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {17958#(<= ~counter~0 1)} assume !(0 == ~cond); {17958#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:54,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {17958#(<= ~counter~0 1)} assume true; {17958#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:54,057 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17958#(<= ~counter~0 1)} {17958#(<= ~counter~0 1)} #94#return; {17958#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:54,057 INFO L290 TraceCheckUtils]: 24: Hoare triple {17958#(<= ~counter~0 1)} assume !!(0 != ~r~0); {17958#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:54,058 INFO L290 TraceCheckUtils]: 25: Hoare triple {17958#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {17983#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:54,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {17983#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {17983#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:54,059 INFO L272 TraceCheckUtils]: 27: Hoare triple {17983#(<= ~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)); {17983#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:54,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {17983#(<= ~counter~0 2)} ~cond := #in~cond; {17983#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:54,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {17983#(<= ~counter~0 2)} assume !(0 == ~cond); {17983#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:54,060 INFO L290 TraceCheckUtils]: 30: Hoare triple {17983#(<= ~counter~0 2)} assume true; {17983#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:54,060 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17983#(<= ~counter~0 2)} {17983#(<= ~counter~0 2)} #96#return; {17983#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:54,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {17983#(<= ~counter~0 2)} assume !(~r~0 > 0); {17983#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:54,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {17983#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18008#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:54,061 INFO L290 TraceCheckUtils]: 34: Hoare triple {18008#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {18008#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:54,062 INFO L272 TraceCheckUtils]: 35: Hoare triple {18008#(<= ~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)); {18008#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:54,062 INFO L290 TraceCheckUtils]: 36: Hoare triple {18008#(<= ~counter~0 3)} ~cond := #in~cond; {18008#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:54,062 INFO L290 TraceCheckUtils]: 37: Hoare triple {18008#(<= ~counter~0 3)} assume !(0 == ~cond); {18008#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:54,063 INFO L290 TraceCheckUtils]: 38: Hoare triple {18008#(<= ~counter~0 3)} assume true; {18008#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:54,063 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {18008#(<= ~counter~0 3)} {18008#(<= ~counter~0 3)} #98#return; {18008#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:54,063 INFO L290 TraceCheckUtils]: 40: Hoare triple {18008#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18008#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:54,064 INFO L290 TraceCheckUtils]: 41: Hoare triple {18008#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18033#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:54,064 INFO L290 TraceCheckUtils]: 42: Hoare triple {18033#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {18033#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:54,065 INFO L272 TraceCheckUtils]: 43: Hoare triple {18033#(<= ~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)); {18033#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:54,065 INFO L290 TraceCheckUtils]: 44: Hoare triple {18033#(<= ~counter~0 4)} ~cond := #in~cond; {18033#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:54,065 INFO L290 TraceCheckUtils]: 45: Hoare triple {18033#(<= ~counter~0 4)} assume !(0 == ~cond); {18033#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:54,065 INFO L290 TraceCheckUtils]: 46: Hoare triple {18033#(<= ~counter~0 4)} assume true; {18033#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:54,066 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {18033#(<= ~counter~0 4)} {18033#(<= ~counter~0 4)} #98#return; {18033#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:54,066 INFO L290 TraceCheckUtils]: 48: Hoare triple {18033#(<= ~counter~0 4)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18033#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:54,067 INFO L290 TraceCheckUtils]: 49: Hoare triple {18033#(<= ~counter~0 4)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18058#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:54,067 INFO L290 TraceCheckUtils]: 50: Hoare triple {18058#(<= ~counter~0 5)} assume !!(#t~post8 < 100);havoc #t~post8; {18058#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:54,068 INFO L272 TraceCheckUtils]: 51: Hoare triple {18058#(<= ~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)); {18058#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:54,068 INFO L290 TraceCheckUtils]: 52: Hoare triple {18058#(<= ~counter~0 5)} ~cond := #in~cond; {18058#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:54,068 INFO L290 TraceCheckUtils]: 53: Hoare triple {18058#(<= ~counter~0 5)} assume !(0 == ~cond); {18058#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:54,068 INFO L290 TraceCheckUtils]: 54: Hoare triple {18058#(<= ~counter~0 5)} assume true; {18058#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:54,069 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {18058#(<= ~counter~0 5)} {18058#(<= ~counter~0 5)} #98#return; {18058#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:54,069 INFO L290 TraceCheckUtils]: 56: Hoare triple {18058#(<= ~counter~0 5)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18058#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:54,070 INFO L290 TraceCheckUtils]: 57: Hoare triple {18058#(<= ~counter~0 5)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18083#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:54,070 INFO L290 TraceCheckUtils]: 58: Hoare triple {18083#(<= ~counter~0 6)} assume !!(#t~post8 < 100);havoc #t~post8; {18083#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:54,070 INFO L272 TraceCheckUtils]: 59: Hoare triple {18083#(<= ~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)); {18083#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:54,071 INFO L290 TraceCheckUtils]: 60: Hoare triple {18083#(<= ~counter~0 6)} ~cond := #in~cond; {18083#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:54,071 INFO L290 TraceCheckUtils]: 61: Hoare triple {18083#(<= ~counter~0 6)} assume !(0 == ~cond); {18083#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:54,071 INFO L290 TraceCheckUtils]: 62: Hoare triple {18083#(<= ~counter~0 6)} assume true; {18083#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:54,072 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {18083#(<= ~counter~0 6)} {18083#(<= ~counter~0 6)} #98#return; {18083#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:54,072 INFO L290 TraceCheckUtils]: 64: Hoare triple {18083#(<= ~counter~0 6)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18083#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:54,073 INFO L290 TraceCheckUtils]: 65: Hoare triple {18083#(<= ~counter~0 6)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18108#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:54,073 INFO L290 TraceCheckUtils]: 66: Hoare triple {18108#(<= ~counter~0 7)} assume !!(#t~post8 < 100);havoc #t~post8; {18108#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:54,073 INFO L272 TraceCheckUtils]: 67: Hoare triple {18108#(<= ~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)); {18108#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:54,074 INFO L290 TraceCheckUtils]: 68: Hoare triple {18108#(<= ~counter~0 7)} ~cond := #in~cond; {18108#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:54,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {18108#(<= ~counter~0 7)} assume !(0 == ~cond); {18108#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:54,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {18108#(<= ~counter~0 7)} assume true; {18108#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:54,075 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {18108#(<= ~counter~0 7)} {18108#(<= ~counter~0 7)} #98#return; {18108#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:54,075 INFO L290 TraceCheckUtils]: 72: Hoare triple {18108#(<= ~counter~0 7)} assume !(~r~0 < 0); {18108#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:54,075 INFO L290 TraceCheckUtils]: 73: Hoare triple {18108#(<= ~counter~0 7)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18133#(<= |main_#t~post6| 7)} is VALID [2022-04-15 15:11:54,076 INFO L290 TraceCheckUtils]: 74: Hoare triple {18133#(<= |main_#t~post6| 7)} assume !(#t~post6 < 100);havoc #t~post6; {17902#false} is VALID [2022-04-15 15:11:54,076 INFO L272 TraceCheckUtils]: 75: Hoare triple {17902#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)); {17902#false} is VALID [2022-04-15 15:11:54,076 INFO L290 TraceCheckUtils]: 76: Hoare triple {17902#false} ~cond := #in~cond; {17902#false} is VALID [2022-04-15 15:11:54,076 INFO L290 TraceCheckUtils]: 77: Hoare triple {17902#false} assume 0 == ~cond; {17902#false} is VALID [2022-04-15 15:11:54,076 INFO L290 TraceCheckUtils]: 78: Hoare triple {17902#false} assume !false; {17902#false} is VALID [2022-04-15 15:11:54,076 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 126 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:54,076 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:54,522 INFO L290 TraceCheckUtils]: 78: Hoare triple {17902#false} assume !false; {17902#false} is VALID [2022-04-15 15:11:54,522 INFO L290 TraceCheckUtils]: 77: Hoare triple {17902#false} assume 0 == ~cond; {17902#false} is VALID [2022-04-15 15:11:54,522 INFO L290 TraceCheckUtils]: 76: Hoare triple {17902#false} ~cond := #in~cond; {17902#false} is VALID [2022-04-15 15:11:54,523 INFO L272 TraceCheckUtils]: 75: Hoare triple {17902#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)); {17902#false} is VALID [2022-04-15 15:11:54,523 INFO L290 TraceCheckUtils]: 74: Hoare triple {18161#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {17902#false} is VALID [2022-04-15 15:11:54,523 INFO L290 TraceCheckUtils]: 73: Hoare triple {18165#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18161#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:11:54,523 INFO L290 TraceCheckUtils]: 72: Hoare triple {18165#(< ~counter~0 100)} assume !(~r~0 < 0); {18165#(< ~counter~0 100)} is VALID [2022-04-15 15:11:54,524 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {17901#true} {18165#(< ~counter~0 100)} #98#return; {18165#(< ~counter~0 100)} is VALID [2022-04-15 15:11:54,524 INFO L290 TraceCheckUtils]: 70: Hoare triple {17901#true} assume true; {17901#true} is VALID [2022-04-15 15:11:54,524 INFO L290 TraceCheckUtils]: 69: Hoare triple {17901#true} assume !(0 == ~cond); {17901#true} is VALID [2022-04-15 15:11:54,524 INFO L290 TraceCheckUtils]: 68: Hoare triple {17901#true} ~cond := #in~cond; {17901#true} is VALID [2022-04-15 15:11:54,524 INFO L272 TraceCheckUtils]: 67: Hoare triple {18165#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17901#true} is VALID [2022-04-15 15:11:54,525 INFO L290 TraceCheckUtils]: 66: Hoare triple {18165#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {18165#(< ~counter~0 100)} is VALID [2022-04-15 15:11:54,525 INFO L290 TraceCheckUtils]: 65: Hoare triple {18190#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18165#(< ~counter~0 100)} is VALID [2022-04-15 15:11:54,526 INFO L290 TraceCheckUtils]: 64: Hoare triple {18190#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18190#(< ~counter~0 99)} is VALID [2022-04-15 15:11:54,526 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {17901#true} {18190#(< ~counter~0 99)} #98#return; {18190#(< ~counter~0 99)} is VALID [2022-04-15 15:11:54,526 INFO L290 TraceCheckUtils]: 62: Hoare triple {17901#true} assume true; {17901#true} is VALID [2022-04-15 15:11:54,526 INFO L290 TraceCheckUtils]: 61: Hoare triple {17901#true} assume !(0 == ~cond); {17901#true} is VALID [2022-04-15 15:11:54,526 INFO L290 TraceCheckUtils]: 60: Hoare triple {17901#true} ~cond := #in~cond; {17901#true} is VALID [2022-04-15 15:11:54,526 INFO L272 TraceCheckUtils]: 59: Hoare triple {18190#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17901#true} is VALID [2022-04-15 15:11:54,527 INFO L290 TraceCheckUtils]: 58: Hoare triple {18190#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {18190#(< ~counter~0 99)} is VALID [2022-04-15 15:11:54,527 INFO L290 TraceCheckUtils]: 57: Hoare triple {18215#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18190#(< ~counter~0 99)} is VALID [2022-04-15 15:11:54,527 INFO L290 TraceCheckUtils]: 56: Hoare triple {18215#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18215#(< ~counter~0 98)} is VALID [2022-04-15 15:11:54,528 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {17901#true} {18215#(< ~counter~0 98)} #98#return; {18215#(< ~counter~0 98)} is VALID [2022-04-15 15:11:54,528 INFO L290 TraceCheckUtils]: 54: Hoare triple {17901#true} assume true; {17901#true} is VALID [2022-04-15 15:11:54,528 INFO L290 TraceCheckUtils]: 53: Hoare triple {17901#true} assume !(0 == ~cond); {17901#true} is VALID [2022-04-15 15:11:54,528 INFO L290 TraceCheckUtils]: 52: Hoare triple {17901#true} ~cond := #in~cond; {17901#true} is VALID [2022-04-15 15:11:54,528 INFO L272 TraceCheckUtils]: 51: Hoare triple {18215#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17901#true} is VALID [2022-04-15 15:11:54,528 INFO L290 TraceCheckUtils]: 50: Hoare triple {18215#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {18215#(< ~counter~0 98)} is VALID [2022-04-15 15:11:54,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {18240#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18215#(< ~counter~0 98)} is VALID [2022-04-15 15:11:54,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {18240#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18240#(< ~counter~0 97)} is VALID [2022-04-15 15:11:54,543 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {17901#true} {18240#(< ~counter~0 97)} #98#return; {18240#(< ~counter~0 97)} is VALID [2022-04-15 15:11:54,543 INFO L290 TraceCheckUtils]: 46: Hoare triple {17901#true} assume true; {17901#true} is VALID [2022-04-15 15:11:54,543 INFO L290 TraceCheckUtils]: 45: Hoare triple {17901#true} assume !(0 == ~cond); {17901#true} is VALID [2022-04-15 15:11:54,543 INFO L290 TraceCheckUtils]: 44: Hoare triple {17901#true} ~cond := #in~cond; {17901#true} is VALID [2022-04-15 15:11:54,544 INFO L272 TraceCheckUtils]: 43: Hoare triple {18240#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17901#true} is VALID [2022-04-15 15:11:54,544 INFO L290 TraceCheckUtils]: 42: Hoare triple {18240#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {18240#(< ~counter~0 97)} is VALID [2022-04-15 15:11:54,545 INFO L290 TraceCheckUtils]: 41: Hoare triple {18265#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18240#(< ~counter~0 97)} is VALID [2022-04-15 15:11:54,545 INFO L290 TraceCheckUtils]: 40: Hoare triple {18265#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {18265#(< ~counter~0 96)} is VALID [2022-04-15 15:11:54,546 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {17901#true} {18265#(< ~counter~0 96)} #98#return; {18265#(< ~counter~0 96)} is VALID [2022-04-15 15:11:54,546 INFO L290 TraceCheckUtils]: 38: Hoare triple {17901#true} assume true; {17901#true} is VALID [2022-04-15 15:11:54,546 INFO L290 TraceCheckUtils]: 37: Hoare triple {17901#true} assume !(0 == ~cond); {17901#true} is VALID [2022-04-15 15:11:54,546 INFO L290 TraceCheckUtils]: 36: Hoare triple {17901#true} ~cond := #in~cond; {17901#true} is VALID [2022-04-15 15:11:54,546 INFO L272 TraceCheckUtils]: 35: Hoare triple {18265#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17901#true} is VALID [2022-04-15 15:11:54,547 INFO L290 TraceCheckUtils]: 34: Hoare triple {18265#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {18265#(< ~counter~0 96)} is VALID [2022-04-15 15:11:54,547 INFO L290 TraceCheckUtils]: 33: Hoare triple {18290#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {18265#(< ~counter~0 96)} is VALID [2022-04-15 15:11:54,547 INFO L290 TraceCheckUtils]: 32: Hoare triple {18290#(< ~counter~0 95)} assume !(~r~0 > 0); {18290#(< ~counter~0 95)} is VALID [2022-04-15 15:11:54,548 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {17901#true} {18290#(< ~counter~0 95)} #96#return; {18290#(< ~counter~0 95)} is VALID [2022-04-15 15:11:54,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {17901#true} assume true; {17901#true} is VALID [2022-04-15 15:11:54,548 INFO L290 TraceCheckUtils]: 29: Hoare triple {17901#true} assume !(0 == ~cond); {17901#true} is VALID [2022-04-15 15:11:54,548 INFO L290 TraceCheckUtils]: 28: Hoare triple {17901#true} ~cond := #in~cond; {17901#true} is VALID [2022-04-15 15:11:54,549 INFO L272 TraceCheckUtils]: 27: Hoare triple {18290#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17901#true} is VALID [2022-04-15 15:11:54,549 INFO L290 TraceCheckUtils]: 26: Hoare triple {18290#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {18290#(< ~counter~0 95)} is VALID [2022-04-15 15:11:54,549 INFO L290 TraceCheckUtils]: 25: Hoare triple {18315#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {18290#(< ~counter~0 95)} is VALID [2022-04-15 15:11:54,550 INFO L290 TraceCheckUtils]: 24: Hoare triple {18315#(< ~counter~0 94)} assume !!(0 != ~r~0); {18315#(< ~counter~0 94)} is VALID [2022-04-15 15:11:54,550 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {17901#true} {18315#(< ~counter~0 94)} #94#return; {18315#(< ~counter~0 94)} is VALID [2022-04-15 15:11:54,550 INFO L290 TraceCheckUtils]: 22: Hoare triple {17901#true} assume true; {17901#true} is VALID [2022-04-15 15:11:54,551 INFO L290 TraceCheckUtils]: 21: Hoare triple {17901#true} assume !(0 == ~cond); {17901#true} is VALID [2022-04-15 15:11:54,551 INFO L290 TraceCheckUtils]: 20: Hoare triple {17901#true} ~cond := #in~cond; {17901#true} is VALID [2022-04-15 15:11:54,551 INFO L272 TraceCheckUtils]: 19: Hoare triple {18315#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {17901#true} is VALID [2022-04-15 15:11:54,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {18315#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {18315#(< ~counter~0 94)} is VALID [2022-04-15 15:11:54,552 INFO L290 TraceCheckUtils]: 17: Hoare triple {18340#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {18315#(< ~counter~0 94)} is VALID [2022-04-15 15:11:54,552 INFO L290 TraceCheckUtils]: 16: Hoare triple {18340#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {18340#(< ~counter~0 93)} is VALID [2022-04-15 15:11:54,553 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {17901#true} {18340#(< ~counter~0 93)} #92#return; {18340#(< ~counter~0 93)} is VALID [2022-04-15 15:11:54,553 INFO L290 TraceCheckUtils]: 14: Hoare triple {17901#true} assume true; {17901#true} is VALID [2022-04-15 15:11:54,553 INFO L290 TraceCheckUtils]: 13: Hoare triple {17901#true} assume !(0 == ~cond); {17901#true} is VALID [2022-04-15 15:11:54,553 INFO L290 TraceCheckUtils]: 12: Hoare triple {17901#true} ~cond := #in~cond; {17901#true} is VALID [2022-04-15 15:11:54,553 INFO L272 TraceCheckUtils]: 11: Hoare triple {18340#(< ~counter~0 93)} 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)); {17901#true} is VALID [2022-04-15 15:11:54,553 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17901#true} {18340#(< ~counter~0 93)} #90#return; {18340#(< ~counter~0 93)} is VALID [2022-04-15 15:11:54,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {17901#true} assume true; {17901#true} is VALID [2022-04-15 15:11:54,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {17901#true} assume !(0 == ~cond); {17901#true} is VALID [2022-04-15 15:11:54,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {17901#true} ~cond := #in~cond; {17901#true} is VALID [2022-04-15 15:11:54,554 INFO L272 TraceCheckUtils]: 6: Hoare triple {18340#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {17901#true} is VALID [2022-04-15 15:11:54,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {18340#(< ~counter~0 93)} 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; {18340#(< ~counter~0 93)} is VALID [2022-04-15 15:11:54,555 INFO L272 TraceCheckUtils]: 4: Hoare triple {18340#(< ~counter~0 93)} call #t~ret9 := main(); {18340#(< ~counter~0 93)} is VALID [2022-04-15 15:11:54,555 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {18340#(< ~counter~0 93)} {17901#true} #102#return; {18340#(< ~counter~0 93)} is VALID [2022-04-15 15:11:54,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {18340#(< ~counter~0 93)} assume true; {18340#(< ~counter~0 93)} is VALID [2022-04-15 15:11:54,556 INFO L290 TraceCheckUtils]: 1: Hoare triple {17901#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; {18340#(< ~counter~0 93)} is VALID [2022-04-15 15:11:54,556 INFO L272 TraceCheckUtils]: 0: Hoare triple {17901#true} call ULTIMATE.init(); {17901#true} is VALID [2022-04-15 15:11:54,556 INFO L134 CoverageAnalysis]: Checked inductivity of 144 backedges. 14 proven. 42 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 15:11:54,557 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:54,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601350049] [2022-04-15 15:11:54,557 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:54,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1298216751] [2022-04-15 15:11:54,557 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1298216751] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:54,557 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:54,557 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 15:11:54,557 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:54,557 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1244256424] [2022-04-15 15:11:54,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1244256424] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:54,558 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:54,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:11:54,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223174135] [2022-04-15 15:11:54,558 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:54,558 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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 79 [2022-04-15 15:11:54,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:54,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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-15 15:11:54,622 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:54,622 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:11:54,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:54,623 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:11:54,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:11:54,623 INFO L87 Difference]: Start difference. First operand 150 states and 186 transitions. Second operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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-15 15:11:55,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:55,177 INFO L93 Difference]: Finished difference Result 172 states and 213 transitions. [2022-04-15 15:11:55,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-04-15 15:11:55,177 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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 79 [2022-04-15 15:11:55,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:55,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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-15 15:11:55,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 15:11:55,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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-15 15:11:55,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 155 transitions. [2022-04-15 15:11:55,183 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 15 states and 155 transitions. [2022-04-15 15:11:55,325 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-15 15:11:55,327 INFO L225 Difference]: With dead ends: 172 [2022-04-15 15:11:55,328 INFO L226 Difference]: Without dead ends: 167 [2022-04-15 15:11:55,328 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 161 GetRequests, 139 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=225, Invalid=327, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:11:55,328 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 71 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:55,329 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 217 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:55,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2022-04-15 15:11:55,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 161. [2022-04-15 15:11:55,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:11:55,527 INFO L82 GeneralOperation]: Start isEquivalent. First operand 167 states. Second operand has 161 states, 117 states have (on average 1.188034188034188) internal successors, (139), 120 states have internal predecessors, (139), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:11:55,528 INFO L74 IsIncluded]: Start isIncluded. First operand 167 states. Second operand has 161 states, 117 states have (on average 1.188034188034188) internal successors, (139), 120 states have internal predecessors, (139), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:11:55,528 INFO L87 Difference]: Start difference. First operand 167 states. Second operand has 161 states, 117 states have (on average 1.188034188034188) internal successors, (139), 120 states have internal predecessors, (139), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:11:55,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:55,532 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2022-04-15 15:11:55,533 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2022-04-15 15:11:55,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:55,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:55,533 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 117 states have (on average 1.188034188034188) internal successors, (139), 120 states have internal predecessors, (139), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 167 states. [2022-04-15 15:11:55,534 INFO L87 Difference]: Start difference. First operand has 161 states, 117 states have (on average 1.188034188034188) internal successors, (139), 120 states have internal predecessors, (139), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) Second operand 167 states. [2022-04-15 15:11:55,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:55,538 INFO L93 Difference]: Finished difference Result 167 states and 208 transitions. [2022-04-15 15:11:55,538 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 208 transitions. [2022-04-15 15:11:55,538 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:11:55,538 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:11:55,538 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:11:55,538 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:11:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 117 states have (on average 1.188034188034188) internal successors, (139), 120 states have internal predecessors, (139), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 27 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:11:55,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 201 transitions. [2022-04-15 15:11:55,543 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 201 transitions. Word has length 79 [2022-04-15 15:11:55,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:11:55,544 INFO L478 AbstractCegarLoop]: Abstraction has 161 states and 201 transitions. [2022-04-15 15:11:55,544 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 4.909090909090909) internal successors, (54), 10 states have internal predecessors, (54), 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-15 15:11:55,544 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 161 states and 201 transitions. [2022-04-15 15:11:57,774 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 200 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:57,774 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 201 transitions. [2022-04-15 15:11:57,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2022-04-15 15:11:57,775 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:11:57,775 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:11:57,793 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2022-04-15 15:11:57,983 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-15 15:11:57,984 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:11:57,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:11:57,984 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 1 times [2022-04-15 15:11:57,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:57,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1322961452] [2022-04-15 15:11:57,985 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:11:57,985 INFO L85 PathProgramCache]: Analyzing trace with hash 1693648491, now seen corresponding path program 2 times [2022-04-15 15:11:57,985 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:11:57,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924258614] [2022-04-15 15:11:57,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:11:57,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:11:58,007 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:11:58,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2118556047] [2022-04-15 15:11:58,008 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:11:58,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:11:58,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:11:58,009 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-15 15:11:58,010 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-15 15:11:58,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:11:58,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:11:58,067 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 15:11:58,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:11:58,084 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:11:58,473 INFO L272 TraceCheckUtils]: 0: Hoare triple {19402#true} call ULTIMATE.init(); {19402#true} is VALID [2022-04-15 15:11:58,473 INFO L290 TraceCheckUtils]: 1: Hoare triple {19402#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; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,474 INFO L290 TraceCheckUtils]: 2: Hoare triple {19410#(<= ~counter~0 0)} assume true; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,474 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19410#(<= ~counter~0 0)} {19402#true} #102#return; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,474 INFO L272 TraceCheckUtils]: 4: Hoare triple {19410#(<= ~counter~0 0)} call #t~ret9 := main(); {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {19410#(<= ~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; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {19410#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {19410#(<= ~counter~0 0)} ~cond := #in~cond; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {19410#(<= ~counter~0 0)} assume !(0 == ~cond); {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {19410#(<= ~counter~0 0)} assume true; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19410#(<= ~counter~0 0)} {19410#(<= ~counter~0 0)} #90#return; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,477 INFO L272 TraceCheckUtils]: 11: Hoare triple {19410#(<= ~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)); {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,477 INFO L290 TraceCheckUtils]: 12: Hoare triple {19410#(<= ~counter~0 0)} ~cond := #in~cond; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,477 INFO L290 TraceCheckUtils]: 13: Hoare triple {19410#(<= ~counter~0 0)} assume !(0 == ~cond); {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,477 INFO L290 TraceCheckUtils]: 14: Hoare triple {19410#(<= ~counter~0 0)} assume true; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,478 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19410#(<= ~counter~0 0)} {19410#(<= ~counter~0 0)} #92#return; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {19410#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19410#(<= ~counter~0 0)} is VALID [2022-04-15 15:11:58,479 INFO L290 TraceCheckUtils]: 17: Hoare triple {19410#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19459#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:58,479 INFO L290 TraceCheckUtils]: 18: Hoare triple {19459#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {19459#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:58,480 INFO L272 TraceCheckUtils]: 19: Hoare triple {19459#(<= ~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)); {19459#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:58,480 INFO L290 TraceCheckUtils]: 20: Hoare triple {19459#(<= ~counter~0 1)} ~cond := #in~cond; {19459#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:58,480 INFO L290 TraceCheckUtils]: 21: Hoare triple {19459#(<= ~counter~0 1)} assume !(0 == ~cond); {19459#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:58,481 INFO L290 TraceCheckUtils]: 22: Hoare triple {19459#(<= ~counter~0 1)} assume true; {19459#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:58,481 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19459#(<= ~counter~0 1)} {19459#(<= ~counter~0 1)} #94#return; {19459#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:58,481 INFO L290 TraceCheckUtils]: 24: Hoare triple {19459#(<= ~counter~0 1)} assume !!(0 != ~r~0); {19459#(<= ~counter~0 1)} is VALID [2022-04-15 15:11:58,482 INFO L290 TraceCheckUtils]: 25: Hoare triple {19459#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19484#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:58,483 INFO L290 TraceCheckUtils]: 26: Hoare triple {19484#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {19484#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:58,483 INFO L272 TraceCheckUtils]: 27: Hoare triple {19484#(<= ~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)); {19484#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:58,483 INFO L290 TraceCheckUtils]: 28: Hoare triple {19484#(<= ~counter~0 2)} ~cond := #in~cond; {19484#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:58,484 INFO L290 TraceCheckUtils]: 29: Hoare triple {19484#(<= ~counter~0 2)} assume !(0 == ~cond); {19484#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:58,484 INFO L290 TraceCheckUtils]: 30: Hoare triple {19484#(<= ~counter~0 2)} assume true; {19484#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:58,485 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19484#(<= ~counter~0 2)} {19484#(<= ~counter~0 2)} #96#return; {19484#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:58,485 INFO L290 TraceCheckUtils]: 32: Hoare triple {19484#(<= ~counter~0 2)} assume !(~r~0 > 0); {19484#(<= ~counter~0 2)} is VALID [2022-04-15 15:11:58,486 INFO L290 TraceCheckUtils]: 33: Hoare triple {19484#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19509#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:58,486 INFO L290 TraceCheckUtils]: 34: Hoare triple {19509#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {19509#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:58,487 INFO L272 TraceCheckUtils]: 35: Hoare triple {19509#(<= ~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)); {19509#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:58,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {19509#(<= ~counter~0 3)} ~cond := #in~cond; {19509#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:58,487 INFO L290 TraceCheckUtils]: 37: Hoare triple {19509#(<= ~counter~0 3)} assume !(0 == ~cond); {19509#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:58,488 INFO L290 TraceCheckUtils]: 38: Hoare triple {19509#(<= ~counter~0 3)} assume true; {19509#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:58,488 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19509#(<= ~counter~0 3)} {19509#(<= ~counter~0 3)} #98#return; {19509#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:58,489 INFO L290 TraceCheckUtils]: 40: Hoare triple {19509#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19509#(<= ~counter~0 3)} is VALID [2022-04-15 15:11:58,489 INFO L290 TraceCheckUtils]: 41: Hoare triple {19509#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19534#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:58,490 INFO L290 TraceCheckUtils]: 42: Hoare triple {19534#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {19534#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:58,490 INFO L272 TraceCheckUtils]: 43: Hoare triple {19534#(<= ~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)); {19534#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:58,491 INFO L290 TraceCheckUtils]: 44: Hoare triple {19534#(<= ~counter~0 4)} ~cond := #in~cond; {19534#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:58,491 INFO L290 TraceCheckUtils]: 45: Hoare triple {19534#(<= ~counter~0 4)} assume !(0 == ~cond); {19534#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:58,491 INFO L290 TraceCheckUtils]: 46: Hoare triple {19534#(<= ~counter~0 4)} assume true; {19534#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:58,492 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {19534#(<= ~counter~0 4)} {19534#(<= ~counter~0 4)} #98#return; {19534#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:58,492 INFO L290 TraceCheckUtils]: 48: Hoare triple {19534#(<= ~counter~0 4)} assume !(~r~0 < 0); {19534#(<= ~counter~0 4)} is VALID [2022-04-15 15:11:58,493 INFO L290 TraceCheckUtils]: 49: Hoare triple {19534#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19559#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:58,493 INFO L290 TraceCheckUtils]: 50: Hoare triple {19559#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {19559#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:58,493 INFO L272 TraceCheckUtils]: 51: Hoare triple {19559#(<= ~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)); {19559#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:58,494 INFO L290 TraceCheckUtils]: 52: Hoare triple {19559#(<= ~counter~0 5)} ~cond := #in~cond; {19559#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:58,494 INFO L290 TraceCheckUtils]: 53: Hoare triple {19559#(<= ~counter~0 5)} assume !(0 == ~cond); {19559#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:58,494 INFO L290 TraceCheckUtils]: 54: Hoare triple {19559#(<= ~counter~0 5)} assume true; {19559#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:58,495 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19559#(<= ~counter~0 5)} {19559#(<= ~counter~0 5)} #94#return; {19559#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:58,495 INFO L290 TraceCheckUtils]: 56: Hoare triple {19559#(<= ~counter~0 5)} assume !!(0 != ~r~0); {19559#(<= ~counter~0 5)} is VALID [2022-04-15 15:11:58,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {19559#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19584#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:58,496 INFO L290 TraceCheckUtils]: 58: Hoare triple {19584#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {19584#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:58,496 INFO L272 TraceCheckUtils]: 59: Hoare triple {19584#(<= ~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)); {19584#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:58,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {19584#(<= ~counter~0 6)} ~cond := #in~cond; {19584#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:58,497 INFO L290 TraceCheckUtils]: 61: Hoare triple {19584#(<= ~counter~0 6)} assume !(0 == ~cond); {19584#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:58,497 INFO L290 TraceCheckUtils]: 62: Hoare triple {19584#(<= ~counter~0 6)} assume true; {19584#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:58,498 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19584#(<= ~counter~0 6)} {19584#(<= ~counter~0 6)} #96#return; {19584#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:58,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {19584#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19584#(<= ~counter~0 6)} is VALID [2022-04-15 15:11:58,498 INFO L290 TraceCheckUtils]: 65: Hoare triple {19584#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19609#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:58,499 INFO L290 TraceCheckUtils]: 66: Hoare triple {19609#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {19609#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:58,499 INFO L272 TraceCheckUtils]: 67: Hoare triple {19609#(<= ~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)); {19609#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:58,499 INFO L290 TraceCheckUtils]: 68: Hoare triple {19609#(<= ~counter~0 7)} ~cond := #in~cond; {19609#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:58,500 INFO L290 TraceCheckUtils]: 69: Hoare triple {19609#(<= ~counter~0 7)} assume !(0 == ~cond); {19609#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:58,500 INFO L290 TraceCheckUtils]: 70: Hoare triple {19609#(<= ~counter~0 7)} assume true; {19609#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:58,500 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19609#(<= ~counter~0 7)} {19609#(<= ~counter~0 7)} #96#return; {19609#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:58,501 INFO L290 TraceCheckUtils]: 72: Hoare triple {19609#(<= ~counter~0 7)} assume !(~r~0 > 0); {19609#(<= ~counter~0 7)} is VALID [2022-04-15 15:11:58,501 INFO L290 TraceCheckUtils]: 73: Hoare triple {19609#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19634#(<= |main_#t~post8| 7)} is VALID [2022-04-15 15:11:58,501 INFO L290 TraceCheckUtils]: 74: Hoare triple {19634#(<= |main_#t~post8| 7)} assume !(#t~post8 < 100);havoc #t~post8; {19403#false} is VALID [2022-04-15 15:11:58,501 INFO L290 TraceCheckUtils]: 75: Hoare triple {19403#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19403#false} is VALID [2022-04-15 15:11:58,502 INFO L290 TraceCheckUtils]: 76: Hoare triple {19403#false} assume !(#t~post6 < 100);havoc #t~post6; {19403#false} is VALID [2022-04-15 15:11:58,502 INFO L272 TraceCheckUtils]: 77: Hoare triple {19403#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)); {19403#false} is VALID [2022-04-15 15:11:58,502 INFO L290 TraceCheckUtils]: 78: Hoare triple {19403#false} ~cond := #in~cond; {19403#false} is VALID [2022-04-15 15:11:58,502 INFO L290 TraceCheckUtils]: 79: Hoare triple {19403#false} assume 0 == ~cond; {19403#false} is VALID [2022-04-15 15:11:58,502 INFO L290 TraceCheckUtils]: 80: Hoare triple {19403#false} assume !false; {19403#false} is VALID [2022-04-15 15:11:58,502 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 108 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:11:58,502 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:11:58,940 INFO L290 TraceCheckUtils]: 80: Hoare triple {19403#false} assume !false; {19403#false} is VALID [2022-04-15 15:11:58,940 INFO L290 TraceCheckUtils]: 79: Hoare triple {19403#false} assume 0 == ~cond; {19403#false} is VALID [2022-04-15 15:11:58,940 INFO L290 TraceCheckUtils]: 78: Hoare triple {19403#false} ~cond := #in~cond; {19403#false} is VALID [2022-04-15 15:11:58,940 INFO L272 TraceCheckUtils]: 77: Hoare triple {19403#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)); {19403#false} is VALID [2022-04-15 15:11:58,940 INFO L290 TraceCheckUtils]: 76: Hoare triple {19403#false} assume !(#t~post6 < 100);havoc #t~post6; {19403#false} is VALID [2022-04-15 15:11:58,940 INFO L290 TraceCheckUtils]: 75: Hoare triple {19403#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19403#false} is VALID [2022-04-15 15:11:58,940 INFO L290 TraceCheckUtils]: 74: Hoare triple {19674#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {19403#false} is VALID [2022-04-15 15:11:58,941 INFO L290 TraceCheckUtils]: 73: Hoare triple {19678#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19674#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:11:58,941 INFO L290 TraceCheckUtils]: 72: Hoare triple {19678#(< ~counter~0 100)} assume !(~r~0 > 0); {19678#(< ~counter~0 100)} is VALID [2022-04-15 15:11:58,942 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {19402#true} {19678#(< ~counter~0 100)} #96#return; {19678#(< ~counter~0 100)} is VALID [2022-04-15 15:11:58,942 INFO L290 TraceCheckUtils]: 70: Hoare triple {19402#true} assume true; {19402#true} is VALID [2022-04-15 15:11:58,942 INFO L290 TraceCheckUtils]: 69: Hoare triple {19402#true} assume !(0 == ~cond); {19402#true} is VALID [2022-04-15 15:11:58,942 INFO L290 TraceCheckUtils]: 68: Hoare triple {19402#true} ~cond := #in~cond; {19402#true} is VALID [2022-04-15 15:11:58,942 INFO L272 TraceCheckUtils]: 67: Hoare triple {19678#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19402#true} is VALID [2022-04-15 15:11:58,942 INFO L290 TraceCheckUtils]: 66: Hoare triple {19678#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {19678#(< ~counter~0 100)} is VALID [2022-04-15 15:11:58,943 INFO L290 TraceCheckUtils]: 65: Hoare triple {19703#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19678#(< ~counter~0 100)} is VALID [2022-04-15 15:11:58,943 INFO L290 TraceCheckUtils]: 64: Hoare triple {19703#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {19703#(< ~counter~0 99)} is VALID [2022-04-15 15:11:58,944 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {19402#true} {19703#(< ~counter~0 99)} #96#return; {19703#(< ~counter~0 99)} is VALID [2022-04-15 15:11:58,944 INFO L290 TraceCheckUtils]: 62: Hoare triple {19402#true} assume true; {19402#true} is VALID [2022-04-15 15:11:58,944 INFO L290 TraceCheckUtils]: 61: Hoare triple {19402#true} assume !(0 == ~cond); {19402#true} is VALID [2022-04-15 15:11:58,944 INFO L290 TraceCheckUtils]: 60: Hoare triple {19402#true} ~cond := #in~cond; {19402#true} is VALID [2022-04-15 15:11:58,944 INFO L272 TraceCheckUtils]: 59: Hoare triple {19703#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19402#true} is VALID [2022-04-15 15:11:58,944 INFO L290 TraceCheckUtils]: 58: Hoare triple {19703#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {19703#(< ~counter~0 99)} is VALID [2022-04-15 15:11:58,945 INFO L290 TraceCheckUtils]: 57: Hoare triple {19728#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19703#(< ~counter~0 99)} is VALID [2022-04-15 15:11:58,945 INFO L290 TraceCheckUtils]: 56: Hoare triple {19728#(< ~counter~0 98)} assume !!(0 != ~r~0); {19728#(< ~counter~0 98)} is VALID [2022-04-15 15:11:58,946 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {19402#true} {19728#(< ~counter~0 98)} #94#return; {19728#(< ~counter~0 98)} is VALID [2022-04-15 15:11:58,946 INFO L290 TraceCheckUtils]: 54: Hoare triple {19402#true} assume true; {19402#true} is VALID [2022-04-15 15:11:58,946 INFO L290 TraceCheckUtils]: 53: Hoare triple {19402#true} assume !(0 == ~cond); {19402#true} is VALID [2022-04-15 15:11:58,946 INFO L290 TraceCheckUtils]: 52: Hoare triple {19402#true} ~cond := #in~cond; {19402#true} is VALID [2022-04-15 15:11:58,946 INFO L272 TraceCheckUtils]: 51: Hoare triple {19728#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19402#true} is VALID [2022-04-15 15:11:58,946 INFO L290 TraceCheckUtils]: 50: Hoare triple {19728#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {19728#(< ~counter~0 98)} is VALID [2022-04-15 15:11:58,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {19753#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19728#(< ~counter~0 98)} is VALID [2022-04-15 15:11:58,947 INFO L290 TraceCheckUtils]: 48: Hoare triple {19753#(< ~counter~0 97)} assume !(~r~0 < 0); {19753#(< ~counter~0 97)} is VALID [2022-04-15 15:11:58,948 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {19402#true} {19753#(< ~counter~0 97)} #98#return; {19753#(< ~counter~0 97)} is VALID [2022-04-15 15:11:58,948 INFO L290 TraceCheckUtils]: 46: Hoare triple {19402#true} assume true; {19402#true} is VALID [2022-04-15 15:11:58,948 INFO L290 TraceCheckUtils]: 45: Hoare triple {19402#true} assume !(0 == ~cond); {19402#true} is VALID [2022-04-15 15:11:58,948 INFO L290 TraceCheckUtils]: 44: Hoare triple {19402#true} ~cond := #in~cond; {19402#true} is VALID [2022-04-15 15:11:58,948 INFO L272 TraceCheckUtils]: 43: Hoare triple {19753#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19402#true} is VALID [2022-04-15 15:11:58,948 INFO L290 TraceCheckUtils]: 42: Hoare triple {19753#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {19753#(< ~counter~0 97)} is VALID [2022-04-15 15:11:58,949 INFO L290 TraceCheckUtils]: 41: Hoare triple {19778#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19753#(< ~counter~0 97)} is VALID [2022-04-15 15:11:58,949 INFO L290 TraceCheckUtils]: 40: Hoare triple {19778#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {19778#(< ~counter~0 96)} is VALID [2022-04-15 15:11:58,950 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {19402#true} {19778#(< ~counter~0 96)} #98#return; {19778#(< ~counter~0 96)} is VALID [2022-04-15 15:11:58,950 INFO L290 TraceCheckUtils]: 38: Hoare triple {19402#true} assume true; {19402#true} is VALID [2022-04-15 15:11:58,950 INFO L290 TraceCheckUtils]: 37: Hoare triple {19402#true} assume !(0 == ~cond); {19402#true} is VALID [2022-04-15 15:11:58,950 INFO L290 TraceCheckUtils]: 36: Hoare triple {19402#true} ~cond := #in~cond; {19402#true} is VALID [2022-04-15 15:11:58,950 INFO L272 TraceCheckUtils]: 35: Hoare triple {19778#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19402#true} is VALID [2022-04-15 15:11:58,950 INFO L290 TraceCheckUtils]: 34: Hoare triple {19778#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {19778#(< ~counter~0 96)} is VALID [2022-04-15 15:11:58,951 INFO L290 TraceCheckUtils]: 33: Hoare triple {19803#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {19778#(< ~counter~0 96)} is VALID [2022-04-15 15:11:58,951 INFO L290 TraceCheckUtils]: 32: Hoare triple {19803#(< ~counter~0 95)} assume !(~r~0 > 0); {19803#(< ~counter~0 95)} is VALID [2022-04-15 15:11:58,951 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {19402#true} {19803#(< ~counter~0 95)} #96#return; {19803#(< ~counter~0 95)} is VALID [2022-04-15 15:11:58,951 INFO L290 TraceCheckUtils]: 30: Hoare triple {19402#true} assume true; {19402#true} is VALID [2022-04-15 15:11:58,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {19402#true} assume !(0 == ~cond); {19402#true} is VALID [2022-04-15 15:11:58,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {19402#true} ~cond := #in~cond; {19402#true} is VALID [2022-04-15 15:11:58,952 INFO L272 TraceCheckUtils]: 27: Hoare triple {19803#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19402#true} is VALID [2022-04-15 15:11:58,952 INFO L290 TraceCheckUtils]: 26: Hoare triple {19803#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {19803#(< ~counter~0 95)} is VALID [2022-04-15 15:11:58,952 INFO L290 TraceCheckUtils]: 25: Hoare triple {19828#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {19803#(< ~counter~0 95)} is VALID [2022-04-15 15:11:58,953 INFO L290 TraceCheckUtils]: 24: Hoare triple {19828#(< ~counter~0 94)} assume !!(0 != ~r~0); {19828#(< ~counter~0 94)} is VALID [2022-04-15 15:11:58,953 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {19402#true} {19828#(< ~counter~0 94)} #94#return; {19828#(< ~counter~0 94)} is VALID [2022-04-15 15:11:58,953 INFO L290 TraceCheckUtils]: 22: Hoare triple {19402#true} assume true; {19402#true} is VALID [2022-04-15 15:11:58,953 INFO L290 TraceCheckUtils]: 21: Hoare triple {19402#true} assume !(0 == ~cond); {19402#true} is VALID [2022-04-15 15:11:58,953 INFO L290 TraceCheckUtils]: 20: Hoare triple {19402#true} ~cond := #in~cond; {19402#true} is VALID [2022-04-15 15:11:58,953 INFO L272 TraceCheckUtils]: 19: Hoare triple {19828#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {19402#true} is VALID [2022-04-15 15:11:58,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {19828#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {19828#(< ~counter~0 94)} is VALID [2022-04-15 15:11:58,954 INFO L290 TraceCheckUtils]: 17: Hoare triple {19853#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {19828#(< ~counter~0 94)} is VALID [2022-04-15 15:11:58,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {19853#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {19853#(< ~counter~0 93)} is VALID [2022-04-15 15:11:58,955 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {19402#true} {19853#(< ~counter~0 93)} #92#return; {19853#(< ~counter~0 93)} is VALID [2022-04-15 15:11:58,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {19402#true} assume true; {19402#true} is VALID [2022-04-15 15:11:58,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {19402#true} assume !(0 == ~cond); {19402#true} is VALID [2022-04-15 15:11:58,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {19402#true} ~cond := #in~cond; {19402#true} is VALID [2022-04-15 15:11:58,955 INFO L272 TraceCheckUtils]: 11: Hoare triple {19853#(< ~counter~0 93)} 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)); {19402#true} is VALID [2022-04-15 15:11:58,956 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {19402#true} {19853#(< ~counter~0 93)} #90#return; {19853#(< ~counter~0 93)} is VALID [2022-04-15 15:11:58,956 INFO L290 TraceCheckUtils]: 9: Hoare triple {19402#true} assume true; {19402#true} is VALID [2022-04-15 15:11:58,956 INFO L290 TraceCheckUtils]: 8: Hoare triple {19402#true} assume !(0 == ~cond); {19402#true} is VALID [2022-04-15 15:11:58,956 INFO L290 TraceCheckUtils]: 7: Hoare triple {19402#true} ~cond := #in~cond; {19402#true} is VALID [2022-04-15 15:11:58,956 INFO L272 TraceCheckUtils]: 6: Hoare triple {19853#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {19402#true} is VALID [2022-04-15 15:11:58,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {19853#(< ~counter~0 93)} 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; {19853#(< ~counter~0 93)} is VALID [2022-04-15 15:11:58,957 INFO L272 TraceCheckUtils]: 4: Hoare triple {19853#(< ~counter~0 93)} call #t~ret9 := main(); {19853#(< ~counter~0 93)} is VALID [2022-04-15 15:11:58,957 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {19853#(< ~counter~0 93)} {19402#true} #102#return; {19853#(< ~counter~0 93)} is VALID [2022-04-15 15:11:58,957 INFO L290 TraceCheckUtils]: 2: Hoare triple {19853#(< ~counter~0 93)} assume true; {19853#(< ~counter~0 93)} is VALID [2022-04-15 15:11:58,958 INFO L290 TraceCheckUtils]: 1: Hoare triple {19402#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; {19853#(< ~counter~0 93)} is VALID [2022-04-15 15:11:58,958 INFO L272 TraceCheckUtils]: 0: Hoare triple {19402#true} call ULTIMATE.init(); {19402#true} is VALID [2022-04-15 15:11:58,958 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 18 proven. 24 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 15:11:58,958 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:11:58,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924258614] [2022-04-15 15:11:58,958 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:11:58,958 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118556047] [2022-04-15 15:11:58,958 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118556047] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:11:58,958 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:11:58,958 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 15:11:58,959 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:11:58,959 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1322961452] [2022-04-15 15:11:58,959 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1322961452] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:11:58,959 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:11:58,959 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:11:58,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [237542269] [2022-04-15 15:11:58,959 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:11:58,959 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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 81 [2022-04-15 15:11:58,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:11:58,960 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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-15 15:11:59,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 78 edges. 78 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:59,015 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:11:59,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:11:59,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:11:59,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:11:59,016 INFO L87 Difference]: Start difference. First operand 161 states and 201 transitions. Second operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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-15 15:11:59,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:11:59,656 INFO L93 Difference]: Finished difference Result 217 states and 280 transitions. [2022-04-15 15:11:59,656 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-04-15 15:11:59,656 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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 81 [2022-04-15 15:11:59,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:11:59,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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-15 15:11:59,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 15:11:59,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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-15 15:11:59,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 177 transitions. [2022-04-15 15:11:59,661 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 16 states and 177 transitions. [2022-04-15 15:11:59,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:11:59,824 INFO L225 Difference]: With dead ends: 217 [2022-04-15 15:11:59,824 INFO L226 Difference]: Without dead ends: 168 [2022-04-15 15:11:59,825 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 166 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=243, Invalid=357, Unknown=0, NotChecked=0, Total=600 [2022-04-15 15:11:59,825 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 102 mSDsluCounter, 154 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 87 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 102 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 87 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:11:59,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [102 Valid, 205 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [87 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:11:59,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168 states. [2022-04-15 15:12:00,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168 to 164. [2022-04-15 15:12:00,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:00,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 168 states. Second operand has 164 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 122 states have internal predecessors, (143), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:12:00,039 INFO L74 IsIncluded]: Start isIncluded. First operand 168 states. Second operand has 164 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 122 states have internal predecessors, (143), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:12:00,040 INFO L87 Difference]: Start difference. First operand 168 states. Second operand has 164 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 122 states have internal predecessors, (143), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:12:00,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:00,043 INFO L93 Difference]: Finished difference Result 168 states and 209 transitions. [2022-04-15 15:12:00,043 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions. [2022-04-15 15:12:00,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:00,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:00,044 INFO L74 IsIncluded]: Start isIncluded. First operand has 164 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 122 states have internal predecessors, (143), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 168 states. [2022-04-15 15:12:00,044 INFO L87 Difference]: Start difference. First operand has 164 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 122 states have internal predecessors, (143), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) Second operand 168 states. [2022-04-15 15:12:00,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:00,047 INFO L93 Difference]: Finished difference Result 168 states and 209 transitions. [2022-04-15 15:12:00,047 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 209 transitions. [2022-04-15 15:12:00,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:00,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:00,048 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:00,048 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:00,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 120 states have (on average 1.1916666666666667) internal successors, (143), 122 states have internal predecessors, (143), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 28 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:12:00,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 205 transitions. [2022-04-15 15:12:00,051 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 205 transitions. Word has length 81 [2022-04-15 15:12:00,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:00,052 INFO L478 AbstractCegarLoop]: Abstraction has 164 states and 205 transitions. [2022-04-15 15:12:00,052 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.090909090909091) internal successors, (56), 10 states have internal predecessors, (56), 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-15 15:12:00,052 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 164 states and 205 transitions. [2022-04-15 15:12:00,650 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-15 15:12:00,651 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 205 transitions. [2022-04-15 15:12:00,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2022-04-15 15:12:00,651 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:00,652 INFO L499 BasicCegarLoop]: trace histogram [8, 7, 7, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:00,676 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-15 15:12:00,852 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-15 15:12:00,852 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:00,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:00,852 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 3 times [2022-04-15 15:12:00,852 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:00,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1548842898] [2022-04-15 15:12:00,853 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:00,853 INFO L85 PathProgramCache]: Analyzing trace with hash -918360272, now seen corresponding path program 4 times [2022-04-15 15:12:00,853 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:00,853 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854431303] [2022-04-15 15:12:00,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:00,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:00,863 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:00,863 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2102125010] [2022-04-15 15:12:00,863 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:00,864 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:00,864 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:00,864 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-15 15:12:00,866 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-15 15:12:00,967 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:00,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:00,968 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-04-15 15:12:00,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:00,984 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:01,350 INFO L272 TraceCheckUtils]: 0: Hoare triple {21015#true} call ULTIMATE.init(); {21015#true} is VALID [2022-04-15 15:12:01,350 INFO L290 TraceCheckUtils]: 1: Hoare triple {21015#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; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,351 INFO L290 TraceCheckUtils]: 2: Hoare triple {21023#(<= ~counter~0 0)} assume true; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,351 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21023#(<= ~counter~0 0)} {21015#true} #102#return; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,351 INFO L272 TraceCheckUtils]: 4: Hoare triple {21023#(<= ~counter~0 0)} call #t~ret9 := main(); {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,352 INFO L290 TraceCheckUtils]: 5: Hoare triple {21023#(<= ~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; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,352 INFO L272 TraceCheckUtils]: 6: Hoare triple {21023#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,352 INFO L290 TraceCheckUtils]: 7: Hoare triple {21023#(<= ~counter~0 0)} ~cond := #in~cond; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,353 INFO L290 TraceCheckUtils]: 8: Hoare triple {21023#(<= ~counter~0 0)} assume !(0 == ~cond); {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,353 INFO L290 TraceCheckUtils]: 9: Hoare triple {21023#(<= ~counter~0 0)} assume true; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,353 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21023#(<= ~counter~0 0)} {21023#(<= ~counter~0 0)} #90#return; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,354 INFO L272 TraceCheckUtils]: 11: Hoare triple {21023#(<= ~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)); {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {21023#(<= ~counter~0 0)} ~cond := #in~cond; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {21023#(<= ~counter~0 0)} assume !(0 == ~cond); {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,354 INFO L290 TraceCheckUtils]: 14: Hoare triple {21023#(<= ~counter~0 0)} assume true; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,355 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21023#(<= ~counter~0 0)} {21023#(<= ~counter~0 0)} #92#return; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,355 INFO L290 TraceCheckUtils]: 16: Hoare triple {21023#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21023#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:01,356 INFO L290 TraceCheckUtils]: 17: Hoare triple {21023#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21072#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:01,356 INFO L290 TraceCheckUtils]: 18: Hoare triple {21072#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {21072#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:01,357 INFO L272 TraceCheckUtils]: 19: Hoare triple {21072#(<= ~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)); {21072#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:01,357 INFO L290 TraceCheckUtils]: 20: Hoare triple {21072#(<= ~counter~0 1)} ~cond := #in~cond; {21072#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:01,357 INFO L290 TraceCheckUtils]: 21: Hoare triple {21072#(<= ~counter~0 1)} assume !(0 == ~cond); {21072#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:01,357 INFO L290 TraceCheckUtils]: 22: Hoare triple {21072#(<= ~counter~0 1)} assume true; {21072#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:01,358 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21072#(<= ~counter~0 1)} {21072#(<= ~counter~0 1)} #94#return; {21072#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:01,358 INFO L290 TraceCheckUtils]: 24: Hoare triple {21072#(<= ~counter~0 1)} assume !!(0 != ~r~0); {21072#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:01,359 INFO L290 TraceCheckUtils]: 25: Hoare triple {21072#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21097#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:01,359 INFO L290 TraceCheckUtils]: 26: Hoare triple {21097#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {21097#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:01,359 INFO L272 TraceCheckUtils]: 27: Hoare triple {21097#(<= ~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)); {21097#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:01,360 INFO L290 TraceCheckUtils]: 28: Hoare triple {21097#(<= ~counter~0 2)} ~cond := #in~cond; {21097#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:01,360 INFO L290 TraceCheckUtils]: 29: Hoare triple {21097#(<= ~counter~0 2)} assume !(0 == ~cond); {21097#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:01,360 INFO L290 TraceCheckUtils]: 30: Hoare triple {21097#(<= ~counter~0 2)} assume true; {21097#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:01,361 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21097#(<= ~counter~0 2)} {21097#(<= ~counter~0 2)} #96#return; {21097#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:01,361 INFO L290 TraceCheckUtils]: 32: Hoare triple {21097#(<= ~counter~0 2)} assume !(~r~0 > 0); {21097#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:01,362 INFO L290 TraceCheckUtils]: 33: Hoare triple {21097#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21122#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:01,362 INFO L290 TraceCheckUtils]: 34: Hoare triple {21122#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {21122#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:01,362 INFO L272 TraceCheckUtils]: 35: Hoare triple {21122#(<= ~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)); {21122#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:01,363 INFO L290 TraceCheckUtils]: 36: Hoare triple {21122#(<= ~counter~0 3)} ~cond := #in~cond; {21122#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:01,363 INFO L290 TraceCheckUtils]: 37: Hoare triple {21122#(<= ~counter~0 3)} assume !(0 == ~cond); {21122#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:01,363 INFO L290 TraceCheckUtils]: 38: Hoare triple {21122#(<= ~counter~0 3)} assume true; {21122#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:01,364 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21122#(<= ~counter~0 3)} {21122#(<= ~counter~0 3)} #98#return; {21122#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:01,364 INFO L290 TraceCheckUtils]: 40: Hoare triple {21122#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21122#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:01,364 INFO L290 TraceCheckUtils]: 41: Hoare triple {21122#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21147#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:01,365 INFO L290 TraceCheckUtils]: 42: Hoare triple {21147#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {21147#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:01,365 INFO L272 TraceCheckUtils]: 43: Hoare triple {21147#(<= ~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)); {21147#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:01,365 INFO L290 TraceCheckUtils]: 44: Hoare triple {21147#(<= ~counter~0 4)} ~cond := #in~cond; {21147#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:01,366 INFO L290 TraceCheckUtils]: 45: Hoare triple {21147#(<= ~counter~0 4)} assume !(0 == ~cond); {21147#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:01,366 INFO L290 TraceCheckUtils]: 46: Hoare triple {21147#(<= ~counter~0 4)} assume true; {21147#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:01,367 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21147#(<= ~counter~0 4)} {21147#(<= ~counter~0 4)} #98#return; {21147#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:01,367 INFO L290 TraceCheckUtils]: 48: Hoare triple {21147#(<= ~counter~0 4)} assume !(~r~0 < 0); {21147#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:01,367 INFO L290 TraceCheckUtils]: 49: Hoare triple {21147#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21172#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:01,368 INFO L290 TraceCheckUtils]: 50: Hoare triple {21172#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {21172#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:01,368 INFO L272 TraceCheckUtils]: 51: Hoare triple {21172#(<= ~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)); {21172#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:01,368 INFO L290 TraceCheckUtils]: 52: Hoare triple {21172#(<= ~counter~0 5)} ~cond := #in~cond; {21172#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:01,369 INFO L290 TraceCheckUtils]: 53: Hoare triple {21172#(<= ~counter~0 5)} assume !(0 == ~cond); {21172#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:01,369 INFO L290 TraceCheckUtils]: 54: Hoare triple {21172#(<= ~counter~0 5)} assume true; {21172#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:01,369 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21172#(<= ~counter~0 5)} {21172#(<= ~counter~0 5)} #94#return; {21172#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:01,370 INFO L290 TraceCheckUtils]: 56: Hoare triple {21172#(<= ~counter~0 5)} assume !!(0 != ~r~0); {21172#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:01,370 INFO L290 TraceCheckUtils]: 57: Hoare triple {21172#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21197#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:01,370 INFO L290 TraceCheckUtils]: 58: Hoare triple {21197#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {21197#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:01,371 INFO L272 TraceCheckUtils]: 59: Hoare triple {21197#(<= ~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)); {21197#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:01,371 INFO L290 TraceCheckUtils]: 60: Hoare triple {21197#(<= ~counter~0 6)} ~cond := #in~cond; {21197#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:01,371 INFO L290 TraceCheckUtils]: 61: Hoare triple {21197#(<= ~counter~0 6)} assume !(0 == ~cond); {21197#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:01,372 INFO L290 TraceCheckUtils]: 62: Hoare triple {21197#(<= ~counter~0 6)} assume true; {21197#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:01,372 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21197#(<= ~counter~0 6)} {21197#(<= ~counter~0 6)} #96#return; {21197#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:01,372 INFO L290 TraceCheckUtils]: 64: Hoare triple {21197#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21197#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:01,373 INFO L290 TraceCheckUtils]: 65: Hoare triple {21197#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21222#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:01,373 INFO L290 TraceCheckUtils]: 66: Hoare triple {21222#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {21222#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:01,374 INFO L272 TraceCheckUtils]: 67: Hoare triple {21222#(<= ~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)); {21222#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:01,374 INFO L290 TraceCheckUtils]: 68: Hoare triple {21222#(<= ~counter~0 7)} ~cond := #in~cond; {21222#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:01,374 INFO L290 TraceCheckUtils]: 69: Hoare triple {21222#(<= ~counter~0 7)} assume !(0 == ~cond); {21222#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:01,374 INFO L290 TraceCheckUtils]: 70: Hoare triple {21222#(<= ~counter~0 7)} assume true; {21222#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:01,375 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21222#(<= ~counter~0 7)} {21222#(<= ~counter~0 7)} #96#return; {21222#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:01,375 INFO L290 TraceCheckUtils]: 72: Hoare triple {21222#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21222#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:01,376 INFO L290 TraceCheckUtils]: 73: Hoare triple {21222#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21247#(<= |main_#t~post7| 7)} is VALID [2022-04-15 15:12:01,376 INFO L290 TraceCheckUtils]: 74: Hoare triple {21247#(<= |main_#t~post7| 7)} assume !(#t~post7 < 100);havoc #t~post7; {21016#false} is VALID [2022-04-15 15:12:01,376 INFO L290 TraceCheckUtils]: 75: Hoare triple {21016#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21016#false} is VALID [2022-04-15 15:12:01,376 INFO L290 TraceCheckUtils]: 76: Hoare triple {21016#false} assume !(#t~post8 < 100);havoc #t~post8; {21016#false} is VALID [2022-04-15 15:12:01,376 INFO L290 TraceCheckUtils]: 77: Hoare triple {21016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21016#false} is VALID [2022-04-15 15:12:01,376 INFO L290 TraceCheckUtils]: 78: Hoare triple {21016#false} assume !(#t~post6 < 100);havoc #t~post6; {21016#false} is VALID [2022-04-15 15:12:01,376 INFO L272 TraceCheckUtils]: 79: Hoare triple {21016#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)); {21016#false} is VALID [2022-04-15 15:12:01,376 INFO L290 TraceCheckUtils]: 80: Hoare triple {21016#false} ~cond := #in~cond; {21016#false} is VALID [2022-04-15 15:12:01,376 INFO L290 TraceCheckUtils]: 81: Hoare triple {21016#false} assume 0 == ~cond; {21016#false} is VALID [2022-04-15 15:12:01,377 INFO L290 TraceCheckUtils]: 82: Hoare triple {21016#false} assume !false; {21016#false} is VALID [2022-04-15 15:12:01,377 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 110 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:01,377 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:01,807 INFO L290 TraceCheckUtils]: 82: Hoare triple {21016#false} assume !false; {21016#false} is VALID [2022-04-15 15:12:01,807 INFO L290 TraceCheckUtils]: 81: Hoare triple {21016#false} assume 0 == ~cond; {21016#false} is VALID [2022-04-15 15:12:01,807 INFO L290 TraceCheckUtils]: 80: Hoare triple {21016#false} ~cond := #in~cond; {21016#false} is VALID [2022-04-15 15:12:01,807 INFO L272 TraceCheckUtils]: 79: Hoare triple {21016#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)); {21016#false} is VALID [2022-04-15 15:12:01,807 INFO L290 TraceCheckUtils]: 78: Hoare triple {21016#false} assume !(#t~post6 < 100);havoc #t~post6; {21016#false} is VALID [2022-04-15 15:12:01,807 INFO L290 TraceCheckUtils]: 77: Hoare triple {21016#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21016#false} is VALID [2022-04-15 15:12:01,807 INFO L290 TraceCheckUtils]: 76: Hoare triple {21016#false} assume !(#t~post8 < 100);havoc #t~post8; {21016#false} is VALID [2022-04-15 15:12:01,807 INFO L290 TraceCheckUtils]: 75: Hoare triple {21016#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21016#false} is VALID [2022-04-15 15:12:01,807 INFO L290 TraceCheckUtils]: 74: Hoare triple {21299#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {21016#false} is VALID [2022-04-15 15:12:01,808 INFO L290 TraceCheckUtils]: 73: Hoare triple {21303#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21299#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:12:01,808 INFO L290 TraceCheckUtils]: 72: Hoare triple {21303#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21303#(< ~counter~0 100)} is VALID [2022-04-15 15:12:01,809 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {21015#true} {21303#(< ~counter~0 100)} #96#return; {21303#(< ~counter~0 100)} is VALID [2022-04-15 15:12:01,809 INFO L290 TraceCheckUtils]: 70: Hoare triple {21015#true} assume true; {21015#true} is VALID [2022-04-15 15:12:01,809 INFO L290 TraceCheckUtils]: 69: Hoare triple {21015#true} assume !(0 == ~cond); {21015#true} is VALID [2022-04-15 15:12:01,809 INFO L290 TraceCheckUtils]: 68: Hoare triple {21015#true} ~cond := #in~cond; {21015#true} is VALID [2022-04-15 15:12:01,809 INFO L272 TraceCheckUtils]: 67: Hoare triple {21303#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21015#true} is VALID [2022-04-15 15:12:01,809 INFO L290 TraceCheckUtils]: 66: Hoare triple {21303#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {21303#(< ~counter~0 100)} is VALID [2022-04-15 15:12:01,810 INFO L290 TraceCheckUtils]: 65: Hoare triple {21328#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21303#(< ~counter~0 100)} is VALID [2022-04-15 15:12:01,810 INFO L290 TraceCheckUtils]: 64: Hoare triple {21328#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {21328#(< ~counter~0 99)} is VALID [2022-04-15 15:12:01,811 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {21015#true} {21328#(< ~counter~0 99)} #96#return; {21328#(< ~counter~0 99)} is VALID [2022-04-15 15:12:01,811 INFO L290 TraceCheckUtils]: 62: Hoare triple {21015#true} assume true; {21015#true} is VALID [2022-04-15 15:12:01,811 INFO L290 TraceCheckUtils]: 61: Hoare triple {21015#true} assume !(0 == ~cond); {21015#true} is VALID [2022-04-15 15:12:01,811 INFO L290 TraceCheckUtils]: 60: Hoare triple {21015#true} ~cond := #in~cond; {21015#true} is VALID [2022-04-15 15:12:01,811 INFO L272 TraceCheckUtils]: 59: Hoare triple {21328#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21015#true} is VALID [2022-04-15 15:12:01,811 INFO L290 TraceCheckUtils]: 58: Hoare triple {21328#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {21328#(< ~counter~0 99)} is VALID [2022-04-15 15:12:01,812 INFO L290 TraceCheckUtils]: 57: Hoare triple {21353#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21328#(< ~counter~0 99)} is VALID [2022-04-15 15:12:01,812 INFO L290 TraceCheckUtils]: 56: Hoare triple {21353#(< ~counter~0 98)} assume !!(0 != ~r~0); {21353#(< ~counter~0 98)} is VALID [2022-04-15 15:12:01,812 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {21015#true} {21353#(< ~counter~0 98)} #94#return; {21353#(< ~counter~0 98)} is VALID [2022-04-15 15:12:01,813 INFO L290 TraceCheckUtils]: 54: Hoare triple {21015#true} assume true; {21015#true} is VALID [2022-04-15 15:12:01,813 INFO L290 TraceCheckUtils]: 53: Hoare triple {21015#true} assume !(0 == ~cond); {21015#true} is VALID [2022-04-15 15:12:01,813 INFO L290 TraceCheckUtils]: 52: Hoare triple {21015#true} ~cond := #in~cond; {21015#true} is VALID [2022-04-15 15:12:01,813 INFO L272 TraceCheckUtils]: 51: Hoare triple {21353#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21015#true} is VALID [2022-04-15 15:12:01,813 INFO L290 TraceCheckUtils]: 50: Hoare triple {21353#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {21353#(< ~counter~0 98)} is VALID [2022-04-15 15:12:01,813 INFO L290 TraceCheckUtils]: 49: Hoare triple {21378#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21353#(< ~counter~0 98)} is VALID [2022-04-15 15:12:01,814 INFO L290 TraceCheckUtils]: 48: Hoare triple {21378#(< ~counter~0 97)} assume !(~r~0 < 0); {21378#(< ~counter~0 97)} is VALID [2022-04-15 15:12:01,814 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {21015#true} {21378#(< ~counter~0 97)} #98#return; {21378#(< ~counter~0 97)} is VALID [2022-04-15 15:12:01,814 INFO L290 TraceCheckUtils]: 46: Hoare triple {21015#true} assume true; {21015#true} is VALID [2022-04-15 15:12:01,814 INFO L290 TraceCheckUtils]: 45: Hoare triple {21015#true} assume !(0 == ~cond); {21015#true} is VALID [2022-04-15 15:12:01,814 INFO L290 TraceCheckUtils]: 44: Hoare triple {21015#true} ~cond := #in~cond; {21015#true} is VALID [2022-04-15 15:12:01,815 INFO L272 TraceCheckUtils]: 43: Hoare triple {21378#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21015#true} is VALID [2022-04-15 15:12:01,815 INFO L290 TraceCheckUtils]: 42: Hoare triple {21378#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {21378#(< ~counter~0 97)} is VALID [2022-04-15 15:12:01,815 INFO L290 TraceCheckUtils]: 41: Hoare triple {21403#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21378#(< ~counter~0 97)} is VALID [2022-04-15 15:12:01,816 INFO L290 TraceCheckUtils]: 40: Hoare triple {21403#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {21403#(< ~counter~0 96)} is VALID [2022-04-15 15:12:01,816 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {21015#true} {21403#(< ~counter~0 96)} #98#return; {21403#(< ~counter~0 96)} is VALID [2022-04-15 15:12:01,816 INFO L290 TraceCheckUtils]: 38: Hoare triple {21015#true} assume true; {21015#true} is VALID [2022-04-15 15:12:01,816 INFO L290 TraceCheckUtils]: 37: Hoare triple {21015#true} assume !(0 == ~cond); {21015#true} is VALID [2022-04-15 15:12:01,816 INFO L290 TraceCheckUtils]: 36: Hoare triple {21015#true} ~cond := #in~cond; {21015#true} is VALID [2022-04-15 15:12:01,816 INFO L272 TraceCheckUtils]: 35: Hoare triple {21403#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21015#true} is VALID [2022-04-15 15:12:01,817 INFO L290 TraceCheckUtils]: 34: Hoare triple {21403#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {21403#(< ~counter~0 96)} is VALID [2022-04-15 15:12:01,817 INFO L290 TraceCheckUtils]: 33: Hoare triple {21428#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {21403#(< ~counter~0 96)} is VALID [2022-04-15 15:12:01,817 INFO L290 TraceCheckUtils]: 32: Hoare triple {21428#(< ~counter~0 95)} assume !(~r~0 > 0); {21428#(< ~counter~0 95)} is VALID [2022-04-15 15:12:01,818 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {21015#true} {21428#(< ~counter~0 95)} #96#return; {21428#(< ~counter~0 95)} is VALID [2022-04-15 15:12:01,818 INFO L290 TraceCheckUtils]: 30: Hoare triple {21015#true} assume true; {21015#true} is VALID [2022-04-15 15:12:01,818 INFO L290 TraceCheckUtils]: 29: Hoare triple {21015#true} assume !(0 == ~cond); {21015#true} is VALID [2022-04-15 15:12:01,818 INFO L290 TraceCheckUtils]: 28: Hoare triple {21015#true} ~cond := #in~cond; {21015#true} is VALID [2022-04-15 15:12:01,818 INFO L272 TraceCheckUtils]: 27: Hoare triple {21428#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21015#true} is VALID [2022-04-15 15:12:01,818 INFO L290 TraceCheckUtils]: 26: Hoare triple {21428#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {21428#(< ~counter~0 95)} is VALID [2022-04-15 15:12:01,819 INFO L290 TraceCheckUtils]: 25: Hoare triple {21453#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {21428#(< ~counter~0 95)} is VALID [2022-04-15 15:12:01,819 INFO L290 TraceCheckUtils]: 24: Hoare triple {21453#(< ~counter~0 94)} assume !!(0 != ~r~0); {21453#(< ~counter~0 94)} is VALID [2022-04-15 15:12:01,820 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {21015#true} {21453#(< ~counter~0 94)} #94#return; {21453#(< ~counter~0 94)} is VALID [2022-04-15 15:12:01,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {21015#true} assume true; {21015#true} is VALID [2022-04-15 15:12:01,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {21015#true} assume !(0 == ~cond); {21015#true} is VALID [2022-04-15 15:12:01,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {21015#true} ~cond := #in~cond; {21015#true} is VALID [2022-04-15 15:12:01,820 INFO L272 TraceCheckUtils]: 19: Hoare triple {21453#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {21015#true} is VALID [2022-04-15 15:12:01,820 INFO L290 TraceCheckUtils]: 18: Hoare triple {21453#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {21453#(< ~counter~0 94)} is VALID [2022-04-15 15:12:01,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {21478#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {21453#(< ~counter~0 94)} is VALID [2022-04-15 15:12:01,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {21478#(< ~counter~0 93)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {21478#(< ~counter~0 93)} is VALID [2022-04-15 15:12:01,821 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {21015#true} {21478#(< ~counter~0 93)} #92#return; {21478#(< ~counter~0 93)} is VALID [2022-04-15 15:12:01,822 INFO L290 TraceCheckUtils]: 14: Hoare triple {21015#true} assume true; {21015#true} is VALID [2022-04-15 15:12:01,822 INFO L290 TraceCheckUtils]: 13: Hoare triple {21015#true} assume !(0 == ~cond); {21015#true} is VALID [2022-04-15 15:12:01,822 INFO L290 TraceCheckUtils]: 12: Hoare triple {21015#true} ~cond := #in~cond; {21015#true} is VALID [2022-04-15 15:12:01,822 INFO L272 TraceCheckUtils]: 11: Hoare triple {21478#(< ~counter~0 93)} 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)); {21015#true} is VALID [2022-04-15 15:12:01,822 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {21015#true} {21478#(< ~counter~0 93)} #90#return; {21478#(< ~counter~0 93)} is VALID [2022-04-15 15:12:01,822 INFO L290 TraceCheckUtils]: 9: Hoare triple {21015#true} assume true; {21015#true} is VALID [2022-04-15 15:12:01,822 INFO L290 TraceCheckUtils]: 8: Hoare triple {21015#true} assume !(0 == ~cond); {21015#true} is VALID [2022-04-15 15:12:01,822 INFO L290 TraceCheckUtils]: 7: Hoare triple {21015#true} ~cond := #in~cond; {21015#true} is VALID [2022-04-15 15:12:01,822 INFO L272 TraceCheckUtils]: 6: Hoare triple {21478#(< ~counter~0 93)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {21015#true} is VALID [2022-04-15 15:12:01,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {21478#(< ~counter~0 93)} 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; {21478#(< ~counter~0 93)} is VALID [2022-04-15 15:12:01,823 INFO L272 TraceCheckUtils]: 4: Hoare triple {21478#(< ~counter~0 93)} call #t~ret9 := main(); {21478#(< ~counter~0 93)} is VALID [2022-04-15 15:12:01,823 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {21478#(< ~counter~0 93)} {21015#true} #102#return; {21478#(< ~counter~0 93)} is VALID [2022-04-15 15:12:01,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {21478#(< ~counter~0 93)} assume true; {21478#(< ~counter~0 93)} is VALID [2022-04-15 15:12:01,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {21015#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; {21478#(< ~counter~0 93)} is VALID [2022-04-15 15:12:01,824 INFO L272 TraceCheckUtils]: 0: Hoare triple {21015#true} call ULTIMATE.init(); {21015#true} is VALID [2022-04-15 15:12:01,824 INFO L134 CoverageAnalysis]: Checked inductivity of 136 backedges. 22 proven. 26 refuted. 0 times theorem prover too weak. 88 trivial. 0 not checked. [2022-04-15 15:12:01,825 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854431303] [2022-04-15 15:12:01,825 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:01,825 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2102125010] [2022-04-15 15:12:01,825 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2102125010] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:01,825 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:01,825 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 20 [2022-04-15 15:12:01,825 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:01,826 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1548842898] [2022-04-15 15:12:01,826 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1548842898] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:01,826 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:01,826 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:12:01,826 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971295826] [2022-04-15 15:12:01,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:01,826 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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 83 [2022-04-15 15:12:01,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:01,827 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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-15 15:12:01,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:01,887 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:12:01,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:01,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:12:01,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=222, Unknown=0, NotChecked=0, Total=380 [2022-04-15 15:12:01,888 INFO L87 Difference]: Start difference. First operand 164 states and 205 transitions. Second operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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-15 15:12:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:02,483 INFO L93 Difference]: Finished difference Result 219 states and 283 transitions. [2022-04-15 15:12:02,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 15:12:02,483 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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 83 [2022-04-15 15:12:02,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:02,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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-15 15:12:02,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 15:12:02,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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-15 15:12:02,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 177 transitions. [2022-04-15 15:12:02,488 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 177 transitions. [2022-04-15 15:12:02,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:02,633 INFO L225 Difference]: With dead ends: 219 [2022-04-15 15:12:02,634 INFO L226 Difference]: Without dead ends: 170 [2022-04-15 15:12:02,634 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 171 GetRequests, 147 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 37 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=266, Invalid=384, Unknown=0, NotChecked=0, Total=650 [2022-04-15 15:12:02,635 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 76 mSDsluCounter, 166 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 64 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 64 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:02,635 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 217 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [64 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-04-15 15:12:02,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 170 states. [2022-04-15 15:12:02,834 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 170 to 170. [2022-04-15 15:12:02,834 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:02,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 170 states. Second operand has 170 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 126 states have internal predecessors, (149), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:12:02,835 INFO L74 IsIncluded]: Start isIncluded. First operand 170 states. Second operand has 170 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 126 states have internal predecessors, (149), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:12:02,835 INFO L87 Difference]: Start difference. First operand 170 states. Second operand has 170 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 126 states have internal predecessors, (149), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:12:02,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:02,838 INFO L93 Difference]: Finished difference Result 170 states and 211 transitions. [2022-04-15 15:12:02,838 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 211 transitions. [2022-04-15 15:12:02,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:02,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:02,839 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 126 states have internal predecessors, (149), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 170 states. [2022-04-15 15:12:02,839 INFO L87 Difference]: Start difference. First operand has 170 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 126 states have internal predecessors, (149), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) Second operand 170 states. [2022-04-15 15:12:02,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:02,842 INFO L93 Difference]: Finished difference Result 170 states and 211 transitions. [2022-04-15 15:12:02,842 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 211 transitions. [2022-04-15 15:12:02,843 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:02,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:02,843 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:02,843 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:02,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 126 states have (on average 1.1825396825396826) internal successors, (149), 126 states have internal predecessors, (149), 32 states have call successors, (32), 13 states have call predecessors, (32), 11 states have return successors, (30), 30 states have call predecessors, (30), 30 states have call successors, (30) [2022-04-15 15:12:02,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 211 transitions. [2022-04-15 15:12:02,847 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 211 transitions. Word has length 83 [2022-04-15 15:12:02,847 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:02,847 INFO L478 AbstractCegarLoop]: Abstraction has 170 states and 211 transitions. [2022-04-15 15:12:02,847 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.2727272727272725) internal successors, (58), 10 states have internal predecessors, (58), 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-15 15:12:02,847 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 170 states and 211 transitions. [2022-04-15 15:12:04,438 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-15 15:12:04,438 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 211 transitions. [2022-04-15 15:12:04,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2022-04-15 15:12:04,439 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:04,439 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:04,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:04,639 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-15 15:12:04,640 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:04,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:04,640 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 1 times [2022-04-15 15:12:04,640 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:04,640 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1662636589] [2022-04-15 15:12:04,640 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:04,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1698627479, now seen corresponding path program 2 times [2022-04-15 15:12:04,641 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:04,641 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1754232392] [2022-04-15 15:12:04,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:04,641 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:04,652 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:04,652 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1915078410] [2022-04-15 15:12:04,652 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:04,652 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:04,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:04,653 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-15 15:12:04,654 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-15 15:12:04,702 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:04,702 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:04,702 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 15:12:04,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:04,720 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:05,121 INFO L272 TraceCheckUtils]: 0: Hoare triple {22662#true} call ULTIMATE.init(); {22662#true} is VALID [2022-04-15 15:12:05,122 INFO L290 TraceCheckUtils]: 1: Hoare triple {22662#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; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {22670#(<= ~counter~0 0)} assume true; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,123 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22670#(<= ~counter~0 0)} {22662#true} #102#return; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,123 INFO L272 TraceCheckUtils]: 4: Hoare triple {22670#(<= ~counter~0 0)} call #t~ret9 := main(); {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,123 INFO L290 TraceCheckUtils]: 5: Hoare triple {22670#(<= ~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; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,124 INFO L272 TraceCheckUtils]: 6: Hoare triple {22670#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,124 INFO L290 TraceCheckUtils]: 7: Hoare triple {22670#(<= ~counter~0 0)} ~cond := #in~cond; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {22670#(<= ~counter~0 0)} assume !(0 == ~cond); {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {22670#(<= ~counter~0 0)} assume true; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,125 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22670#(<= ~counter~0 0)} {22670#(<= ~counter~0 0)} #90#return; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,125 INFO L272 TraceCheckUtils]: 11: Hoare triple {22670#(<= ~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)); {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {22670#(<= ~counter~0 0)} ~cond := #in~cond; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {22670#(<= ~counter~0 0)} assume !(0 == ~cond); {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,126 INFO L290 TraceCheckUtils]: 14: Hoare triple {22670#(<= ~counter~0 0)} assume true; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,127 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22670#(<= ~counter~0 0)} {22670#(<= ~counter~0 0)} #92#return; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {22670#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {22670#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:05,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {22670#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:05,128 INFO L290 TraceCheckUtils]: 18: Hoare triple {22719#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {22719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:05,128 INFO L272 TraceCheckUtils]: 19: Hoare triple {22719#(<= ~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)); {22719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:05,129 INFO L290 TraceCheckUtils]: 20: Hoare triple {22719#(<= ~counter~0 1)} ~cond := #in~cond; {22719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:05,129 INFO L290 TraceCheckUtils]: 21: Hoare triple {22719#(<= ~counter~0 1)} assume !(0 == ~cond); {22719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:05,129 INFO L290 TraceCheckUtils]: 22: Hoare triple {22719#(<= ~counter~0 1)} assume true; {22719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:05,130 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22719#(<= ~counter~0 1)} {22719#(<= ~counter~0 1)} #94#return; {22719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:05,130 INFO L290 TraceCheckUtils]: 24: Hoare triple {22719#(<= ~counter~0 1)} assume !!(0 != ~r~0); {22719#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:05,130 INFO L290 TraceCheckUtils]: 25: Hoare triple {22719#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:05,131 INFO L290 TraceCheckUtils]: 26: Hoare triple {22744#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {22744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:05,131 INFO L272 TraceCheckUtils]: 27: Hoare triple {22744#(<= ~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)); {22744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:05,132 INFO L290 TraceCheckUtils]: 28: Hoare triple {22744#(<= ~counter~0 2)} ~cond := #in~cond; {22744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:05,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {22744#(<= ~counter~0 2)} assume !(0 == ~cond); {22744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:05,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {22744#(<= ~counter~0 2)} assume true; {22744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:05,133 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22744#(<= ~counter~0 2)} {22744#(<= ~counter~0 2)} #96#return; {22744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:05,133 INFO L290 TraceCheckUtils]: 32: Hoare triple {22744#(<= ~counter~0 2)} assume !(~r~0 > 0); {22744#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:05,133 INFO L290 TraceCheckUtils]: 33: Hoare triple {22744#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:05,134 INFO L290 TraceCheckUtils]: 34: Hoare triple {22769#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {22769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:05,134 INFO L272 TraceCheckUtils]: 35: Hoare triple {22769#(<= ~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)); {22769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:05,135 INFO L290 TraceCheckUtils]: 36: Hoare triple {22769#(<= ~counter~0 3)} ~cond := #in~cond; {22769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:05,135 INFO L290 TraceCheckUtils]: 37: Hoare triple {22769#(<= ~counter~0 3)} assume !(0 == ~cond); {22769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:05,135 INFO L290 TraceCheckUtils]: 38: Hoare triple {22769#(<= ~counter~0 3)} assume true; {22769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:05,136 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22769#(<= ~counter~0 3)} {22769#(<= ~counter~0 3)} #98#return; {22769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:05,144 INFO L290 TraceCheckUtils]: 40: Hoare triple {22769#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {22769#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:05,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {22769#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:05,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {22794#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {22794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:05,146 INFO L272 TraceCheckUtils]: 43: Hoare triple {22794#(<= ~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)); {22794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:05,146 INFO L290 TraceCheckUtils]: 44: Hoare triple {22794#(<= ~counter~0 4)} ~cond := #in~cond; {22794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:05,146 INFO L290 TraceCheckUtils]: 45: Hoare triple {22794#(<= ~counter~0 4)} assume !(0 == ~cond); {22794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:05,147 INFO L290 TraceCheckUtils]: 46: Hoare triple {22794#(<= ~counter~0 4)} assume true; {22794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:05,147 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22794#(<= ~counter~0 4)} {22794#(<= ~counter~0 4)} #98#return; {22794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:05,147 INFO L290 TraceCheckUtils]: 48: Hoare triple {22794#(<= ~counter~0 4)} assume !(~r~0 < 0); {22794#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:05,148 INFO L290 TraceCheckUtils]: 49: Hoare triple {22794#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22819#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:05,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {22819#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {22819#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:05,149 INFO L272 TraceCheckUtils]: 51: Hoare triple {22819#(<= ~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)); {22819#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:05,149 INFO L290 TraceCheckUtils]: 52: Hoare triple {22819#(<= ~counter~0 5)} ~cond := #in~cond; {22819#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:05,149 INFO L290 TraceCheckUtils]: 53: Hoare triple {22819#(<= ~counter~0 5)} assume !(0 == ~cond); {22819#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:05,150 INFO L290 TraceCheckUtils]: 54: Hoare triple {22819#(<= ~counter~0 5)} assume true; {22819#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:05,150 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22819#(<= ~counter~0 5)} {22819#(<= ~counter~0 5)} #94#return; {22819#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:05,150 INFO L290 TraceCheckUtils]: 56: Hoare triple {22819#(<= ~counter~0 5)} assume !!(0 != ~r~0); {22819#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:05,151 INFO L290 TraceCheckUtils]: 57: Hoare triple {22819#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22844#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:05,151 INFO L290 TraceCheckUtils]: 58: Hoare triple {22844#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {22844#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:05,152 INFO L272 TraceCheckUtils]: 59: Hoare triple {22844#(<= ~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)); {22844#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:05,157 INFO L290 TraceCheckUtils]: 60: Hoare triple {22844#(<= ~counter~0 6)} ~cond := #in~cond; {22844#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:05,158 INFO L290 TraceCheckUtils]: 61: Hoare triple {22844#(<= ~counter~0 6)} assume !(0 == ~cond); {22844#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:05,158 INFO L290 TraceCheckUtils]: 62: Hoare triple {22844#(<= ~counter~0 6)} assume true; {22844#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:05,159 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22844#(<= ~counter~0 6)} {22844#(<= ~counter~0 6)} #96#return; {22844#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:05,159 INFO L290 TraceCheckUtils]: 64: Hoare triple {22844#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {22844#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:05,160 INFO L290 TraceCheckUtils]: 65: Hoare triple {22844#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22869#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:05,160 INFO L290 TraceCheckUtils]: 66: Hoare triple {22869#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {22869#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:05,161 INFO L272 TraceCheckUtils]: 67: Hoare triple {22869#(<= ~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)); {22869#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:05,161 INFO L290 TraceCheckUtils]: 68: Hoare triple {22869#(<= ~counter~0 7)} ~cond := #in~cond; {22869#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:05,161 INFO L290 TraceCheckUtils]: 69: Hoare triple {22869#(<= ~counter~0 7)} assume !(0 == ~cond); {22869#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:05,161 INFO L290 TraceCheckUtils]: 70: Hoare triple {22869#(<= ~counter~0 7)} assume true; {22869#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:05,162 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22869#(<= ~counter~0 7)} {22869#(<= ~counter~0 7)} #96#return; {22869#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:05,162 INFO L290 TraceCheckUtils]: 72: Hoare triple {22869#(<= ~counter~0 7)} assume !(~r~0 > 0); {22869#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:05,163 INFO L290 TraceCheckUtils]: 73: Hoare triple {22869#(<= ~counter~0 7)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22894#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:05,163 INFO L290 TraceCheckUtils]: 74: Hoare triple {22894#(<= ~counter~0 8)} assume !!(#t~post8 < 100);havoc #t~post8; {22894#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:05,163 INFO L272 TraceCheckUtils]: 75: Hoare triple {22894#(<= ~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)); {22894#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:05,164 INFO L290 TraceCheckUtils]: 76: Hoare triple {22894#(<= ~counter~0 8)} ~cond := #in~cond; {22894#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:05,164 INFO L290 TraceCheckUtils]: 77: Hoare triple {22894#(<= ~counter~0 8)} assume !(0 == ~cond); {22894#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:05,164 INFO L290 TraceCheckUtils]: 78: Hoare triple {22894#(<= ~counter~0 8)} assume true; {22894#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:05,165 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22894#(<= ~counter~0 8)} {22894#(<= ~counter~0 8)} #98#return; {22894#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:05,165 INFO L290 TraceCheckUtils]: 80: Hoare triple {22894#(<= ~counter~0 8)} assume !(~r~0 < 0); {22894#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:05,165 INFO L290 TraceCheckUtils]: 81: Hoare triple {22894#(<= ~counter~0 8)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22919#(<= |main_#t~post6| 8)} is VALID [2022-04-15 15:12:05,166 INFO L290 TraceCheckUtils]: 82: Hoare triple {22919#(<= |main_#t~post6| 8)} assume !(#t~post6 < 100);havoc #t~post6; {22663#false} is VALID [2022-04-15 15:12:05,166 INFO L272 TraceCheckUtils]: 83: Hoare triple {22663#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)); {22663#false} is VALID [2022-04-15 15:12:05,166 INFO L290 TraceCheckUtils]: 84: Hoare triple {22663#false} ~cond := #in~cond; {22663#false} is VALID [2022-04-15 15:12:05,166 INFO L290 TraceCheckUtils]: 85: Hoare triple {22663#false} assume 0 == ~cond; {22663#false} is VALID [2022-04-15 15:12:05,166 INFO L290 TraceCheckUtils]: 86: Hoare triple {22663#false} assume !false; {22663#false} is VALID [2022-04-15 15:12:05,166 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 144 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:05,166 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:05,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {22663#false} assume !false; {22663#false} is VALID [2022-04-15 15:12:05,628 INFO L290 TraceCheckUtils]: 85: Hoare triple {22663#false} assume 0 == ~cond; {22663#false} is VALID [2022-04-15 15:12:05,628 INFO L290 TraceCheckUtils]: 84: Hoare triple {22663#false} ~cond := #in~cond; {22663#false} is VALID [2022-04-15 15:12:05,628 INFO L272 TraceCheckUtils]: 83: Hoare triple {22663#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)); {22663#false} is VALID [2022-04-15 15:12:05,628 INFO L290 TraceCheckUtils]: 82: Hoare triple {22947#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {22663#false} is VALID [2022-04-15 15:12:05,629 INFO L290 TraceCheckUtils]: 81: Hoare triple {22951#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {22947#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:12:05,629 INFO L290 TraceCheckUtils]: 80: Hoare triple {22951#(< ~counter~0 100)} assume !(~r~0 < 0); {22951#(< ~counter~0 100)} is VALID [2022-04-15 15:12:05,630 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {22662#true} {22951#(< ~counter~0 100)} #98#return; {22951#(< ~counter~0 100)} is VALID [2022-04-15 15:12:05,630 INFO L290 TraceCheckUtils]: 78: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,630 INFO L290 TraceCheckUtils]: 77: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,630 INFO L290 TraceCheckUtils]: 76: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,630 INFO L272 TraceCheckUtils]: 75: Hoare triple {22951#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22662#true} is VALID [2022-04-15 15:12:05,630 INFO L290 TraceCheckUtils]: 74: Hoare triple {22951#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {22951#(< ~counter~0 100)} is VALID [2022-04-15 15:12:05,631 INFO L290 TraceCheckUtils]: 73: Hoare triple {22976#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {22951#(< ~counter~0 100)} is VALID [2022-04-15 15:12:05,631 INFO L290 TraceCheckUtils]: 72: Hoare triple {22976#(< ~counter~0 99)} assume !(~r~0 > 0); {22976#(< ~counter~0 99)} is VALID [2022-04-15 15:12:05,632 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {22662#true} {22976#(< ~counter~0 99)} #96#return; {22976#(< ~counter~0 99)} is VALID [2022-04-15 15:12:05,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,632 INFO L272 TraceCheckUtils]: 67: Hoare triple {22976#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22662#true} is VALID [2022-04-15 15:12:05,632 INFO L290 TraceCheckUtils]: 66: Hoare triple {22976#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {22976#(< ~counter~0 99)} is VALID [2022-04-15 15:12:05,633 INFO L290 TraceCheckUtils]: 65: Hoare triple {23001#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {22976#(< ~counter~0 99)} is VALID [2022-04-15 15:12:05,635 INFO L290 TraceCheckUtils]: 64: Hoare triple {23001#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {23001#(< ~counter~0 98)} is VALID [2022-04-15 15:12:05,636 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {22662#true} {23001#(< ~counter~0 98)} #96#return; {23001#(< ~counter~0 98)} is VALID [2022-04-15 15:12:05,636 INFO L290 TraceCheckUtils]: 62: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,636 INFO L290 TraceCheckUtils]: 61: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,636 INFO L290 TraceCheckUtils]: 60: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,636 INFO L272 TraceCheckUtils]: 59: Hoare triple {23001#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22662#true} is VALID [2022-04-15 15:12:05,637 INFO L290 TraceCheckUtils]: 58: Hoare triple {23001#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {23001#(< ~counter~0 98)} is VALID [2022-04-15 15:12:05,637 INFO L290 TraceCheckUtils]: 57: Hoare triple {23026#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23001#(< ~counter~0 98)} is VALID [2022-04-15 15:12:05,638 INFO L290 TraceCheckUtils]: 56: Hoare triple {23026#(< ~counter~0 97)} assume !!(0 != ~r~0); {23026#(< ~counter~0 97)} is VALID [2022-04-15 15:12:05,638 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {22662#true} {23026#(< ~counter~0 97)} #94#return; {23026#(< ~counter~0 97)} is VALID [2022-04-15 15:12:05,638 INFO L290 TraceCheckUtils]: 54: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,638 INFO L290 TraceCheckUtils]: 53: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,639 INFO L290 TraceCheckUtils]: 52: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,639 INFO L272 TraceCheckUtils]: 51: Hoare triple {23026#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22662#true} is VALID [2022-04-15 15:12:05,639 INFO L290 TraceCheckUtils]: 50: Hoare triple {23026#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {23026#(< ~counter~0 97)} is VALID [2022-04-15 15:12:05,640 INFO L290 TraceCheckUtils]: 49: Hoare triple {23051#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23026#(< ~counter~0 97)} is VALID [2022-04-15 15:12:05,640 INFO L290 TraceCheckUtils]: 48: Hoare triple {23051#(< ~counter~0 96)} assume !(~r~0 < 0); {23051#(< ~counter~0 96)} is VALID [2022-04-15 15:12:05,641 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {22662#true} {23051#(< ~counter~0 96)} #98#return; {23051#(< ~counter~0 96)} is VALID [2022-04-15 15:12:05,641 INFO L290 TraceCheckUtils]: 46: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,641 INFO L290 TraceCheckUtils]: 45: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,641 INFO L290 TraceCheckUtils]: 44: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,641 INFO L272 TraceCheckUtils]: 43: Hoare triple {23051#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22662#true} is VALID [2022-04-15 15:12:05,641 INFO L290 TraceCheckUtils]: 42: Hoare triple {23051#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {23051#(< ~counter~0 96)} is VALID [2022-04-15 15:12:05,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {23076#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23051#(< ~counter~0 96)} is VALID [2022-04-15 15:12:05,642 INFO L290 TraceCheckUtils]: 40: Hoare triple {23076#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {23076#(< ~counter~0 95)} is VALID [2022-04-15 15:12:05,643 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {22662#true} {23076#(< ~counter~0 95)} #98#return; {23076#(< ~counter~0 95)} is VALID [2022-04-15 15:12:05,643 INFO L290 TraceCheckUtils]: 38: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,643 INFO L290 TraceCheckUtils]: 37: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,643 INFO L290 TraceCheckUtils]: 36: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,643 INFO L272 TraceCheckUtils]: 35: Hoare triple {23076#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22662#true} is VALID [2022-04-15 15:12:05,644 INFO L290 TraceCheckUtils]: 34: Hoare triple {23076#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {23076#(< ~counter~0 95)} is VALID [2022-04-15 15:12:05,644 INFO L290 TraceCheckUtils]: 33: Hoare triple {23101#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {23076#(< ~counter~0 95)} is VALID [2022-04-15 15:12:05,645 INFO L290 TraceCheckUtils]: 32: Hoare triple {23101#(< ~counter~0 94)} assume !(~r~0 > 0); {23101#(< ~counter~0 94)} is VALID [2022-04-15 15:12:05,645 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {22662#true} {23101#(< ~counter~0 94)} #96#return; {23101#(< ~counter~0 94)} is VALID [2022-04-15 15:12:05,646 INFO L290 TraceCheckUtils]: 30: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,646 INFO L290 TraceCheckUtils]: 29: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,646 INFO L290 TraceCheckUtils]: 28: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,646 INFO L272 TraceCheckUtils]: 27: Hoare triple {23101#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22662#true} is VALID [2022-04-15 15:12:05,646 INFO L290 TraceCheckUtils]: 26: Hoare triple {23101#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {23101#(< ~counter~0 94)} is VALID [2022-04-15 15:12:05,647 INFO L290 TraceCheckUtils]: 25: Hoare triple {23126#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {23101#(< ~counter~0 94)} is VALID [2022-04-15 15:12:05,647 INFO L290 TraceCheckUtils]: 24: Hoare triple {23126#(< ~counter~0 93)} assume !!(0 != ~r~0); {23126#(< ~counter~0 93)} is VALID [2022-04-15 15:12:05,648 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {22662#true} {23126#(< ~counter~0 93)} #94#return; {23126#(< ~counter~0 93)} is VALID [2022-04-15 15:12:05,648 INFO L290 TraceCheckUtils]: 22: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,648 INFO L290 TraceCheckUtils]: 21: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,648 INFO L290 TraceCheckUtils]: 20: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,648 INFO L272 TraceCheckUtils]: 19: Hoare triple {23126#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {22662#true} is VALID [2022-04-15 15:12:05,648 INFO L290 TraceCheckUtils]: 18: Hoare triple {23126#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {23126#(< ~counter~0 93)} is VALID [2022-04-15 15:12:05,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {23151#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {23126#(< ~counter~0 93)} is VALID [2022-04-15 15:12:05,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {23151#(< ~counter~0 92)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {23151#(< ~counter~0 92)} is VALID [2022-04-15 15:12:05,650 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {22662#true} {23151#(< ~counter~0 92)} #92#return; {23151#(< ~counter~0 92)} is VALID [2022-04-15 15:12:05,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,650 INFO L290 TraceCheckUtils]: 13: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,650 INFO L290 TraceCheckUtils]: 12: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,650 INFO L272 TraceCheckUtils]: 11: Hoare triple {23151#(< ~counter~0 92)} 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)); {22662#true} is VALID [2022-04-15 15:12:05,651 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22662#true} {23151#(< ~counter~0 92)} #90#return; {23151#(< ~counter~0 92)} is VALID [2022-04-15 15:12:05,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {22662#true} assume true; {22662#true} is VALID [2022-04-15 15:12:05,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {22662#true} assume !(0 == ~cond); {22662#true} is VALID [2022-04-15 15:12:05,651 INFO L290 TraceCheckUtils]: 7: Hoare triple {22662#true} ~cond := #in~cond; {22662#true} is VALID [2022-04-15 15:12:05,651 INFO L272 TraceCheckUtils]: 6: Hoare triple {23151#(< ~counter~0 92)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {22662#true} is VALID [2022-04-15 15:12:05,651 INFO L290 TraceCheckUtils]: 5: Hoare triple {23151#(< ~counter~0 92)} 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; {23151#(< ~counter~0 92)} is VALID [2022-04-15 15:12:05,652 INFO L272 TraceCheckUtils]: 4: Hoare triple {23151#(< ~counter~0 92)} call #t~ret9 := main(); {23151#(< ~counter~0 92)} is VALID [2022-04-15 15:12:05,652 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {23151#(< ~counter~0 92)} {22662#true} #102#return; {23151#(< ~counter~0 92)} is VALID [2022-04-15 15:12:05,653 INFO L290 TraceCheckUtils]: 2: Hoare triple {23151#(< ~counter~0 92)} assume true; {23151#(< ~counter~0 92)} is VALID [2022-04-15 15:12:05,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {22662#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; {23151#(< ~counter~0 92)} is VALID [2022-04-15 15:12:05,653 INFO L272 TraceCheckUtils]: 0: Hoare triple {22662#true} call ULTIMATE.init(); {22662#true} is VALID [2022-04-15 15:12:05,654 INFO L134 CoverageAnalysis]: Checked inductivity of 164 backedges. 16 proven. 32 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 15:12:05,654 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:05,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1754232392] [2022-04-15 15:12:05,654 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:05,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1915078410] [2022-04-15 15:12:05,654 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1915078410] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:05,654 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:05,654 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 15:12:05,654 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:05,654 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1662636589] [2022-04-15 15:12:05,655 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1662636589] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:05,655 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:05,655 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 15:12:05,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [87662354] [2022-04-15 15:12:05,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:05,655 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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 87 [2022-04-15 15:12:05,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:05,656 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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-15 15:12:05,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:05,713 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 15:12:05,714 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:05,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 15:12:05,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 15:12:05,714 INFO L87 Difference]: Start difference. First operand 170 states and 211 transitions. Second operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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-15 15:12:06,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:06,496 INFO L93 Difference]: Finished difference Result 192 states and 238 transitions. [2022-04-15 15:12:06,496 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-04-15 15:12:06,496 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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 87 [2022-04-15 15:12:06,497 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:06,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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-15 15:12:06,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 15:12:06,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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-15 15:12:06,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 175 transitions. [2022-04-15 15:12:06,501 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 17 states and 175 transitions. [2022-04-15 15:12:06,650 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-15 15:12:06,653 INFO L225 Difference]: With dead ends: 192 [2022-04-15 15:12:06,653 INFO L226 Difference]: Without dead ends: 187 [2022-04-15 15:12:06,654 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 153 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=288, Invalid=414, Unknown=0, NotChecked=0, Total=702 [2022-04-15 15:12:06,656 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 137 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 229 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:06,656 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [137 Valid, 205 Invalid, 229 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:12:06,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-04-15 15:12:06,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 181. [2022-04-15 15:12:06,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:06,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 181 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 135 states have internal predecessors, (156), 36 states have call successors, (36), 14 states have call predecessors, (36), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 15:12:06,905 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 181 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 135 states have internal predecessors, (156), 36 states have call successors, (36), 14 states have call predecessors, (36), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 15:12:06,906 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 181 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 135 states have internal predecessors, (156), 36 states have call successors, (36), 14 states have call predecessors, (36), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 15:12:06,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:06,909 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2022-04-15 15:12:06,909 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 233 transitions. [2022-04-15 15:12:06,910 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:06,910 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:06,910 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 135 states have internal predecessors, (156), 36 states have call successors, (36), 14 states have call predecessors, (36), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 187 states. [2022-04-15 15:12:06,910 INFO L87 Difference]: Start difference. First operand has 181 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 135 states have internal predecessors, (156), 36 states have call successors, (36), 14 states have call predecessors, (36), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) Second operand 187 states. [2022-04-15 15:12:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:06,914 INFO L93 Difference]: Finished difference Result 187 states and 233 transitions. [2022-04-15 15:12:06,914 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 233 transitions. [2022-04-15 15:12:06,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:06,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:06,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:06,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:06,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 132 states have (on average 1.1818181818181819) internal successors, (156), 135 states have internal predecessors, (156), 36 states have call successors, (36), 14 states have call predecessors, (36), 12 states have return successors, (34), 31 states have call predecessors, (34), 34 states have call successors, (34) [2022-04-15 15:12:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 226 transitions. [2022-04-15 15:12:06,918 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 226 transitions. Word has length 87 [2022-04-15 15:12:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:06,919 INFO L478 AbstractCegarLoop]: Abstraction has 181 states and 226 transitions. [2022-04-15 15:12:06,919 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.0) internal successors, (60), 11 states have internal predecessors, (60), 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-15 15:12:06,919 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 181 states and 226 transitions. [2022-04-15 15:12:07,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 226 edges. 226 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:07,593 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 226 transitions. [2022-04-15 15:12:07,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 15:12:07,594 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:07,594 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:07,616 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-15 15:12:07,811 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-15 15:12:07,812 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:07,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:07,812 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 3 times [2022-04-15 15:12:07,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:07,812 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1717906330] [2022-04-15 15:12:07,813 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:07,813 INFO L85 PathProgramCache]: Analyzing trace with hash 2133755932, now seen corresponding path program 4 times [2022-04-15 15:12:07,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:07,813 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [944142286] [2022-04-15 15:12:07,813 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:07,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:07,823 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:07,823 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [395714844] [2022-04-15 15:12:07,823 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:07,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:07,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:07,825 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:07,830 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Waiting until timeout for monitored process [2022-04-15 15:12:07,881 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:07,881 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:07,882 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 4 conjunts are in the unsatisfiable core [2022-04-15 15:12:07,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:07,895 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:08,131 INFO L272 TraceCheckUtils]: 0: Hoare triple {24335#true} call ULTIMATE.init(); {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L290 TraceCheckUtils]: 1: Hoare triple {24335#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; {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L290 TraceCheckUtils]: 2: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24335#true} {24335#true} #102#return; {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L272 TraceCheckUtils]: 4: Hoare triple {24335#true} call #t~ret9 := main(); {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L290 TraceCheckUtils]: 5: Hoare triple {24335#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; {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L272 TraceCheckUtils]: 6: Hoare triple {24335#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L290 TraceCheckUtils]: 7: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L290 TraceCheckUtils]: 8: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24335#true} {24335#true} #90#return; {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L272 TraceCheckUtils]: 11: Hoare triple {24335#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)); {24335#true} is VALID [2022-04-15 15:12:08,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,133 INFO L290 TraceCheckUtils]: 13: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,133 INFO L290 TraceCheckUtils]: 14: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,133 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24335#true} {24335#true} #92#return; {24335#true} is VALID [2022-04-15 15:12:08,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {24335#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,133 INFO L290 TraceCheckUtils]: 17: Hoare triple {24388#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,134 INFO L272 TraceCheckUtils]: 19: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,134 INFO L290 TraceCheckUtils]: 20: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,134 INFO L290 TraceCheckUtils]: 21: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,134 INFO L290 TraceCheckUtils]: 22: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,134 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #94#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,135 INFO L290 TraceCheckUtils]: 24: Hoare triple {24388#(<= main_~v~0 1)} assume !!(0 != ~r~0); {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,135 INFO L290 TraceCheckUtils]: 25: Hoare triple {24388#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,135 INFO L290 TraceCheckUtils]: 26: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,135 INFO L272 TraceCheckUtils]: 27: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,135 INFO L290 TraceCheckUtils]: 28: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,135 INFO L290 TraceCheckUtils]: 29: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,136 INFO L290 TraceCheckUtils]: 30: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,136 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #96#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,136 INFO L290 TraceCheckUtils]: 32: Hoare triple {24388#(<= main_~v~0 1)} assume !(~r~0 > 0); {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,137 INFO L290 TraceCheckUtils]: 33: Hoare triple {24388#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,137 INFO L290 TraceCheckUtils]: 34: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,137 INFO L272 TraceCheckUtils]: 35: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,137 INFO L290 TraceCheckUtils]: 36: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,137 INFO L290 TraceCheckUtils]: 37: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,137 INFO L290 TraceCheckUtils]: 38: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,138 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #98#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,138 INFO L290 TraceCheckUtils]: 40: Hoare triple {24388#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,138 INFO L290 TraceCheckUtils]: 41: Hoare triple {24388#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,138 INFO L290 TraceCheckUtils]: 42: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,138 INFO L272 TraceCheckUtils]: 43: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,139 INFO L290 TraceCheckUtils]: 44: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,139 INFO L290 TraceCheckUtils]: 45: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,139 INFO L290 TraceCheckUtils]: 46: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,139 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #98#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,139 INFO L290 TraceCheckUtils]: 48: Hoare triple {24388#(<= main_~v~0 1)} assume !(~r~0 < 0); {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,140 INFO L290 TraceCheckUtils]: 49: Hoare triple {24388#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,140 INFO L290 TraceCheckUtils]: 50: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,140 INFO L272 TraceCheckUtils]: 51: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,140 INFO L290 TraceCheckUtils]: 52: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,140 INFO L290 TraceCheckUtils]: 53: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,140 INFO L290 TraceCheckUtils]: 54: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,141 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #94#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,141 INFO L290 TraceCheckUtils]: 56: Hoare triple {24388#(<= main_~v~0 1)} assume !!(0 != ~r~0); {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,141 INFO L290 TraceCheckUtils]: 57: Hoare triple {24388#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,142 INFO L290 TraceCheckUtils]: 58: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,142 INFO L272 TraceCheckUtils]: 59: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,142 INFO L290 TraceCheckUtils]: 60: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,142 INFO L290 TraceCheckUtils]: 61: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,142 INFO L290 TraceCheckUtils]: 62: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,142 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #96#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,143 INFO L290 TraceCheckUtils]: 64: Hoare triple {24388#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,143 INFO L290 TraceCheckUtils]: 65: Hoare triple {24533#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,144 INFO L290 TraceCheckUtils]: 66: Hoare triple {24533#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,144 INFO L272 TraceCheckUtils]: 67: Hoare triple {24533#(< 0 (+ main_~r~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)); {24335#true} is VALID [2022-04-15 15:12:08,144 INFO L290 TraceCheckUtils]: 68: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,144 INFO L290 TraceCheckUtils]: 69: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,144 INFO L290 TraceCheckUtils]: 70: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,144 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24335#true} {24533#(< 0 (+ main_~r~0 1))} #96#return; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,145 INFO L290 TraceCheckUtils]: 72: Hoare triple {24533#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,145 INFO L290 TraceCheckUtils]: 73: Hoare triple {24533#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,145 INFO L290 TraceCheckUtils]: 74: Hoare triple {24533#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,145 INFO L272 TraceCheckUtils]: 75: Hoare triple {24533#(< 0 (+ main_~r~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)); {24335#true} is VALID [2022-04-15 15:12:08,145 INFO L290 TraceCheckUtils]: 76: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,145 INFO L290 TraceCheckUtils]: 77: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,145 INFO L290 TraceCheckUtils]: 78: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,146 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {24335#true} {24533#(< 0 (+ main_~r~0 1))} #98#return; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,147 INFO L290 TraceCheckUtils]: 80: Hoare triple {24533#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {24336#false} is VALID [2022-04-15 15:12:08,147 INFO L290 TraceCheckUtils]: 81: Hoare triple {24336#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24336#false} is VALID [2022-04-15 15:12:08,147 INFO L290 TraceCheckUtils]: 82: Hoare triple {24336#false} assume !(#t~post8 < 100);havoc #t~post8; {24336#false} is VALID [2022-04-15 15:12:08,147 INFO L290 TraceCheckUtils]: 83: Hoare triple {24336#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24336#false} is VALID [2022-04-15 15:12:08,147 INFO L290 TraceCheckUtils]: 84: Hoare triple {24336#false} assume !(#t~post6 < 100);havoc #t~post6; {24336#false} is VALID [2022-04-15 15:12:08,147 INFO L272 TraceCheckUtils]: 85: Hoare triple {24336#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)); {24336#false} is VALID [2022-04-15 15:12:08,147 INFO L290 TraceCheckUtils]: 86: Hoare triple {24336#false} ~cond := #in~cond; {24336#false} is VALID [2022-04-15 15:12:08,147 INFO L290 TraceCheckUtils]: 87: Hoare triple {24336#false} assume 0 == ~cond; {24336#false} is VALID [2022-04-15 15:12:08,147 INFO L290 TraceCheckUtils]: 88: Hoare triple {24336#false} assume !false; {24336#false} is VALID [2022-04-15 15:12:08,148 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-15 15:12:08,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:08,397 INFO L290 TraceCheckUtils]: 88: Hoare triple {24336#false} assume !false; {24336#false} is VALID [2022-04-15 15:12:08,397 INFO L290 TraceCheckUtils]: 87: Hoare triple {24336#false} assume 0 == ~cond; {24336#false} is VALID [2022-04-15 15:12:08,397 INFO L290 TraceCheckUtils]: 86: Hoare triple {24336#false} ~cond := #in~cond; {24336#false} is VALID [2022-04-15 15:12:08,397 INFO L272 TraceCheckUtils]: 85: Hoare triple {24336#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)); {24336#false} is VALID [2022-04-15 15:12:08,397 INFO L290 TraceCheckUtils]: 84: Hoare triple {24336#false} assume !(#t~post6 < 100);havoc #t~post6; {24336#false} is VALID [2022-04-15 15:12:08,397 INFO L290 TraceCheckUtils]: 83: Hoare triple {24336#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24336#false} is VALID [2022-04-15 15:12:08,397 INFO L290 TraceCheckUtils]: 82: Hoare triple {24336#false} assume !(#t~post8 < 100);havoc #t~post8; {24336#false} is VALID [2022-04-15 15:12:08,397 INFO L290 TraceCheckUtils]: 81: Hoare triple {24336#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24336#false} is VALID [2022-04-15 15:12:08,398 INFO L290 TraceCheckUtils]: 80: Hoare triple {24533#(< 0 (+ main_~r~0 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {24336#false} is VALID [2022-04-15 15:12:08,399 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {24335#true} {24533#(< 0 (+ main_~r~0 1))} #98#return; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,399 INFO L290 TraceCheckUtils]: 78: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,399 INFO L290 TraceCheckUtils]: 77: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,399 INFO L290 TraceCheckUtils]: 76: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,399 INFO L272 TraceCheckUtils]: 75: Hoare triple {24533#(< 0 (+ main_~r~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)); {24335#true} is VALID [2022-04-15 15:12:08,399 INFO L290 TraceCheckUtils]: 74: Hoare triple {24533#(< 0 (+ main_~r~0 1))} assume !!(#t~post8 < 100);havoc #t~post8; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,400 INFO L290 TraceCheckUtils]: 73: Hoare triple {24533#(< 0 (+ main_~r~0 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,400 INFO L290 TraceCheckUtils]: 72: Hoare triple {24533#(< 0 (+ main_~r~0 1))} assume !(~r~0 > 0); {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,400 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {24335#true} {24533#(< 0 (+ main_~r~0 1))} #96#return; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,400 INFO L290 TraceCheckUtils]: 70: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,400 INFO L290 TraceCheckUtils]: 69: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,401 INFO L290 TraceCheckUtils]: 68: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,401 INFO L272 TraceCheckUtils]: 67: Hoare triple {24533#(< 0 (+ main_~r~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)); {24335#true} is VALID [2022-04-15 15:12:08,401 INFO L290 TraceCheckUtils]: 66: Hoare triple {24533#(< 0 (+ main_~r~0 1))} assume !!(#t~post7 < 100);havoc #t~post7; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,401 INFO L290 TraceCheckUtils]: 65: Hoare triple {24533#(< 0 (+ main_~r~0 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,402 INFO L290 TraceCheckUtils]: 64: Hoare triple {24388#(<= main_~v~0 1)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {24533#(< 0 (+ main_~r~0 1))} is VALID [2022-04-15 15:12:08,402 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #96#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,402 INFO L290 TraceCheckUtils]: 62: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,402 INFO L290 TraceCheckUtils]: 61: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,402 INFO L290 TraceCheckUtils]: 60: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,402 INFO L272 TraceCheckUtils]: 59: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,403 INFO L290 TraceCheckUtils]: 58: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,403 INFO L290 TraceCheckUtils]: 57: Hoare triple {24388#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,403 INFO L290 TraceCheckUtils]: 56: Hoare triple {24388#(<= main_~v~0 1)} assume !!(0 != ~r~0); {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,404 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #94#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,404 INFO L290 TraceCheckUtils]: 54: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,404 INFO L290 TraceCheckUtils]: 53: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,404 INFO L272 TraceCheckUtils]: 51: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,405 INFO L290 TraceCheckUtils]: 49: Hoare triple {24388#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,405 INFO L290 TraceCheckUtils]: 48: Hoare triple {24388#(<= main_~v~0 1)} assume !(~r~0 < 0); {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,405 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #98#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,405 INFO L290 TraceCheckUtils]: 46: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,405 INFO L290 TraceCheckUtils]: 45: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,405 INFO L290 TraceCheckUtils]: 44: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,406 INFO L272 TraceCheckUtils]: 43: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,406 INFO L290 TraceCheckUtils]: 42: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,406 INFO L290 TraceCheckUtils]: 41: Hoare triple {24388#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,406 INFO L290 TraceCheckUtils]: 40: Hoare triple {24388#(<= main_~v~0 1)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,407 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #98#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,407 INFO L290 TraceCheckUtils]: 38: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,407 INFO L290 TraceCheckUtils]: 37: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,407 INFO L290 TraceCheckUtils]: 36: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,407 INFO L272 TraceCheckUtils]: 35: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,407 INFO L290 TraceCheckUtils]: 34: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post8 < 100);havoc #t~post8; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,408 INFO L290 TraceCheckUtils]: 33: Hoare triple {24388#(<= main_~v~0 1)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,408 INFO L290 TraceCheckUtils]: 32: Hoare triple {24388#(<= main_~v~0 1)} assume !(~r~0 > 0); {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,408 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #96#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,408 INFO L290 TraceCheckUtils]: 30: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,409 INFO L290 TraceCheckUtils]: 29: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,409 INFO L290 TraceCheckUtils]: 28: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,409 INFO L272 TraceCheckUtils]: 27: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,409 INFO L290 TraceCheckUtils]: 26: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post7 < 100);havoc #t~post7; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,409 INFO L290 TraceCheckUtils]: 25: Hoare triple {24388#(<= main_~v~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,410 INFO L290 TraceCheckUtils]: 24: Hoare triple {24388#(<= main_~v~0 1)} assume !!(0 != ~r~0); {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,410 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {24335#true} {24388#(<= main_~v~0 1)} #94#return; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,410 INFO L290 TraceCheckUtils]: 22: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,410 INFO L290 TraceCheckUtils]: 20: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,410 INFO L272 TraceCheckUtils]: 19: Hoare triple {24388#(<= 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)); {24335#true} is VALID [2022-04-15 15:12:08,411 INFO L290 TraceCheckUtils]: 18: Hoare triple {24388#(<= main_~v~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,411 INFO L290 TraceCheckUtils]: 17: Hoare triple {24388#(<= main_~v~0 1)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,411 INFO L290 TraceCheckUtils]: 16: Hoare triple {24335#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {24388#(<= main_~v~0 1)} is VALID [2022-04-15 15:12:08,411 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {24335#true} {24335#true} #92#return; {24335#true} is VALID [2022-04-15 15:12:08,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L290 TraceCheckUtils]: 12: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L272 TraceCheckUtils]: 11: Hoare triple {24335#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)); {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24335#true} {24335#true} #90#return; {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L290 TraceCheckUtils]: 9: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L290 TraceCheckUtils]: 8: Hoare triple {24335#true} assume !(0 == ~cond); {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {24335#true} ~cond := #in~cond; {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L272 TraceCheckUtils]: 6: Hoare triple {24335#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L290 TraceCheckUtils]: 5: Hoare triple {24335#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; {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L272 TraceCheckUtils]: 4: Hoare triple {24335#true} call #t~ret9 := main(); {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24335#true} {24335#true} #102#return; {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L290 TraceCheckUtils]: 2: Hoare triple {24335#true} assume true; {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {24335#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; {24335#true} is VALID [2022-04-15 15:12:08,412 INFO L272 TraceCheckUtils]: 0: Hoare triple {24335#true} call ULTIMATE.init(); {24335#true} is VALID [2022-04-15 15:12:08,413 INFO L134 CoverageAnalysis]: Checked inductivity of 170 backedges. 26 proven. 16 refuted. 0 times theorem prover too weak. 128 trivial. 0 not checked. [2022-04-15 15:12:08,413 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:08,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [944142286] [2022-04-15 15:12:08,413 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:08,413 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395714844] [2022-04-15 15:12:08,413 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395714844] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:08,414 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:08,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-04-15 15:12:08,414 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:08,414 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1717906330] [2022-04-15 15:12:08,414 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1717906330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:08,414 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:08,414 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:12:08,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [542806422] [2022-04-15 15:12:08,414 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:08,415 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-15 15:12:08,415 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:08,415 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:08,462 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:08,462 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:12:08,462 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:08,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:12:08,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:12:08,462 INFO L87 Difference]: Start difference. First operand 181 states and 226 transitions. Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:09,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:09,157 INFO L93 Difference]: Finished difference Result 411 states and 546 transitions. [2022-04-15 15:12:09,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-04-15 15:12:09,158 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 89 [2022-04-15 15:12:09,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:09,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:09,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 15:12:09,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:09,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-04-15 15:12:09,161 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-04-15 15:12:09,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:09,271 INFO L225 Difference]: With dead ends: 411 [2022-04-15 15:12:09,271 INFO L226 Difference]: Without dead ends: 305 [2022-04-15 15:12:09,271 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 174 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-04-15 15:12:09,272 INFO L913 BasicCegarLoop]: 73 mSDtfsCounter, 14 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:09,272 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 145 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:12:09,273 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 305 states. [2022-04-15 15:12:09,669 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 305 to 300. [2022-04-15 15:12:09,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:09,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 305 states. Second operand has 300 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 228 states have internal predecessors, (270), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 15:12:09,670 INFO L74 IsIncluded]: Start isIncluded. First operand 305 states. Second operand has 300 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 228 states have internal predecessors, (270), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 15:12:09,670 INFO L87 Difference]: Start difference. First operand 305 states. Second operand has 300 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 228 states have internal predecessors, (270), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 15:12:09,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:09,677 INFO L93 Difference]: Finished difference Result 305 states and 404 transitions. [2022-04-15 15:12:09,678 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 404 transitions. [2022-04-15 15:12:09,678 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:09,678 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:09,679 INFO L74 IsIncluded]: Start isIncluded. First operand has 300 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 228 states have internal predecessors, (270), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 305 states. [2022-04-15 15:12:09,679 INFO L87 Difference]: Start difference. First operand has 300 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 228 states have internal predecessors, (270), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) Second operand 305 states. [2022-04-15 15:12:09,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:09,687 INFO L93 Difference]: Finished difference Result 305 states and 404 transitions. [2022-04-15 15:12:09,687 INFO L276 IsEmpty]: Start isEmpty. Operand 305 states and 404 transitions. [2022-04-15 15:12:09,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:09,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:09,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:09,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:09,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 300 states, 222 states have (on average 1.2162162162162162) internal successors, (270), 228 states have internal predecessors, (270), 65 states have call successors, (65), 14 states have call predecessors, (65), 12 states have return successors, (63), 57 states have call predecessors, (63), 63 states have call successors, (63) [2022-04-15 15:12:09,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 300 states to 300 states and 398 transitions. [2022-04-15 15:12:09,696 INFO L78 Accepts]: Start accepts. Automaton has 300 states and 398 transitions. Word has length 89 [2022-04-15 15:12:09,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:09,697 INFO L478 AbstractCegarLoop]: Abstraction has 300 states and 398 transitions. [2022-04-15 15:12:09,697 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:09,697 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 300 states and 398 transitions. [2022-04-15 15:12:10,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 398 edges. 398 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:10,766 INFO L276 IsEmpty]: Start isEmpty. Operand 300 states and 398 transitions. [2022-04-15 15:12:10,767 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2022-04-15 15:12:10,767 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:10,767 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:10,790 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (26)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:10,983 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2022-04-15 15:12:10,983 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:10,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 5 times [2022-04-15 15:12:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:10,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1654008749] [2022-04-15 15:12:10,984 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:10,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1322512306, now seen corresponding path program 6 times [2022-04-15 15:12:10,984 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:10,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [873619620] [2022-04-15 15:12:10,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:10,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:10,995 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:10,995 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [175220976] [2022-04-15 15:12:10,996 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:10,996 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:10,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:10,997 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:10,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Waiting until timeout for monitored process [2022-04-15 15:12:11,124 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 15:12:11,125 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:11,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 15:12:11,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:11,149 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:11,683 INFO L272 TraceCheckUtils]: 0: Hoare triple {26906#true} call ULTIMATE.init(); {26906#true} is VALID [2022-04-15 15:12:11,683 INFO L290 TraceCheckUtils]: 1: Hoare triple {26906#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; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,684 INFO L290 TraceCheckUtils]: 2: Hoare triple {26914#(<= ~counter~0 0)} assume true; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,684 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26914#(<= ~counter~0 0)} {26906#true} #102#return; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,684 INFO L272 TraceCheckUtils]: 4: Hoare triple {26914#(<= ~counter~0 0)} call #t~ret9 := main(); {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,685 INFO L290 TraceCheckUtils]: 5: Hoare triple {26914#(<= ~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; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,685 INFO L272 TraceCheckUtils]: 6: Hoare triple {26914#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,685 INFO L290 TraceCheckUtils]: 7: Hoare triple {26914#(<= ~counter~0 0)} ~cond := #in~cond; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {26914#(<= ~counter~0 0)} assume !(0 == ~cond); {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {26914#(<= ~counter~0 0)} assume true; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26914#(<= ~counter~0 0)} {26914#(<= ~counter~0 0)} #90#return; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,687 INFO L272 TraceCheckUtils]: 11: Hoare triple {26914#(<= ~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)); {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,687 INFO L290 TraceCheckUtils]: 12: Hoare triple {26914#(<= ~counter~0 0)} ~cond := #in~cond; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {26914#(<= ~counter~0 0)} assume !(0 == ~cond); {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {26914#(<= ~counter~0 0)} assume true; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,688 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26914#(<= ~counter~0 0)} {26914#(<= ~counter~0 0)} #92#return; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {26914#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {26914#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:11,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {26914#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {26963#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:11,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {26963#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {26963#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:11,690 INFO L272 TraceCheckUtils]: 19: Hoare triple {26963#(<= ~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)); {26963#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:11,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {26963#(<= ~counter~0 1)} ~cond := #in~cond; {26963#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:11,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {26963#(<= ~counter~0 1)} assume !(0 == ~cond); {26963#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:11,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {26963#(<= ~counter~0 1)} assume true; {26963#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:11,691 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26963#(<= ~counter~0 1)} {26963#(<= ~counter~0 1)} #94#return; {26963#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:11,692 INFO L290 TraceCheckUtils]: 24: Hoare triple {26963#(<= ~counter~0 1)} assume !!(0 != ~r~0); {26963#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:11,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {26963#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {26988#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:11,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {26988#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {26988#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:11,693 INFO L272 TraceCheckUtils]: 27: Hoare triple {26988#(<= ~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)); {26988#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:11,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {26988#(<= ~counter~0 2)} ~cond := #in~cond; {26988#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:11,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {26988#(<= ~counter~0 2)} assume !(0 == ~cond); {26988#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:11,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {26988#(<= ~counter~0 2)} assume true; {26988#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:11,694 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26988#(<= ~counter~0 2)} {26988#(<= ~counter~0 2)} #96#return; {26988#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:11,695 INFO L290 TraceCheckUtils]: 32: Hoare triple {26988#(<= ~counter~0 2)} assume !(~r~0 > 0); {26988#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:11,695 INFO L290 TraceCheckUtils]: 33: Hoare triple {26988#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27013#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:11,695 INFO L290 TraceCheckUtils]: 34: Hoare triple {27013#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {27013#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:11,696 INFO L272 TraceCheckUtils]: 35: Hoare triple {27013#(<= ~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)); {27013#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:11,696 INFO L290 TraceCheckUtils]: 36: Hoare triple {27013#(<= ~counter~0 3)} ~cond := #in~cond; {27013#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:11,696 INFO L290 TraceCheckUtils]: 37: Hoare triple {27013#(<= ~counter~0 3)} assume !(0 == ~cond); {27013#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:11,697 INFO L290 TraceCheckUtils]: 38: Hoare triple {27013#(<= ~counter~0 3)} assume true; {27013#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:11,697 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {27013#(<= ~counter~0 3)} {27013#(<= ~counter~0 3)} #98#return; {27013#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:11,697 INFO L290 TraceCheckUtils]: 40: Hoare triple {27013#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {27013#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:11,698 INFO L290 TraceCheckUtils]: 41: Hoare triple {27013#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27038#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:11,698 INFO L290 TraceCheckUtils]: 42: Hoare triple {27038#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {27038#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:11,699 INFO L272 TraceCheckUtils]: 43: Hoare triple {27038#(<= ~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)); {27038#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:11,699 INFO L290 TraceCheckUtils]: 44: Hoare triple {27038#(<= ~counter~0 4)} ~cond := #in~cond; {27038#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:11,699 INFO L290 TraceCheckUtils]: 45: Hoare triple {27038#(<= ~counter~0 4)} assume !(0 == ~cond); {27038#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:11,700 INFO L290 TraceCheckUtils]: 46: Hoare triple {27038#(<= ~counter~0 4)} assume true; {27038#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:11,700 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {27038#(<= ~counter~0 4)} {27038#(<= ~counter~0 4)} #98#return; {27038#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:11,700 INFO L290 TraceCheckUtils]: 48: Hoare triple {27038#(<= ~counter~0 4)} assume !(~r~0 < 0); {27038#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:11,701 INFO L290 TraceCheckUtils]: 49: Hoare triple {27038#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27063#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:11,701 INFO L290 TraceCheckUtils]: 50: Hoare triple {27063#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {27063#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:11,702 INFO L272 TraceCheckUtils]: 51: Hoare triple {27063#(<= ~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)); {27063#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:11,702 INFO L290 TraceCheckUtils]: 52: Hoare triple {27063#(<= ~counter~0 5)} ~cond := #in~cond; {27063#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:11,702 INFO L290 TraceCheckUtils]: 53: Hoare triple {27063#(<= ~counter~0 5)} assume !(0 == ~cond); {27063#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:11,702 INFO L290 TraceCheckUtils]: 54: Hoare triple {27063#(<= ~counter~0 5)} assume true; {27063#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:11,703 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {27063#(<= ~counter~0 5)} {27063#(<= ~counter~0 5)} #94#return; {27063#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:11,703 INFO L290 TraceCheckUtils]: 56: Hoare triple {27063#(<= ~counter~0 5)} assume !!(0 != ~r~0); {27063#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:11,704 INFO L290 TraceCheckUtils]: 57: Hoare triple {27063#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27088#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:11,704 INFO L290 TraceCheckUtils]: 58: Hoare triple {27088#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {27088#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:11,705 INFO L272 TraceCheckUtils]: 59: Hoare triple {27088#(<= ~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)); {27088#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:11,705 INFO L290 TraceCheckUtils]: 60: Hoare triple {27088#(<= ~counter~0 6)} ~cond := #in~cond; {27088#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:11,705 INFO L290 TraceCheckUtils]: 61: Hoare triple {27088#(<= ~counter~0 6)} assume !(0 == ~cond); {27088#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:11,705 INFO L290 TraceCheckUtils]: 62: Hoare triple {27088#(<= ~counter~0 6)} assume true; {27088#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:11,706 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {27088#(<= ~counter~0 6)} {27088#(<= ~counter~0 6)} #96#return; {27088#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:11,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {27088#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {27088#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:11,707 INFO L290 TraceCheckUtils]: 65: Hoare triple {27088#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27113#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:11,707 INFO L290 TraceCheckUtils]: 66: Hoare triple {27113#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {27113#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:11,708 INFO L272 TraceCheckUtils]: 67: Hoare triple {27113#(<= ~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)); {27113#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:11,708 INFO L290 TraceCheckUtils]: 68: Hoare triple {27113#(<= ~counter~0 7)} ~cond := #in~cond; {27113#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:11,708 INFO L290 TraceCheckUtils]: 69: Hoare triple {27113#(<= ~counter~0 7)} assume !(0 == ~cond); {27113#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:11,708 INFO L290 TraceCheckUtils]: 70: Hoare triple {27113#(<= ~counter~0 7)} assume true; {27113#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:11,709 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {27113#(<= ~counter~0 7)} {27113#(<= ~counter~0 7)} #96#return; {27113#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:11,709 INFO L290 TraceCheckUtils]: 72: Hoare triple {27113#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {27113#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:11,710 INFO L290 TraceCheckUtils]: 73: Hoare triple {27113#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27138#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:11,710 INFO L290 TraceCheckUtils]: 74: Hoare triple {27138#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {27138#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:11,710 INFO L272 TraceCheckUtils]: 75: Hoare triple {27138#(<= ~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)); {27138#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:11,711 INFO L290 TraceCheckUtils]: 76: Hoare triple {27138#(<= ~counter~0 8)} ~cond := #in~cond; {27138#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:11,711 INFO L290 TraceCheckUtils]: 77: Hoare triple {27138#(<= ~counter~0 8)} assume !(0 == ~cond); {27138#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:11,711 INFO L290 TraceCheckUtils]: 78: Hoare triple {27138#(<= ~counter~0 8)} assume true; {27138#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:11,712 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {27138#(<= ~counter~0 8)} {27138#(<= ~counter~0 8)} #96#return; {27138#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:11,712 INFO L290 TraceCheckUtils]: 80: Hoare triple {27138#(<= ~counter~0 8)} assume !(~r~0 > 0); {27138#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:11,712 INFO L290 TraceCheckUtils]: 81: Hoare triple {27138#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27163#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:11,713 INFO L290 TraceCheckUtils]: 82: Hoare triple {27163#(<= ~counter~0 9)} assume !(#t~post8 < 100);havoc #t~post8; {27163#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:11,713 INFO L290 TraceCheckUtils]: 83: Hoare triple {27163#(<= ~counter~0 9)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27170#(<= |main_#t~post6| 9)} is VALID [2022-04-15 15:12:11,713 INFO L290 TraceCheckUtils]: 84: Hoare triple {27170#(<= |main_#t~post6| 9)} assume !(#t~post6 < 100);havoc #t~post6; {26907#false} is VALID [2022-04-15 15:12:11,714 INFO L272 TraceCheckUtils]: 85: Hoare triple {26907#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)); {26907#false} is VALID [2022-04-15 15:12:11,714 INFO L290 TraceCheckUtils]: 86: Hoare triple {26907#false} ~cond := #in~cond; {26907#false} is VALID [2022-04-15 15:12:11,714 INFO L290 TraceCheckUtils]: 87: Hoare triple {26907#false} assume 0 == ~cond; {26907#false} is VALID [2022-04-15 15:12:11,714 INFO L290 TraceCheckUtils]: 88: Hoare triple {26907#false} assume !false; {26907#false} is VALID [2022-04-15 15:12:11,714 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:11,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:12,229 INFO L290 TraceCheckUtils]: 88: Hoare triple {26907#false} assume !false; {26907#false} is VALID [2022-04-15 15:12:12,229 INFO L290 TraceCheckUtils]: 87: Hoare triple {26907#false} assume 0 == ~cond; {26907#false} is VALID [2022-04-15 15:12:12,229 INFO L290 TraceCheckUtils]: 86: Hoare triple {26907#false} ~cond := #in~cond; {26907#false} is VALID [2022-04-15 15:12:12,230 INFO L272 TraceCheckUtils]: 85: Hoare triple {26907#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)); {26907#false} is VALID [2022-04-15 15:12:12,230 INFO L290 TraceCheckUtils]: 84: Hoare triple {27198#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {26907#false} is VALID [2022-04-15 15:12:12,230 INFO L290 TraceCheckUtils]: 83: Hoare triple {27202#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27198#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:12:12,230 INFO L290 TraceCheckUtils]: 82: Hoare triple {27202#(< ~counter~0 100)} assume !(#t~post8 < 100);havoc #t~post8; {27202#(< ~counter~0 100)} is VALID [2022-04-15 15:12:12,233 INFO L290 TraceCheckUtils]: 81: Hoare triple {27209#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27202#(< ~counter~0 100)} is VALID [2022-04-15 15:12:12,235 INFO L290 TraceCheckUtils]: 80: Hoare triple {27209#(< ~counter~0 99)} assume !(~r~0 > 0); {27209#(< ~counter~0 99)} is VALID [2022-04-15 15:12:12,236 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {26906#true} {27209#(< ~counter~0 99)} #96#return; {27209#(< ~counter~0 99)} is VALID [2022-04-15 15:12:12,236 INFO L290 TraceCheckUtils]: 78: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,236 INFO L290 TraceCheckUtils]: 77: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,236 INFO L290 TraceCheckUtils]: 76: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,236 INFO L272 TraceCheckUtils]: 75: Hoare triple {27209#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26906#true} is VALID [2022-04-15 15:12:12,237 INFO L290 TraceCheckUtils]: 74: Hoare triple {27209#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {27209#(< ~counter~0 99)} is VALID [2022-04-15 15:12:12,237 INFO L290 TraceCheckUtils]: 73: Hoare triple {27234#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27209#(< ~counter~0 99)} is VALID [2022-04-15 15:12:12,238 INFO L290 TraceCheckUtils]: 72: Hoare triple {27234#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {27234#(< ~counter~0 98)} is VALID [2022-04-15 15:12:12,238 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {26906#true} {27234#(< ~counter~0 98)} #96#return; {27234#(< ~counter~0 98)} is VALID [2022-04-15 15:12:12,238 INFO L290 TraceCheckUtils]: 70: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,238 INFO L290 TraceCheckUtils]: 69: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,239 INFO L290 TraceCheckUtils]: 68: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,239 INFO L272 TraceCheckUtils]: 67: Hoare triple {27234#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26906#true} is VALID [2022-04-15 15:12:12,239 INFO L290 TraceCheckUtils]: 66: Hoare triple {27234#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {27234#(< ~counter~0 98)} is VALID [2022-04-15 15:12:12,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {27259#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27234#(< ~counter~0 98)} is VALID [2022-04-15 15:12:12,240 INFO L290 TraceCheckUtils]: 64: Hoare triple {27259#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {27259#(< ~counter~0 97)} is VALID [2022-04-15 15:12:12,241 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {26906#true} {27259#(< ~counter~0 97)} #96#return; {27259#(< ~counter~0 97)} is VALID [2022-04-15 15:12:12,241 INFO L290 TraceCheckUtils]: 62: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,241 INFO L290 TraceCheckUtils]: 61: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,241 INFO L290 TraceCheckUtils]: 60: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,241 INFO L272 TraceCheckUtils]: 59: Hoare triple {27259#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26906#true} is VALID [2022-04-15 15:12:12,241 INFO L290 TraceCheckUtils]: 58: Hoare triple {27259#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {27259#(< ~counter~0 97)} is VALID [2022-04-15 15:12:12,242 INFO L290 TraceCheckUtils]: 57: Hoare triple {27284#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27259#(< ~counter~0 97)} is VALID [2022-04-15 15:12:12,242 INFO L290 TraceCheckUtils]: 56: Hoare triple {27284#(< ~counter~0 96)} assume !!(0 != ~r~0); {27284#(< ~counter~0 96)} is VALID [2022-04-15 15:12:12,242 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {26906#true} {27284#(< ~counter~0 96)} #94#return; {27284#(< ~counter~0 96)} is VALID [2022-04-15 15:12:12,242 INFO L290 TraceCheckUtils]: 54: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,243 INFO L290 TraceCheckUtils]: 53: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,243 INFO L290 TraceCheckUtils]: 52: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,243 INFO L272 TraceCheckUtils]: 51: Hoare triple {27284#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26906#true} is VALID [2022-04-15 15:12:12,243 INFO L290 TraceCheckUtils]: 50: Hoare triple {27284#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {27284#(< ~counter~0 96)} is VALID [2022-04-15 15:12:12,243 INFO L290 TraceCheckUtils]: 49: Hoare triple {27309#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27284#(< ~counter~0 96)} is VALID [2022-04-15 15:12:12,244 INFO L290 TraceCheckUtils]: 48: Hoare triple {27309#(< ~counter~0 95)} assume !(~r~0 < 0); {27309#(< ~counter~0 95)} is VALID [2022-04-15 15:12:12,244 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {26906#true} {27309#(< ~counter~0 95)} #98#return; {27309#(< ~counter~0 95)} is VALID [2022-04-15 15:12:12,244 INFO L290 TraceCheckUtils]: 46: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,244 INFO L290 TraceCheckUtils]: 45: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,244 INFO L290 TraceCheckUtils]: 44: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,245 INFO L272 TraceCheckUtils]: 43: Hoare triple {27309#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26906#true} is VALID [2022-04-15 15:12:12,245 INFO L290 TraceCheckUtils]: 42: Hoare triple {27309#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {27309#(< ~counter~0 95)} is VALID [2022-04-15 15:12:12,245 INFO L290 TraceCheckUtils]: 41: Hoare triple {27334#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27309#(< ~counter~0 95)} is VALID [2022-04-15 15:12:12,246 INFO L290 TraceCheckUtils]: 40: Hoare triple {27334#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {27334#(< ~counter~0 94)} is VALID [2022-04-15 15:12:12,246 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {26906#true} {27334#(< ~counter~0 94)} #98#return; {27334#(< ~counter~0 94)} is VALID [2022-04-15 15:12:12,246 INFO L290 TraceCheckUtils]: 38: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,247 INFO L290 TraceCheckUtils]: 37: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,247 INFO L290 TraceCheckUtils]: 36: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,247 INFO L272 TraceCheckUtils]: 35: Hoare triple {27334#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26906#true} is VALID [2022-04-15 15:12:12,247 INFO L290 TraceCheckUtils]: 34: Hoare triple {27334#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {27334#(< ~counter~0 94)} is VALID [2022-04-15 15:12:12,247 INFO L290 TraceCheckUtils]: 33: Hoare triple {27359#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {27334#(< ~counter~0 94)} is VALID [2022-04-15 15:12:12,248 INFO L290 TraceCheckUtils]: 32: Hoare triple {27359#(< ~counter~0 93)} assume !(~r~0 > 0); {27359#(< ~counter~0 93)} is VALID [2022-04-15 15:12:12,249 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {26906#true} {27359#(< ~counter~0 93)} #96#return; {27359#(< ~counter~0 93)} is VALID [2022-04-15 15:12:12,249 INFO L290 TraceCheckUtils]: 30: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,249 INFO L290 TraceCheckUtils]: 29: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,249 INFO L290 TraceCheckUtils]: 28: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,249 INFO L272 TraceCheckUtils]: 27: Hoare triple {27359#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26906#true} is VALID [2022-04-15 15:12:12,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {27359#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {27359#(< ~counter~0 93)} is VALID [2022-04-15 15:12:12,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {27384#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {27359#(< ~counter~0 93)} is VALID [2022-04-15 15:12:12,251 INFO L290 TraceCheckUtils]: 24: Hoare triple {27384#(< ~counter~0 92)} assume !!(0 != ~r~0); {27384#(< ~counter~0 92)} is VALID [2022-04-15 15:12:12,252 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {26906#true} {27384#(< ~counter~0 92)} #94#return; {27384#(< ~counter~0 92)} is VALID [2022-04-15 15:12:12,252 INFO L290 TraceCheckUtils]: 22: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,252 INFO L290 TraceCheckUtils]: 21: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,252 INFO L290 TraceCheckUtils]: 20: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,252 INFO L272 TraceCheckUtils]: 19: Hoare triple {27384#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {26906#true} is VALID [2022-04-15 15:12:12,252 INFO L290 TraceCheckUtils]: 18: Hoare triple {27384#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {27384#(< ~counter~0 92)} is VALID [2022-04-15 15:12:12,253 INFO L290 TraceCheckUtils]: 17: Hoare triple {27409#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {27384#(< ~counter~0 92)} is VALID [2022-04-15 15:12:12,253 INFO L290 TraceCheckUtils]: 16: Hoare triple {27409#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {27409#(< ~counter~0 91)} is VALID [2022-04-15 15:12:12,253 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {26906#true} {27409#(< ~counter~0 91)} #92#return; {27409#(< ~counter~0 91)} is VALID [2022-04-15 15:12:12,253 INFO L290 TraceCheckUtils]: 14: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,253 INFO L290 TraceCheckUtils]: 13: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,254 INFO L290 TraceCheckUtils]: 12: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,254 INFO L272 TraceCheckUtils]: 11: Hoare triple {27409#(< ~counter~0 91)} 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)); {26906#true} is VALID [2022-04-15 15:12:12,254 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26906#true} {27409#(< ~counter~0 91)} #90#return; {27409#(< ~counter~0 91)} is VALID [2022-04-15 15:12:12,254 INFO L290 TraceCheckUtils]: 9: Hoare triple {26906#true} assume true; {26906#true} is VALID [2022-04-15 15:12:12,254 INFO L290 TraceCheckUtils]: 8: Hoare triple {26906#true} assume !(0 == ~cond); {26906#true} is VALID [2022-04-15 15:12:12,254 INFO L290 TraceCheckUtils]: 7: Hoare triple {26906#true} ~cond := #in~cond; {26906#true} is VALID [2022-04-15 15:12:12,254 INFO L272 TraceCheckUtils]: 6: Hoare triple {27409#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {26906#true} is VALID [2022-04-15 15:12:12,255 INFO L290 TraceCheckUtils]: 5: Hoare triple {27409#(< ~counter~0 91)} 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; {27409#(< ~counter~0 91)} is VALID [2022-04-15 15:12:12,255 INFO L272 TraceCheckUtils]: 4: Hoare triple {27409#(< ~counter~0 91)} call #t~ret9 := main(); {27409#(< ~counter~0 91)} is VALID [2022-04-15 15:12:12,255 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {27409#(< ~counter~0 91)} {26906#true} #102#return; {27409#(< ~counter~0 91)} is VALID [2022-04-15 15:12:12,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {27409#(< ~counter~0 91)} assume true; {27409#(< ~counter~0 91)} is VALID [2022-04-15 15:12:12,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {26906#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; {27409#(< ~counter~0 91)} is VALID [2022-04-15 15:12:12,256 INFO L272 TraceCheckUtils]: 0: Hoare triple {26906#true} call ULTIMATE.init(); {26906#true} is VALID [2022-04-15 15:12:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 16 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 15:12:12,256 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:12,256 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [873619620] [2022-04-15 15:12:12,257 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:12,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [175220976] [2022-04-15 15:12:12,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [175220976] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:12,257 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:12,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 15:12:12,257 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:12,257 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1654008749] [2022-04-15 15:12:12,257 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1654008749] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:12,257 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:12,257 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:12:12,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [110297394] [2022-04-15 15:12:12,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:12,258 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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 89 [2022-04-15 15:12:12,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:12,258 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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-15 15:12:12,317 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:12,317 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:12:12,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:12,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:12:12,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:12:12,318 INFO L87 Difference]: Start difference. First operand 300 states and 398 transitions. Second operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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-15 15:12:13,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:13,547 INFO L93 Difference]: Finished difference Result 366 states and 489 transitions. [2022-04-15 15:12:13,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 15:12:13,547 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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 89 [2022-04-15 15:12:13,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:13,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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-15 15:12:13,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:12:13,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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-15 15:12:13,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:12:13,552 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 15:12:13,711 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:13,718 INFO L225 Difference]: With dead ends: 366 [2022-04-15 15:12:13,718 INFO L226 Difference]: Without dead ends: 361 [2022-04-15 15:12:13,718 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 183 GetRequests, 155 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=359, Invalid=511, Unknown=0, NotChecked=0, Total=870 [2022-04-15 15:12:13,719 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 151 mSDsluCounter, 191 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 242 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:13,720 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 248 Invalid, 242 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:12:13,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 361 states. [2022-04-15 15:12:14,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 361 to 346. [2022-04-15 15:12:14,197 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:14,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 361 states. Second operand has 346 states, 258 states have (on average 1.2286821705426356) internal successors, (317), 264 states have internal predecessors, (317), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:14,198 INFO L74 IsIncluded]: Start isIncluded. First operand 361 states. Second operand has 346 states, 258 states have (on average 1.2286821705426356) internal successors, (317), 264 states have internal predecessors, (317), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:14,199 INFO L87 Difference]: Start difference. First operand 361 states. Second operand has 346 states, 258 states have (on average 1.2286821705426356) internal successors, (317), 264 states have internal predecessors, (317), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:14,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:14,207 INFO L93 Difference]: Finished difference Result 361 states and 480 transitions. [2022-04-15 15:12:14,208 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 480 transitions. [2022-04-15 15:12:14,209 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:14,209 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:14,210 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 258 states have (on average 1.2286821705426356) internal successors, (317), 264 states have internal predecessors, (317), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 361 states. [2022-04-15 15:12:14,210 INFO L87 Difference]: Start difference. First operand has 346 states, 258 states have (on average 1.2286821705426356) internal successors, (317), 264 states have internal predecessors, (317), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 361 states. [2022-04-15 15:12:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:14,219 INFO L93 Difference]: Finished difference Result 361 states and 480 transitions. [2022-04-15 15:12:14,219 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 480 transitions. [2022-04-15 15:12:14,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:14,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:14,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:14,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 258 states have (on average 1.2286821705426356) internal successors, (317), 264 states have internal predecessors, (317), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:14,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 463 transitions. [2022-04-15 15:12:14,230 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 463 transitions. Word has length 89 [2022-04-15 15:12:14,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:14,230 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 463 transitions. [2022-04-15 15:12:14,231 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 4.769230769230769) internal successors, (62), 12 states have internal predecessors, (62), 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-15 15:12:14,231 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 346 states and 463 transitions. [2022-04-15 15:12:16,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 463 edges. 463 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:16,192 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 463 transitions. [2022-04-15 15:12:16,192 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 92 [2022-04-15 15:12:16,193 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:16,193 INFO L499 BasicCegarLoop]: trace histogram [9, 8, 8, 5, 4, 4, 4, 3, 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, 1, 1, 1, 1, 1] [2022-04-15 15:12:16,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (27)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:16,395 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2022-04-15 15:12:16,395 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:16,396 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 5 times [2022-04-15 15:12:16,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:16,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2118478373] [2022-04-15 15:12:16,396 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:16,396 INFO L85 PathProgramCache]: Analyzing trace with hash -345961389, now seen corresponding path program 6 times [2022-04-15 15:12:16,396 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:16,396 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224424466] [2022-04-15 15:12:16,396 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:16,396 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:16,421 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:16,422 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [503625691] [2022-04-15 15:12:16,422 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:16,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:16,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:16,423 INFO L229 MonitoredProcess]: Starting monitored process 28 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:16,447 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Waiting until timeout for monitored process [2022-04-15 15:12:16,581 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 6 check-sat command(s) [2022-04-15 15:12:16,582 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:16,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 21 conjunts are in the unsatisfiable core [2022-04-15 15:12:16,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:16,613 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:17,050 INFO L272 TraceCheckUtils]: 0: Hoare triple {29621#true} call ULTIMATE.init(); {29621#true} is VALID [2022-04-15 15:12:17,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {29621#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; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {29629#(<= ~counter~0 0)} assume true; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,052 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29629#(<= ~counter~0 0)} {29621#true} #102#return; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,052 INFO L272 TraceCheckUtils]: 4: Hoare triple {29629#(<= ~counter~0 0)} call #t~ret9 := main(); {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,052 INFO L290 TraceCheckUtils]: 5: Hoare triple {29629#(<= ~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; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,053 INFO L272 TraceCheckUtils]: 6: Hoare triple {29629#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,053 INFO L290 TraceCheckUtils]: 7: Hoare triple {29629#(<= ~counter~0 0)} ~cond := #in~cond; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,053 INFO L290 TraceCheckUtils]: 8: Hoare triple {29629#(<= ~counter~0 0)} assume !(0 == ~cond); {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,054 INFO L290 TraceCheckUtils]: 9: Hoare triple {29629#(<= ~counter~0 0)} assume true; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,054 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29629#(<= ~counter~0 0)} {29629#(<= ~counter~0 0)} #90#return; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,054 INFO L272 TraceCheckUtils]: 11: Hoare triple {29629#(<= ~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)); {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,055 INFO L290 TraceCheckUtils]: 12: Hoare triple {29629#(<= ~counter~0 0)} ~cond := #in~cond; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,055 INFO L290 TraceCheckUtils]: 13: Hoare triple {29629#(<= ~counter~0 0)} assume !(0 == ~cond); {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,055 INFO L290 TraceCheckUtils]: 14: Hoare triple {29629#(<= ~counter~0 0)} assume true; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,056 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29629#(<= ~counter~0 0)} {29629#(<= ~counter~0 0)} #92#return; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,056 INFO L290 TraceCheckUtils]: 16: Hoare triple {29629#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {29629#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:17,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {29629#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29678#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:17,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {29678#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {29678#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:17,058 INFO L272 TraceCheckUtils]: 19: Hoare triple {29678#(<= ~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)); {29678#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:17,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {29678#(<= ~counter~0 1)} ~cond := #in~cond; {29678#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:17,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {29678#(<= ~counter~0 1)} assume !(0 == ~cond); {29678#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:17,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {29678#(<= ~counter~0 1)} assume true; {29678#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:17,059 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29678#(<= ~counter~0 1)} {29678#(<= ~counter~0 1)} #94#return; {29678#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:17,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {29678#(<= ~counter~0 1)} assume !!(0 != ~r~0); {29678#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:17,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {29678#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29703#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:17,060 INFO L290 TraceCheckUtils]: 26: Hoare triple {29703#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {29703#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:17,061 INFO L272 TraceCheckUtils]: 27: Hoare triple {29703#(<= ~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)); {29703#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:17,061 INFO L290 TraceCheckUtils]: 28: Hoare triple {29703#(<= ~counter~0 2)} ~cond := #in~cond; {29703#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:17,061 INFO L290 TraceCheckUtils]: 29: Hoare triple {29703#(<= ~counter~0 2)} assume !(0 == ~cond); {29703#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:17,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {29703#(<= ~counter~0 2)} assume true; {29703#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:17,062 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29703#(<= ~counter~0 2)} {29703#(<= ~counter~0 2)} #96#return; {29703#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:17,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {29703#(<= ~counter~0 2)} assume !(~r~0 > 0); {29703#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:17,063 INFO L290 TraceCheckUtils]: 33: Hoare triple {29703#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29728#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:17,063 INFO L290 TraceCheckUtils]: 34: Hoare triple {29728#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {29728#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:17,064 INFO L272 TraceCheckUtils]: 35: Hoare triple {29728#(<= ~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)); {29728#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:17,064 INFO L290 TraceCheckUtils]: 36: Hoare triple {29728#(<= ~counter~0 3)} ~cond := #in~cond; {29728#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:17,064 INFO L290 TraceCheckUtils]: 37: Hoare triple {29728#(<= ~counter~0 3)} assume !(0 == ~cond); {29728#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:17,065 INFO L290 TraceCheckUtils]: 38: Hoare triple {29728#(<= ~counter~0 3)} assume true; {29728#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:17,065 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29728#(<= ~counter~0 3)} {29728#(<= ~counter~0 3)} #98#return; {29728#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:17,066 INFO L290 TraceCheckUtils]: 40: Hoare triple {29728#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {29728#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:17,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {29728#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29753#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:17,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {29753#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {29753#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:17,067 INFO L272 TraceCheckUtils]: 43: Hoare triple {29753#(<= ~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)); {29753#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:17,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {29753#(<= ~counter~0 4)} ~cond := #in~cond; {29753#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:17,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {29753#(<= ~counter~0 4)} assume !(0 == ~cond); {29753#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:17,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {29753#(<= ~counter~0 4)} assume true; {29753#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:17,068 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {29753#(<= ~counter~0 4)} {29753#(<= ~counter~0 4)} #98#return; {29753#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:17,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {29753#(<= ~counter~0 4)} assume !(~r~0 < 0); {29753#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:17,069 INFO L290 TraceCheckUtils]: 49: Hoare triple {29753#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29778#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:17,069 INFO L290 TraceCheckUtils]: 50: Hoare triple {29778#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {29778#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:17,070 INFO L272 TraceCheckUtils]: 51: Hoare triple {29778#(<= ~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)); {29778#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:17,070 INFO L290 TraceCheckUtils]: 52: Hoare triple {29778#(<= ~counter~0 5)} ~cond := #in~cond; {29778#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:17,071 INFO L290 TraceCheckUtils]: 53: Hoare triple {29778#(<= ~counter~0 5)} assume !(0 == ~cond); {29778#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:17,071 INFO L290 TraceCheckUtils]: 54: Hoare triple {29778#(<= ~counter~0 5)} assume true; {29778#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:17,071 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {29778#(<= ~counter~0 5)} {29778#(<= ~counter~0 5)} #94#return; {29778#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:17,072 INFO L290 TraceCheckUtils]: 56: Hoare triple {29778#(<= ~counter~0 5)} assume !!(0 != ~r~0); {29778#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:17,072 INFO L290 TraceCheckUtils]: 57: Hoare triple {29778#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29803#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:17,072 INFO L290 TraceCheckUtils]: 58: Hoare triple {29803#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {29803#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:17,073 INFO L272 TraceCheckUtils]: 59: Hoare triple {29803#(<= ~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)); {29803#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:17,073 INFO L290 TraceCheckUtils]: 60: Hoare triple {29803#(<= ~counter~0 6)} ~cond := #in~cond; {29803#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:17,074 INFO L290 TraceCheckUtils]: 61: Hoare triple {29803#(<= ~counter~0 6)} assume !(0 == ~cond); {29803#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:17,074 INFO L290 TraceCheckUtils]: 62: Hoare triple {29803#(<= ~counter~0 6)} assume true; {29803#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:17,074 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29803#(<= ~counter~0 6)} {29803#(<= ~counter~0 6)} #96#return; {29803#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:17,075 INFO L290 TraceCheckUtils]: 64: Hoare triple {29803#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29803#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:17,075 INFO L290 TraceCheckUtils]: 65: Hoare triple {29803#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29828#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:17,076 INFO L290 TraceCheckUtils]: 66: Hoare triple {29828#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {29828#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:17,076 INFO L272 TraceCheckUtils]: 67: Hoare triple {29828#(<= ~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)); {29828#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:17,076 INFO L290 TraceCheckUtils]: 68: Hoare triple {29828#(<= ~counter~0 7)} ~cond := #in~cond; {29828#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:17,077 INFO L290 TraceCheckUtils]: 69: Hoare triple {29828#(<= ~counter~0 7)} assume !(0 == ~cond); {29828#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:17,077 INFO L290 TraceCheckUtils]: 70: Hoare triple {29828#(<= ~counter~0 7)} assume true; {29828#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:17,077 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29828#(<= ~counter~0 7)} {29828#(<= ~counter~0 7)} #96#return; {29828#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:17,078 INFO L290 TraceCheckUtils]: 72: Hoare triple {29828#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29828#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:17,078 INFO L290 TraceCheckUtils]: 73: Hoare triple {29828#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29853#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:17,079 INFO L290 TraceCheckUtils]: 74: Hoare triple {29853#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {29853#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:17,079 INFO L272 TraceCheckUtils]: 75: Hoare triple {29853#(<= ~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)); {29853#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:17,079 INFO L290 TraceCheckUtils]: 76: Hoare triple {29853#(<= ~counter~0 8)} ~cond := #in~cond; {29853#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:17,080 INFO L290 TraceCheckUtils]: 77: Hoare triple {29853#(<= ~counter~0 8)} assume !(0 == ~cond); {29853#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:17,080 INFO L290 TraceCheckUtils]: 78: Hoare triple {29853#(<= ~counter~0 8)} assume true; {29853#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:17,080 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {29853#(<= ~counter~0 8)} {29853#(<= ~counter~0 8)} #96#return; {29853#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:17,081 INFO L290 TraceCheckUtils]: 80: Hoare triple {29853#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29853#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:17,081 INFO L290 TraceCheckUtils]: 81: Hoare triple {29853#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29878#(<= |main_#t~post7| 8)} is VALID [2022-04-15 15:12:17,081 INFO L290 TraceCheckUtils]: 82: Hoare triple {29878#(<= |main_#t~post7| 8)} assume !(#t~post7 < 100);havoc #t~post7; {29622#false} is VALID [2022-04-15 15:12:17,082 INFO L290 TraceCheckUtils]: 83: Hoare triple {29622#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29622#false} is VALID [2022-04-15 15:12:17,082 INFO L290 TraceCheckUtils]: 84: Hoare triple {29622#false} assume !(#t~post8 < 100);havoc #t~post8; {29622#false} is VALID [2022-04-15 15:12:17,082 INFO L290 TraceCheckUtils]: 85: Hoare triple {29622#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29622#false} is VALID [2022-04-15 15:12:17,082 INFO L290 TraceCheckUtils]: 86: Hoare triple {29622#false} assume !(#t~post6 < 100);havoc #t~post6; {29622#false} is VALID [2022-04-15 15:12:17,082 INFO L272 TraceCheckUtils]: 87: Hoare triple {29622#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)); {29622#false} is VALID [2022-04-15 15:12:17,082 INFO L290 TraceCheckUtils]: 88: Hoare triple {29622#false} ~cond := #in~cond; {29622#false} is VALID [2022-04-15 15:12:17,082 INFO L290 TraceCheckUtils]: 89: Hoare triple {29622#false} assume 0 == ~cond; {29622#false} is VALID [2022-04-15 15:12:17,082 INFO L290 TraceCheckUtils]: 90: Hoare triple {29622#false} assume !false; {29622#false} is VALID [2022-04-15 15:12:17,082 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 152 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:17,082 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:17,546 INFO L290 TraceCheckUtils]: 90: Hoare triple {29622#false} assume !false; {29622#false} is VALID [2022-04-15 15:12:17,546 INFO L290 TraceCheckUtils]: 89: Hoare triple {29622#false} assume 0 == ~cond; {29622#false} is VALID [2022-04-15 15:12:17,546 INFO L290 TraceCheckUtils]: 88: Hoare triple {29622#false} ~cond := #in~cond; {29622#false} is VALID [2022-04-15 15:12:17,546 INFO L272 TraceCheckUtils]: 87: Hoare triple {29622#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)); {29622#false} is VALID [2022-04-15 15:12:17,546 INFO L290 TraceCheckUtils]: 86: Hoare triple {29622#false} assume !(#t~post6 < 100);havoc #t~post6; {29622#false} is VALID [2022-04-15 15:12:17,546 INFO L290 TraceCheckUtils]: 85: Hoare triple {29622#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {29622#false} is VALID [2022-04-15 15:12:17,546 INFO L290 TraceCheckUtils]: 84: Hoare triple {29622#false} assume !(#t~post8 < 100);havoc #t~post8; {29622#false} is VALID [2022-04-15 15:12:17,546 INFO L290 TraceCheckUtils]: 83: Hoare triple {29622#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {29622#false} is VALID [2022-04-15 15:12:17,547 INFO L290 TraceCheckUtils]: 82: Hoare triple {29930#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {29622#false} is VALID [2022-04-15 15:12:17,547 INFO L290 TraceCheckUtils]: 81: Hoare triple {29934#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29930#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:12:17,547 INFO L290 TraceCheckUtils]: 80: Hoare triple {29934#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29934#(< ~counter~0 100)} is VALID [2022-04-15 15:12:17,548 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {29621#true} {29934#(< ~counter~0 100)} #96#return; {29934#(< ~counter~0 100)} is VALID [2022-04-15 15:12:17,548 INFO L290 TraceCheckUtils]: 78: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,548 INFO L290 TraceCheckUtils]: 77: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,548 INFO L290 TraceCheckUtils]: 76: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,548 INFO L272 TraceCheckUtils]: 75: Hoare triple {29934#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29621#true} is VALID [2022-04-15 15:12:17,548 INFO L290 TraceCheckUtils]: 74: Hoare triple {29934#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {29934#(< ~counter~0 100)} is VALID [2022-04-15 15:12:17,549 INFO L290 TraceCheckUtils]: 73: Hoare triple {29959#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29934#(< ~counter~0 100)} is VALID [2022-04-15 15:12:17,550 INFO L290 TraceCheckUtils]: 72: Hoare triple {29959#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29959#(< ~counter~0 99)} is VALID [2022-04-15 15:12:17,550 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {29621#true} {29959#(< ~counter~0 99)} #96#return; {29959#(< ~counter~0 99)} is VALID [2022-04-15 15:12:17,550 INFO L290 TraceCheckUtils]: 70: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,550 INFO L290 TraceCheckUtils]: 69: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,550 INFO L290 TraceCheckUtils]: 68: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,550 INFO L272 TraceCheckUtils]: 67: Hoare triple {29959#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29621#true} is VALID [2022-04-15 15:12:17,551 INFO L290 TraceCheckUtils]: 66: Hoare triple {29959#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {29959#(< ~counter~0 99)} is VALID [2022-04-15 15:12:17,551 INFO L290 TraceCheckUtils]: 65: Hoare triple {29984#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29959#(< ~counter~0 99)} is VALID [2022-04-15 15:12:17,551 INFO L290 TraceCheckUtils]: 64: Hoare triple {29984#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {29984#(< ~counter~0 98)} is VALID [2022-04-15 15:12:17,552 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {29621#true} {29984#(< ~counter~0 98)} #96#return; {29984#(< ~counter~0 98)} is VALID [2022-04-15 15:12:17,552 INFO L290 TraceCheckUtils]: 62: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,552 INFO L290 TraceCheckUtils]: 61: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,552 INFO L290 TraceCheckUtils]: 60: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,552 INFO L272 TraceCheckUtils]: 59: Hoare triple {29984#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29621#true} is VALID [2022-04-15 15:12:17,553 INFO L290 TraceCheckUtils]: 58: Hoare triple {29984#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {29984#(< ~counter~0 98)} is VALID [2022-04-15 15:12:17,553 INFO L290 TraceCheckUtils]: 57: Hoare triple {30009#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {29984#(< ~counter~0 98)} is VALID [2022-04-15 15:12:17,553 INFO L290 TraceCheckUtils]: 56: Hoare triple {30009#(< ~counter~0 97)} assume !!(0 != ~r~0); {30009#(< ~counter~0 97)} is VALID [2022-04-15 15:12:17,554 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {29621#true} {30009#(< ~counter~0 97)} #94#return; {30009#(< ~counter~0 97)} is VALID [2022-04-15 15:12:17,554 INFO L290 TraceCheckUtils]: 54: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,554 INFO L290 TraceCheckUtils]: 53: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,554 INFO L290 TraceCheckUtils]: 52: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,554 INFO L272 TraceCheckUtils]: 51: Hoare triple {30009#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29621#true} is VALID [2022-04-15 15:12:17,554 INFO L290 TraceCheckUtils]: 50: Hoare triple {30009#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {30009#(< ~counter~0 97)} is VALID [2022-04-15 15:12:17,555 INFO L290 TraceCheckUtils]: 49: Hoare triple {30034#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30009#(< ~counter~0 97)} is VALID [2022-04-15 15:12:17,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {30034#(< ~counter~0 96)} assume !(~r~0 < 0); {30034#(< ~counter~0 96)} is VALID [2022-04-15 15:12:17,556 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {29621#true} {30034#(< ~counter~0 96)} #98#return; {30034#(< ~counter~0 96)} is VALID [2022-04-15 15:12:17,556 INFO L290 TraceCheckUtils]: 46: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,556 INFO L290 TraceCheckUtils]: 45: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,556 INFO L290 TraceCheckUtils]: 44: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,556 INFO L272 TraceCheckUtils]: 43: Hoare triple {30034#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29621#true} is VALID [2022-04-15 15:12:17,556 INFO L290 TraceCheckUtils]: 42: Hoare triple {30034#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {30034#(< ~counter~0 96)} is VALID [2022-04-15 15:12:17,557 INFO L290 TraceCheckUtils]: 41: Hoare triple {30059#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30034#(< ~counter~0 96)} is VALID [2022-04-15 15:12:17,557 INFO L290 TraceCheckUtils]: 40: Hoare triple {30059#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {30059#(< ~counter~0 95)} is VALID [2022-04-15 15:12:17,558 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {29621#true} {30059#(< ~counter~0 95)} #98#return; {30059#(< ~counter~0 95)} is VALID [2022-04-15 15:12:17,558 INFO L290 TraceCheckUtils]: 38: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,558 INFO L290 TraceCheckUtils]: 37: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,558 INFO L290 TraceCheckUtils]: 36: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,558 INFO L272 TraceCheckUtils]: 35: Hoare triple {30059#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29621#true} is VALID [2022-04-15 15:12:17,558 INFO L290 TraceCheckUtils]: 34: Hoare triple {30059#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {30059#(< ~counter~0 95)} is VALID [2022-04-15 15:12:17,559 INFO L290 TraceCheckUtils]: 33: Hoare triple {30084#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {30059#(< ~counter~0 95)} is VALID [2022-04-15 15:12:17,559 INFO L290 TraceCheckUtils]: 32: Hoare triple {30084#(< ~counter~0 94)} assume !(~r~0 > 0); {30084#(< ~counter~0 94)} is VALID [2022-04-15 15:12:17,560 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {29621#true} {30084#(< ~counter~0 94)} #96#return; {30084#(< ~counter~0 94)} is VALID [2022-04-15 15:12:17,560 INFO L290 TraceCheckUtils]: 30: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,560 INFO L290 TraceCheckUtils]: 29: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,560 INFO L290 TraceCheckUtils]: 28: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,560 INFO L272 TraceCheckUtils]: 27: Hoare triple {30084#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29621#true} is VALID [2022-04-15 15:12:17,560 INFO L290 TraceCheckUtils]: 26: Hoare triple {30084#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {30084#(< ~counter~0 94)} is VALID [2022-04-15 15:12:17,561 INFO L290 TraceCheckUtils]: 25: Hoare triple {30109#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {30084#(< ~counter~0 94)} is VALID [2022-04-15 15:12:17,561 INFO L290 TraceCheckUtils]: 24: Hoare triple {30109#(< ~counter~0 93)} assume !!(0 != ~r~0); {30109#(< ~counter~0 93)} is VALID [2022-04-15 15:12:17,562 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {29621#true} {30109#(< ~counter~0 93)} #94#return; {30109#(< ~counter~0 93)} is VALID [2022-04-15 15:12:17,562 INFO L290 TraceCheckUtils]: 22: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,562 INFO L290 TraceCheckUtils]: 21: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,562 INFO L290 TraceCheckUtils]: 20: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,562 INFO L272 TraceCheckUtils]: 19: Hoare triple {30109#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {29621#true} is VALID [2022-04-15 15:12:17,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {30109#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {30109#(< ~counter~0 93)} is VALID [2022-04-15 15:12:17,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {30134#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {30109#(< ~counter~0 93)} is VALID [2022-04-15 15:12:17,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {30134#(< ~counter~0 92)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {30134#(< ~counter~0 92)} is VALID [2022-04-15 15:12:17,575 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {29621#true} {30134#(< ~counter~0 92)} #92#return; {30134#(< ~counter~0 92)} is VALID [2022-04-15 15:12:17,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,576 INFO L290 TraceCheckUtils]: 13: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,576 INFO L290 TraceCheckUtils]: 12: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,576 INFO L272 TraceCheckUtils]: 11: Hoare triple {30134#(< ~counter~0 92)} 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)); {29621#true} is VALID [2022-04-15 15:12:17,576 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29621#true} {30134#(< ~counter~0 92)} #90#return; {30134#(< ~counter~0 92)} is VALID [2022-04-15 15:12:17,576 INFO L290 TraceCheckUtils]: 9: Hoare triple {29621#true} assume true; {29621#true} is VALID [2022-04-15 15:12:17,577 INFO L290 TraceCheckUtils]: 8: Hoare triple {29621#true} assume !(0 == ~cond); {29621#true} is VALID [2022-04-15 15:12:17,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {29621#true} ~cond := #in~cond; {29621#true} is VALID [2022-04-15 15:12:17,577 INFO L272 TraceCheckUtils]: 6: Hoare triple {30134#(< ~counter~0 92)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {29621#true} is VALID [2022-04-15 15:12:17,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {30134#(< ~counter~0 92)} 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; {30134#(< ~counter~0 92)} is VALID [2022-04-15 15:12:17,578 INFO L272 TraceCheckUtils]: 4: Hoare triple {30134#(< ~counter~0 92)} call #t~ret9 := main(); {30134#(< ~counter~0 92)} is VALID [2022-04-15 15:12:17,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {30134#(< ~counter~0 92)} {29621#true} #102#return; {30134#(< ~counter~0 92)} is VALID [2022-04-15 15:12:17,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {30134#(< ~counter~0 92)} assume true; {30134#(< ~counter~0 92)} is VALID [2022-04-15 15:12:17,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {29621#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; {30134#(< ~counter~0 92)} is VALID [2022-04-15 15:12:17,579 INFO L272 TraceCheckUtils]: 0: Hoare triple {29621#true} call ULTIMATE.init(); {29621#true} is VALID [2022-04-15 15:12:17,579 INFO L134 CoverageAnalysis]: Checked inductivity of 180 backedges. 24 proven. 40 refuted. 0 times theorem prover too weak. 116 trivial. 0 not checked. [2022-04-15 15:12:17,580 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:17,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224424466] [2022-04-15 15:12:17,580 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:17,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503625691] [2022-04-15 15:12:17,580 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503625691] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:17,580 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:17,580 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 22 [2022-04-15 15:12:17,580 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:17,580 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2118478373] [2022-04-15 15:12:17,581 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2118478373] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:17,581 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:17,581 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-04-15 15:12:17,581 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1439951092] [2022-04-15 15:12:17,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:17,581 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 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 91 [2022-04-15 15:12:17,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:17,582 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 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-15 15:12:17,658 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:17,658 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-04-15 15:12:17,658 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:17,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-04-15 15:12:17,659 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=195, Invalid=267, Unknown=0, NotChecked=0, Total=462 [2022-04-15 15:12:17,659 INFO L87 Difference]: Start difference. First operand 346 states and 463 transitions. Second operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 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-15 15:12:18,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:18,642 INFO L93 Difference]: Finished difference Result 431 states and 588 transitions. [2022-04-15 15:12:18,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-04-15 15:12:18,642 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 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 91 [2022-04-15 15:12:18,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:18,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 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-15 15:12:18,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:12:18,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 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-15 15:12:18,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 197 transitions. [2022-04-15 15:12:18,647 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 19 states and 197 transitions. [2022-04-15 15:12:18,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:18,801 INFO L225 Difference]: With dead ends: 431 [2022-04-15 15:12:18,801 INFO L226 Difference]: Without dead ends: 346 [2022-04-15 15:12:18,802 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=335, Invalid=477, Unknown=0, NotChecked=0, Total=812 [2022-04-15 15:12:18,802 INFO L913 BasicCegarLoop]: 54 mSDtfsCounter, 97 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:18,802 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 224 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:12:18,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2022-04-15 15:12:19,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 346. [2022-04-15 15:12:19,295 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:19,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 346 states. Second operand has 346 states, 258 states have (on average 1.2131782945736433) internal successors, (313), 264 states have internal predecessors, (313), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:19,296 INFO L74 IsIncluded]: Start isIncluded. First operand 346 states. Second operand has 346 states, 258 states have (on average 1.2131782945736433) internal successors, (313), 264 states have internal predecessors, (313), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:19,297 INFO L87 Difference]: Start difference. First operand 346 states. Second operand has 346 states, 258 states have (on average 1.2131782945736433) internal successors, (313), 264 states have internal predecessors, (313), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:19,304 INFO L93 Difference]: Finished difference Result 346 states and 459 transitions. [2022-04-15 15:12:19,304 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 459 transitions. [2022-04-15 15:12:19,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:19,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:19,306 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 258 states have (on average 1.2131782945736433) internal successors, (313), 264 states have internal predecessors, (313), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 346 states. [2022-04-15 15:12:19,306 INFO L87 Difference]: Start difference. First operand has 346 states, 258 states have (on average 1.2131782945736433) internal successors, (313), 264 states have internal predecessors, (313), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) Second operand 346 states. [2022-04-15 15:12:19,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:19,314 INFO L93 Difference]: Finished difference Result 346 states and 459 transitions. [2022-04-15 15:12:19,314 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 459 transitions. [2022-04-15 15:12:19,315 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:19,315 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:19,315 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:19,315 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:19,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 258 states have (on average 1.2131782945736433) internal successors, (313), 264 states have internal predecessors, (313), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 66 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:19,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 459 transitions. [2022-04-15 15:12:19,326 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 459 transitions. Word has length 91 [2022-04-15 15:12:19,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:19,326 INFO L478 AbstractCegarLoop]: Abstraction has 346 states and 459 transitions. [2022-04-15 15:12:19,326 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 5.333333333333333) internal successors, (64), 11 states have internal predecessors, (64), 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-15 15:12:19,327 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 346 states and 459 transitions. [2022-04-15 15:12:20,898 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 459 edges. 459 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:20,899 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 459 transitions. [2022-04-15 15:12:20,903 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2022-04-15 15:12:20,904 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:20,904 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 4, 4, 3, 3, 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, 1, 1] [2022-04-15 15:12:20,909 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (28)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:21,108 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2022-04-15 15:12:21,109 INFO L403 AbstractCegarLoop]: === Iteration 28 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:21,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:21,109 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 7 times [2022-04-15 15:12:21,109 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:21,109 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [382435899] [2022-04-15 15:12:21,110 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:21,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1660747519, now seen corresponding path program 8 times [2022-04-15 15:12:21,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:21,110 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746423069] [2022-04-15 15:12:21,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:21,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:21,128 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:21,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [597459056] [2022-04-15 15:12:21,129 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:21,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:21,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:21,130 INFO L229 MonitoredProcess]: Starting monitored process 29 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:21,134 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Waiting until timeout for monitored process [2022-04-15 15:12:21,187 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:21,187 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:21,189 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 15:12:21,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:21,207 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:21,740 INFO L272 TraceCheckUtils]: 0: Hoare triple {32448#true} call ULTIMATE.init(); {32448#true} is VALID [2022-04-15 15:12:21,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {32448#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; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {32456#(<= ~counter~0 0)} assume true; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,741 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32456#(<= ~counter~0 0)} {32448#true} #102#return; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {32456#(<= ~counter~0 0)} call #t~ret9 := main(); {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {32456#(<= ~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; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,742 INFO L272 TraceCheckUtils]: 6: Hoare triple {32456#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {32456#(<= ~counter~0 0)} ~cond := #in~cond; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {32456#(<= ~counter~0 0)} assume !(0 == ~cond); {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,743 INFO L290 TraceCheckUtils]: 9: Hoare triple {32456#(<= ~counter~0 0)} assume true; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,743 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32456#(<= ~counter~0 0)} {32456#(<= ~counter~0 0)} #90#return; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,744 INFO L272 TraceCheckUtils]: 11: Hoare triple {32456#(<= ~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)); {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,744 INFO L290 TraceCheckUtils]: 12: Hoare triple {32456#(<= ~counter~0 0)} ~cond := #in~cond; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,744 INFO L290 TraceCheckUtils]: 13: Hoare triple {32456#(<= ~counter~0 0)} assume !(0 == ~cond); {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,745 INFO L290 TraceCheckUtils]: 14: Hoare triple {32456#(<= ~counter~0 0)} assume true; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,745 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32456#(<= ~counter~0 0)} {32456#(<= ~counter~0 0)} #92#return; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,745 INFO L290 TraceCheckUtils]: 16: Hoare triple {32456#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32456#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:21,746 INFO L290 TraceCheckUtils]: 17: Hoare triple {32456#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32505#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {32505#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {32505#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,747 INFO L272 TraceCheckUtils]: 19: Hoare triple {32505#(<= ~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)); {32505#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {32505#(<= ~counter~0 1)} ~cond := #in~cond; {32505#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,748 INFO L290 TraceCheckUtils]: 21: Hoare triple {32505#(<= ~counter~0 1)} assume !(0 == ~cond); {32505#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,748 INFO L290 TraceCheckUtils]: 22: Hoare triple {32505#(<= ~counter~0 1)} assume true; {32505#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,748 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {32505#(<= ~counter~0 1)} {32505#(<= ~counter~0 1)} #94#return; {32505#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,749 INFO L290 TraceCheckUtils]: 24: Hoare triple {32505#(<= ~counter~0 1)} assume !!(0 != ~r~0); {32505#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:21,749 INFO L290 TraceCheckUtils]: 25: Hoare triple {32505#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32530#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,749 INFO L290 TraceCheckUtils]: 26: Hoare triple {32530#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {32530#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,750 INFO L272 TraceCheckUtils]: 27: Hoare triple {32530#(<= ~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)); {32530#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,750 INFO L290 TraceCheckUtils]: 28: Hoare triple {32530#(<= ~counter~0 2)} ~cond := #in~cond; {32530#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,750 INFO L290 TraceCheckUtils]: 29: Hoare triple {32530#(<= ~counter~0 2)} assume !(0 == ~cond); {32530#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,751 INFO L290 TraceCheckUtils]: 30: Hoare triple {32530#(<= ~counter~0 2)} assume true; {32530#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,751 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {32530#(<= ~counter~0 2)} {32530#(<= ~counter~0 2)} #96#return; {32530#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,752 INFO L290 TraceCheckUtils]: 32: Hoare triple {32530#(<= ~counter~0 2)} assume !(~r~0 > 0); {32530#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:21,752 INFO L290 TraceCheckUtils]: 33: Hoare triple {32530#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:21,752 INFO L290 TraceCheckUtils]: 34: Hoare triple {32555#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:21,753 INFO L272 TraceCheckUtils]: 35: Hoare triple {32555#(<= ~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)); {32555#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:21,753 INFO L290 TraceCheckUtils]: 36: Hoare triple {32555#(<= ~counter~0 3)} ~cond := #in~cond; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:21,753 INFO L290 TraceCheckUtils]: 37: Hoare triple {32555#(<= ~counter~0 3)} assume !(0 == ~cond); {32555#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:21,754 INFO L290 TraceCheckUtils]: 38: Hoare triple {32555#(<= ~counter~0 3)} assume true; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:21,754 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {32555#(<= ~counter~0 3)} {32555#(<= ~counter~0 3)} #98#return; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:21,754 INFO L290 TraceCheckUtils]: 40: Hoare triple {32555#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32555#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:21,755 INFO L290 TraceCheckUtils]: 41: Hoare triple {32555#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32580#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:21,755 INFO L290 TraceCheckUtils]: 42: Hoare triple {32580#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {32580#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:21,756 INFO L272 TraceCheckUtils]: 43: Hoare triple {32580#(<= ~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)); {32580#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:21,756 INFO L290 TraceCheckUtils]: 44: Hoare triple {32580#(<= ~counter~0 4)} ~cond := #in~cond; {32580#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:21,756 INFO L290 TraceCheckUtils]: 45: Hoare triple {32580#(<= ~counter~0 4)} assume !(0 == ~cond); {32580#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:21,757 INFO L290 TraceCheckUtils]: 46: Hoare triple {32580#(<= ~counter~0 4)} assume true; {32580#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:21,757 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {32580#(<= ~counter~0 4)} {32580#(<= ~counter~0 4)} #98#return; {32580#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:21,757 INFO L290 TraceCheckUtils]: 48: Hoare triple {32580#(<= ~counter~0 4)} assume !(~r~0 < 0); {32580#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:21,758 INFO L290 TraceCheckUtils]: 49: Hoare triple {32580#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32605#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:21,758 INFO L290 TraceCheckUtils]: 50: Hoare triple {32605#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {32605#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:21,759 INFO L272 TraceCheckUtils]: 51: Hoare triple {32605#(<= ~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)); {32605#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:21,759 INFO L290 TraceCheckUtils]: 52: Hoare triple {32605#(<= ~counter~0 5)} ~cond := #in~cond; {32605#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:21,759 INFO L290 TraceCheckUtils]: 53: Hoare triple {32605#(<= ~counter~0 5)} assume !(0 == ~cond); {32605#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:21,760 INFO L290 TraceCheckUtils]: 54: Hoare triple {32605#(<= ~counter~0 5)} assume true; {32605#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:21,760 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32605#(<= ~counter~0 5)} {32605#(<= ~counter~0 5)} #94#return; {32605#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:21,760 INFO L290 TraceCheckUtils]: 56: Hoare triple {32605#(<= ~counter~0 5)} assume !!(0 != ~r~0); {32605#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:21,761 INFO L290 TraceCheckUtils]: 57: Hoare triple {32605#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32630#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:21,761 INFO L290 TraceCheckUtils]: 58: Hoare triple {32630#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {32630#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:21,762 INFO L272 TraceCheckUtils]: 59: Hoare triple {32630#(<= ~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)); {32630#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:21,762 INFO L290 TraceCheckUtils]: 60: Hoare triple {32630#(<= ~counter~0 6)} ~cond := #in~cond; {32630#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:21,762 INFO L290 TraceCheckUtils]: 61: Hoare triple {32630#(<= ~counter~0 6)} assume !(0 == ~cond); {32630#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:21,762 INFO L290 TraceCheckUtils]: 62: Hoare triple {32630#(<= ~counter~0 6)} assume true; {32630#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:21,763 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {32630#(<= ~counter~0 6)} {32630#(<= ~counter~0 6)} #96#return; {32630#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:21,763 INFO L290 TraceCheckUtils]: 64: Hoare triple {32630#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32630#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:21,764 INFO L290 TraceCheckUtils]: 65: Hoare triple {32630#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32655#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:21,764 INFO L290 TraceCheckUtils]: 66: Hoare triple {32655#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {32655#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:21,764 INFO L272 TraceCheckUtils]: 67: Hoare triple {32655#(<= ~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)); {32655#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:21,765 INFO L290 TraceCheckUtils]: 68: Hoare triple {32655#(<= ~counter~0 7)} ~cond := #in~cond; {32655#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:21,765 INFO L290 TraceCheckUtils]: 69: Hoare triple {32655#(<= ~counter~0 7)} assume !(0 == ~cond); {32655#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:21,765 INFO L290 TraceCheckUtils]: 70: Hoare triple {32655#(<= ~counter~0 7)} assume true; {32655#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:21,766 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32655#(<= ~counter~0 7)} {32655#(<= ~counter~0 7)} #96#return; {32655#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:21,766 INFO L290 TraceCheckUtils]: 72: Hoare triple {32655#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32655#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:21,767 INFO L290 TraceCheckUtils]: 73: Hoare triple {32655#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32680#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:21,767 INFO L290 TraceCheckUtils]: 74: Hoare triple {32680#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {32680#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:21,767 INFO L272 TraceCheckUtils]: 75: Hoare triple {32680#(<= ~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)); {32680#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:21,768 INFO L290 TraceCheckUtils]: 76: Hoare triple {32680#(<= ~counter~0 8)} ~cond := #in~cond; {32680#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:21,768 INFO L290 TraceCheckUtils]: 77: Hoare triple {32680#(<= ~counter~0 8)} assume !(0 == ~cond); {32680#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:21,768 INFO L290 TraceCheckUtils]: 78: Hoare triple {32680#(<= ~counter~0 8)} assume true; {32680#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:21,769 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {32680#(<= ~counter~0 8)} {32680#(<= ~counter~0 8)} #96#return; {32680#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:21,769 INFO L290 TraceCheckUtils]: 80: Hoare triple {32680#(<= ~counter~0 8)} assume !(~r~0 > 0); {32680#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:21,769 INFO L290 TraceCheckUtils]: 81: Hoare triple {32680#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32705#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:21,770 INFO L290 TraceCheckUtils]: 82: Hoare triple {32705#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {32705#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:21,770 INFO L272 TraceCheckUtils]: 83: Hoare triple {32705#(<= ~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)); {32705#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:21,770 INFO L290 TraceCheckUtils]: 84: Hoare triple {32705#(<= ~counter~0 9)} ~cond := #in~cond; {32705#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:21,771 INFO L290 TraceCheckUtils]: 85: Hoare triple {32705#(<= ~counter~0 9)} assume !(0 == ~cond); {32705#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:21,771 INFO L290 TraceCheckUtils]: 86: Hoare triple {32705#(<= ~counter~0 9)} assume true; {32705#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:21,772 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32705#(<= ~counter~0 9)} {32705#(<= ~counter~0 9)} #98#return; {32705#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:21,772 INFO L290 TraceCheckUtils]: 88: Hoare triple {32705#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32705#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:21,772 INFO L290 TraceCheckUtils]: 89: Hoare triple {32705#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32730#(<= |main_#t~post8| 9)} is VALID [2022-04-15 15:12:21,772 INFO L290 TraceCheckUtils]: 90: Hoare triple {32730#(<= |main_#t~post8| 9)} assume !(#t~post8 < 100);havoc #t~post8; {32449#false} is VALID [2022-04-15 15:12:21,773 INFO L290 TraceCheckUtils]: 91: Hoare triple {32449#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32449#false} is VALID [2022-04-15 15:12:21,773 INFO L290 TraceCheckUtils]: 92: Hoare triple {32449#false} assume !(#t~post6 < 100);havoc #t~post6; {32449#false} is VALID [2022-04-15 15:12:21,773 INFO L272 TraceCheckUtils]: 93: Hoare triple {32449#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)); {32449#false} is VALID [2022-04-15 15:12:21,773 INFO L290 TraceCheckUtils]: 94: Hoare triple {32449#false} ~cond := #in~cond; {32449#false} is VALID [2022-04-15 15:12:21,773 INFO L290 TraceCheckUtils]: 95: Hoare triple {32449#false} assume 0 == ~cond; {32449#false} is VALID [2022-04-15 15:12:21,773 INFO L290 TraceCheckUtils]: 96: Hoare triple {32449#false} assume !false; {32449#false} is VALID [2022-04-15 15:12:21,773 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 190 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:21,773 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:22,334 INFO L290 TraceCheckUtils]: 96: Hoare triple {32449#false} assume !false; {32449#false} is VALID [2022-04-15 15:12:22,334 INFO L290 TraceCheckUtils]: 95: Hoare triple {32449#false} assume 0 == ~cond; {32449#false} is VALID [2022-04-15 15:12:22,335 INFO L290 TraceCheckUtils]: 94: Hoare triple {32449#false} ~cond := #in~cond; {32449#false} is VALID [2022-04-15 15:12:22,335 INFO L272 TraceCheckUtils]: 93: Hoare triple {32449#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)); {32449#false} is VALID [2022-04-15 15:12:22,335 INFO L290 TraceCheckUtils]: 92: Hoare triple {32449#false} assume !(#t~post6 < 100);havoc #t~post6; {32449#false} is VALID [2022-04-15 15:12:22,335 INFO L290 TraceCheckUtils]: 91: Hoare triple {32449#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32449#false} is VALID [2022-04-15 15:12:22,335 INFO L290 TraceCheckUtils]: 90: Hoare triple {32770#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {32449#false} is VALID [2022-04-15 15:12:22,335 INFO L290 TraceCheckUtils]: 89: Hoare triple {32774#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32770#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:12:22,336 INFO L290 TraceCheckUtils]: 88: Hoare triple {32774#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32774#(< ~counter~0 100)} is VALID [2022-04-15 15:12:22,336 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {32448#true} {32774#(< ~counter~0 100)} #98#return; {32774#(< ~counter~0 100)} is VALID [2022-04-15 15:12:22,341 INFO L290 TraceCheckUtils]: 86: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,341 INFO L290 TraceCheckUtils]: 85: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,341 INFO L290 TraceCheckUtils]: 84: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,342 INFO L272 TraceCheckUtils]: 83: Hoare triple {32774#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,342 INFO L290 TraceCheckUtils]: 82: Hoare triple {32774#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {32774#(< ~counter~0 100)} is VALID [2022-04-15 15:12:22,343 INFO L290 TraceCheckUtils]: 81: Hoare triple {32799#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32774#(< ~counter~0 100)} is VALID [2022-04-15 15:12:22,344 INFO L290 TraceCheckUtils]: 80: Hoare triple {32799#(< ~counter~0 99)} assume !(~r~0 > 0); {32799#(< ~counter~0 99)} is VALID [2022-04-15 15:12:22,344 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {32448#true} {32799#(< ~counter~0 99)} #96#return; {32799#(< ~counter~0 99)} is VALID [2022-04-15 15:12:22,344 INFO L290 TraceCheckUtils]: 78: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,344 INFO L290 TraceCheckUtils]: 77: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,345 INFO L290 TraceCheckUtils]: 76: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,345 INFO L272 TraceCheckUtils]: 75: Hoare triple {32799#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,345 INFO L290 TraceCheckUtils]: 74: Hoare triple {32799#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {32799#(< ~counter~0 99)} is VALID [2022-04-15 15:12:22,345 INFO L290 TraceCheckUtils]: 73: Hoare triple {32824#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32799#(< ~counter~0 99)} is VALID [2022-04-15 15:12:22,346 INFO L290 TraceCheckUtils]: 72: Hoare triple {32824#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32824#(< ~counter~0 98)} is VALID [2022-04-15 15:12:22,346 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {32448#true} {32824#(< ~counter~0 98)} #96#return; {32824#(< ~counter~0 98)} is VALID [2022-04-15 15:12:22,346 INFO L290 TraceCheckUtils]: 70: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,346 INFO L290 TraceCheckUtils]: 69: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,346 INFO L290 TraceCheckUtils]: 68: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,346 INFO L272 TraceCheckUtils]: 67: Hoare triple {32824#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,347 INFO L290 TraceCheckUtils]: 66: Hoare triple {32824#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {32824#(< ~counter~0 98)} is VALID [2022-04-15 15:12:22,347 INFO L290 TraceCheckUtils]: 65: Hoare triple {32849#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32824#(< ~counter~0 98)} is VALID [2022-04-15 15:12:22,348 INFO L290 TraceCheckUtils]: 64: Hoare triple {32849#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {32849#(< ~counter~0 97)} is VALID [2022-04-15 15:12:22,348 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {32448#true} {32849#(< ~counter~0 97)} #96#return; {32849#(< ~counter~0 97)} is VALID [2022-04-15 15:12:22,348 INFO L290 TraceCheckUtils]: 62: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,348 INFO L290 TraceCheckUtils]: 61: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,348 INFO L290 TraceCheckUtils]: 60: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,348 INFO L272 TraceCheckUtils]: 59: Hoare triple {32849#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,349 INFO L290 TraceCheckUtils]: 58: Hoare triple {32849#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {32849#(< ~counter~0 97)} is VALID [2022-04-15 15:12:22,349 INFO L290 TraceCheckUtils]: 57: Hoare triple {32874#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32849#(< ~counter~0 97)} is VALID [2022-04-15 15:12:22,349 INFO L290 TraceCheckUtils]: 56: Hoare triple {32874#(< ~counter~0 96)} assume !!(0 != ~r~0); {32874#(< ~counter~0 96)} is VALID [2022-04-15 15:12:22,350 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {32448#true} {32874#(< ~counter~0 96)} #94#return; {32874#(< ~counter~0 96)} is VALID [2022-04-15 15:12:22,350 INFO L290 TraceCheckUtils]: 54: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,350 INFO L290 TraceCheckUtils]: 53: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,350 INFO L290 TraceCheckUtils]: 52: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,350 INFO L272 TraceCheckUtils]: 51: Hoare triple {32874#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,351 INFO L290 TraceCheckUtils]: 50: Hoare triple {32874#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {32874#(< ~counter~0 96)} is VALID [2022-04-15 15:12:22,351 INFO L290 TraceCheckUtils]: 49: Hoare triple {32899#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32874#(< ~counter~0 96)} is VALID [2022-04-15 15:12:22,351 INFO L290 TraceCheckUtils]: 48: Hoare triple {32899#(< ~counter~0 95)} assume !(~r~0 < 0); {32899#(< ~counter~0 95)} is VALID [2022-04-15 15:12:22,352 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {32448#true} {32899#(< ~counter~0 95)} #98#return; {32899#(< ~counter~0 95)} is VALID [2022-04-15 15:12:22,352 INFO L290 TraceCheckUtils]: 46: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,352 INFO L290 TraceCheckUtils]: 45: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,352 INFO L290 TraceCheckUtils]: 44: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,352 INFO L272 TraceCheckUtils]: 43: Hoare triple {32899#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,352 INFO L290 TraceCheckUtils]: 42: Hoare triple {32899#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {32899#(< ~counter~0 95)} is VALID [2022-04-15 15:12:22,353 INFO L290 TraceCheckUtils]: 41: Hoare triple {32924#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32899#(< ~counter~0 95)} is VALID [2022-04-15 15:12:22,353 INFO L290 TraceCheckUtils]: 40: Hoare triple {32924#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {32924#(< ~counter~0 94)} is VALID [2022-04-15 15:12:22,354 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {32448#true} {32924#(< ~counter~0 94)} #98#return; {32924#(< ~counter~0 94)} is VALID [2022-04-15 15:12:22,354 INFO L290 TraceCheckUtils]: 38: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,354 INFO L272 TraceCheckUtils]: 35: Hoare triple {32924#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,354 INFO L290 TraceCheckUtils]: 34: Hoare triple {32924#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {32924#(< ~counter~0 94)} is VALID [2022-04-15 15:12:22,355 INFO L290 TraceCheckUtils]: 33: Hoare triple {32949#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {32924#(< ~counter~0 94)} is VALID [2022-04-15 15:12:22,355 INFO L290 TraceCheckUtils]: 32: Hoare triple {32949#(< ~counter~0 93)} assume !(~r~0 > 0); {32949#(< ~counter~0 93)} is VALID [2022-04-15 15:12:22,356 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {32448#true} {32949#(< ~counter~0 93)} #96#return; {32949#(< ~counter~0 93)} is VALID [2022-04-15 15:12:22,356 INFO L290 TraceCheckUtils]: 30: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,356 INFO L290 TraceCheckUtils]: 29: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,356 INFO L290 TraceCheckUtils]: 28: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,356 INFO L272 TraceCheckUtils]: 27: Hoare triple {32949#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {32949#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {32949#(< ~counter~0 93)} is VALID [2022-04-15 15:12:22,357 INFO L290 TraceCheckUtils]: 25: Hoare triple {32974#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {32949#(< ~counter~0 93)} is VALID [2022-04-15 15:12:22,357 INFO L290 TraceCheckUtils]: 24: Hoare triple {32974#(< ~counter~0 92)} assume !!(0 != ~r~0); {32974#(< ~counter~0 92)} is VALID [2022-04-15 15:12:22,358 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {32448#true} {32974#(< ~counter~0 92)} #94#return; {32974#(< ~counter~0 92)} is VALID [2022-04-15 15:12:22,358 INFO L290 TraceCheckUtils]: 22: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,358 INFO L290 TraceCheckUtils]: 21: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,358 INFO L290 TraceCheckUtils]: 20: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,358 INFO L272 TraceCheckUtils]: 19: Hoare triple {32974#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,358 INFO L290 TraceCheckUtils]: 18: Hoare triple {32974#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {32974#(< ~counter~0 92)} is VALID [2022-04-15 15:12:22,359 INFO L290 TraceCheckUtils]: 17: Hoare triple {32999#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {32974#(< ~counter~0 92)} is VALID [2022-04-15 15:12:22,359 INFO L290 TraceCheckUtils]: 16: Hoare triple {32999#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {32999#(< ~counter~0 91)} is VALID [2022-04-15 15:12:22,359 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {32448#true} {32999#(< ~counter~0 91)} #92#return; {32999#(< ~counter~0 91)} is VALID [2022-04-15 15:12:22,359 INFO L290 TraceCheckUtils]: 14: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,360 INFO L290 TraceCheckUtils]: 13: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,360 INFO L272 TraceCheckUtils]: 11: Hoare triple {32999#(< ~counter~0 91)} 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)); {32448#true} is VALID [2022-04-15 15:12:22,360 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {32448#true} {32999#(< ~counter~0 91)} #90#return; {32999#(< ~counter~0 91)} is VALID [2022-04-15 15:12:22,360 INFO L290 TraceCheckUtils]: 9: Hoare triple {32448#true} assume true; {32448#true} is VALID [2022-04-15 15:12:22,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {32448#true} assume !(0 == ~cond); {32448#true} is VALID [2022-04-15 15:12:22,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {32448#true} ~cond := #in~cond; {32448#true} is VALID [2022-04-15 15:12:22,360 INFO L272 TraceCheckUtils]: 6: Hoare triple {32999#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {32448#true} is VALID [2022-04-15 15:12:22,361 INFO L290 TraceCheckUtils]: 5: Hoare triple {32999#(< ~counter~0 91)} 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; {32999#(< ~counter~0 91)} is VALID [2022-04-15 15:12:22,361 INFO L272 TraceCheckUtils]: 4: Hoare triple {32999#(< ~counter~0 91)} call #t~ret9 := main(); {32999#(< ~counter~0 91)} is VALID [2022-04-15 15:12:22,361 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {32999#(< ~counter~0 91)} {32448#true} #102#return; {32999#(< ~counter~0 91)} is VALID [2022-04-15 15:12:22,362 INFO L290 TraceCheckUtils]: 2: Hoare triple {32999#(< ~counter~0 91)} assume true; {32999#(< ~counter~0 91)} is VALID [2022-04-15 15:12:22,362 INFO L290 TraceCheckUtils]: 1: Hoare triple {32448#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; {32999#(< ~counter~0 91)} is VALID [2022-04-15 15:12:22,362 INFO L272 TraceCheckUtils]: 0: Hoare triple {32448#true} call ULTIMATE.init(); {32448#true} is VALID [2022-04-15 15:12:22,362 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 22 proven. 46 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-15 15:12:22,362 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:22,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746423069] [2022-04-15 15:12:22,363 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:22,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [597459056] [2022-04-15 15:12:22,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [597459056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:22,363 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:22,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 15:12:22,363 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:22,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [382435899] [2022-04-15 15:12:22,363 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [382435899] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:22,363 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:22,363 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:12:22,363 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841102638] [2022-04-15 15:12:22,363 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:22,364 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 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 97 [2022-04-15 15:12:22,364 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:22,364 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 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-15 15:12:22,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:22,431 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:12:22,431 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:22,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:12:22,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:12:22,432 INFO L87 Difference]: Start difference. First operand 346 states and 459 transitions. Second operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 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-15 15:12:23,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:23,559 INFO L93 Difference]: Finished difference Result 471 states and 643 transitions. [2022-04-15 15:12:23,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-04-15 15:12:23,559 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 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 97 [2022-04-15 15:12:23,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:23,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 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-15 15:12:23,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 15:12:23,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 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-15 15:12:23,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 218 transitions. [2022-04-15 15:12:23,564 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 20 states and 218 transitions. [2022-04-15 15:12:23,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:23,776 INFO L225 Difference]: With dead ends: 471 [2022-04-15 15:12:23,777 INFO L226 Difference]: Without dead ends: 356 [2022-04-15 15:12:23,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 200 GetRequests, 171 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=383, Invalid=547, Unknown=0, NotChecked=0, Total=930 [2022-04-15 15:12:23,778 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 116 mSDsluCounter, 181 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 95 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 238 SdHoareTripleChecker+Invalid, 200 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 95 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:23,779 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 238 Invalid, 200 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [95 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:12:23,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2022-04-15 15:12:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 348. [2022-04-15 15:12:24,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:24,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 356 states. Second operand has 348 states, 260 states have (on average 1.2076923076923076) internal successors, (314), 264 states have internal predecessors, (314), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:24,374 INFO L74 IsIncluded]: Start isIncluded. First operand 356 states. Second operand has 348 states, 260 states have (on average 1.2076923076923076) internal successors, (314), 264 states have internal predecessors, (314), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:24,375 INFO L87 Difference]: Start difference. First operand 356 states. Second operand has 348 states, 260 states have (on average 1.2076923076923076) internal successors, (314), 264 states have internal predecessors, (314), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:24,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:24,383 INFO L93 Difference]: Finished difference Result 356 states and 468 transitions. [2022-04-15 15:12:24,383 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 468 transitions. [2022-04-15 15:12:24,384 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:24,384 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:24,385 INFO L74 IsIncluded]: Start isIncluded. First operand has 348 states, 260 states have (on average 1.2076923076923076) internal successors, (314), 264 states have internal predecessors, (314), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 356 states. [2022-04-15 15:12:24,386 INFO L87 Difference]: Start difference. First operand has 348 states, 260 states have (on average 1.2076923076923076) internal successors, (314), 264 states have internal predecessors, (314), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 356 states. [2022-04-15 15:12:24,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:24,394 INFO L93 Difference]: Finished difference Result 356 states and 468 transitions. [2022-04-15 15:12:24,394 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 468 transitions. [2022-04-15 15:12:24,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:24,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:24,395 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:24,395 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:24,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 348 states, 260 states have (on average 1.2076923076923076) internal successors, (314), 264 states have internal predecessors, (314), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:24,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 348 states to 348 states and 460 transitions. [2022-04-15 15:12:24,405 INFO L78 Accepts]: Start accepts. Automaton has 348 states and 460 transitions. Word has length 97 [2022-04-15 15:12:24,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:24,406 INFO L478 AbstractCegarLoop]: Abstraction has 348 states and 460 transitions. [2022-04-15 15:12:24,406 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.230769230769231) internal successors, (68), 12 states have internal predecessors, (68), 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-15 15:12:24,406 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 348 states and 460 transitions. [2022-04-15 15:12:26,132 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 460 edges. 460 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:26,133 INFO L276 IsEmpty]: Start isEmpty. Operand 348 states and 460 transitions. [2022-04-15 15:12:26,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 15:12:26,134 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:26,134 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:26,152 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (29)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:26,335 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2022-04-15 15:12:26,335 INFO L403 AbstractCegarLoop]: === Iteration 29 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:26,336 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 7 times [2022-04-15 15:12:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:26,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [239206330] [2022-04-15 15:12:26,336 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:26,336 INFO L85 PathProgramCache]: Analyzing trace with hash 1020733748, now seen corresponding path program 8 times [2022-04-15 15:12:26,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:26,336 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2116307353] [2022-04-15 15:12:26,336 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:26,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:26,347 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:26,347 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [446996891] [2022-04-15 15:12:26,348 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:12:26,348 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:26,348 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:26,349 INFO L229 MonitoredProcess]: Starting monitored process 30 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:26,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Waiting until timeout for monitored process [2022-04-15 15:12:26,400 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:12:26,400 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:26,401 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 3 conjunts are in the unsatisfiable core [2022-04-15 15:12:26,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:26,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:26,661 INFO L272 TraceCheckUtils]: 0: Hoare triple {35417#true} call ULTIMATE.init(); {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L290 TraceCheckUtils]: 1: Hoare triple {35417#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; {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L290 TraceCheckUtils]: 2: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35417#true} {35417#true} #102#return; {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L272 TraceCheckUtils]: 4: Hoare triple {35417#true} call #t~ret9 := main(); {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {35417#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; {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L272 TraceCheckUtils]: 6: Hoare triple {35417#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L290 TraceCheckUtils]: 7: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35417#true} {35417#true} #90#return; {35417#true} is VALID [2022-04-15 15:12:26,661 INFO L272 TraceCheckUtils]: 11: Hoare triple {35417#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)); {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {35417#true} {35417#true} #92#return; {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 16: Hoare triple {35417#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 17: Hoare triple {35417#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 18: Hoare triple {35417#true} assume !!(#t~post6 < 100);havoc #t~post6; {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L272 TraceCheckUtils]: 19: Hoare triple {35417#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)); {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 20: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 21: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 22: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {35417#true} {35417#true} #94#return; {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 24: Hoare triple {35417#true} assume !!(0 != ~r~0); {35417#true} is VALID [2022-04-15 15:12:26,662 INFO L290 TraceCheckUtils]: 25: Hoare triple {35417#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 26: Hoare triple {35417#true} assume !!(#t~post7 < 100);havoc #t~post7; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L272 TraceCheckUtils]: 27: Hoare triple {35417#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)); {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 29: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 30: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {35417#true} {35417#true} #96#return; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 32: Hoare triple {35417#true} assume !(~r~0 > 0); {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {35417#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 34: Hoare triple {35417#true} assume !!(#t~post8 < 100);havoc #t~post8; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L272 TraceCheckUtils]: 35: Hoare triple {35417#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)); {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 36: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 37: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 38: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {35417#true} {35417#true} #98#return; {35417#true} is VALID [2022-04-15 15:12:26,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {35417#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 41: Hoare triple {35417#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 42: Hoare triple {35417#true} assume !!(#t~post8 < 100);havoc #t~post8; {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L272 TraceCheckUtils]: 43: Hoare triple {35417#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)); {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 44: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 45: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 46: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {35417#true} {35417#true} #98#return; {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 48: Hoare triple {35417#true} assume !(~r~0 < 0); {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {35417#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {35417#true} assume !!(#t~post6 < 100);havoc #t~post6; {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L272 TraceCheckUtils]: 51: Hoare triple {35417#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)); {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 53: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,664 INFO L290 TraceCheckUtils]: 54: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,665 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {35417#true} {35417#true} #94#return; {35417#true} is VALID [2022-04-15 15:12:26,665 INFO L290 TraceCheckUtils]: 56: Hoare triple {35417#true} assume !!(0 != ~r~0); {35417#true} is VALID [2022-04-15 15:12:26,665 INFO L290 TraceCheckUtils]: 57: Hoare triple {35417#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35417#true} is VALID [2022-04-15 15:12:26,665 INFO L290 TraceCheckUtils]: 58: Hoare triple {35417#true} assume !!(#t~post7 < 100);havoc #t~post7; {35417#true} is VALID [2022-04-15 15:12:26,665 INFO L272 TraceCheckUtils]: 59: Hoare triple {35417#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)); {35417#true} is VALID [2022-04-15 15:12:26,665 INFO L290 TraceCheckUtils]: 60: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,665 INFO L290 TraceCheckUtils]: 61: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,670 INFO L290 TraceCheckUtils]: 62: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,671 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {35417#true} {35417#true} #96#return; {35417#true} is VALID [2022-04-15 15:12:26,671 INFO L290 TraceCheckUtils]: 64: Hoare triple {35417#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {35417#true} is VALID [2022-04-15 15:12:26,671 INFO L290 TraceCheckUtils]: 65: Hoare triple {35417#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35417#true} is VALID [2022-04-15 15:12:26,671 INFO L290 TraceCheckUtils]: 66: Hoare triple {35417#true} assume !!(#t~post7 < 100);havoc #t~post7; {35417#true} is VALID [2022-04-15 15:12:26,671 INFO L272 TraceCheckUtils]: 67: Hoare triple {35417#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)); {35417#true} is VALID [2022-04-15 15:12:26,671 INFO L290 TraceCheckUtils]: 68: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,671 INFO L290 TraceCheckUtils]: 69: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,671 INFO L290 TraceCheckUtils]: 70: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,671 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {35417#true} {35417#true} #96#return; {35417#true} is VALID [2022-04-15 15:12:26,672 INFO L290 TraceCheckUtils]: 72: Hoare triple {35417#true} assume !(~r~0 > 0); {35638#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:12:26,672 INFO L290 TraceCheckUtils]: 73: Hoare triple {35638#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {35638#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:12:26,672 INFO L290 TraceCheckUtils]: 74: Hoare triple {35638#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {35638#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:12:26,672 INFO L272 TraceCheckUtils]: 75: Hoare triple {35638#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {35417#true} is VALID [2022-04-15 15:12:26,673 INFO L290 TraceCheckUtils]: 76: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,673 INFO L290 TraceCheckUtils]: 77: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,673 INFO L290 TraceCheckUtils]: 78: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,673 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {35417#true} {35638#(not (< 0 main_~r~0))} #98#return; {35638#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:12:26,674 INFO L290 TraceCheckUtils]: 80: Hoare triple {35638#(not (< 0 main_~r~0))} assume !(~r~0 < 0); {35663#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:12:26,674 INFO L290 TraceCheckUtils]: 81: Hoare triple {35663#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35663#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:12:26,674 INFO L290 TraceCheckUtils]: 82: Hoare triple {35663#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(#t~post6 < 100);havoc #t~post6; {35663#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:12:26,674 INFO L272 TraceCheckUtils]: 83: Hoare triple {35663#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {35417#true} is VALID [2022-04-15 15:12:26,674 INFO L290 TraceCheckUtils]: 84: Hoare triple {35417#true} ~cond := #in~cond; {35417#true} is VALID [2022-04-15 15:12:26,675 INFO L290 TraceCheckUtils]: 85: Hoare triple {35417#true} assume !(0 == ~cond); {35417#true} is VALID [2022-04-15 15:12:26,675 INFO L290 TraceCheckUtils]: 86: Hoare triple {35417#true} assume true; {35417#true} is VALID [2022-04-15 15:12:26,675 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {35417#true} {35663#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} #94#return; {35663#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} is VALID [2022-04-15 15:12:26,675 INFO L290 TraceCheckUtils]: 88: Hoare triple {35663#(and (not (< 0 main_~r~0)) (not (< main_~r~0 0)))} assume !!(0 != ~r~0); {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L290 TraceCheckUtils]: 89: Hoare triple {35418#false} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L290 TraceCheckUtils]: 90: Hoare triple {35418#false} assume !(#t~post7 < 100);havoc #t~post7; {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L290 TraceCheckUtils]: 91: Hoare triple {35418#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L290 TraceCheckUtils]: 92: Hoare triple {35418#false} assume !(#t~post8 < 100);havoc #t~post8; {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L290 TraceCheckUtils]: 93: Hoare triple {35418#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L290 TraceCheckUtils]: 94: Hoare triple {35418#false} assume !(#t~post6 < 100);havoc #t~post6; {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L272 TraceCheckUtils]: 95: Hoare triple {35418#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)); {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L290 TraceCheckUtils]: 96: Hoare triple {35418#false} ~cond := #in~cond; {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L290 TraceCheckUtils]: 97: Hoare triple {35418#false} assume 0 == ~cond; {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L290 TraceCheckUtils]: 98: Hoare triple {35418#false} assume !false; {35418#false} is VALID [2022-04-15 15:12:26,676 INFO L134 CoverageAnalysis]: Checked inductivity of 220 backedges. 52 proven. 0 refuted. 0 times theorem prover too weak. 168 trivial. 0 not checked. [2022-04-15 15:12:26,677 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-04-15 15:12:26,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:26,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2116307353] [2022-04-15 15:12:26,677 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:26,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [446996891] [2022-04-15 15:12:26,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [446996891] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:26,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:26,677 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:12:26,677 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:26,677 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [239206330] [2022-04-15 15:12:26,677 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [239206330] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:26,677 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:26,678 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-04-15 15:12:26,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1647238700] [2022-04-15 15:12:26,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:26,678 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-15 15:12:26,678 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:26,679 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:26,717 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-15 15:12:26,718 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-04-15 15:12:26,718 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:26,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-04-15 15:12:26,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:12:26,718 INFO L87 Difference]: Start difference. First operand 348 states and 460 transitions. Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:27,487 INFO L93 Difference]: Finished difference Result 508 states and 678 transitions. [2022-04-15 15:12:27,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-04-15 15:12:27,487 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) Word has length 99 [2022-04-15 15:12:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:27,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:27,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:12:27,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:27,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 94 transitions. [2022-04-15 15:12:27,489 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 4 states and 94 transitions. [2022-04-15 15:12:27,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:27,574 INFO L225 Difference]: With dead ends: 508 [2022-04-15 15:12:27,574 INFO L226 Difference]: Without dead ends: 366 [2022-04-15 15:12:27,574 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-04-15 15:12:27,575 INFO L913 BasicCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:27,575 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 121 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-04-15 15:12:27,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 366 states. [2022-04-15 15:12:28,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 366 to 356. [2022-04-15 15:12:28,099 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:28,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 366 states. Second operand has 356 states, 268 states have (on average 1.212686567164179) internal successors, (325), 272 states have internal predecessors, (325), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:28,099 INFO L74 IsIncluded]: Start isIncluded. First operand 366 states. Second operand has 356 states, 268 states have (on average 1.212686567164179) internal successors, (325), 272 states have internal predecessors, (325), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:28,100 INFO L87 Difference]: Start difference. First operand 366 states. Second operand has 356 states, 268 states have (on average 1.212686567164179) internal successors, (325), 272 states have internal predecessors, (325), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:28,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:28,111 INFO L93 Difference]: Finished difference Result 366 states and 484 transitions. [2022-04-15 15:12:28,111 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 484 transitions. [2022-04-15 15:12:28,112 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:28,112 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:28,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 268 states have (on average 1.212686567164179) internal successors, (325), 272 states have internal predecessors, (325), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 366 states. [2022-04-15 15:12:28,113 INFO L87 Difference]: Start difference. First operand has 356 states, 268 states have (on average 1.212686567164179) internal successors, (325), 272 states have internal predecessors, (325), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) Second operand 366 states. [2022-04-15 15:12:28,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:28,123 INFO L93 Difference]: Finished difference Result 366 states and 484 transitions. [2022-04-15 15:12:28,123 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 484 transitions. [2022-04-15 15:12:28,123 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:28,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:28,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:28,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:28,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 268 states have (on average 1.212686567164179) internal successors, (325), 272 states have internal predecessors, (325), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 68 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:28,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 471 transitions. [2022-04-15 15:12:28,136 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 471 transitions. Word has length 99 [2022-04-15 15:12:28,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:28,136 INFO L478 AbstractCegarLoop]: Abstraction has 356 states and 471 transitions. [2022-04-15 15:12:28,136 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 4 states have call successors, (10), 2 states have call predecessors, (10), 1 states have return successors, (8), 3 states have call predecessors, (8), 3 states have call successors, (8) [2022-04-15 15:12:28,136 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 356 states and 471 transitions. [2022-04-15 15:12:30,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 471 edges. 470 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:30,837 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 471 transitions. [2022-04-15 15:12:30,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2022-04-15 15:12:30,838 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:30,838 INFO L499 BasicCegarLoop]: trace histogram [10, 9, 9, 6, 5, 5, 5, 4, 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, 1, 1, 1, 1, 1] [2022-04-15 15:12:30,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (30)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:31,038 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2022-04-15 15:12:31,039 INFO L403 AbstractCegarLoop]: === Iteration 30 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:31,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 9 times [2022-04-15 15:12:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:31,039 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [115440014] [2022-04-15 15:12:31,039 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:31,039 INFO L85 PathProgramCache]: Analyzing trace with hash 359487094, now seen corresponding path program 10 times [2022-04-15 15:12:31,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:31,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411605682] [2022-04-15 15:12:31,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:31,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:31,067 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:31,068 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1859145471] [2022-04-15 15:12:31,068 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:31,068 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:31,068 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:31,069 INFO L229 MonitoredProcess]: Starting monitored process 31 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:31,075 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Waiting until timeout for monitored process [2022-04-15 15:12:31,223 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:31,223 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:31,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 258 conjuncts, 23 conjunts are in the unsatisfiable core [2022-04-15 15:12:31,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:31,243 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:31,707 INFO L272 TraceCheckUtils]: 0: Hoare triple {38177#true} call ULTIMATE.init(); {38177#true} is VALID [2022-04-15 15:12:31,708 INFO L290 TraceCheckUtils]: 1: Hoare triple {38177#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; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,708 INFO L290 TraceCheckUtils]: 2: Hoare triple {38185#(<= ~counter~0 0)} assume true; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,708 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38185#(<= ~counter~0 0)} {38177#true} #102#return; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,709 INFO L272 TraceCheckUtils]: 4: Hoare triple {38185#(<= ~counter~0 0)} call #t~ret9 := main(); {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,709 INFO L290 TraceCheckUtils]: 5: Hoare triple {38185#(<= ~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; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,709 INFO L272 TraceCheckUtils]: 6: Hoare triple {38185#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {38185#(<= ~counter~0 0)} ~cond := #in~cond; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {38185#(<= ~counter~0 0)} assume !(0 == ~cond); {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,710 INFO L290 TraceCheckUtils]: 9: Hoare triple {38185#(<= ~counter~0 0)} assume true; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,711 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38185#(<= ~counter~0 0)} {38185#(<= ~counter~0 0)} #90#return; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,711 INFO L272 TraceCheckUtils]: 11: Hoare triple {38185#(<= ~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)); {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,711 INFO L290 TraceCheckUtils]: 12: Hoare triple {38185#(<= ~counter~0 0)} ~cond := #in~cond; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,712 INFO L290 TraceCheckUtils]: 13: Hoare triple {38185#(<= ~counter~0 0)} assume !(0 == ~cond); {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,712 INFO L290 TraceCheckUtils]: 14: Hoare triple {38185#(<= ~counter~0 0)} assume true; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,731 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38185#(<= ~counter~0 0)} {38185#(<= ~counter~0 0)} #92#return; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {38185#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38185#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:31,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {38185#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38234#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:31,733 INFO L290 TraceCheckUtils]: 18: Hoare triple {38234#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {38234#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:31,734 INFO L272 TraceCheckUtils]: 19: Hoare triple {38234#(<= ~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)); {38234#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:31,734 INFO L290 TraceCheckUtils]: 20: Hoare triple {38234#(<= ~counter~0 1)} ~cond := #in~cond; {38234#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:31,735 INFO L290 TraceCheckUtils]: 21: Hoare triple {38234#(<= ~counter~0 1)} assume !(0 == ~cond); {38234#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:31,735 INFO L290 TraceCheckUtils]: 22: Hoare triple {38234#(<= ~counter~0 1)} assume true; {38234#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:31,736 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38234#(<= ~counter~0 1)} {38234#(<= ~counter~0 1)} #94#return; {38234#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:31,736 INFO L290 TraceCheckUtils]: 24: Hoare triple {38234#(<= ~counter~0 1)} assume !!(0 != ~r~0); {38234#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:31,737 INFO L290 TraceCheckUtils]: 25: Hoare triple {38234#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38259#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:31,737 INFO L290 TraceCheckUtils]: 26: Hoare triple {38259#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {38259#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:31,738 INFO L272 TraceCheckUtils]: 27: Hoare triple {38259#(<= ~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)); {38259#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:31,738 INFO L290 TraceCheckUtils]: 28: Hoare triple {38259#(<= ~counter~0 2)} ~cond := #in~cond; {38259#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:31,738 INFO L290 TraceCheckUtils]: 29: Hoare triple {38259#(<= ~counter~0 2)} assume !(0 == ~cond); {38259#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:31,739 INFO L290 TraceCheckUtils]: 30: Hoare triple {38259#(<= ~counter~0 2)} assume true; {38259#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:31,739 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38259#(<= ~counter~0 2)} {38259#(<= ~counter~0 2)} #96#return; {38259#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:31,740 INFO L290 TraceCheckUtils]: 32: Hoare triple {38259#(<= ~counter~0 2)} assume !(~r~0 > 0); {38259#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:31,741 INFO L290 TraceCheckUtils]: 33: Hoare triple {38259#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38284#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:31,741 INFO L290 TraceCheckUtils]: 34: Hoare triple {38284#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {38284#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:31,741 INFO L272 TraceCheckUtils]: 35: Hoare triple {38284#(<= ~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)); {38284#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:31,742 INFO L290 TraceCheckUtils]: 36: Hoare triple {38284#(<= ~counter~0 3)} ~cond := #in~cond; {38284#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:31,742 INFO L290 TraceCheckUtils]: 37: Hoare triple {38284#(<= ~counter~0 3)} assume !(0 == ~cond); {38284#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:31,743 INFO L290 TraceCheckUtils]: 38: Hoare triple {38284#(<= ~counter~0 3)} assume true; {38284#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:31,743 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38284#(<= ~counter~0 3)} {38284#(<= ~counter~0 3)} #98#return; {38284#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:31,744 INFO L290 TraceCheckUtils]: 40: Hoare triple {38284#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38284#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:31,744 INFO L290 TraceCheckUtils]: 41: Hoare triple {38284#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38309#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:31,745 INFO L290 TraceCheckUtils]: 42: Hoare triple {38309#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {38309#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:31,745 INFO L272 TraceCheckUtils]: 43: Hoare triple {38309#(<= ~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)); {38309#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:31,746 INFO L290 TraceCheckUtils]: 44: Hoare triple {38309#(<= ~counter~0 4)} ~cond := #in~cond; {38309#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:31,746 INFO L290 TraceCheckUtils]: 45: Hoare triple {38309#(<= ~counter~0 4)} assume !(0 == ~cond); {38309#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:31,746 INFO L290 TraceCheckUtils]: 46: Hoare triple {38309#(<= ~counter~0 4)} assume true; {38309#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:31,747 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38309#(<= ~counter~0 4)} {38309#(<= ~counter~0 4)} #98#return; {38309#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:31,747 INFO L290 TraceCheckUtils]: 48: Hoare triple {38309#(<= ~counter~0 4)} assume !(~r~0 < 0); {38309#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:31,748 INFO L290 TraceCheckUtils]: 49: Hoare triple {38309#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38334#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:31,748 INFO L290 TraceCheckUtils]: 50: Hoare triple {38334#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {38334#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:31,749 INFO L272 TraceCheckUtils]: 51: Hoare triple {38334#(<= ~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)); {38334#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:31,749 INFO L290 TraceCheckUtils]: 52: Hoare triple {38334#(<= ~counter~0 5)} ~cond := #in~cond; {38334#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:31,750 INFO L290 TraceCheckUtils]: 53: Hoare triple {38334#(<= ~counter~0 5)} assume !(0 == ~cond); {38334#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:31,750 INFO L290 TraceCheckUtils]: 54: Hoare triple {38334#(<= ~counter~0 5)} assume true; {38334#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:31,751 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {38334#(<= ~counter~0 5)} {38334#(<= ~counter~0 5)} #94#return; {38334#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:31,751 INFO L290 TraceCheckUtils]: 56: Hoare triple {38334#(<= ~counter~0 5)} assume !!(0 != ~r~0); {38334#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:31,752 INFO L290 TraceCheckUtils]: 57: Hoare triple {38334#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38359#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:31,752 INFO L290 TraceCheckUtils]: 58: Hoare triple {38359#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {38359#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:31,753 INFO L272 TraceCheckUtils]: 59: Hoare triple {38359#(<= ~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)); {38359#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:31,753 INFO L290 TraceCheckUtils]: 60: Hoare triple {38359#(<= ~counter~0 6)} ~cond := #in~cond; {38359#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:31,753 INFO L290 TraceCheckUtils]: 61: Hoare triple {38359#(<= ~counter~0 6)} assume !(0 == ~cond); {38359#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:31,754 INFO L290 TraceCheckUtils]: 62: Hoare triple {38359#(<= ~counter~0 6)} assume true; {38359#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:31,754 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38359#(<= ~counter~0 6)} {38359#(<= ~counter~0 6)} #96#return; {38359#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:31,755 INFO L290 TraceCheckUtils]: 64: Hoare triple {38359#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38359#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:31,756 INFO L290 TraceCheckUtils]: 65: Hoare triple {38359#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38384#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:31,756 INFO L290 TraceCheckUtils]: 66: Hoare triple {38384#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {38384#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:31,757 INFO L272 TraceCheckUtils]: 67: Hoare triple {38384#(<= ~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)); {38384#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:31,757 INFO L290 TraceCheckUtils]: 68: Hoare triple {38384#(<= ~counter~0 7)} ~cond := #in~cond; {38384#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:31,757 INFO L290 TraceCheckUtils]: 69: Hoare triple {38384#(<= ~counter~0 7)} assume !(0 == ~cond); {38384#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:31,758 INFO L290 TraceCheckUtils]: 70: Hoare triple {38384#(<= ~counter~0 7)} assume true; {38384#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:31,758 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38384#(<= ~counter~0 7)} {38384#(<= ~counter~0 7)} #96#return; {38384#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:31,759 INFO L290 TraceCheckUtils]: 72: Hoare triple {38384#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38384#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:31,759 INFO L290 TraceCheckUtils]: 73: Hoare triple {38384#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38409#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:31,760 INFO L290 TraceCheckUtils]: 74: Hoare triple {38409#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {38409#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:31,760 INFO L272 TraceCheckUtils]: 75: Hoare triple {38409#(<= ~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)); {38409#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:31,761 INFO L290 TraceCheckUtils]: 76: Hoare triple {38409#(<= ~counter~0 8)} ~cond := #in~cond; {38409#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:31,761 INFO L290 TraceCheckUtils]: 77: Hoare triple {38409#(<= ~counter~0 8)} assume !(0 == ~cond); {38409#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:31,761 INFO L290 TraceCheckUtils]: 78: Hoare triple {38409#(<= ~counter~0 8)} assume true; {38409#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:31,762 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {38409#(<= ~counter~0 8)} {38409#(<= ~counter~0 8)} #96#return; {38409#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:31,762 INFO L290 TraceCheckUtils]: 80: Hoare triple {38409#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38409#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:31,763 INFO L290 TraceCheckUtils]: 81: Hoare triple {38409#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38434#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:31,763 INFO L290 TraceCheckUtils]: 82: Hoare triple {38434#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {38434#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:31,764 INFO L272 TraceCheckUtils]: 83: Hoare triple {38434#(<= ~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)); {38434#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:31,764 INFO L290 TraceCheckUtils]: 84: Hoare triple {38434#(<= ~counter~0 9)} ~cond := #in~cond; {38434#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:31,765 INFO L290 TraceCheckUtils]: 85: Hoare triple {38434#(<= ~counter~0 9)} assume !(0 == ~cond); {38434#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:31,765 INFO L290 TraceCheckUtils]: 86: Hoare triple {38434#(<= ~counter~0 9)} assume true; {38434#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:31,766 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {38434#(<= ~counter~0 9)} {38434#(<= ~counter~0 9)} #96#return; {38434#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:31,766 INFO L290 TraceCheckUtils]: 88: Hoare triple {38434#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38434#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:31,766 INFO L290 TraceCheckUtils]: 89: Hoare triple {38434#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38459#(<= |main_#t~post7| 9)} is VALID [2022-04-15 15:12:31,767 INFO L290 TraceCheckUtils]: 90: Hoare triple {38459#(<= |main_#t~post7| 9)} assume !(#t~post7 < 100);havoc #t~post7; {38178#false} is VALID [2022-04-15 15:12:31,767 INFO L290 TraceCheckUtils]: 91: Hoare triple {38178#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38178#false} is VALID [2022-04-15 15:12:31,767 INFO L290 TraceCheckUtils]: 92: Hoare triple {38178#false} assume !(#t~post8 < 100);havoc #t~post8; {38178#false} is VALID [2022-04-15 15:12:31,767 INFO L290 TraceCheckUtils]: 93: Hoare triple {38178#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38178#false} is VALID [2022-04-15 15:12:31,767 INFO L290 TraceCheckUtils]: 94: Hoare triple {38178#false} assume !(#t~post6 < 100);havoc #t~post6; {38178#false} is VALID [2022-04-15 15:12:31,767 INFO L272 TraceCheckUtils]: 95: Hoare triple {38178#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)); {38178#false} is VALID [2022-04-15 15:12:31,767 INFO L290 TraceCheckUtils]: 96: Hoare triple {38178#false} ~cond := #in~cond; {38178#false} is VALID [2022-04-15 15:12:31,767 INFO L290 TraceCheckUtils]: 97: Hoare triple {38178#false} assume 0 == ~cond; {38178#false} is VALID [2022-04-15 15:12:31,768 INFO L290 TraceCheckUtils]: 98: Hoare triple {38178#false} assume !false; {38178#false} is VALID [2022-04-15 15:12:31,768 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 202 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:31,768 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:32,332 INFO L290 TraceCheckUtils]: 98: Hoare triple {38178#false} assume !false; {38178#false} is VALID [2022-04-15 15:12:32,332 INFO L290 TraceCheckUtils]: 97: Hoare triple {38178#false} assume 0 == ~cond; {38178#false} is VALID [2022-04-15 15:12:32,332 INFO L290 TraceCheckUtils]: 96: Hoare triple {38178#false} ~cond := #in~cond; {38178#false} is VALID [2022-04-15 15:12:32,332 INFO L272 TraceCheckUtils]: 95: Hoare triple {38178#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)); {38178#false} is VALID [2022-04-15 15:12:32,332 INFO L290 TraceCheckUtils]: 94: Hoare triple {38178#false} assume !(#t~post6 < 100);havoc #t~post6; {38178#false} is VALID [2022-04-15 15:12:32,332 INFO L290 TraceCheckUtils]: 93: Hoare triple {38178#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38178#false} is VALID [2022-04-15 15:12:32,333 INFO L290 TraceCheckUtils]: 92: Hoare triple {38178#false} assume !(#t~post8 < 100);havoc #t~post8; {38178#false} is VALID [2022-04-15 15:12:32,333 INFO L290 TraceCheckUtils]: 91: Hoare triple {38178#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38178#false} is VALID [2022-04-15 15:12:32,335 INFO L290 TraceCheckUtils]: 90: Hoare triple {38511#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {38178#false} is VALID [2022-04-15 15:12:32,335 INFO L290 TraceCheckUtils]: 89: Hoare triple {38515#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38511#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:12:32,335 INFO L290 TraceCheckUtils]: 88: Hoare triple {38515#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38515#(< ~counter~0 100)} is VALID [2022-04-15 15:12:32,336 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {38177#true} {38515#(< ~counter~0 100)} #96#return; {38515#(< ~counter~0 100)} is VALID [2022-04-15 15:12:32,336 INFO L290 TraceCheckUtils]: 86: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,336 INFO L290 TraceCheckUtils]: 85: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,336 INFO L290 TraceCheckUtils]: 84: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,336 INFO L272 TraceCheckUtils]: 83: Hoare triple {38515#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,336 INFO L290 TraceCheckUtils]: 82: Hoare triple {38515#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {38515#(< ~counter~0 100)} is VALID [2022-04-15 15:12:32,337 INFO L290 TraceCheckUtils]: 81: Hoare triple {38540#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38515#(< ~counter~0 100)} is VALID [2022-04-15 15:12:32,338 INFO L290 TraceCheckUtils]: 80: Hoare triple {38540#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38540#(< ~counter~0 99)} is VALID [2022-04-15 15:12:32,338 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {38177#true} {38540#(< ~counter~0 99)} #96#return; {38540#(< ~counter~0 99)} is VALID [2022-04-15 15:12:32,338 INFO L290 TraceCheckUtils]: 78: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,338 INFO L290 TraceCheckUtils]: 77: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,338 INFO L290 TraceCheckUtils]: 76: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,338 INFO L272 TraceCheckUtils]: 75: Hoare triple {38540#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,339 INFO L290 TraceCheckUtils]: 74: Hoare triple {38540#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {38540#(< ~counter~0 99)} is VALID [2022-04-15 15:12:32,339 INFO L290 TraceCheckUtils]: 73: Hoare triple {38565#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38540#(< ~counter~0 99)} is VALID [2022-04-15 15:12:32,340 INFO L290 TraceCheckUtils]: 72: Hoare triple {38565#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38565#(< ~counter~0 98)} is VALID [2022-04-15 15:12:32,340 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {38177#true} {38565#(< ~counter~0 98)} #96#return; {38565#(< ~counter~0 98)} is VALID [2022-04-15 15:12:32,340 INFO L290 TraceCheckUtils]: 70: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,340 INFO L290 TraceCheckUtils]: 69: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,340 INFO L290 TraceCheckUtils]: 68: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,340 INFO L272 TraceCheckUtils]: 67: Hoare triple {38565#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,341 INFO L290 TraceCheckUtils]: 66: Hoare triple {38565#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {38565#(< ~counter~0 98)} is VALID [2022-04-15 15:12:32,341 INFO L290 TraceCheckUtils]: 65: Hoare triple {38590#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38565#(< ~counter~0 98)} is VALID [2022-04-15 15:12:32,341 INFO L290 TraceCheckUtils]: 64: Hoare triple {38590#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {38590#(< ~counter~0 97)} is VALID [2022-04-15 15:12:32,342 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {38177#true} {38590#(< ~counter~0 97)} #96#return; {38590#(< ~counter~0 97)} is VALID [2022-04-15 15:12:32,342 INFO L290 TraceCheckUtils]: 62: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,342 INFO L290 TraceCheckUtils]: 61: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,342 INFO L290 TraceCheckUtils]: 60: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,342 INFO L272 TraceCheckUtils]: 59: Hoare triple {38590#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,342 INFO L290 TraceCheckUtils]: 58: Hoare triple {38590#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {38590#(< ~counter~0 97)} is VALID [2022-04-15 15:12:32,343 INFO L290 TraceCheckUtils]: 57: Hoare triple {38615#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38590#(< ~counter~0 97)} is VALID [2022-04-15 15:12:32,343 INFO L290 TraceCheckUtils]: 56: Hoare triple {38615#(< ~counter~0 96)} assume !!(0 != ~r~0); {38615#(< ~counter~0 96)} is VALID [2022-04-15 15:12:32,344 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {38177#true} {38615#(< ~counter~0 96)} #94#return; {38615#(< ~counter~0 96)} is VALID [2022-04-15 15:12:32,344 INFO L290 TraceCheckUtils]: 54: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,344 INFO L290 TraceCheckUtils]: 53: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,344 INFO L290 TraceCheckUtils]: 52: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,344 INFO L272 TraceCheckUtils]: 51: Hoare triple {38615#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,344 INFO L290 TraceCheckUtils]: 50: Hoare triple {38615#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {38615#(< ~counter~0 96)} is VALID [2022-04-15 15:12:32,345 INFO L290 TraceCheckUtils]: 49: Hoare triple {38640#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38615#(< ~counter~0 96)} is VALID [2022-04-15 15:12:32,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {38640#(< ~counter~0 95)} assume !(~r~0 < 0); {38640#(< ~counter~0 95)} is VALID [2022-04-15 15:12:32,346 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {38177#true} {38640#(< ~counter~0 95)} #98#return; {38640#(< ~counter~0 95)} is VALID [2022-04-15 15:12:32,346 INFO L290 TraceCheckUtils]: 46: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,346 INFO L290 TraceCheckUtils]: 45: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,346 INFO L290 TraceCheckUtils]: 44: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,346 INFO L272 TraceCheckUtils]: 43: Hoare triple {38640#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,346 INFO L290 TraceCheckUtils]: 42: Hoare triple {38640#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {38640#(< ~counter~0 95)} is VALID [2022-04-15 15:12:32,347 INFO L290 TraceCheckUtils]: 41: Hoare triple {38665#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38640#(< ~counter~0 95)} is VALID [2022-04-15 15:12:32,347 INFO L290 TraceCheckUtils]: 40: Hoare triple {38665#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {38665#(< ~counter~0 94)} is VALID [2022-04-15 15:12:32,348 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {38177#true} {38665#(< ~counter~0 94)} #98#return; {38665#(< ~counter~0 94)} is VALID [2022-04-15 15:12:32,348 INFO L290 TraceCheckUtils]: 38: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,348 INFO L290 TraceCheckUtils]: 37: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,348 INFO L290 TraceCheckUtils]: 36: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,348 INFO L272 TraceCheckUtils]: 35: Hoare triple {38665#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,348 INFO L290 TraceCheckUtils]: 34: Hoare triple {38665#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {38665#(< ~counter~0 94)} is VALID [2022-04-15 15:12:32,349 INFO L290 TraceCheckUtils]: 33: Hoare triple {38690#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {38665#(< ~counter~0 94)} is VALID [2022-04-15 15:12:32,349 INFO L290 TraceCheckUtils]: 32: Hoare triple {38690#(< ~counter~0 93)} assume !(~r~0 > 0); {38690#(< ~counter~0 93)} is VALID [2022-04-15 15:12:32,350 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {38177#true} {38690#(< ~counter~0 93)} #96#return; {38690#(< ~counter~0 93)} is VALID [2022-04-15 15:12:32,350 INFO L290 TraceCheckUtils]: 30: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,350 INFO L290 TraceCheckUtils]: 29: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,350 INFO L290 TraceCheckUtils]: 28: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,350 INFO L272 TraceCheckUtils]: 27: Hoare triple {38690#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {38690#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {38690#(< ~counter~0 93)} is VALID [2022-04-15 15:12:32,351 INFO L290 TraceCheckUtils]: 25: Hoare triple {38715#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {38690#(< ~counter~0 93)} is VALID [2022-04-15 15:12:32,351 INFO L290 TraceCheckUtils]: 24: Hoare triple {38715#(< ~counter~0 92)} assume !!(0 != ~r~0); {38715#(< ~counter~0 92)} is VALID [2022-04-15 15:12:32,351 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {38177#true} {38715#(< ~counter~0 92)} #94#return; {38715#(< ~counter~0 92)} is VALID [2022-04-15 15:12:32,352 INFO L290 TraceCheckUtils]: 22: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,352 INFO L290 TraceCheckUtils]: 21: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,352 INFO L290 TraceCheckUtils]: 20: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,352 INFO L272 TraceCheckUtils]: 19: Hoare triple {38715#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {38715#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {38715#(< ~counter~0 92)} is VALID [2022-04-15 15:12:32,353 INFO L290 TraceCheckUtils]: 17: Hoare triple {38740#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {38715#(< ~counter~0 92)} is VALID [2022-04-15 15:12:32,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {38740#(< ~counter~0 91)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {38740#(< ~counter~0 91)} is VALID [2022-04-15 15:12:32,353 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {38177#true} {38740#(< ~counter~0 91)} #92#return; {38740#(< ~counter~0 91)} is VALID [2022-04-15 15:12:32,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,354 INFO L290 TraceCheckUtils]: 13: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,354 INFO L290 TraceCheckUtils]: 12: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,354 INFO L272 TraceCheckUtils]: 11: Hoare triple {38740#(< ~counter~0 91)} 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)); {38177#true} is VALID [2022-04-15 15:12:32,354 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {38177#true} {38740#(< ~counter~0 91)} #90#return; {38740#(< ~counter~0 91)} is VALID [2022-04-15 15:12:32,354 INFO L290 TraceCheckUtils]: 9: Hoare triple {38177#true} assume true; {38177#true} is VALID [2022-04-15 15:12:32,354 INFO L290 TraceCheckUtils]: 8: Hoare triple {38177#true} assume !(0 == ~cond); {38177#true} is VALID [2022-04-15 15:12:32,354 INFO L290 TraceCheckUtils]: 7: Hoare triple {38177#true} ~cond := #in~cond; {38177#true} is VALID [2022-04-15 15:12:32,354 INFO L272 TraceCheckUtils]: 6: Hoare triple {38740#(< ~counter~0 91)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {38177#true} is VALID [2022-04-15 15:12:32,355 INFO L290 TraceCheckUtils]: 5: Hoare triple {38740#(< ~counter~0 91)} 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; {38740#(< ~counter~0 91)} is VALID [2022-04-15 15:12:32,355 INFO L272 TraceCheckUtils]: 4: Hoare triple {38740#(< ~counter~0 91)} call #t~ret9 := main(); {38740#(< ~counter~0 91)} is VALID [2022-04-15 15:12:32,355 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {38740#(< ~counter~0 91)} {38177#true} #102#return; {38740#(< ~counter~0 91)} is VALID [2022-04-15 15:12:32,356 INFO L290 TraceCheckUtils]: 2: Hoare triple {38740#(< ~counter~0 91)} assume true; {38740#(< ~counter~0 91)} is VALID [2022-04-15 15:12:32,356 INFO L290 TraceCheckUtils]: 1: Hoare triple {38177#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; {38740#(< ~counter~0 91)} is VALID [2022-04-15 15:12:32,356 INFO L272 TraceCheckUtils]: 0: Hoare triple {38177#true} call ULTIMATE.init(); {38177#true} is VALID [2022-04-15 15:12:32,356 INFO L134 CoverageAnalysis]: Checked inductivity of 232 backedges. 26 proven. 58 refuted. 0 times theorem prover too weak. 148 trivial. 0 not checked. [2022-04-15 15:12:32,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:32,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411605682] [2022-04-15 15:12:32,357 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:32,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1859145471] [2022-04-15 15:12:32,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1859145471] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:32,357 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:32,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13] total 24 [2022-04-15 15:12:32,357 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:32,357 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [115440014] [2022-04-15 15:12:32,357 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [115440014] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:32,357 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:32,357 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2022-04-15 15:12:32,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765408495] [2022-04-15 15:12:32,357 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:32,358 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 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 99 [2022-04-15 15:12:32,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:32,358 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 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-15 15:12:32,429 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:32,429 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-04-15 15:12:32,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:32,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-04-15 15:12:32,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=236, Invalid=316, Unknown=0, NotChecked=0, Total=552 [2022-04-15 15:12:32,430 INFO L87 Difference]: Start difference. First operand 356 states and 471 transitions. Second operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 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-15 15:12:33,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:33,573 INFO L93 Difference]: Finished difference Result 475 states and 645 transitions. [2022-04-15 15:12:33,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 15:12:33,573 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 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 99 [2022-04-15 15:12:33,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:33,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 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-15 15:12:33,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 15:12:33,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 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-15 15:12:33,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 216 transitions. [2022-04-15 15:12:33,577 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 216 transitions. [2022-04-15 15:12:33,771 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:33,777 INFO L225 Difference]: With dead ends: 475 [2022-04-15 15:12:33,777 INFO L226 Difference]: Without dead ends: 368 [2022-04-15 15:12:33,778 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 205 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=412, Invalid=580, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:12:33,778 INFO L913 BasicCegarLoop]: 57 mSDtfsCounter, 107 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 191 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:33,778 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [107 Valid, 237 Invalid, 191 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:12:33,779 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 368 states. [2022-04-15 15:12:34,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 368 to 368. [2022-04-15 15:12:34,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:34,327 INFO L82 GeneralOperation]: Start isEquivalent. First operand 368 states. Second operand has 368 states, 280 states have (on average 1.2035714285714285) internal successors, (337), 280 states have internal predecessors, (337), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:34,328 INFO L74 IsIncluded]: Start isIncluded. First operand 368 states. Second operand has 368 states, 280 states have (on average 1.2035714285714285) internal successors, (337), 280 states have internal predecessors, (337), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:34,328 INFO L87 Difference]: Start difference. First operand 368 states. Second operand has 368 states, 280 states have (on average 1.2035714285714285) internal successors, (337), 280 states have internal predecessors, (337), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:34,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:34,337 INFO L93 Difference]: Finished difference Result 368 states and 483 transitions. [2022-04-15 15:12:34,337 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 483 transitions. [2022-04-15 15:12:34,337 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:34,338 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:34,338 INFO L74 IsIncluded]: Start isIncluded. First operand has 368 states, 280 states have (on average 1.2035714285714285) internal successors, (337), 280 states have internal predecessors, (337), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 368 states. [2022-04-15 15:12:34,338 INFO L87 Difference]: Start difference. First operand has 368 states, 280 states have (on average 1.2035714285714285) internal successors, (337), 280 states have internal predecessors, (337), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) Second operand 368 states. [2022-04-15 15:12:34,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:34,347 INFO L93 Difference]: Finished difference Result 368 states and 483 transitions. [2022-04-15 15:12:34,347 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 483 transitions. [2022-04-15 15:12:34,348 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:34,348 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:34,348 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:34,348 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 368 states, 280 states have (on average 1.2035714285714285) internal successors, (337), 280 states have internal predecessors, (337), 74 states have call successors, (74), 15 states have call predecessors, (74), 13 states have return successors, (72), 72 states have call predecessors, (72), 72 states have call successors, (72) [2022-04-15 15:12:34,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 368 states to 368 states and 483 transitions. [2022-04-15 15:12:34,359 INFO L78 Accepts]: Start accepts. Automaton has 368 states and 483 transitions. Word has length 99 [2022-04-15 15:12:34,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:34,359 INFO L478 AbstractCegarLoop]: Abstraction has 368 states and 483 transitions. [2022-04-15 15:12:34,359 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 5.384615384615385) internal successors, (70), 12 states have internal predecessors, (70), 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-15 15:12:34,359 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 368 states and 483 transitions. [2022-04-15 15:12:35,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 483 edges. 483 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:35,071 INFO L276 IsEmpty]: Start isEmpty. Operand 368 states and 483 transitions. [2022-04-15 15:12:35,072 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 104 [2022-04-15 15:12:35,072 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:35,072 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 4, 4, 4, 4, 4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:35,088 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (31)] Ended with exit code 0 [2022-04-15 15:12:35,272 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,31 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:35,273 INFO L403 AbstractCegarLoop]: === Iteration 31 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:35,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 3 times [2022-04-15 15:12:35,273 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:35,273 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [946190578] [2022-04-15 15:12:35,273 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:35,273 INFO L85 PathProgramCache]: Analyzing trace with hash -1761003221, now seen corresponding path program 4 times [2022-04-15 15:12:35,274 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:35,274 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020656460] [2022-04-15 15:12:35,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:35,274 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:35,285 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:35,285 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [165935874] [2022-04-15 15:12:35,285 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:35,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:35,285 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:35,286 INFO L229 MonitoredProcess]: Starting monitored process 32 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:35,286 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Waiting until timeout for monitored process [2022-04-15 15:12:35,386 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:35,386 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:35,387 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 15:12:35,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:35,412 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:35,929 INFO L272 TraceCheckUtils]: 0: Hoare triple {41232#true} call ULTIMATE.init(); {41232#true} is VALID [2022-04-15 15:12:35,929 INFO L290 TraceCheckUtils]: 1: Hoare triple {41232#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; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,929 INFO L290 TraceCheckUtils]: 2: Hoare triple {41240#(<= ~counter~0 0)} assume true; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,930 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41240#(<= ~counter~0 0)} {41232#true} #102#return; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,930 INFO L272 TraceCheckUtils]: 4: Hoare triple {41240#(<= ~counter~0 0)} call #t~ret9 := main(); {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,930 INFO L290 TraceCheckUtils]: 5: Hoare triple {41240#(<= ~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; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,931 INFO L272 TraceCheckUtils]: 6: Hoare triple {41240#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,931 INFO L290 TraceCheckUtils]: 7: Hoare triple {41240#(<= ~counter~0 0)} ~cond := #in~cond; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,931 INFO L290 TraceCheckUtils]: 8: Hoare triple {41240#(<= ~counter~0 0)} assume !(0 == ~cond); {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {41240#(<= ~counter~0 0)} assume true; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,932 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41240#(<= ~counter~0 0)} {41240#(<= ~counter~0 0)} #90#return; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,932 INFO L272 TraceCheckUtils]: 11: Hoare triple {41240#(<= ~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)); {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {41240#(<= ~counter~0 0)} ~cond := #in~cond; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {41240#(<= ~counter~0 0)} assume !(0 == ~cond); {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,933 INFO L290 TraceCheckUtils]: 14: Hoare triple {41240#(<= ~counter~0 0)} assume true; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,934 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41240#(<= ~counter~0 0)} {41240#(<= ~counter~0 0)} #92#return; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {41240#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41240#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:35,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {41240#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41289#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {41289#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {41289#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,936 INFO L272 TraceCheckUtils]: 19: Hoare triple {41289#(<= ~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)); {41289#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {41289#(<= ~counter~0 1)} ~cond := #in~cond; {41289#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {41289#(<= ~counter~0 1)} assume !(0 == ~cond); {41289#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,937 INFO L290 TraceCheckUtils]: 22: Hoare triple {41289#(<= ~counter~0 1)} assume true; {41289#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,937 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {41289#(<= ~counter~0 1)} {41289#(<= ~counter~0 1)} #94#return; {41289#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {41289#(<= ~counter~0 1)} assume !!(0 != ~r~0); {41289#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:35,938 INFO L290 TraceCheckUtils]: 25: Hoare triple {41289#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41314#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,938 INFO L290 TraceCheckUtils]: 26: Hoare triple {41314#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {41314#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,939 INFO L272 TraceCheckUtils]: 27: Hoare triple {41314#(<= ~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)); {41314#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,939 INFO L290 TraceCheckUtils]: 28: Hoare triple {41314#(<= ~counter~0 2)} ~cond := #in~cond; {41314#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,939 INFO L290 TraceCheckUtils]: 29: Hoare triple {41314#(<= ~counter~0 2)} assume !(0 == ~cond); {41314#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,940 INFO L290 TraceCheckUtils]: 30: Hoare triple {41314#(<= ~counter~0 2)} assume true; {41314#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,940 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {41314#(<= ~counter~0 2)} {41314#(<= ~counter~0 2)} #96#return; {41314#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,940 INFO L290 TraceCheckUtils]: 32: Hoare triple {41314#(<= ~counter~0 2)} assume !(~r~0 > 0); {41314#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:35,941 INFO L290 TraceCheckUtils]: 33: Hoare triple {41314#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41339#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,941 INFO L290 TraceCheckUtils]: 34: Hoare triple {41339#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {41339#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,942 INFO L272 TraceCheckUtils]: 35: Hoare triple {41339#(<= ~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)); {41339#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,942 INFO L290 TraceCheckUtils]: 36: Hoare triple {41339#(<= ~counter~0 3)} ~cond := #in~cond; {41339#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,942 INFO L290 TraceCheckUtils]: 37: Hoare triple {41339#(<= ~counter~0 3)} assume !(0 == ~cond); {41339#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,943 INFO L290 TraceCheckUtils]: 38: Hoare triple {41339#(<= ~counter~0 3)} assume true; {41339#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,943 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {41339#(<= ~counter~0 3)} {41339#(<= ~counter~0 3)} #98#return; {41339#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,943 INFO L290 TraceCheckUtils]: 40: Hoare triple {41339#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {41339#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:35,944 INFO L290 TraceCheckUtils]: 41: Hoare triple {41339#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41364#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,944 INFO L290 TraceCheckUtils]: 42: Hoare triple {41364#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {41364#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,945 INFO L272 TraceCheckUtils]: 43: Hoare triple {41364#(<= ~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)); {41364#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,945 INFO L290 TraceCheckUtils]: 44: Hoare triple {41364#(<= ~counter~0 4)} ~cond := #in~cond; {41364#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,945 INFO L290 TraceCheckUtils]: 45: Hoare triple {41364#(<= ~counter~0 4)} assume !(0 == ~cond); {41364#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,946 INFO L290 TraceCheckUtils]: 46: Hoare triple {41364#(<= ~counter~0 4)} assume true; {41364#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,946 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {41364#(<= ~counter~0 4)} {41364#(<= ~counter~0 4)} #98#return; {41364#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,946 INFO L290 TraceCheckUtils]: 48: Hoare triple {41364#(<= ~counter~0 4)} assume !(~r~0 < 0); {41364#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:35,947 INFO L290 TraceCheckUtils]: 49: Hoare triple {41364#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41389#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:35,947 INFO L290 TraceCheckUtils]: 50: Hoare triple {41389#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {41389#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:35,948 INFO L272 TraceCheckUtils]: 51: Hoare triple {41389#(<= ~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)); {41389#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:35,948 INFO L290 TraceCheckUtils]: 52: Hoare triple {41389#(<= ~counter~0 5)} ~cond := #in~cond; {41389#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:35,948 INFO L290 TraceCheckUtils]: 53: Hoare triple {41389#(<= ~counter~0 5)} assume !(0 == ~cond); {41389#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:35,949 INFO L290 TraceCheckUtils]: 54: Hoare triple {41389#(<= ~counter~0 5)} assume true; {41389#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:35,949 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {41389#(<= ~counter~0 5)} {41389#(<= ~counter~0 5)} #94#return; {41389#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:35,949 INFO L290 TraceCheckUtils]: 56: Hoare triple {41389#(<= ~counter~0 5)} assume !!(0 != ~r~0); {41389#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:35,950 INFO L290 TraceCheckUtils]: 57: Hoare triple {41389#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41414#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:35,950 INFO L290 TraceCheckUtils]: 58: Hoare triple {41414#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {41414#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:35,951 INFO L272 TraceCheckUtils]: 59: Hoare triple {41414#(<= ~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)); {41414#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:35,951 INFO L290 TraceCheckUtils]: 60: Hoare triple {41414#(<= ~counter~0 6)} ~cond := #in~cond; {41414#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:35,954 INFO L290 TraceCheckUtils]: 61: Hoare triple {41414#(<= ~counter~0 6)} assume !(0 == ~cond); {41414#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:35,954 INFO L290 TraceCheckUtils]: 62: Hoare triple {41414#(<= ~counter~0 6)} assume true; {41414#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:35,955 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {41414#(<= ~counter~0 6)} {41414#(<= ~counter~0 6)} #96#return; {41414#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:35,955 INFO L290 TraceCheckUtils]: 64: Hoare triple {41414#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {41414#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:35,956 INFO L290 TraceCheckUtils]: 65: Hoare triple {41414#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41439#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:35,956 INFO L290 TraceCheckUtils]: 66: Hoare triple {41439#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {41439#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:35,957 INFO L272 TraceCheckUtils]: 67: Hoare triple {41439#(<= ~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)); {41439#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:35,957 INFO L290 TraceCheckUtils]: 68: Hoare triple {41439#(<= ~counter~0 7)} ~cond := #in~cond; {41439#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:35,957 INFO L290 TraceCheckUtils]: 69: Hoare triple {41439#(<= ~counter~0 7)} assume !(0 == ~cond); {41439#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:35,957 INFO L290 TraceCheckUtils]: 70: Hoare triple {41439#(<= ~counter~0 7)} assume true; {41439#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:35,958 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {41439#(<= ~counter~0 7)} {41439#(<= ~counter~0 7)} #96#return; {41439#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:35,958 INFO L290 TraceCheckUtils]: 72: Hoare triple {41439#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {41439#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:35,959 INFO L290 TraceCheckUtils]: 73: Hoare triple {41439#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41464#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:35,959 INFO L290 TraceCheckUtils]: 74: Hoare triple {41464#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {41464#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:35,960 INFO L272 TraceCheckUtils]: 75: Hoare triple {41464#(<= ~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)); {41464#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:35,960 INFO L290 TraceCheckUtils]: 76: Hoare triple {41464#(<= ~counter~0 8)} ~cond := #in~cond; {41464#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:35,960 INFO L290 TraceCheckUtils]: 77: Hoare triple {41464#(<= ~counter~0 8)} assume !(0 == ~cond); {41464#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:35,960 INFO L290 TraceCheckUtils]: 78: Hoare triple {41464#(<= ~counter~0 8)} assume true; {41464#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:35,961 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {41464#(<= ~counter~0 8)} {41464#(<= ~counter~0 8)} #96#return; {41464#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:35,961 INFO L290 TraceCheckUtils]: 80: Hoare triple {41464#(<= ~counter~0 8)} assume !(~r~0 > 0); {41464#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:35,962 INFO L290 TraceCheckUtils]: 81: Hoare triple {41464#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41489#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:35,962 INFO L290 TraceCheckUtils]: 82: Hoare triple {41489#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {41489#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:35,963 INFO L272 TraceCheckUtils]: 83: Hoare triple {41489#(<= ~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)); {41489#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:35,963 INFO L290 TraceCheckUtils]: 84: Hoare triple {41489#(<= ~counter~0 9)} ~cond := #in~cond; {41489#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:35,963 INFO L290 TraceCheckUtils]: 85: Hoare triple {41489#(<= ~counter~0 9)} assume !(0 == ~cond); {41489#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:35,963 INFO L290 TraceCheckUtils]: 86: Hoare triple {41489#(<= ~counter~0 9)} assume true; {41489#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:35,964 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {41489#(<= ~counter~0 9)} {41489#(<= ~counter~0 9)} #98#return; {41489#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:35,964 INFO L290 TraceCheckUtils]: 88: Hoare triple {41489#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {41489#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:35,965 INFO L290 TraceCheckUtils]: 89: Hoare triple {41489#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41514#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:35,965 INFO L290 TraceCheckUtils]: 90: Hoare triple {41514#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {41514#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:35,966 INFO L272 TraceCheckUtils]: 91: Hoare triple {41514#(<= ~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)); {41514#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:35,966 INFO L290 TraceCheckUtils]: 92: Hoare triple {41514#(<= ~counter~0 10)} ~cond := #in~cond; {41514#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:35,967 INFO L290 TraceCheckUtils]: 93: Hoare triple {41514#(<= ~counter~0 10)} assume !(0 == ~cond); {41514#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:35,971 INFO L290 TraceCheckUtils]: 94: Hoare triple {41514#(<= ~counter~0 10)} assume true; {41514#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:35,972 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {41514#(<= ~counter~0 10)} {41514#(<= ~counter~0 10)} #98#return; {41514#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:35,972 INFO L290 TraceCheckUtils]: 96: Hoare triple {41514#(<= ~counter~0 10)} assume !(~r~0 < 0); {41514#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:35,973 INFO L290 TraceCheckUtils]: 97: Hoare triple {41514#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41539#(<= |main_#t~post6| 10)} is VALID [2022-04-15 15:12:35,973 INFO L290 TraceCheckUtils]: 98: Hoare triple {41539#(<= |main_#t~post6| 10)} assume !(#t~post6 < 100);havoc #t~post6; {41233#false} is VALID [2022-04-15 15:12:35,974 INFO L272 TraceCheckUtils]: 99: Hoare triple {41233#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)); {41233#false} is VALID [2022-04-15 15:12:35,974 INFO L290 TraceCheckUtils]: 100: Hoare triple {41233#false} ~cond := #in~cond; {41233#false} is VALID [2022-04-15 15:12:35,974 INFO L290 TraceCheckUtils]: 101: Hoare triple {41233#false} assume 0 == ~cond; {41233#false} is VALID [2022-04-15 15:12:35,974 INFO L290 TraceCheckUtils]: 102: Hoare triple {41233#false} assume !false; {41233#false} is VALID [2022-04-15 15:12:35,974 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 236 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:35,974 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:36,590 INFO L290 TraceCheckUtils]: 102: Hoare triple {41233#false} assume !false; {41233#false} is VALID [2022-04-15 15:12:36,590 INFO L290 TraceCheckUtils]: 101: Hoare triple {41233#false} assume 0 == ~cond; {41233#false} is VALID [2022-04-15 15:12:36,590 INFO L290 TraceCheckUtils]: 100: Hoare triple {41233#false} ~cond := #in~cond; {41233#false} is VALID [2022-04-15 15:12:36,590 INFO L272 TraceCheckUtils]: 99: Hoare triple {41233#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)); {41233#false} is VALID [2022-04-15 15:12:36,590 INFO L290 TraceCheckUtils]: 98: Hoare triple {41567#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {41233#false} is VALID [2022-04-15 15:12:36,591 INFO L290 TraceCheckUtils]: 97: Hoare triple {41571#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41567#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:12:36,591 INFO L290 TraceCheckUtils]: 96: Hoare triple {41571#(< ~counter~0 100)} assume !(~r~0 < 0); {41571#(< ~counter~0 100)} is VALID [2022-04-15 15:12:36,591 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {41232#true} {41571#(< ~counter~0 100)} #98#return; {41571#(< ~counter~0 100)} is VALID [2022-04-15 15:12:36,592 INFO L290 TraceCheckUtils]: 94: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,592 INFO L290 TraceCheckUtils]: 93: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,592 INFO L290 TraceCheckUtils]: 92: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,592 INFO L272 TraceCheckUtils]: 91: Hoare triple {41571#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,592 INFO L290 TraceCheckUtils]: 90: Hoare triple {41571#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {41571#(< ~counter~0 100)} is VALID [2022-04-15 15:12:36,593 INFO L290 TraceCheckUtils]: 89: Hoare triple {41596#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41571#(< ~counter~0 100)} is VALID [2022-04-15 15:12:36,593 INFO L290 TraceCheckUtils]: 88: Hoare triple {41596#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {41596#(< ~counter~0 99)} is VALID [2022-04-15 15:12:36,594 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {41232#true} {41596#(< ~counter~0 99)} #98#return; {41596#(< ~counter~0 99)} is VALID [2022-04-15 15:12:36,594 INFO L290 TraceCheckUtils]: 86: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,594 INFO L290 TraceCheckUtils]: 85: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,594 INFO L290 TraceCheckUtils]: 84: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,594 INFO L272 TraceCheckUtils]: 83: Hoare triple {41596#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,594 INFO L290 TraceCheckUtils]: 82: Hoare triple {41596#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {41596#(< ~counter~0 99)} is VALID [2022-04-15 15:12:36,595 INFO L290 TraceCheckUtils]: 81: Hoare triple {41621#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41596#(< ~counter~0 99)} is VALID [2022-04-15 15:12:36,595 INFO L290 TraceCheckUtils]: 80: Hoare triple {41621#(< ~counter~0 98)} assume !(~r~0 > 0); {41621#(< ~counter~0 98)} is VALID [2022-04-15 15:12:36,596 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {41232#true} {41621#(< ~counter~0 98)} #96#return; {41621#(< ~counter~0 98)} is VALID [2022-04-15 15:12:36,596 INFO L290 TraceCheckUtils]: 78: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,596 INFO L290 TraceCheckUtils]: 77: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,596 INFO L290 TraceCheckUtils]: 76: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,596 INFO L272 TraceCheckUtils]: 75: Hoare triple {41621#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,596 INFO L290 TraceCheckUtils]: 74: Hoare triple {41621#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {41621#(< ~counter~0 98)} is VALID [2022-04-15 15:12:36,597 INFO L290 TraceCheckUtils]: 73: Hoare triple {41646#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41621#(< ~counter~0 98)} is VALID [2022-04-15 15:12:36,597 INFO L290 TraceCheckUtils]: 72: Hoare triple {41646#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {41646#(< ~counter~0 97)} is VALID [2022-04-15 15:12:36,598 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {41232#true} {41646#(< ~counter~0 97)} #96#return; {41646#(< ~counter~0 97)} is VALID [2022-04-15 15:12:36,598 INFO L290 TraceCheckUtils]: 70: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,598 INFO L290 TraceCheckUtils]: 69: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,598 INFO L290 TraceCheckUtils]: 68: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,598 INFO L272 TraceCheckUtils]: 67: Hoare triple {41646#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,598 INFO L290 TraceCheckUtils]: 66: Hoare triple {41646#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {41646#(< ~counter~0 97)} is VALID [2022-04-15 15:12:36,599 INFO L290 TraceCheckUtils]: 65: Hoare triple {41671#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41646#(< ~counter~0 97)} is VALID [2022-04-15 15:12:36,599 INFO L290 TraceCheckUtils]: 64: Hoare triple {41671#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {41671#(< ~counter~0 96)} is VALID [2022-04-15 15:12:36,600 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {41232#true} {41671#(< ~counter~0 96)} #96#return; {41671#(< ~counter~0 96)} is VALID [2022-04-15 15:12:36,600 INFO L290 TraceCheckUtils]: 62: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,600 INFO L290 TraceCheckUtils]: 61: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,600 INFO L290 TraceCheckUtils]: 60: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,600 INFO L272 TraceCheckUtils]: 59: Hoare triple {41671#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,600 INFO L290 TraceCheckUtils]: 58: Hoare triple {41671#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {41671#(< ~counter~0 96)} is VALID [2022-04-15 15:12:36,601 INFO L290 TraceCheckUtils]: 57: Hoare triple {41696#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41671#(< ~counter~0 96)} is VALID [2022-04-15 15:12:36,601 INFO L290 TraceCheckUtils]: 56: Hoare triple {41696#(< ~counter~0 95)} assume !!(0 != ~r~0); {41696#(< ~counter~0 95)} is VALID [2022-04-15 15:12:36,602 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {41232#true} {41696#(< ~counter~0 95)} #94#return; {41696#(< ~counter~0 95)} is VALID [2022-04-15 15:12:36,602 INFO L290 TraceCheckUtils]: 54: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,602 INFO L290 TraceCheckUtils]: 53: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,602 INFO L290 TraceCheckUtils]: 52: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,602 INFO L272 TraceCheckUtils]: 51: Hoare triple {41696#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,602 INFO L290 TraceCheckUtils]: 50: Hoare triple {41696#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {41696#(< ~counter~0 95)} is VALID [2022-04-15 15:12:36,603 INFO L290 TraceCheckUtils]: 49: Hoare triple {41721#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41696#(< ~counter~0 95)} is VALID [2022-04-15 15:12:36,603 INFO L290 TraceCheckUtils]: 48: Hoare triple {41721#(< ~counter~0 94)} assume !(~r~0 < 0); {41721#(< ~counter~0 94)} is VALID [2022-04-15 15:12:36,604 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {41232#true} {41721#(< ~counter~0 94)} #98#return; {41721#(< ~counter~0 94)} is VALID [2022-04-15 15:12:36,604 INFO L290 TraceCheckUtils]: 46: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,604 INFO L290 TraceCheckUtils]: 45: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,604 INFO L290 TraceCheckUtils]: 44: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,604 INFO L272 TraceCheckUtils]: 43: Hoare triple {41721#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,604 INFO L290 TraceCheckUtils]: 42: Hoare triple {41721#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {41721#(< ~counter~0 94)} is VALID [2022-04-15 15:12:36,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {41746#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41721#(< ~counter~0 94)} is VALID [2022-04-15 15:12:36,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {41746#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {41746#(< ~counter~0 93)} is VALID [2022-04-15 15:12:36,605 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {41232#true} {41746#(< ~counter~0 93)} #98#return; {41746#(< ~counter~0 93)} is VALID [2022-04-15 15:12:36,606 INFO L290 TraceCheckUtils]: 38: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,606 INFO L290 TraceCheckUtils]: 37: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,606 INFO L290 TraceCheckUtils]: 36: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,606 INFO L272 TraceCheckUtils]: 35: Hoare triple {41746#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,606 INFO L290 TraceCheckUtils]: 34: Hoare triple {41746#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {41746#(< ~counter~0 93)} is VALID [2022-04-15 15:12:36,607 INFO L290 TraceCheckUtils]: 33: Hoare triple {41771#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {41746#(< ~counter~0 93)} is VALID [2022-04-15 15:12:36,607 INFO L290 TraceCheckUtils]: 32: Hoare triple {41771#(< ~counter~0 92)} assume !(~r~0 > 0); {41771#(< ~counter~0 92)} is VALID [2022-04-15 15:12:36,607 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {41232#true} {41771#(< ~counter~0 92)} #96#return; {41771#(< ~counter~0 92)} is VALID [2022-04-15 15:12:36,607 INFO L290 TraceCheckUtils]: 30: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,607 INFO L290 TraceCheckUtils]: 29: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,608 INFO L272 TraceCheckUtils]: 27: Hoare triple {41771#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,608 INFO L290 TraceCheckUtils]: 26: Hoare triple {41771#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {41771#(< ~counter~0 92)} is VALID [2022-04-15 15:12:36,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {41796#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {41771#(< ~counter~0 92)} is VALID [2022-04-15 15:12:36,609 INFO L290 TraceCheckUtils]: 24: Hoare triple {41796#(< ~counter~0 91)} assume !!(0 != ~r~0); {41796#(< ~counter~0 91)} is VALID [2022-04-15 15:12:36,609 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {41232#true} {41796#(< ~counter~0 91)} #94#return; {41796#(< ~counter~0 91)} is VALID [2022-04-15 15:12:36,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,610 INFO L272 TraceCheckUtils]: 19: Hoare triple {41796#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,610 INFO L290 TraceCheckUtils]: 18: Hoare triple {41796#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {41796#(< ~counter~0 91)} is VALID [2022-04-15 15:12:36,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {41821#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {41796#(< ~counter~0 91)} is VALID [2022-04-15 15:12:36,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {41821#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {41821#(< ~counter~0 90)} is VALID [2022-04-15 15:12:36,611 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {41232#true} {41821#(< ~counter~0 90)} #92#return; {41821#(< ~counter~0 90)} is VALID [2022-04-15 15:12:36,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,611 INFO L272 TraceCheckUtils]: 11: Hoare triple {41821#(< ~counter~0 90)} 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)); {41232#true} is VALID [2022-04-15 15:12:36,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41232#true} {41821#(< ~counter~0 90)} #90#return; {41821#(< ~counter~0 90)} is VALID [2022-04-15 15:12:36,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {41232#true} assume true; {41232#true} is VALID [2022-04-15 15:12:36,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {41232#true} assume !(0 == ~cond); {41232#true} is VALID [2022-04-15 15:12:36,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {41232#true} ~cond := #in~cond; {41232#true} is VALID [2022-04-15 15:12:36,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {41821#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {41232#true} is VALID [2022-04-15 15:12:36,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {41821#(< ~counter~0 90)} 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; {41821#(< ~counter~0 90)} is VALID [2022-04-15 15:12:36,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {41821#(< ~counter~0 90)} call #t~ret9 := main(); {41821#(< ~counter~0 90)} is VALID [2022-04-15 15:12:36,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41821#(< ~counter~0 90)} {41232#true} #102#return; {41821#(< ~counter~0 90)} is VALID [2022-04-15 15:12:36,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {41821#(< ~counter~0 90)} assume true; {41821#(< ~counter~0 90)} is VALID [2022-04-15 15:12:36,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {41232#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; {41821#(< ~counter~0 90)} is VALID [2022-04-15 15:12:36,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {41232#true} call ULTIMATE.init(); {41232#true} is VALID [2022-04-15 15:12:36,614 INFO L134 CoverageAnalysis]: Checked inductivity of 260 backedges. 20 proven. 56 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:12:36,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:36,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020656460] [2022-04-15 15:12:36,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:36,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [165935874] [2022-04-15 15:12:36,614 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [165935874] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:36,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:36,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 15:12:36,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:36,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [946190578] [2022-04-15 15:12:36,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [946190578] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:36,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:36,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 15:12:36,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1905058362] [2022-04-15 15:12:36,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:36,616 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 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 103 [2022-04-15 15:12:36,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:36,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 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-15 15:12:36,694 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:36,694 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 15:12:36,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:36,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 15:12:36,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 15:12:36,695 INFO L87 Difference]: Start difference. First operand 368 states and 483 transitions. Second operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 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-15 15:12:37,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:37,986 INFO L93 Difference]: Finished difference Result 411 states and 541 transitions. [2022-04-15 15:12:37,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2022-04-15 15:12:37,986 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 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 103 [2022-04-15 15:12:37,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:37,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 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-15 15:12:37,988 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-15 15:12:37,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 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-15 15:12:37,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 214 transitions. [2022-04-15 15:12:37,990 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 21 states and 214 transitions. [2022-04-15 15:12:38,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:38,161 INFO L225 Difference]: With dead ends: 411 [2022-04-15 15:12:38,161 INFO L226 Difference]: Without dead ends: 400 [2022-04-15 15:12:38,162 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 212 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 52 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=438, Invalid=618, Unknown=0, NotChecked=0, Total=1056 [2022-04-15 15:12:38,162 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 128 mSDsluCounter, 200 mSDsCounter, 0 mSdLazyCounter, 139 mSolverCounterSat, 109 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 109 IncrementalHoareTripleChecker+Valid, 139 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:38,162 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 260 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [109 Valid, 139 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:12:38,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-04-15 15:12:38,743 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 381. [2022-04-15 15:12:38,743 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:38,743 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 381 states, 284 states have (on average 1.204225352112676) internal successors, (342), 291 states have internal predecessors, (342), 82 states have call successors, (82), 16 states have call predecessors, (82), 14 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 15:12:38,744 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 381 states, 284 states have (on average 1.204225352112676) internal successors, (342), 291 states have internal predecessors, (342), 82 states have call successors, (82), 16 states have call predecessors, (82), 14 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 15:12:38,744 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 381 states, 284 states have (on average 1.204225352112676) internal successors, (342), 291 states have internal predecessors, (342), 82 states have call successors, (82), 16 states have call predecessors, (82), 14 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 15:12:38,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:38,754 INFO L93 Difference]: Finished difference Result 400 states and 526 transitions. [2022-04-15 15:12:38,754 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 526 transitions. [2022-04-15 15:12:38,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:38,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:38,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 284 states have (on average 1.204225352112676) internal successors, (342), 291 states have internal predecessors, (342), 82 states have call successors, (82), 16 states have call predecessors, (82), 14 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 400 states. [2022-04-15 15:12:38,756 INFO L87 Difference]: Start difference. First operand has 381 states, 284 states have (on average 1.204225352112676) internal successors, (342), 291 states have internal predecessors, (342), 82 states have call successors, (82), 16 states have call predecessors, (82), 14 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) Second operand 400 states. [2022-04-15 15:12:38,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:38,766 INFO L93 Difference]: Finished difference Result 400 states and 526 transitions. [2022-04-15 15:12:38,766 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 526 transitions. [2022-04-15 15:12:38,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:38,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:38,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:38,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:38,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 284 states have (on average 1.204225352112676) internal successors, (342), 291 states have internal predecessors, (342), 82 states have call successors, (82), 16 states have call predecessors, (82), 14 states have return successors, (80), 73 states have call predecessors, (80), 80 states have call successors, (80) [2022-04-15 15:12:38,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 504 transitions. [2022-04-15 15:12:38,779 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 504 transitions. Word has length 103 [2022-04-15 15:12:38,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:38,779 INFO L478 AbstractCegarLoop]: Abstraction has 381 states and 504 transitions. [2022-04-15 15:12:38,779 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.142857142857143) internal successors, (72), 13 states have internal predecessors, (72), 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-15 15:12:38,779 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 381 states and 504 transitions. [2022-04-15 15:12:39,957 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 504 edges. 504 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:39,957 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 504 transitions. [2022-04-15 15:12:39,958 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 15:12:39,958 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:39,958 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:39,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (32)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:40,159 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,32 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:40,159 INFO L403 AbstractCegarLoop]: === Iteration 32 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:40,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 9 times [2022-04-15 15:12:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:40,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1426066079] [2022-04-15 15:12:40,160 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:40,160 INFO L85 PathProgramCache]: Analyzing trace with hash 1733340336, now seen corresponding path program 10 times [2022-04-15 15:12:40,160 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:40,160 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193878956] [2022-04-15 15:12:40,160 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:40,161 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:40,172 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:40,172 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [273349145] [2022-04-15 15:12:40,172 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:12:40,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:40,173 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:40,174 INFO L229 MonitoredProcess]: Starting monitored process 33 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:40,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Waiting until timeout for monitored process [2022-04-15 15:12:40,244 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:12:40,244 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:40,245 INFO L263 TraceCheckSpWp]: Trace formula consists of 223 conjuncts, 9 conjunts are in the unsatisfiable core [2022-04-15 15:12:40,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:40,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:41,139 INFO L272 TraceCheckUtils]: 0: Hoare triple {44273#true} call ULTIMATE.init(); {44273#true} is VALID [2022-04-15 15:12:41,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {44273#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; {44273#true} is VALID [2022-04-15 15:12:41,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44273#true} {44273#true} #102#return; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L272 TraceCheckUtils]: 4: Hoare triple {44273#true} call #t~ret9 := main(); {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {44273#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; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L272 TraceCheckUtils]: 6: Hoare triple {44273#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44273#true} {44273#true} #90#return; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L272 TraceCheckUtils]: 11: Hoare triple {44273#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)); {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L290 TraceCheckUtils]: 12: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L290 TraceCheckUtils]: 13: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L290 TraceCheckUtils]: 14: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44273#true} {44273#true} #92#return; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L290 TraceCheckUtils]: 16: Hoare triple {44273#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {44273#true} is VALID [2022-04-15 15:12:41,140 INFO L290 TraceCheckUtils]: 17: Hoare triple {44273#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 18: Hoare triple {44273#true} assume !!(#t~post6 < 100);havoc #t~post6; {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L272 TraceCheckUtils]: 19: Hoare triple {44273#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)); {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 20: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 21: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 22: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {44273#true} {44273#true} #94#return; {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 24: Hoare triple {44273#true} assume !!(0 != ~r~0); {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {44273#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 26: Hoare triple {44273#true} assume !!(#t~post7 < 100);havoc #t~post7; {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L272 TraceCheckUtils]: 27: Hoare triple {44273#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)); {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 28: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 29: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L290 TraceCheckUtils]: 30: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,141 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {44273#true} {44273#true} #96#return; {44273#true} is VALID [2022-04-15 15:12:41,142 INFO L290 TraceCheckUtils]: 32: Hoare triple {44273#true} assume !(~r~0 > 0); {44273#true} is VALID [2022-04-15 15:12:41,142 INFO L290 TraceCheckUtils]: 33: Hoare triple {44273#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44273#true} is VALID [2022-04-15 15:12:41,142 INFO L290 TraceCheckUtils]: 34: Hoare triple {44273#true} assume !!(#t~post8 < 100);havoc #t~post8; {44273#true} is VALID [2022-04-15 15:12:41,142 INFO L272 TraceCheckUtils]: 35: Hoare triple {44273#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)); {44273#true} is VALID [2022-04-15 15:12:41,142 INFO L290 TraceCheckUtils]: 36: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,142 INFO L290 TraceCheckUtils]: 37: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,142 INFO L290 TraceCheckUtils]: 38: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,142 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {44273#true} {44273#true} #98#return; {44273#true} is VALID [2022-04-15 15:12:41,143 INFO L290 TraceCheckUtils]: 40: Hoare triple {44273#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,144 INFO L290 TraceCheckUtils]: 41: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,144 INFO L290 TraceCheckUtils]: 42: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,144 INFO L272 TraceCheckUtils]: 43: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,144 INFO L290 TraceCheckUtils]: 44: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,144 INFO L290 TraceCheckUtils]: 45: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,144 INFO L290 TraceCheckUtils]: 46: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,145 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {44273#true} {44398#(< (+ main_~r~0 2) main_~u~0)} #98#return; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} assume !(~r~0 < 0); {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,145 INFO L290 TraceCheckUtils]: 49: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,146 INFO L272 TraceCheckUtils]: 51: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,146 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {44273#true} {44398#(< (+ main_~r~0 2) main_~u~0)} #94#return; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,147 INFO L290 TraceCheckUtils]: 56: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} assume !!(0 != ~r~0); {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,147 INFO L290 TraceCheckUtils]: 57: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,147 INFO L290 TraceCheckUtils]: 58: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,147 INFO L272 TraceCheckUtils]: 59: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,148 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {44273#true} {44398#(< (+ main_~r~0 2) main_~u~0)} #96#return; {44398#(< (+ main_~r~0 2) main_~u~0)} is VALID [2022-04-15 15:12:41,149 INFO L290 TraceCheckUtils]: 64: Hoare triple {44398#(< (+ main_~r~0 2) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {44471#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 15:12:41,149 INFO L290 TraceCheckUtils]: 65: Hoare triple {44471#(< (+ main_~v~0 main_~r~0) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44471#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 15:12:41,149 INFO L290 TraceCheckUtils]: 66: Hoare triple {44471#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {44471#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 15:12:41,149 INFO L272 TraceCheckUtils]: 67: Hoare triple {44471#(< (+ main_~v~0 main_~r~0) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,149 INFO L290 TraceCheckUtils]: 68: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,149 INFO L290 TraceCheckUtils]: 69: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,149 INFO L290 TraceCheckUtils]: 70: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,150 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {44273#true} {44471#(< (+ main_~v~0 main_~r~0) main_~u~0)} #96#return; {44471#(< (+ main_~v~0 main_~r~0) main_~u~0)} is VALID [2022-04-15 15:12:41,151 INFO L290 TraceCheckUtils]: 72: Hoare triple {44471#(< (+ main_~v~0 main_~r~0) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:12:41,151 INFO L290 TraceCheckUtils]: 73: Hoare triple {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:12:41,151 INFO L290 TraceCheckUtils]: 74: Hoare triple {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:12:41,151 INFO L272 TraceCheckUtils]: 75: Hoare triple {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~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)); {44273#true} is VALID [2022-04-15 15:12:41,151 INFO L290 TraceCheckUtils]: 76: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,151 INFO L290 TraceCheckUtils]: 77: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,151 INFO L290 TraceCheckUtils]: 78: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,152 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {44273#true} {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #96#return; {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:12:41,152 INFO L290 TraceCheckUtils]: 80: Hoare triple {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:12:41,152 INFO L290 TraceCheckUtils]: 81: Hoare triple {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:12:41,153 INFO L290 TraceCheckUtils]: 82: Hoare triple {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:12:41,153 INFO L272 TraceCheckUtils]: 83: Hoare triple {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~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)); {44273#true} is VALID [2022-04-15 15:12:41,153 INFO L290 TraceCheckUtils]: 84: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,153 INFO L290 TraceCheckUtils]: 85: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,153 INFO L290 TraceCheckUtils]: 86: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,153 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {44273#true} {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} #98#return; {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:12:41,154 INFO L290 TraceCheckUtils]: 88: Hoare triple {44496#(< 0 (div (+ (- 1) main_~u~0 main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {44545#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 15:12:41,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {44545#(< 0 (div (+ (- 1) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44545#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 15:12:41,155 INFO L290 TraceCheckUtils]: 90: Hoare triple {44545#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {44545#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 15:12:41,155 INFO L272 TraceCheckUtils]: 91: Hoare triple {44545#(< 0 (div (+ (- 1) main_~r~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)); {44273#true} is VALID [2022-04-15 15:12:41,155 INFO L290 TraceCheckUtils]: 92: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,155 INFO L290 TraceCheckUtils]: 93: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,155 INFO L290 TraceCheckUtils]: 94: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,156 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {44273#true} {44545#(< 0 (div (+ (- 1) main_~r~0) 2))} #98#return; {44545#(< 0 (div (+ (- 1) main_~r~0) 2))} is VALID [2022-04-15 15:12:41,156 INFO L290 TraceCheckUtils]: 96: Hoare triple {44545#(< 0 (div (+ (- 1) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {44274#false} is VALID [2022-04-15 15:12:41,156 INFO L290 TraceCheckUtils]: 97: Hoare triple {44274#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44274#false} is VALID [2022-04-15 15:12:41,156 INFO L290 TraceCheckUtils]: 98: Hoare triple {44274#false} assume !(#t~post8 < 100);havoc #t~post8; {44274#false} is VALID [2022-04-15 15:12:41,156 INFO L290 TraceCheckUtils]: 99: Hoare triple {44274#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44274#false} is VALID [2022-04-15 15:12:41,157 INFO L290 TraceCheckUtils]: 100: Hoare triple {44274#false} assume !(#t~post6 < 100);havoc #t~post6; {44274#false} is VALID [2022-04-15 15:12:41,157 INFO L272 TraceCheckUtils]: 101: Hoare triple {44274#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)); {44274#false} is VALID [2022-04-15 15:12:41,157 INFO L290 TraceCheckUtils]: 102: Hoare triple {44274#false} ~cond := #in~cond; {44274#false} is VALID [2022-04-15 15:12:41,157 INFO L290 TraceCheckUtils]: 103: Hoare triple {44274#false} assume 0 == ~cond; {44274#false} is VALID [2022-04-15 15:12:41,157 INFO L290 TraceCheckUtils]: 104: Hoare triple {44274#false} assume !false; {44274#false} is VALID [2022-04-15 15:12:41,157 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:12:41,157 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:41,624 INFO L290 TraceCheckUtils]: 104: Hoare triple {44274#false} assume !false; {44274#false} is VALID [2022-04-15 15:12:41,624 INFO L290 TraceCheckUtils]: 103: Hoare triple {44274#false} assume 0 == ~cond; {44274#false} is VALID [2022-04-15 15:12:41,624 INFO L290 TraceCheckUtils]: 102: Hoare triple {44274#false} ~cond := #in~cond; {44274#false} is VALID [2022-04-15 15:12:41,624 INFO L272 TraceCheckUtils]: 101: Hoare triple {44274#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)); {44274#false} is VALID [2022-04-15 15:12:41,624 INFO L290 TraceCheckUtils]: 100: Hoare triple {44274#false} assume !(#t~post6 < 100);havoc #t~post6; {44274#false} is VALID [2022-04-15 15:12:41,625 INFO L290 TraceCheckUtils]: 99: Hoare triple {44274#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44274#false} is VALID [2022-04-15 15:12:41,625 INFO L290 TraceCheckUtils]: 98: Hoare triple {44274#false} assume !(#t~post8 < 100);havoc #t~post8; {44274#false} is VALID [2022-04-15 15:12:41,625 INFO L290 TraceCheckUtils]: 97: Hoare triple {44274#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44274#false} is VALID [2022-04-15 15:12:41,625 INFO L290 TraceCheckUtils]: 96: Hoare triple {44618#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {44274#false} is VALID [2022-04-15 15:12:41,626 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {44273#true} {44618#(not (< main_~r~0 0))} #98#return; {44618#(not (< main_~r~0 0))} is VALID [2022-04-15 15:12:41,626 INFO L290 TraceCheckUtils]: 94: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,626 INFO L290 TraceCheckUtils]: 93: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,626 INFO L290 TraceCheckUtils]: 92: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,626 INFO L272 TraceCheckUtils]: 91: Hoare triple {44618#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,626 INFO L290 TraceCheckUtils]: 90: Hoare triple {44618#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {44618#(not (< main_~r~0 0))} is VALID [2022-04-15 15:12:41,627 INFO L290 TraceCheckUtils]: 89: Hoare triple {44618#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44618#(not (< main_~r~0 0))} is VALID [2022-04-15 15:12:41,627 INFO L290 TraceCheckUtils]: 88: Hoare triple {44643#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {44618#(not (< main_~r~0 0))} is VALID [2022-04-15 15:12:41,628 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {44273#true} {44643#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {44643#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:12:41,628 INFO L290 TraceCheckUtils]: 86: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,628 INFO L290 TraceCheckUtils]: 85: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,628 INFO L290 TraceCheckUtils]: 84: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,628 INFO L272 TraceCheckUtils]: 83: Hoare triple {44643#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,629 INFO L290 TraceCheckUtils]: 82: Hoare triple {44643#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {44643#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:12:41,629 INFO L290 TraceCheckUtils]: 81: Hoare triple {44643#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44643#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:12:41,629 INFO L290 TraceCheckUtils]: 80: Hoare triple {44643#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {44643#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:12:41,630 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {44273#true} {44643#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {44643#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:12:41,630 INFO L290 TraceCheckUtils]: 78: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,630 INFO L290 TraceCheckUtils]: 77: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,630 INFO L290 TraceCheckUtils]: 76: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,630 INFO L272 TraceCheckUtils]: 75: Hoare triple {44643#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,630 INFO L290 TraceCheckUtils]: 74: Hoare triple {44643#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {44643#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:12:41,631 INFO L290 TraceCheckUtils]: 73: Hoare triple {44643#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44643#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:12:41,631 INFO L290 TraceCheckUtils]: 72: Hoare triple {44692#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {44643#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:12:41,632 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {44273#true} {44692#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {44692#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:12:41,632 INFO L290 TraceCheckUtils]: 70: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,632 INFO L290 TraceCheckUtils]: 69: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,632 INFO L290 TraceCheckUtils]: 68: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,632 INFO L272 TraceCheckUtils]: 67: Hoare triple {44692#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,633 INFO L290 TraceCheckUtils]: 66: Hoare triple {44692#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {44692#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:12:41,633 INFO L290 TraceCheckUtils]: 65: Hoare triple {44692#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44692#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:12:41,634 INFO L290 TraceCheckUtils]: 64: Hoare triple {44717#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {44692#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:12:41,635 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {44273#true} {44717#(<= main_~r~0 main_~u~0)} #96#return; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,635 INFO L290 TraceCheckUtils]: 62: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,635 INFO L290 TraceCheckUtils]: 61: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,635 INFO L290 TraceCheckUtils]: 60: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,635 INFO L272 TraceCheckUtils]: 59: Hoare triple {44717#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,635 INFO L290 TraceCheckUtils]: 58: Hoare triple {44717#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,636 INFO L290 TraceCheckUtils]: 57: Hoare triple {44717#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,636 INFO L290 TraceCheckUtils]: 56: Hoare triple {44717#(<= main_~r~0 main_~u~0)} assume !!(0 != ~r~0); {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,637 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {44273#true} {44717#(<= main_~r~0 main_~u~0)} #94#return; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,637 INFO L290 TraceCheckUtils]: 54: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,637 INFO L290 TraceCheckUtils]: 53: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,637 INFO L290 TraceCheckUtils]: 52: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,637 INFO L272 TraceCheckUtils]: 51: Hoare triple {44717#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,637 INFO L290 TraceCheckUtils]: 50: Hoare triple {44717#(<= main_~r~0 main_~u~0)} assume !!(#t~post6 < 100);havoc #t~post6; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,638 INFO L290 TraceCheckUtils]: 49: Hoare triple {44717#(<= main_~r~0 main_~u~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,638 INFO L290 TraceCheckUtils]: 48: Hoare triple {44717#(<= main_~r~0 main_~u~0)} assume !(~r~0 < 0); {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,638 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {44273#true} {44717#(<= main_~r~0 main_~u~0)} #98#return; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,639 INFO L290 TraceCheckUtils]: 46: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,639 INFO L290 TraceCheckUtils]: 45: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,639 INFO L290 TraceCheckUtils]: 44: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,639 INFO L272 TraceCheckUtils]: 43: Hoare triple {44717#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,639 INFO L290 TraceCheckUtils]: 42: Hoare triple {44717#(<= main_~r~0 main_~u~0)} assume !!(#t~post8 < 100);havoc #t~post8; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,639 INFO L290 TraceCheckUtils]: 41: Hoare triple {44717#(<= main_~r~0 main_~u~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,640 INFO L290 TraceCheckUtils]: 40: Hoare triple {44273#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {44717#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:12:41,641 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {44273#true} {44273#true} #98#return; {44273#true} is VALID [2022-04-15 15:12:41,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,641 INFO L290 TraceCheckUtils]: 37: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,641 INFO L290 TraceCheckUtils]: 36: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,641 INFO L272 TraceCheckUtils]: 35: Hoare triple {44273#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)); {44273#true} is VALID [2022-04-15 15:12:41,641 INFO L290 TraceCheckUtils]: 34: Hoare triple {44273#true} assume !!(#t~post8 < 100);havoc #t~post8; {44273#true} is VALID [2022-04-15 15:12:41,641 INFO L290 TraceCheckUtils]: 33: Hoare triple {44273#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {44273#true} is VALID [2022-04-15 15:12:41,641 INFO L290 TraceCheckUtils]: 32: Hoare triple {44273#true} assume !(~r~0 > 0); {44273#true} is VALID [2022-04-15 15:12:41,641 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {44273#true} {44273#true} #96#return; {44273#true} is VALID [2022-04-15 15:12:41,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L290 TraceCheckUtils]: 29: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L290 TraceCheckUtils]: 28: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L272 TraceCheckUtils]: 27: Hoare triple {44273#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)); {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L290 TraceCheckUtils]: 26: Hoare triple {44273#true} assume !!(#t~post7 < 100);havoc #t~post7; {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L290 TraceCheckUtils]: 25: Hoare triple {44273#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L290 TraceCheckUtils]: 24: Hoare triple {44273#true} assume !!(0 != ~r~0); {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {44273#true} {44273#true} #94#return; {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L290 TraceCheckUtils]: 22: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L290 TraceCheckUtils]: 21: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L272 TraceCheckUtils]: 19: Hoare triple {44273#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)); {44273#true} is VALID [2022-04-15 15:12:41,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {44273#true} assume !!(#t~post6 < 100);havoc #t~post6; {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {44273#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {44273#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {44273#true} {44273#true} #92#return; {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L290 TraceCheckUtils]: 14: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L290 TraceCheckUtils]: 13: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L290 TraceCheckUtils]: 12: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L272 TraceCheckUtils]: 11: Hoare triple {44273#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)); {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44273#true} {44273#true} #90#return; {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,643 INFO L290 TraceCheckUtils]: 8: Hoare triple {44273#true} assume !(0 == ~cond); {44273#true} is VALID [2022-04-15 15:12:41,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {44273#true} ~cond := #in~cond; {44273#true} is VALID [2022-04-15 15:12:41,644 INFO L272 TraceCheckUtils]: 6: Hoare triple {44273#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {44273#true} is VALID [2022-04-15 15:12:41,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {44273#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; {44273#true} is VALID [2022-04-15 15:12:41,644 INFO L272 TraceCheckUtils]: 4: Hoare triple {44273#true} call #t~ret9 := main(); {44273#true} is VALID [2022-04-15 15:12:41,644 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44273#true} {44273#true} #102#return; {44273#true} is VALID [2022-04-15 15:12:41,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {44273#true} assume true; {44273#true} is VALID [2022-04-15 15:12:41,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {44273#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; {44273#true} is VALID [2022-04-15 15:12:41,644 INFO L272 TraceCheckUtils]: 0: Hoare triple {44273#true} call ULTIMATE.init(); {44273#true} is VALID [2022-04-15 15:12:41,645 INFO L134 CoverageAnalysis]: Checked inductivity of 268 backedges. 60 proven. 24 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:12:41,645 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:41,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193878956] [2022-04-15 15:12:41,645 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:41,645 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [273349145] [2022-04-15 15:12:41,645 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [273349145] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:41,645 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:41,645 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2022-04-15 15:12:41,645 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:41,646 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1426066079] [2022-04-15 15:12:41,646 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1426066079] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:41,646 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:41,646 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-04-15 15:12:41,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [164661119] [2022-04-15 15:12:41,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:41,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-15 15:12:41,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:41,648 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:12:41,720 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-15 15:12:41,720 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-04-15 15:12:41,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:41,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-04-15 15:12:41,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2022-04-15 15:12:41,721 INFO L87 Difference]: Start difference. First operand 381 states and 504 transitions. Second operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:12:43,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:43,636 INFO L93 Difference]: Finished difference Result 653 states and 910 transitions. [2022-04-15 15:12:43,636 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-04-15 15:12:43,636 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) Word has length 105 [2022-04-15 15:12:43,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:43,636 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:12:43,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-15 15:12:43,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:12:43,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 171 transitions. [2022-04-15 15:12:43,639 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 7 states and 171 transitions. [2022-04-15 15:12:43,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:43,799 INFO L225 Difference]: With dead ends: 653 [2022-04-15 15:12:43,800 INFO L226 Difference]: Without dead ends: 592 [2022-04-15 15:12:43,800 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-04-15 15:12:43,800 INFO L913 BasicCegarLoop]: 96 mSDtfsCounter, 36 mSDsluCounter, 186 mSDsCounter, 0 mSdLazyCounter, 188 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:43,800 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 282 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:12:43,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-04-15 15:12:44,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 508. [2022-04-15 15:12:44,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:44,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 592 states. Second operand has 508 states, 379 states have (on average 1.245382585751979) internal successors, (472), 389 states have internal predecessors, (472), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:44,864 INFO L74 IsIncluded]: Start isIncluded. First operand 592 states. Second operand has 508 states, 379 states have (on average 1.245382585751979) internal successors, (472), 389 states have internal predecessors, (472), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:44,865 INFO L87 Difference]: Start difference. First operand 592 states. Second operand has 508 states, 379 states have (on average 1.245382585751979) internal successors, (472), 389 states have internal predecessors, (472), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:44,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:44,886 INFO L93 Difference]: Finished difference Result 592 states and 819 transitions. [2022-04-15 15:12:44,886 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 819 transitions. [2022-04-15 15:12:44,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:44,888 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:44,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 508 states, 379 states have (on average 1.245382585751979) internal successors, (472), 389 states have internal predecessors, (472), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 592 states. [2022-04-15 15:12:44,889 INFO L87 Difference]: Start difference. First operand has 508 states, 379 states have (on average 1.245382585751979) internal successors, (472), 389 states have internal predecessors, (472), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) Second operand 592 states. [2022-04-15 15:12:44,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:44,910 INFO L93 Difference]: Finished difference Result 592 states and 819 transitions. [2022-04-15 15:12:44,910 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 819 transitions. [2022-04-15 15:12:44,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:44,912 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:44,912 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:44,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:44,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 508 states, 379 states have (on average 1.245382585751979) internal successors, (472), 389 states have internal predecessors, (472), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 102 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:44,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 508 states to 508 states and 698 transitions. [2022-04-15 15:12:44,932 INFO L78 Accepts]: Start accepts. Automaton has 508 states and 698 transitions. Word has length 105 [2022-04-15 15:12:44,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:44,933 INFO L478 AbstractCegarLoop]: Abstraction has 508 states and 698 transitions. [2022-04-15 15:12:44,933 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 7.833333333333333) internal successors, (47), 6 states have internal predecessors, (47), 6 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (13), 5 states have call predecessors, (13), 5 states have call successors, (13) [2022-04-15 15:12:44,933 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 508 states and 698 transitions. [2022-04-15 15:12:46,973 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 698 edges. 698 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:46,973 INFO L276 IsEmpty]: Start isEmpty. Operand 508 states and 698 transitions. [2022-04-15 15:12:46,974 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2022-04-15 15:12:46,974 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:46,974 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:12:46,990 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (33)] Forceful destruction successful, exit code 0 [2022-04-15 15:12:47,174 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,33 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:47,175 INFO L403 AbstractCegarLoop]: === Iteration 33 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:47,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 11 times [2022-04-15 15:12:47,175 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:47,175 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [281357092] [2022-04-15 15:12:47,175 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:47,175 INFO L85 PathProgramCache]: Analyzing trace with hash -1666981150, now seen corresponding path program 12 times [2022-04-15 15:12:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:47,176 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919062717] [2022-04-15 15:12:47,176 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:47,176 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:47,187 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:47,187 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1006721024] [2022-04-15 15:12:47,187 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:47,187 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:47,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:47,188 INFO L229 MonitoredProcess]: Starting monitored process 34 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:47,200 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Waiting until timeout for monitored process [2022-04-15 15:12:47,314 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:12:47,315 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:47,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 15:12:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:47,365 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:47,913 INFO L272 TraceCheckUtils]: 0: Hoare triple {48424#true} call ULTIMATE.init(); {48424#true} is VALID [2022-04-15 15:12:47,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {48424#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; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {48432#(<= ~counter~0 0)} assume true; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,914 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48432#(<= ~counter~0 0)} {48424#true} #102#return; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,914 INFO L272 TraceCheckUtils]: 4: Hoare triple {48432#(<= ~counter~0 0)} call #t~ret9 := main(); {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {48432#(<= ~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; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,915 INFO L272 TraceCheckUtils]: 6: Hoare triple {48432#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,915 INFO L290 TraceCheckUtils]: 7: Hoare triple {48432#(<= ~counter~0 0)} ~cond := #in~cond; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {48432#(<= ~counter~0 0)} assume !(0 == ~cond); {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,916 INFO L290 TraceCheckUtils]: 9: Hoare triple {48432#(<= ~counter~0 0)} assume true; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,916 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {48432#(<= ~counter~0 0)} {48432#(<= ~counter~0 0)} #90#return; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,917 INFO L272 TraceCheckUtils]: 11: Hoare triple {48432#(<= ~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)); {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {48432#(<= ~counter~0 0)} ~cond := #in~cond; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,917 INFO L290 TraceCheckUtils]: 13: Hoare triple {48432#(<= ~counter~0 0)} assume !(0 == ~cond); {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,917 INFO L290 TraceCheckUtils]: 14: Hoare triple {48432#(<= ~counter~0 0)} assume true; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,918 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48432#(<= ~counter~0 0)} {48432#(<= ~counter~0 0)} #92#return; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,918 INFO L290 TraceCheckUtils]: 16: Hoare triple {48432#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {48432#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:47,919 INFO L290 TraceCheckUtils]: 17: Hoare triple {48432#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48481#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:47,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {48481#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {48481#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:47,920 INFO L272 TraceCheckUtils]: 19: Hoare triple {48481#(<= ~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)); {48481#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:47,920 INFO L290 TraceCheckUtils]: 20: Hoare triple {48481#(<= ~counter~0 1)} ~cond := #in~cond; {48481#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:47,921 INFO L290 TraceCheckUtils]: 21: Hoare triple {48481#(<= ~counter~0 1)} assume !(0 == ~cond); {48481#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:47,921 INFO L290 TraceCheckUtils]: 22: Hoare triple {48481#(<= ~counter~0 1)} assume true; {48481#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:47,921 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {48481#(<= ~counter~0 1)} {48481#(<= ~counter~0 1)} #94#return; {48481#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:47,922 INFO L290 TraceCheckUtils]: 24: Hoare triple {48481#(<= ~counter~0 1)} assume !!(0 != ~r~0); {48481#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:47,922 INFO L290 TraceCheckUtils]: 25: Hoare triple {48481#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48506#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:47,923 INFO L290 TraceCheckUtils]: 26: Hoare triple {48506#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {48506#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:47,923 INFO L272 TraceCheckUtils]: 27: Hoare triple {48506#(<= ~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)); {48506#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:47,923 INFO L290 TraceCheckUtils]: 28: Hoare triple {48506#(<= ~counter~0 2)} ~cond := #in~cond; {48506#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:47,924 INFO L290 TraceCheckUtils]: 29: Hoare triple {48506#(<= ~counter~0 2)} assume !(0 == ~cond); {48506#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:47,924 INFO L290 TraceCheckUtils]: 30: Hoare triple {48506#(<= ~counter~0 2)} assume true; {48506#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:47,924 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {48506#(<= ~counter~0 2)} {48506#(<= ~counter~0 2)} #96#return; {48506#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:47,925 INFO L290 TraceCheckUtils]: 32: Hoare triple {48506#(<= ~counter~0 2)} assume !(~r~0 > 0); {48506#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:47,925 INFO L290 TraceCheckUtils]: 33: Hoare triple {48506#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48531#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:47,926 INFO L290 TraceCheckUtils]: 34: Hoare triple {48531#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {48531#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:47,926 INFO L272 TraceCheckUtils]: 35: Hoare triple {48531#(<= ~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)); {48531#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:47,926 INFO L290 TraceCheckUtils]: 36: Hoare triple {48531#(<= ~counter~0 3)} ~cond := #in~cond; {48531#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:47,927 INFO L290 TraceCheckUtils]: 37: Hoare triple {48531#(<= ~counter~0 3)} assume !(0 == ~cond); {48531#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:47,927 INFO L290 TraceCheckUtils]: 38: Hoare triple {48531#(<= ~counter~0 3)} assume true; {48531#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:47,927 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {48531#(<= ~counter~0 3)} {48531#(<= ~counter~0 3)} #98#return; {48531#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:47,928 INFO L290 TraceCheckUtils]: 40: Hoare triple {48531#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48531#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:47,928 INFO L290 TraceCheckUtils]: 41: Hoare triple {48531#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48556#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:47,929 INFO L290 TraceCheckUtils]: 42: Hoare triple {48556#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {48556#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:47,929 INFO L272 TraceCheckUtils]: 43: Hoare triple {48556#(<= ~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)); {48556#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:47,929 INFO L290 TraceCheckUtils]: 44: Hoare triple {48556#(<= ~counter~0 4)} ~cond := #in~cond; {48556#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:47,930 INFO L290 TraceCheckUtils]: 45: Hoare triple {48556#(<= ~counter~0 4)} assume !(0 == ~cond); {48556#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:47,930 INFO L290 TraceCheckUtils]: 46: Hoare triple {48556#(<= ~counter~0 4)} assume true; {48556#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:47,930 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {48556#(<= ~counter~0 4)} {48556#(<= ~counter~0 4)} #98#return; {48556#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:47,931 INFO L290 TraceCheckUtils]: 48: Hoare triple {48556#(<= ~counter~0 4)} assume !(~r~0 < 0); {48556#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:47,931 INFO L290 TraceCheckUtils]: 49: Hoare triple {48556#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48581#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:47,932 INFO L290 TraceCheckUtils]: 50: Hoare triple {48581#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {48581#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:47,932 INFO L272 TraceCheckUtils]: 51: Hoare triple {48581#(<= ~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)); {48581#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:47,932 INFO L290 TraceCheckUtils]: 52: Hoare triple {48581#(<= ~counter~0 5)} ~cond := #in~cond; {48581#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:47,933 INFO L290 TraceCheckUtils]: 53: Hoare triple {48581#(<= ~counter~0 5)} assume !(0 == ~cond); {48581#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:47,933 INFO L290 TraceCheckUtils]: 54: Hoare triple {48581#(<= ~counter~0 5)} assume true; {48581#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:47,933 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48581#(<= ~counter~0 5)} {48581#(<= ~counter~0 5)} #94#return; {48581#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:47,934 INFO L290 TraceCheckUtils]: 56: Hoare triple {48581#(<= ~counter~0 5)} assume !!(0 != ~r~0); {48581#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:47,934 INFO L290 TraceCheckUtils]: 57: Hoare triple {48581#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48606#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:47,935 INFO L290 TraceCheckUtils]: 58: Hoare triple {48606#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {48606#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:47,935 INFO L272 TraceCheckUtils]: 59: Hoare triple {48606#(<= ~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)); {48606#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:47,935 INFO L290 TraceCheckUtils]: 60: Hoare triple {48606#(<= ~counter~0 6)} ~cond := #in~cond; {48606#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:47,936 INFO L290 TraceCheckUtils]: 61: Hoare triple {48606#(<= ~counter~0 6)} assume !(0 == ~cond); {48606#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:47,936 INFO L290 TraceCheckUtils]: 62: Hoare triple {48606#(<= ~counter~0 6)} assume true; {48606#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:47,936 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48606#(<= ~counter~0 6)} {48606#(<= ~counter~0 6)} #96#return; {48606#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:47,937 INFO L290 TraceCheckUtils]: 64: Hoare triple {48606#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48606#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:47,937 INFO L290 TraceCheckUtils]: 65: Hoare triple {48606#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48631#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:47,938 INFO L290 TraceCheckUtils]: 66: Hoare triple {48631#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {48631#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:47,938 INFO L272 TraceCheckUtils]: 67: Hoare triple {48631#(<= ~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)); {48631#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:47,938 INFO L290 TraceCheckUtils]: 68: Hoare triple {48631#(<= ~counter~0 7)} ~cond := #in~cond; {48631#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:47,939 INFO L290 TraceCheckUtils]: 69: Hoare triple {48631#(<= ~counter~0 7)} assume !(0 == ~cond); {48631#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:47,939 INFO L290 TraceCheckUtils]: 70: Hoare triple {48631#(<= ~counter~0 7)} assume true; {48631#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:47,939 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48631#(<= ~counter~0 7)} {48631#(<= ~counter~0 7)} #96#return; {48631#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:47,940 INFO L290 TraceCheckUtils]: 72: Hoare triple {48631#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48631#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:47,940 INFO L290 TraceCheckUtils]: 73: Hoare triple {48631#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48656#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:47,941 INFO L290 TraceCheckUtils]: 74: Hoare triple {48656#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {48656#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:47,941 INFO L272 TraceCheckUtils]: 75: Hoare triple {48656#(<= ~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)); {48656#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:47,941 INFO L290 TraceCheckUtils]: 76: Hoare triple {48656#(<= ~counter~0 8)} ~cond := #in~cond; {48656#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:47,942 INFO L290 TraceCheckUtils]: 77: Hoare triple {48656#(<= ~counter~0 8)} assume !(0 == ~cond); {48656#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:47,942 INFO L290 TraceCheckUtils]: 78: Hoare triple {48656#(<= ~counter~0 8)} assume true; {48656#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:47,942 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48656#(<= ~counter~0 8)} {48656#(<= ~counter~0 8)} #96#return; {48656#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:47,943 INFO L290 TraceCheckUtils]: 80: Hoare triple {48656#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48656#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:47,943 INFO L290 TraceCheckUtils]: 81: Hoare triple {48656#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48681#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:47,944 INFO L290 TraceCheckUtils]: 82: Hoare triple {48681#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {48681#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:47,944 INFO L272 TraceCheckUtils]: 83: Hoare triple {48681#(<= ~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)); {48681#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:47,944 INFO L290 TraceCheckUtils]: 84: Hoare triple {48681#(<= ~counter~0 9)} ~cond := #in~cond; {48681#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:47,945 INFO L290 TraceCheckUtils]: 85: Hoare triple {48681#(<= ~counter~0 9)} assume !(0 == ~cond); {48681#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:47,945 INFO L290 TraceCheckUtils]: 86: Hoare triple {48681#(<= ~counter~0 9)} assume true; {48681#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:47,945 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48681#(<= ~counter~0 9)} {48681#(<= ~counter~0 9)} #96#return; {48681#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:47,946 INFO L290 TraceCheckUtils]: 88: Hoare triple {48681#(<= ~counter~0 9)} assume !(~r~0 > 0); {48681#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:47,946 INFO L290 TraceCheckUtils]: 89: Hoare triple {48681#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48706#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:47,947 INFO L290 TraceCheckUtils]: 90: Hoare triple {48706#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {48706#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:47,947 INFO L272 TraceCheckUtils]: 91: Hoare triple {48706#(<= ~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)); {48706#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:47,947 INFO L290 TraceCheckUtils]: 92: Hoare triple {48706#(<= ~counter~0 10)} ~cond := #in~cond; {48706#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:47,948 INFO L290 TraceCheckUtils]: 93: Hoare triple {48706#(<= ~counter~0 10)} assume !(0 == ~cond); {48706#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:47,948 INFO L290 TraceCheckUtils]: 94: Hoare triple {48706#(<= ~counter~0 10)} assume true; {48706#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:47,948 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {48706#(<= ~counter~0 10)} {48706#(<= ~counter~0 10)} #98#return; {48706#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:47,949 INFO L290 TraceCheckUtils]: 96: Hoare triple {48706#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48706#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:47,949 INFO L290 TraceCheckUtils]: 97: Hoare triple {48706#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48731#(<= |main_#t~post8| 10)} is VALID [2022-04-15 15:12:47,949 INFO L290 TraceCheckUtils]: 98: Hoare triple {48731#(<= |main_#t~post8| 10)} assume !(#t~post8 < 100);havoc #t~post8; {48425#false} is VALID [2022-04-15 15:12:47,949 INFO L290 TraceCheckUtils]: 99: Hoare triple {48425#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48425#false} is VALID [2022-04-15 15:12:47,950 INFO L290 TraceCheckUtils]: 100: Hoare triple {48425#false} assume !(#t~post6 < 100);havoc #t~post6; {48425#false} is VALID [2022-04-15 15:12:47,950 INFO L272 TraceCheckUtils]: 101: Hoare triple {48425#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)); {48425#false} is VALID [2022-04-15 15:12:47,950 INFO L290 TraceCheckUtils]: 102: Hoare triple {48425#false} ~cond := #in~cond; {48425#false} is VALID [2022-04-15 15:12:47,950 INFO L290 TraceCheckUtils]: 103: Hoare triple {48425#false} assume 0 == ~cond; {48425#false} is VALID [2022-04-15 15:12:47,950 INFO L290 TraceCheckUtils]: 104: Hoare triple {48425#false} assume !false; {48425#false} is VALID [2022-04-15 15:12:47,950 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 242 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:47,950 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:48,531 INFO L290 TraceCheckUtils]: 104: Hoare triple {48425#false} assume !false; {48425#false} is VALID [2022-04-15 15:12:48,531 INFO L290 TraceCheckUtils]: 103: Hoare triple {48425#false} assume 0 == ~cond; {48425#false} is VALID [2022-04-15 15:12:48,532 INFO L290 TraceCheckUtils]: 102: Hoare triple {48425#false} ~cond := #in~cond; {48425#false} is VALID [2022-04-15 15:12:48,532 INFO L272 TraceCheckUtils]: 101: Hoare triple {48425#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)); {48425#false} is VALID [2022-04-15 15:12:48,532 INFO L290 TraceCheckUtils]: 100: Hoare triple {48425#false} assume !(#t~post6 < 100);havoc #t~post6; {48425#false} is VALID [2022-04-15 15:12:48,532 INFO L290 TraceCheckUtils]: 99: Hoare triple {48425#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48425#false} is VALID [2022-04-15 15:12:48,532 INFO L290 TraceCheckUtils]: 98: Hoare triple {48771#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {48425#false} is VALID [2022-04-15 15:12:48,532 INFO L290 TraceCheckUtils]: 97: Hoare triple {48775#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48771#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:12:48,533 INFO L290 TraceCheckUtils]: 96: Hoare triple {48775#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48775#(< ~counter~0 100)} is VALID [2022-04-15 15:12:48,533 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {48424#true} {48775#(< ~counter~0 100)} #98#return; {48775#(< ~counter~0 100)} is VALID [2022-04-15 15:12:48,533 INFO L290 TraceCheckUtils]: 94: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,533 INFO L290 TraceCheckUtils]: 93: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,533 INFO L290 TraceCheckUtils]: 92: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,533 INFO L272 TraceCheckUtils]: 91: Hoare triple {48775#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,534 INFO L290 TraceCheckUtils]: 90: Hoare triple {48775#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {48775#(< ~counter~0 100)} is VALID [2022-04-15 15:12:48,535 INFO L290 TraceCheckUtils]: 89: Hoare triple {48800#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48775#(< ~counter~0 100)} is VALID [2022-04-15 15:12:48,535 INFO L290 TraceCheckUtils]: 88: Hoare triple {48800#(< ~counter~0 99)} assume !(~r~0 > 0); {48800#(< ~counter~0 99)} is VALID [2022-04-15 15:12:48,536 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {48424#true} {48800#(< ~counter~0 99)} #96#return; {48800#(< ~counter~0 99)} is VALID [2022-04-15 15:12:48,536 INFO L290 TraceCheckUtils]: 86: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,536 INFO L290 TraceCheckUtils]: 85: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,536 INFO L290 TraceCheckUtils]: 84: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,536 INFO L272 TraceCheckUtils]: 83: Hoare triple {48800#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,536 INFO L290 TraceCheckUtils]: 82: Hoare triple {48800#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {48800#(< ~counter~0 99)} is VALID [2022-04-15 15:12:48,537 INFO L290 TraceCheckUtils]: 81: Hoare triple {48825#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48800#(< ~counter~0 99)} is VALID [2022-04-15 15:12:48,537 INFO L290 TraceCheckUtils]: 80: Hoare triple {48825#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48825#(< ~counter~0 98)} is VALID [2022-04-15 15:12:48,538 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {48424#true} {48825#(< ~counter~0 98)} #96#return; {48825#(< ~counter~0 98)} is VALID [2022-04-15 15:12:48,538 INFO L290 TraceCheckUtils]: 78: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,538 INFO L290 TraceCheckUtils]: 77: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,538 INFO L290 TraceCheckUtils]: 76: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,538 INFO L272 TraceCheckUtils]: 75: Hoare triple {48825#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,538 INFO L290 TraceCheckUtils]: 74: Hoare triple {48825#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {48825#(< ~counter~0 98)} is VALID [2022-04-15 15:12:48,539 INFO L290 TraceCheckUtils]: 73: Hoare triple {48850#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48825#(< ~counter~0 98)} is VALID [2022-04-15 15:12:48,539 INFO L290 TraceCheckUtils]: 72: Hoare triple {48850#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48850#(< ~counter~0 97)} is VALID [2022-04-15 15:12:48,540 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {48424#true} {48850#(< ~counter~0 97)} #96#return; {48850#(< ~counter~0 97)} is VALID [2022-04-15 15:12:48,540 INFO L290 TraceCheckUtils]: 70: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,540 INFO L290 TraceCheckUtils]: 69: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,540 INFO L290 TraceCheckUtils]: 68: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,540 INFO L272 TraceCheckUtils]: 67: Hoare triple {48850#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,540 INFO L290 TraceCheckUtils]: 66: Hoare triple {48850#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {48850#(< ~counter~0 97)} is VALID [2022-04-15 15:12:48,541 INFO L290 TraceCheckUtils]: 65: Hoare triple {48875#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48850#(< ~counter~0 97)} is VALID [2022-04-15 15:12:48,541 INFO L290 TraceCheckUtils]: 64: Hoare triple {48875#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {48875#(< ~counter~0 96)} is VALID [2022-04-15 15:12:48,542 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {48424#true} {48875#(< ~counter~0 96)} #96#return; {48875#(< ~counter~0 96)} is VALID [2022-04-15 15:12:48,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,542 INFO L290 TraceCheckUtils]: 61: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,542 INFO L272 TraceCheckUtils]: 59: Hoare triple {48875#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {48875#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {48875#(< ~counter~0 96)} is VALID [2022-04-15 15:12:48,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {48900#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48875#(< ~counter~0 96)} is VALID [2022-04-15 15:12:48,543 INFO L290 TraceCheckUtils]: 56: Hoare triple {48900#(< ~counter~0 95)} assume !!(0 != ~r~0); {48900#(< ~counter~0 95)} is VALID [2022-04-15 15:12:48,544 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {48424#true} {48900#(< ~counter~0 95)} #94#return; {48900#(< ~counter~0 95)} is VALID [2022-04-15 15:12:48,544 INFO L290 TraceCheckUtils]: 54: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,544 INFO L290 TraceCheckUtils]: 53: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,544 INFO L290 TraceCheckUtils]: 52: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,544 INFO L272 TraceCheckUtils]: 51: Hoare triple {48900#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,544 INFO L290 TraceCheckUtils]: 50: Hoare triple {48900#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {48900#(< ~counter~0 95)} is VALID [2022-04-15 15:12:48,545 INFO L290 TraceCheckUtils]: 49: Hoare triple {48925#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {48900#(< ~counter~0 95)} is VALID [2022-04-15 15:12:48,545 INFO L290 TraceCheckUtils]: 48: Hoare triple {48925#(< ~counter~0 94)} assume !(~r~0 < 0); {48925#(< ~counter~0 94)} is VALID [2022-04-15 15:12:48,546 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {48424#true} {48925#(< ~counter~0 94)} #98#return; {48925#(< ~counter~0 94)} is VALID [2022-04-15 15:12:48,546 INFO L290 TraceCheckUtils]: 46: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,546 INFO L290 TraceCheckUtils]: 45: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,546 INFO L290 TraceCheckUtils]: 44: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,546 INFO L272 TraceCheckUtils]: 43: Hoare triple {48925#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,546 INFO L290 TraceCheckUtils]: 42: Hoare triple {48925#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {48925#(< ~counter~0 94)} is VALID [2022-04-15 15:12:48,547 INFO L290 TraceCheckUtils]: 41: Hoare triple {48950#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48925#(< ~counter~0 94)} is VALID [2022-04-15 15:12:48,547 INFO L290 TraceCheckUtils]: 40: Hoare triple {48950#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {48950#(< ~counter~0 93)} is VALID [2022-04-15 15:12:48,548 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {48424#true} {48950#(< ~counter~0 93)} #98#return; {48950#(< ~counter~0 93)} is VALID [2022-04-15 15:12:48,548 INFO L290 TraceCheckUtils]: 38: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,548 INFO L290 TraceCheckUtils]: 37: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,548 INFO L290 TraceCheckUtils]: 36: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,548 INFO L272 TraceCheckUtils]: 35: Hoare triple {48950#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,548 INFO L290 TraceCheckUtils]: 34: Hoare triple {48950#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {48950#(< ~counter~0 93)} is VALID [2022-04-15 15:12:48,549 INFO L290 TraceCheckUtils]: 33: Hoare triple {48975#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {48950#(< ~counter~0 93)} is VALID [2022-04-15 15:12:48,549 INFO L290 TraceCheckUtils]: 32: Hoare triple {48975#(< ~counter~0 92)} assume !(~r~0 > 0); {48975#(< ~counter~0 92)} is VALID [2022-04-15 15:12:48,550 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {48424#true} {48975#(< ~counter~0 92)} #96#return; {48975#(< ~counter~0 92)} is VALID [2022-04-15 15:12:48,550 INFO L290 TraceCheckUtils]: 30: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,550 INFO L290 TraceCheckUtils]: 29: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,550 INFO L272 TraceCheckUtils]: 27: Hoare triple {48975#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {48975#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {48975#(< ~counter~0 92)} is VALID [2022-04-15 15:12:48,551 INFO L290 TraceCheckUtils]: 25: Hoare triple {49000#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {48975#(< ~counter~0 92)} is VALID [2022-04-15 15:12:48,551 INFO L290 TraceCheckUtils]: 24: Hoare triple {49000#(< ~counter~0 91)} assume !!(0 != ~r~0); {49000#(< ~counter~0 91)} is VALID [2022-04-15 15:12:48,552 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {48424#true} {49000#(< ~counter~0 91)} #94#return; {49000#(< ~counter~0 91)} is VALID [2022-04-15 15:12:48,552 INFO L290 TraceCheckUtils]: 22: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,552 INFO L272 TraceCheckUtils]: 19: Hoare triple {49000#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,552 INFO L290 TraceCheckUtils]: 18: Hoare triple {49000#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {49000#(< ~counter~0 91)} is VALID [2022-04-15 15:12:48,553 INFO L290 TraceCheckUtils]: 17: Hoare triple {49025#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {49000#(< ~counter~0 91)} is VALID [2022-04-15 15:12:48,553 INFO L290 TraceCheckUtils]: 16: Hoare triple {49025#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {49025#(< ~counter~0 90)} is VALID [2022-04-15 15:12:48,554 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {48424#true} {49025#(< ~counter~0 90)} #92#return; {49025#(< ~counter~0 90)} is VALID [2022-04-15 15:12:48,554 INFO L290 TraceCheckUtils]: 14: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,554 INFO L290 TraceCheckUtils]: 13: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,554 INFO L290 TraceCheckUtils]: 12: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,554 INFO L272 TraceCheckUtils]: 11: Hoare triple {49025#(< ~counter~0 90)} 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)); {48424#true} is VALID [2022-04-15 15:12:48,555 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {48424#true} {49025#(< ~counter~0 90)} #90#return; {49025#(< ~counter~0 90)} is VALID [2022-04-15 15:12:48,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {48424#true} assume true; {48424#true} is VALID [2022-04-15 15:12:48,555 INFO L290 TraceCheckUtils]: 8: Hoare triple {48424#true} assume !(0 == ~cond); {48424#true} is VALID [2022-04-15 15:12:48,555 INFO L290 TraceCheckUtils]: 7: Hoare triple {48424#true} ~cond := #in~cond; {48424#true} is VALID [2022-04-15 15:12:48,555 INFO L272 TraceCheckUtils]: 6: Hoare triple {49025#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {48424#true} is VALID [2022-04-15 15:12:48,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {49025#(< ~counter~0 90)} 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; {49025#(< ~counter~0 90)} is VALID [2022-04-15 15:12:48,556 INFO L272 TraceCheckUtils]: 4: Hoare triple {49025#(< ~counter~0 90)} call #t~ret9 := main(); {49025#(< ~counter~0 90)} is VALID [2022-04-15 15:12:48,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {49025#(< ~counter~0 90)} {48424#true} #102#return; {49025#(< ~counter~0 90)} is VALID [2022-04-15 15:12:48,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {49025#(< ~counter~0 90)} assume true; {49025#(< ~counter~0 90)} is VALID [2022-04-15 15:12:48,557 INFO L290 TraceCheckUtils]: 1: Hoare triple {48424#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; {49025#(< ~counter~0 90)} is VALID [2022-04-15 15:12:48,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {48424#true} call ULTIMATE.init(); {48424#true} is VALID [2022-04-15 15:12:48,558 INFO L134 CoverageAnalysis]: Checked inductivity of 270 backedges. 24 proven. 62 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:12:48,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:48,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919062717] [2022-04-15 15:12:48,558 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:48,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1006721024] [2022-04-15 15:12:48,558 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1006721024] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:48,558 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:48,558 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 15:12:48,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:48,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [281357092] [2022-04-15 15:12:48,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [281357092] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:48,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:48,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 15:12:48,559 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1214517959] [2022-04-15 15:12:48,559 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:48,559 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 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 105 [2022-04-15 15:12:48,559 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:48,559 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 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-15 15:12:48,636 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:48,637 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 15:12:48,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:48,637 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 15:12:48,637 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 15:12:48,637 INFO L87 Difference]: Start difference. First operand 508 states and 698 transitions. Second operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 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-15 15:12:50,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:50,416 INFO L93 Difference]: Finished difference Result 757 states and 1076 transitions. [2022-04-15 15:12:50,416 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-04-15 15:12:50,416 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 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 105 [2022-04-15 15:12:50,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:50,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 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-15 15:12:50,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-15 15:12:50,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 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-15 15:12:50,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 236 transitions. [2022-04-15 15:12:50,421 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 22 states and 236 transitions. [2022-04-15 15:12:50,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:50,619 INFO L225 Difference]: With dead ends: 757 [2022-04-15 15:12:50,619 INFO L226 Difference]: Without dead ends: 536 [2022-04-15 15:12:50,620 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 185 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 59 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=465, Invalid=657, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 15:12:50,620 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 124 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:50,621 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [124 Valid, 266 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:12:50,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 536 states. [2022-04-15 15:12:51,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 536 to 526. [2022-04-15 15:12:51,716 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:51,717 INFO L82 GeneralOperation]: Start isEquivalent. First operand 536 states. Second operand has 526 states, 397 states have (on average 1.2443324937027709) internal successors, (494), 401 states have internal predecessors, (494), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:51,717 INFO L74 IsIncluded]: Start isIncluded. First operand 536 states. Second operand has 526 states, 397 states have (on average 1.2443324937027709) internal successors, (494), 401 states have internal predecessors, (494), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:51,719 INFO L87 Difference]: Start difference. First operand 536 states. Second operand has 526 states, 397 states have (on average 1.2443324937027709) internal successors, (494), 401 states have internal predecessors, (494), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:51,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:51,736 INFO L93 Difference]: Finished difference Result 536 states and 730 transitions. [2022-04-15 15:12:51,736 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 730 transitions. [2022-04-15 15:12:51,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:51,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:51,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 526 states, 397 states have (on average 1.2443324937027709) internal successors, (494), 401 states have internal predecessors, (494), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 536 states. [2022-04-15 15:12:51,738 INFO L87 Difference]: Start difference. First operand has 526 states, 397 states have (on average 1.2443324937027709) internal successors, (494), 401 states have internal predecessors, (494), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) Second operand 536 states. [2022-04-15 15:12:51,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:51,756 INFO L93 Difference]: Finished difference Result 536 states and 730 transitions. [2022-04-15 15:12:51,756 INFO L276 IsEmpty]: Start isEmpty. Operand 536 states and 730 transitions. [2022-04-15 15:12:51,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:51,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:51,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:51,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:51,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 526 states, 397 states have (on average 1.2443324937027709) internal successors, (494), 401 states have internal predecessors, (494), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 108 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:51,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 526 states to 526 states and 720 transitions. [2022-04-15 15:12:51,777 INFO L78 Accepts]: Start accepts. Automaton has 526 states and 720 transitions. Word has length 105 [2022-04-15 15:12:51,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:51,777 INFO L478 AbstractCegarLoop]: Abstraction has 526 states and 720 transitions. [2022-04-15 15:12:51,777 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.285714285714286) internal successors, (74), 13 states have internal predecessors, (74), 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-15 15:12:51,777 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 526 states and 720 transitions. [2022-04-15 15:12:54,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 720 edges. 719 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:54,880 INFO L276 IsEmpty]: Start isEmpty. Operand 526 states and 720 transitions. [2022-04-15 15:12:54,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 108 [2022-04-15 15:12:54,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:12:54,881 INFO L499 BasicCegarLoop]: trace histogram [11, 10, 10, 7, 6, 6, 6, 5, 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, 1, 1, 1, 1, 1] [2022-04-15 15:12:54,898 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (34)] Ended with exit code 0 [2022-04-15 15:12:55,083 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable32 [2022-04-15 15:12:55,083 INFO L403 AbstractCegarLoop]: === Iteration 34 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:12:55,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:12:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 11 times [2022-04-15 15:12:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:55,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1138988457] [2022-04-15 15:12:55,084 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:12:55,084 INFO L85 PathProgramCache]: Analyzing trace with hash -2132095591, now seen corresponding path program 12 times [2022-04-15 15:12:55,084 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:12:55,084 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [573189007] [2022-04-15 15:12:55,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:12:55,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:12:55,096 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:12:55,096 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2072953516] [2022-04-15 15:12:55,096 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:12:55,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:12:55,097 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:12:55,097 INFO L229 MonitoredProcess]: Starting monitored process 35 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:12:55,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Waiting until timeout for monitored process [2022-04-15 15:12:55,218 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 7 check-sat command(s) [2022-04-15 15:12:55,218 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:12:55,219 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 25 conjunts are in the unsatisfiable core [2022-04-15 15:12:55,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:12:55,241 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:12:55,752 INFO L272 TraceCheckUtils]: 0: Hoare triple {52733#true} call ULTIMATE.init(); {52733#true} is VALID [2022-04-15 15:12:55,753 INFO L290 TraceCheckUtils]: 1: Hoare triple {52733#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; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,753 INFO L290 TraceCheckUtils]: 2: Hoare triple {52741#(<= ~counter~0 0)} assume true; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,753 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {52741#(<= ~counter~0 0)} {52733#true} #102#return; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,754 INFO L272 TraceCheckUtils]: 4: Hoare triple {52741#(<= ~counter~0 0)} call #t~ret9 := main(); {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,754 INFO L290 TraceCheckUtils]: 5: Hoare triple {52741#(<= ~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; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,754 INFO L272 TraceCheckUtils]: 6: Hoare triple {52741#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {52741#(<= ~counter~0 0)} ~cond := #in~cond; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,755 INFO L290 TraceCheckUtils]: 8: Hoare triple {52741#(<= ~counter~0 0)} assume !(0 == ~cond); {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,755 INFO L290 TraceCheckUtils]: 9: Hoare triple {52741#(<= ~counter~0 0)} assume true; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,756 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52741#(<= ~counter~0 0)} {52741#(<= ~counter~0 0)} #90#return; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,756 INFO L272 TraceCheckUtils]: 11: Hoare triple {52741#(<= ~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)); {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,756 INFO L290 TraceCheckUtils]: 12: Hoare triple {52741#(<= ~counter~0 0)} ~cond := #in~cond; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {52741#(<= ~counter~0 0)} assume !(0 == ~cond); {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,757 INFO L290 TraceCheckUtils]: 14: Hoare triple {52741#(<= ~counter~0 0)} assume true; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,757 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52741#(<= ~counter~0 0)} {52741#(<= ~counter~0 0)} #92#return; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {52741#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {52741#(<= ~counter~0 0)} is VALID [2022-04-15 15:12:55,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {52741#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52790#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {52790#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {52790#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,760 INFO L272 TraceCheckUtils]: 19: Hoare triple {52790#(<= ~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)); {52790#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {52790#(<= ~counter~0 1)} ~cond := #in~cond; {52790#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {52790#(<= ~counter~0 1)} assume !(0 == ~cond); {52790#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,761 INFO L290 TraceCheckUtils]: 22: Hoare triple {52790#(<= ~counter~0 1)} assume true; {52790#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,761 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {52790#(<= ~counter~0 1)} {52790#(<= ~counter~0 1)} #94#return; {52790#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,761 INFO L290 TraceCheckUtils]: 24: Hoare triple {52790#(<= ~counter~0 1)} assume !!(0 != ~r~0); {52790#(<= ~counter~0 1)} is VALID [2022-04-15 15:12:55,762 INFO L290 TraceCheckUtils]: 25: Hoare triple {52790#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52815#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,762 INFO L290 TraceCheckUtils]: 26: Hoare triple {52815#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {52815#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,763 INFO L272 TraceCheckUtils]: 27: Hoare triple {52815#(<= ~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)); {52815#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,763 INFO L290 TraceCheckUtils]: 28: Hoare triple {52815#(<= ~counter~0 2)} ~cond := #in~cond; {52815#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,763 INFO L290 TraceCheckUtils]: 29: Hoare triple {52815#(<= ~counter~0 2)} assume !(0 == ~cond); {52815#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,764 INFO L290 TraceCheckUtils]: 30: Hoare triple {52815#(<= ~counter~0 2)} assume true; {52815#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,764 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {52815#(<= ~counter~0 2)} {52815#(<= ~counter~0 2)} #96#return; {52815#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,765 INFO L290 TraceCheckUtils]: 32: Hoare triple {52815#(<= ~counter~0 2)} assume !(~r~0 > 0); {52815#(<= ~counter~0 2)} is VALID [2022-04-15 15:12:55,765 INFO L290 TraceCheckUtils]: 33: Hoare triple {52815#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52840#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,766 INFO L290 TraceCheckUtils]: 34: Hoare triple {52840#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {52840#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,766 INFO L272 TraceCheckUtils]: 35: Hoare triple {52840#(<= ~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)); {52840#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,766 INFO L290 TraceCheckUtils]: 36: Hoare triple {52840#(<= ~counter~0 3)} ~cond := #in~cond; {52840#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,767 INFO L290 TraceCheckUtils]: 37: Hoare triple {52840#(<= ~counter~0 3)} assume !(0 == ~cond); {52840#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,767 INFO L290 TraceCheckUtils]: 38: Hoare triple {52840#(<= ~counter~0 3)} assume true; {52840#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,767 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {52840#(<= ~counter~0 3)} {52840#(<= ~counter~0 3)} #98#return; {52840#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,768 INFO L290 TraceCheckUtils]: 40: Hoare triple {52840#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {52840#(<= ~counter~0 3)} is VALID [2022-04-15 15:12:55,768 INFO L290 TraceCheckUtils]: 41: Hoare triple {52840#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52865#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,769 INFO L290 TraceCheckUtils]: 42: Hoare triple {52865#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {52865#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,769 INFO L272 TraceCheckUtils]: 43: Hoare triple {52865#(<= ~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)); {52865#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,769 INFO L290 TraceCheckUtils]: 44: Hoare triple {52865#(<= ~counter~0 4)} ~cond := #in~cond; {52865#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,770 INFO L290 TraceCheckUtils]: 45: Hoare triple {52865#(<= ~counter~0 4)} assume !(0 == ~cond); {52865#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,770 INFO L290 TraceCheckUtils]: 46: Hoare triple {52865#(<= ~counter~0 4)} assume true; {52865#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,770 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52865#(<= ~counter~0 4)} {52865#(<= ~counter~0 4)} #98#return; {52865#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,771 INFO L290 TraceCheckUtils]: 48: Hoare triple {52865#(<= ~counter~0 4)} assume !(~r~0 < 0); {52865#(<= ~counter~0 4)} is VALID [2022-04-15 15:12:55,771 INFO L290 TraceCheckUtils]: 49: Hoare triple {52865#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52890#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,772 INFO L290 TraceCheckUtils]: 50: Hoare triple {52890#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {52890#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,772 INFO L272 TraceCheckUtils]: 51: Hoare triple {52890#(<= ~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)); {52890#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,773 INFO L290 TraceCheckUtils]: 52: Hoare triple {52890#(<= ~counter~0 5)} ~cond := #in~cond; {52890#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,773 INFO L290 TraceCheckUtils]: 53: Hoare triple {52890#(<= ~counter~0 5)} assume !(0 == ~cond); {52890#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,773 INFO L290 TraceCheckUtils]: 54: Hoare triple {52890#(<= ~counter~0 5)} assume true; {52890#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,774 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {52890#(<= ~counter~0 5)} {52890#(<= ~counter~0 5)} #94#return; {52890#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,774 INFO L290 TraceCheckUtils]: 56: Hoare triple {52890#(<= ~counter~0 5)} assume !!(0 != ~r~0); {52890#(<= ~counter~0 5)} is VALID [2022-04-15 15:12:55,775 INFO L290 TraceCheckUtils]: 57: Hoare triple {52890#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52915#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,775 INFO L290 TraceCheckUtils]: 58: Hoare triple {52915#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {52915#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,775 INFO L272 TraceCheckUtils]: 59: Hoare triple {52915#(<= ~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)); {52915#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,776 INFO L290 TraceCheckUtils]: 60: Hoare triple {52915#(<= ~counter~0 6)} ~cond := #in~cond; {52915#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,776 INFO L290 TraceCheckUtils]: 61: Hoare triple {52915#(<= ~counter~0 6)} assume !(0 == ~cond); {52915#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,776 INFO L290 TraceCheckUtils]: 62: Hoare triple {52915#(<= ~counter~0 6)} assume true; {52915#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,777 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {52915#(<= ~counter~0 6)} {52915#(<= ~counter~0 6)} #96#return; {52915#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {52915#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52915#(<= ~counter~0 6)} is VALID [2022-04-15 15:12:55,778 INFO L290 TraceCheckUtils]: 65: Hoare triple {52915#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52940#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:55,778 INFO L290 TraceCheckUtils]: 66: Hoare triple {52940#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {52940#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:55,779 INFO L272 TraceCheckUtils]: 67: Hoare triple {52940#(<= ~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)); {52940#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:55,779 INFO L290 TraceCheckUtils]: 68: Hoare triple {52940#(<= ~counter~0 7)} ~cond := #in~cond; {52940#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:55,779 INFO L290 TraceCheckUtils]: 69: Hoare triple {52940#(<= ~counter~0 7)} assume !(0 == ~cond); {52940#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:55,779 INFO L290 TraceCheckUtils]: 70: Hoare triple {52940#(<= ~counter~0 7)} assume true; {52940#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:55,780 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52940#(<= ~counter~0 7)} {52940#(<= ~counter~0 7)} #96#return; {52940#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:55,780 INFO L290 TraceCheckUtils]: 72: Hoare triple {52940#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52940#(<= ~counter~0 7)} is VALID [2022-04-15 15:12:55,781 INFO L290 TraceCheckUtils]: 73: Hoare triple {52940#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52965#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:55,781 INFO L290 TraceCheckUtils]: 74: Hoare triple {52965#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {52965#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:55,782 INFO L272 TraceCheckUtils]: 75: Hoare triple {52965#(<= ~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)); {52965#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:55,782 INFO L290 TraceCheckUtils]: 76: Hoare triple {52965#(<= ~counter~0 8)} ~cond := #in~cond; {52965#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:55,782 INFO L290 TraceCheckUtils]: 77: Hoare triple {52965#(<= ~counter~0 8)} assume !(0 == ~cond); {52965#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:55,782 INFO L290 TraceCheckUtils]: 78: Hoare triple {52965#(<= ~counter~0 8)} assume true; {52965#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:55,783 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {52965#(<= ~counter~0 8)} {52965#(<= ~counter~0 8)} #96#return; {52965#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:55,783 INFO L290 TraceCheckUtils]: 80: Hoare triple {52965#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52965#(<= ~counter~0 8)} is VALID [2022-04-15 15:12:55,784 INFO L290 TraceCheckUtils]: 81: Hoare triple {52965#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {52990#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:55,784 INFO L290 TraceCheckUtils]: 82: Hoare triple {52990#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {52990#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:55,785 INFO L272 TraceCheckUtils]: 83: Hoare triple {52990#(<= ~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)); {52990#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:55,785 INFO L290 TraceCheckUtils]: 84: Hoare triple {52990#(<= ~counter~0 9)} ~cond := #in~cond; {52990#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:55,785 INFO L290 TraceCheckUtils]: 85: Hoare triple {52990#(<= ~counter~0 9)} assume !(0 == ~cond); {52990#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:55,786 INFO L290 TraceCheckUtils]: 86: Hoare triple {52990#(<= ~counter~0 9)} assume true; {52990#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:55,786 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {52990#(<= ~counter~0 9)} {52990#(<= ~counter~0 9)} #96#return; {52990#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:55,786 INFO L290 TraceCheckUtils]: 88: Hoare triple {52990#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {52990#(<= ~counter~0 9)} is VALID [2022-04-15 15:12:55,787 INFO L290 TraceCheckUtils]: 89: Hoare triple {52990#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53015#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:55,787 INFO L290 TraceCheckUtils]: 90: Hoare triple {53015#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {53015#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:55,788 INFO L272 TraceCheckUtils]: 91: Hoare triple {53015#(<= ~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)); {53015#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:55,788 INFO L290 TraceCheckUtils]: 92: Hoare triple {53015#(<= ~counter~0 10)} ~cond := #in~cond; {53015#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:55,788 INFO L290 TraceCheckUtils]: 93: Hoare triple {53015#(<= ~counter~0 10)} assume !(0 == ~cond); {53015#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:55,789 INFO L290 TraceCheckUtils]: 94: Hoare triple {53015#(<= ~counter~0 10)} assume true; {53015#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:55,789 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {53015#(<= ~counter~0 10)} {53015#(<= ~counter~0 10)} #96#return; {53015#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:55,789 INFO L290 TraceCheckUtils]: 96: Hoare triple {53015#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53015#(<= ~counter~0 10)} is VALID [2022-04-15 15:12:55,790 INFO L290 TraceCheckUtils]: 97: Hoare triple {53015#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53040#(<= |main_#t~post7| 10)} is VALID [2022-04-15 15:12:55,790 INFO L290 TraceCheckUtils]: 98: Hoare triple {53040#(<= |main_#t~post7| 10)} assume !(#t~post7 < 100);havoc #t~post7; {52734#false} is VALID [2022-04-15 15:12:55,790 INFO L290 TraceCheckUtils]: 99: Hoare triple {52734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52734#false} is VALID [2022-04-15 15:12:55,790 INFO L290 TraceCheckUtils]: 100: Hoare triple {52734#false} assume !(#t~post8 < 100);havoc #t~post8; {52734#false} is VALID [2022-04-15 15:12:55,790 INFO L290 TraceCheckUtils]: 101: Hoare triple {52734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52734#false} is VALID [2022-04-15 15:12:55,790 INFO L290 TraceCheckUtils]: 102: Hoare triple {52734#false} assume !(#t~post6 < 100);havoc #t~post6; {52734#false} is VALID [2022-04-15 15:12:55,790 INFO L272 TraceCheckUtils]: 103: Hoare triple {52734#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)); {52734#false} is VALID [2022-04-15 15:12:55,791 INFO L290 TraceCheckUtils]: 104: Hoare triple {52734#false} ~cond := #in~cond; {52734#false} is VALID [2022-04-15 15:12:55,791 INFO L290 TraceCheckUtils]: 105: Hoare triple {52734#false} assume 0 == ~cond; {52734#false} is VALID [2022-04-15 15:12:55,791 INFO L290 TraceCheckUtils]: 106: Hoare triple {52734#false} assume !false; {52734#false} is VALID [2022-04-15 15:12:55,791 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 260 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:12:55,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:12:56,433 INFO L290 TraceCheckUtils]: 106: Hoare triple {52734#false} assume !false; {52734#false} is VALID [2022-04-15 15:12:56,433 INFO L290 TraceCheckUtils]: 105: Hoare triple {52734#false} assume 0 == ~cond; {52734#false} is VALID [2022-04-15 15:12:56,433 INFO L290 TraceCheckUtils]: 104: Hoare triple {52734#false} ~cond := #in~cond; {52734#false} is VALID [2022-04-15 15:12:56,433 INFO L272 TraceCheckUtils]: 103: Hoare triple {52734#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)); {52734#false} is VALID [2022-04-15 15:12:56,433 INFO L290 TraceCheckUtils]: 102: Hoare triple {52734#false} assume !(#t~post6 < 100);havoc #t~post6; {52734#false} is VALID [2022-04-15 15:12:56,433 INFO L290 TraceCheckUtils]: 101: Hoare triple {52734#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {52734#false} is VALID [2022-04-15 15:12:56,434 INFO L290 TraceCheckUtils]: 100: Hoare triple {52734#false} assume !(#t~post8 < 100);havoc #t~post8; {52734#false} is VALID [2022-04-15 15:12:56,434 INFO L290 TraceCheckUtils]: 99: Hoare triple {52734#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {52734#false} is VALID [2022-04-15 15:12:56,434 INFO L290 TraceCheckUtils]: 98: Hoare triple {53092#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {52734#false} is VALID [2022-04-15 15:12:56,434 INFO L290 TraceCheckUtils]: 97: Hoare triple {53096#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53092#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:12:56,434 INFO L290 TraceCheckUtils]: 96: Hoare triple {53096#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53096#(< ~counter~0 100)} is VALID [2022-04-15 15:12:56,435 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {52733#true} {53096#(< ~counter~0 100)} #96#return; {53096#(< ~counter~0 100)} is VALID [2022-04-15 15:12:56,435 INFO L290 TraceCheckUtils]: 94: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,435 INFO L290 TraceCheckUtils]: 93: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,435 INFO L290 TraceCheckUtils]: 92: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,435 INFO L272 TraceCheckUtils]: 91: Hoare triple {53096#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,436 INFO L290 TraceCheckUtils]: 90: Hoare triple {53096#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {53096#(< ~counter~0 100)} is VALID [2022-04-15 15:12:56,437 INFO L290 TraceCheckUtils]: 89: Hoare triple {53121#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53096#(< ~counter~0 100)} is VALID [2022-04-15 15:12:56,437 INFO L290 TraceCheckUtils]: 88: Hoare triple {53121#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53121#(< ~counter~0 99)} is VALID [2022-04-15 15:12:56,438 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {52733#true} {53121#(< ~counter~0 99)} #96#return; {53121#(< ~counter~0 99)} is VALID [2022-04-15 15:12:56,438 INFO L290 TraceCheckUtils]: 86: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,438 INFO L290 TraceCheckUtils]: 85: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,438 INFO L290 TraceCheckUtils]: 84: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,438 INFO L272 TraceCheckUtils]: 83: Hoare triple {53121#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,438 INFO L290 TraceCheckUtils]: 82: Hoare triple {53121#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {53121#(< ~counter~0 99)} is VALID [2022-04-15 15:12:56,439 INFO L290 TraceCheckUtils]: 81: Hoare triple {53146#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53121#(< ~counter~0 99)} is VALID [2022-04-15 15:12:56,440 INFO L290 TraceCheckUtils]: 80: Hoare triple {53146#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53146#(< ~counter~0 98)} is VALID [2022-04-15 15:12:56,440 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {52733#true} {53146#(< ~counter~0 98)} #96#return; {53146#(< ~counter~0 98)} is VALID [2022-04-15 15:12:56,441 INFO L290 TraceCheckUtils]: 78: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,441 INFO L290 TraceCheckUtils]: 77: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,441 INFO L290 TraceCheckUtils]: 76: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,441 INFO L272 TraceCheckUtils]: 75: Hoare triple {53146#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,441 INFO L290 TraceCheckUtils]: 74: Hoare triple {53146#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {53146#(< ~counter~0 98)} is VALID [2022-04-15 15:12:56,442 INFO L290 TraceCheckUtils]: 73: Hoare triple {53171#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53146#(< ~counter~0 98)} is VALID [2022-04-15 15:12:56,442 INFO L290 TraceCheckUtils]: 72: Hoare triple {53171#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53171#(< ~counter~0 97)} is VALID [2022-04-15 15:12:56,443 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {52733#true} {53171#(< ~counter~0 97)} #96#return; {53171#(< ~counter~0 97)} is VALID [2022-04-15 15:12:56,443 INFO L290 TraceCheckUtils]: 70: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,443 INFO L290 TraceCheckUtils]: 69: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,443 INFO L290 TraceCheckUtils]: 68: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,443 INFO L272 TraceCheckUtils]: 67: Hoare triple {53171#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,443 INFO L290 TraceCheckUtils]: 66: Hoare triple {53171#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {53171#(< ~counter~0 97)} is VALID [2022-04-15 15:12:56,444 INFO L290 TraceCheckUtils]: 65: Hoare triple {53196#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53171#(< ~counter~0 97)} is VALID [2022-04-15 15:12:56,444 INFO L290 TraceCheckUtils]: 64: Hoare triple {53196#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {53196#(< ~counter~0 96)} is VALID [2022-04-15 15:12:56,445 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {52733#true} {53196#(< ~counter~0 96)} #96#return; {53196#(< ~counter~0 96)} is VALID [2022-04-15 15:12:56,445 INFO L290 TraceCheckUtils]: 62: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,445 INFO L290 TraceCheckUtils]: 61: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,445 INFO L290 TraceCheckUtils]: 60: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,445 INFO L272 TraceCheckUtils]: 59: Hoare triple {53196#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,445 INFO L290 TraceCheckUtils]: 58: Hoare triple {53196#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {53196#(< ~counter~0 96)} is VALID [2022-04-15 15:12:56,446 INFO L290 TraceCheckUtils]: 57: Hoare triple {53221#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53196#(< ~counter~0 96)} is VALID [2022-04-15 15:12:56,446 INFO L290 TraceCheckUtils]: 56: Hoare triple {53221#(< ~counter~0 95)} assume !!(0 != ~r~0); {53221#(< ~counter~0 95)} is VALID [2022-04-15 15:12:56,447 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {52733#true} {53221#(< ~counter~0 95)} #94#return; {53221#(< ~counter~0 95)} is VALID [2022-04-15 15:12:56,447 INFO L290 TraceCheckUtils]: 54: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,447 INFO L290 TraceCheckUtils]: 53: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,447 INFO L290 TraceCheckUtils]: 52: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,447 INFO L272 TraceCheckUtils]: 51: Hoare triple {53221#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,447 INFO L290 TraceCheckUtils]: 50: Hoare triple {53221#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {53221#(< ~counter~0 95)} is VALID [2022-04-15 15:12:56,448 INFO L290 TraceCheckUtils]: 49: Hoare triple {53246#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53221#(< ~counter~0 95)} is VALID [2022-04-15 15:12:56,448 INFO L290 TraceCheckUtils]: 48: Hoare triple {53246#(< ~counter~0 94)} assume !(~r~0 < 0); {53246#(< ~counter~0 94)} is VALID [2022-04-15 15:12:56,449 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {52733#true} {53246#(< ~counter~0 94)} #98#return; {53246#(< ~counter~0 94)} is VALID [2022-04-15 15:12:56,449 INFO L290 TraceCheckUtils]: 46: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,449 INFO L290 TraceCheckUtils]: 45: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,449 INFO L290 TraceCheckUtils]: 44: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,449 INFO L272 TraceCheckUtils]: 43: Hoare triple {53246#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,449 INFO L290 TraceCheckUtils]: 42: Hoare triple {53246#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {53246#(< ~counter~0 94)} is VALID [2022-04-15 15:12:56,450 INFO L290 TraceCheckUtils]: 41: Hoare triple {53271#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53246#(< ~counter~0 94)} is VALID [2022-04-15 15:12:56,450 INFO L290 TraceCheckUtils]: 40: Hoare triple {53271#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {53271#(< ~counter~0 93)} is VALID [2022-04-15 15:12:56,451 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {52733#true} {53271#(< ~counter~0 93)} #98#return; {53271#(< ~counter~0 93)} is VALID [2022-04-15 15:12:56,451 INFO L290 TraceCheckUtils]: 38: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,451 INFO L290 TraceCheckUtils]: 37: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,451 INFO L290 TraceCheckUtils]: 36: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,451 INFO L272 TraceCheckUtils]: 35: Hoare triple {53271#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,451 INFO L290 TraceCheckUtils]: 34: Hoare triple {53271#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {53271#(< ~counter~0 93)} is VALID [2022-04-15 15:12:56,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {53296#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {53271#(< ~counter~0 93)} is VALID [2022-04-15 15:12:56,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {53296#(< ~counter~0 92)} assume !(~r~0 > 0); {53296#(< ~counter~0 92)} is VALID [2022-04-15 15:12:56,453 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {52733#true} {53296#(< ~counter~0 92)} #96#return; {53296#(< ~counter~0 92)} is VALID [2022-04-15 15:12:56,453 INFO L290 TraceCheckUtils]: 30: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,453 INFO L290 TraceCheckUtils]: 29: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,453 INFO L290 TraceCheckUtils]: 28: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,453 INFO L272 TraceCheckUtils]: 27: Hoare triple {53296#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,453 INFO L290 TraceCheckUtils]: 26: Hoare triple {53296#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {53296#(< ~counter~0 92)} is VALID [2022-04-15 15:12:56,454 INFO L290 TraceCheckUtils]: 25: Hoare triple {53321#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {53296#(< ~counter~0 92)} is VALID [2022-04-15 15:12:56,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {53321#(< ~counter~0 91)} assume !!(0 != ~r~0); {53321#(< ~counter~0 91)} is VALID [2022-04-15 15:12:56,455 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {52733#true} {53321#(< ~counter~0 91)} #94#return; {53321#(< ~counter~0 91)} is VALID [2022-04-15 15:12:56,455 INFO L290 TraceCheckUtils]: 22: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,455 INFO L272 TraceCheckUtils]: 19: Hoare triple {53321#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,455 INFO L290 TraceCheckUtils]: 18: Hoare triple {53321#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {53321#(< ~counter~0 91)} is VALID [2022-04-15 15:12:56,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {53346#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {53321#(< ~counter~0 91)} is VALID [2022-04-15 15:12:56,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {53346#(< ~counter~0 90)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {53346#(< ~counter~0 90)} is VALID [2022-04-15 15:12:56,457 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {52733#true} {53346#(< ~counter~0 90)} #92#return; {53346#(< ~counter~0 90)} is VALID [2022-04-15 15:12:56,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,457 INFO L272 TraceCheckUtils]: 11: Hoare triple {53346#(< ~counter~0 90)} 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)); {52733#true} is VALID [2022-04-15 15:12:56,457 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {52733#true} {53346#(< ~counter~0 90)} #90#return; {53346#(< ~counter~0 90)} is VALID [2022-04-15 15:12:56,457 INFO L290 TraceCheckUtils]: 9: Hoare triple {52733#true} assume true; {52733#true} is VALID [2022-04-15 15:12:56,457 INFO L290 TraceCheckUtils]: 8: Hoare triple {52733#true} assume !(0 == ~cond); {52733#true} is VALID [2022-04-15 15:12:56,457 INFO L290 TraceCheckUtils]: 7: Hoare triple {52733#true} ~cond := #in~cond; {52733#true} is VALID [2022-04-15 15:12:56,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {53346#(< ~counter~0 90)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {52733#true} is VALID [2022-04-15 15:12:56,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {53346#(< ~counter~0 90)} 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; {53346#(< ~counter~0 90)} is VALID [2022-04-15 15:12:56,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {53346#(< ~counter~0 90)} call #t~ret9 := main(); {53346#(< ~counter~0 90)} is VALID [2022-04-15 15:12:56,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {53346#(< ~counter~0 90)} {52733#true} #102#return; {53346#(< ~counter~0 90)} is VALID [2022-04-15 15:12:56,459 INFO L290 TraceCheckUtils]: 2: Hoare triple {53346#(< ~counter~0 90)} assume true; {53346#(< ~counter~0 90)} is VALID [2022-04-15 15:12:56,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {52733#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; {53346#(< ~counter~0 90)} is VALID [2022-04-15 15:12:56,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {52733#true} call ULTIMATE.init(); {52733#true} is VALID [2022-04-15 15:12:56,460 INFO L134 CoverageAnalysis]: Checked inductivity of 292 backedges. 28 proven. 80 refuted. 0 times theorem prover too weak. 184 trivial. 0 not checked. [2022-04-15 15:12:56,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:12:56,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [573189007] [2022-04-15 15:12:56,460 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:12:56,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2072953516] [2022-04-15 15:12:56,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2072953516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:12:56,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:12:56,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 26 [2022-04-15 15:12:56,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:12:56,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1138988457] [2022-04-15 15:12:56,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1138988457] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:12:56,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:12:56,461 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2022-04-15 15:12:56,461 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [514563036] [2022-04-15 15:12:56,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:12:56,461 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 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 107 [2022-04-15 15:12:56,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:12:56,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 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-15 15:12:56,558 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:56,558 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-04-15 15:12:56,558 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:12:56,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-04-15 15:12:56,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=281, Invalid=369, Unknown=0, NotChecked=0, Total=650 [2022-04-15 15:12:56,559 INFO L87 Difference]: Start difference. First operand 526 states and 720 transitions. Second operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 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-15 15:12:58,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:58,376 INFO L93 Difference]: Finished difference Result 739 states and 1044 transitions. [2022-04-15 15:12:58,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 15:12:58,376 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 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 107 [2022-04-15 15:12:58,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:12:58,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 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-15 15:12:58,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-15 15:12:58,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 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-15 15:12:58,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 236 transitions. [2022-04-15 15:12:58,380 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 236 transitions. [2022-04-15 15:12:58,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 236 edges. 236 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:12:58,575 INFO L225 Difference]: With dead ends: 739 [2022-04-15 15:12:58,575 INFO L226 Difference]: Without dead ends: 542 [2022-04-15 15:12:58,576 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 222 GetRequests, 189 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 67 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=497, Invalid=693, Unknown=0, NotChecked=0, Total=1190 [2022-04-15 15:12:58,576 INFO L913 BasicCegarLoop]: 60 mSDtfsCounter, 110 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 73 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 110 SdHoareTripleChecker+Valid, 280 SdHoareTripleChecker+Invalid, 237 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 73 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:12:58,576 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [110 Valid, 280 Invalid, 237 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [73 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:12:58,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 542 states. [2022-04-15 15:12:59,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 542 to 542. [2022-04-15 15:12:59,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:12:59,711 INFO L82 GeneralOperation]: Start isEquivalent. First operand 542 states. Second operand has 542 states, 413 states have (on average 1.234866828087167) internal successors, (510), 413 states have internal predecessors, (510), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:59,712 INFO L74 IsIncluded]: Start isIncluded. First operand 542 states. Second operand has 542 states, 413 states have (on average 1.234866828087167) internal successors, (510), 413 states have internal predecessors, (510), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:59,712 INFO L87 Difference]: Start difference. First operand 542 states. Second operand has 542 states, 413 states have (on average 1.234866828087167) internal successors, (510), 413 states have internal predecessors, (510), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:59,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:59,729 INFO L93 Difference]: Finished difference Result 542 states and 736 transitions. [2022-04-15 15:12:59,729 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 736 transitions. [2022-04-15 15:12:59,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:59,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:59,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 542 states, 413 states have (on average 1.234866828087167) internal successors, (510), 413 states have internal predecessors, (510), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 542 states. [2022-04-15 15:12:59,731 INFO L87 Difference]: Start difference. First operand has 542 states, 413 states have (on average 1.234866828087167) internal successors, (510), 413 states have internal predecessors, (510), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) Second operand 542 states. [2022-04-15 15:12:59,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:12:59,747 INFO L93 Difference]: Finished difference Result 542 states and 736 transitions. [2022-04-15 15:12:59,748 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 736 transitions. [2022-04-15 15:12:59,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:12:59,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:12:59,748 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:12:59,749 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:12:59,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 413 states have (on average 1.234866828087167) internal successors, (510), 413 states have internal predecessors, (510), 114 states have call successors, (114), 16 states have call predecessors, (114), 14 states have return successors, (112), 112 states have call predecessors, (112), 112 states have call successors, (112) [2022-04-15 15:12:59,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 736 transitions. [2022-04-15 15:12:59,771 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 736 transitions. Word has length 107 [2022-04-15 15:12:59,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:12:59,771 INFO L478 AbstractCegarLoop]: Abstraction has 542 states and 736 transitions. [2022-04-15 15:12:59,771 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 5.428571428571429) internal successors, (76), 13 states have internal predecessors, (76), 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-15 15:12:59,771 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 542 states and 736 transitions. [2022-04-15 15:13:02,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 736 edges. 735 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:02,829 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 736 transitions. [2022-04-15 15:13:02,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2022-04-15 15:13:02,830 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:02,831 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 4, 4, 4, 4, 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-15 15:13:02,835 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (35)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:03,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,35 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:03,031 INFO L403 AbstractCegarLoop]: === Iteration 35 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:03,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:03,031 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 5 times [2022-04-15 15:13:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:03,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [641719159] [2022-04-15 15:13:03,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:03,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1965005106, now seen corresponding path program 6 times [2022-04-15 15:13:03,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:03,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097912129] [2022-04-15 15:13:03,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:03,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:03,043 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:03,043 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1271187558] [2022-04-15 15:13:03,043 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:13:03,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:03,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:03,044 INFO L229 MonitoredProcess]: Starting monitored process 36 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:03,045 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Waiting until timeout for monitored process [2022-04-15 15:13:03,184 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:13:03,185 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:03,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 278 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:13:03,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:03,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:03,798 INFO L272 TraceCheckUtils]: 0: Hoare triple {57064#true} call ULTIMATE.init(); {57064#true} is VALID [2022-04-15 15:13:03,799 INFO L290 TraceCheckUtils]: 1: Hoare triple {57064#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; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,799 INFO L290 TraceCheckUtils]: 2: Hoare triple {57072#(<= ~counter~0 0)} assume true; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57072#(<= ~counter~0 0)} {57064#true} #102#return; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,800 INFO L272 TraceCheckUtils]: 4: Hoare triple {57072#(<= ~counter~0 0)} call #t~ret9 := main(); {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,800 INFO L290 TraceCheckUtils]: 5: Hoare triple {57072#(<= ~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; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,801 INFO L272 TraceCheckUtils]: 6: Hoare triple {57072#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,801 INFO L290 TraceCheckUtils]: 7: Hoare triple {57072#(<= ~counter~0 0)} ~cond := #in~cond; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,801 INFO L290 TraceCheckUtils]: 8: Hoare triple {57072#(<= ~counter~0 0)} assume !(0 == ~cond); {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,801 INFO L290 TraceCheckUtils]: 9: Hoare triple {57072#(<= ~counter~0 0)} assume true; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,802 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {57072#(<= ~counter~0 0)} {57072#(<= ~counter~0 0)} #90#return; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,802 INFO L272 TraceCheckUtils]: 11: Hoare triple {57072#(<= ~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)); {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {57072#(<= ~counter~0 0)} ~cond := #in~cond; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {57072#(<= ~counter~0 0)} assume !(0 == ~cond); {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,803 INFO L290 TraceCheckUtils]: 14: Hoare triple {57072#(<= ~counter~0 0)} assume true; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,804 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {57072#(<= ~counter~0 0)} {57072#(<= ~counter~0 0)} #92#return; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {57072#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {57072#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:03,805 INFO L290 TraceCheckUtils]: 17: Hoare triple {57072#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:03,805 INFO L290 TraceCheckUtils]: 18: Hoare triple {57121#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {57121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:03,806 INFO L272 TraceCheckUtils]: 19: Hoare triple {57121#(<= ~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)); {57121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:03,806 INFO L290 TraceCheckUtils]: 20: Hoare triple {57121#(<= ~counter~0 1)} ~cond := #in~cond; {57121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:03,806 INFO L290 TraceCheckUtils]: 21: Hoare triple {57121#(<= ~counter~0 1)} assume !(0 == ~cond); {57121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:03,807 INFO L290 TraceCheckUtils]: 22: Hoare triple {57121#(<= ~counter~0 1)} assume true; {57121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:03,807 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {57121#(<= ~counter~0 1)} {57121#(<= ~counter~0 1)} #94#return; {57121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:03,807 INFO L290 TraceCheckUtils]: 24: Hoare triple {57121#(<= ~counter~0 1)} assume !!(0 != ~r~0); {57121#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:03,808 INFO L290 TraceCheckUtils]: 25: Hoare triple {57121#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:03,808 INFO L290 TraceCheckUtils]: 26: Hoare triple {57146#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {57146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:03,809 INFO L272 TraceCheckUtils]: 27: Hoare triple {57146#(<= ~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)); {57146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:03,809 INFO L290 TraceCheckUtils]: 28: Hoare triple {57146#(<= ~counter~0 2)} ~cond := #in~cond; {57146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:03,809 INFO L290 TraceCheckUtils]: 29: Hoare triple {57146#(<= ~counter~0 2)} assume !(0 == ~cond); {57146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:03,810 INFO L290 TraceCheckUtils]: 30: Hoare triple {57146#(<= ~counter~0 2)} assume true; {57146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:03,810 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {57146#(<= ~counter~0 2)} {57146#(<= ~counter~0 2)} #96#return; {57146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:03,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {57146#(<= ~counter~0 2)} assume !(~r~0 > 0); {57146#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:03,811 INFO L290 TraceCheckUtils]: 33: Hoare triple {57146#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:03,811 INFO L290 TraceCheckUtils]: 34: Hoare triple {57171#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {57171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:03,812 INFO L272 TraceCheckUtils]: 35: Hoare triple {57171#(<= ~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)); {57171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:03,812 INFO L290 TraceCheckUtils]: 36: Hoare triple {57171#(<= ~counter~0 3)} ~cond := #in~cond; {57171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:03,813 INFO L290 TraceCheckUtils]: 37: Hoare triple {57171#(<= ~counter~0 3)} assume !(0 == ~cond); {57171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:03,813 INFO L290 TraceCheckUtils]: 38: Hoare triple {57171#(<= ~counter~0 3)} assume true; {57171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:03,813 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {57171#(<= ~counter~0 3)} {57171#(<= ~counter~0 3)} #98#return; {57171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:03,814 INFO L290 TraceCheckUtils]: 40: Hoare triple {57171#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57171#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:03,814 INFO L290 TraceCheckUtils]: 41: Hoare triple {57171#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:03,814 INFO L290 TraceCheckUtils]: 42: Hoare triple {57196#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {57196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:03,815 INFO L272 TraceCheckUtils]: 43: Hoare triple {57196#(<= ~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)); {57196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:03,815 INFO L290 TraceCheckUtils]: 44: Hoare triple {57196#(<= ~counter~0 4)} ~cond := #in~cond; {57196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:03,816 INFO L290 TraceCheckUtils]: 45: Hoare triple {57196#(<= ~counter~0 4)} assume !(0 == ~cond); {57196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:03,816 INFO L290 TraceCheckUtils]: 46: Hoare triple {57196#(<= ~counter~0 4)} assume true; {57196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:03,816 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {57196#(<= ~counter~0 4)} {57196#(<= ~counter~0 4)} #98#return; {57196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:03,817 INFO L290 TraceCheckUtils]: 48: Hoare triple {57196#(<= ~counter~0 4)} assume !(~r~0 < 0); {57196#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:03,817 INFO L290 TraceCheckUtils]: 49: Hoare triple {57196#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:03,818 INFO L290 TraceCheckUtils]: 50: Hoare triple {57221#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {57221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:03,818 INFO L272 TraceCheckUtils]: 51: Hoare triple {57221#(<= ~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)); {57221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:03,818 INFO L290 TraceCheckUtils]: 52: Hoare triple {57221#(<= ~counter~0 5)} ~cond := #in~cond; {57221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:03,819 INFO L290 TraceCheckUtils]: 53: Hoare triple {57221#(<= ~counter~0 5)} assume !(0 == ~cond); {57221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:03,819 INFO L290 TraceCheckUtils]: 54: Hoare triple {57221#(<= ~counter~0 5)} assume true; {57221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:03,819 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {57221#(<= ~counter~0 5)} {57221#(<= ~counter~0 5)} #94#return; {57221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:03,820 INFO L290 TraceCheckUtils]: 56: Hoare triple {57221#(<= ~counter~0 5)} assume !!(0 != ~r~0); {57221#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:03,820 INFO L290 TraceCheckUtils]: 57: Hoare triple {57221#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:03,821 INFO L290 TraceCheckUtils]: 58: Hoare triple {57246#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {57246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:03,821 INFO L272 TraceCheckUtils]: 59: Hoare triple {57246#(<= ~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)); {57246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:03,821 INFO L290 TraceCheckUtils]: 60: Hoare triple {57246#(<= ~counter~0 6)} ~cond := #in~cond; {57246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:03,822 INFO L290 TraceCheckUtils]: 61: Hoare triple {57246#(<= ~counter~0 6)} assume !(0 == ~cond); {57246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:03,822 INFO L290 TraceCheckUtils]: 62: Hoare triple {57246#(<= ~counter~0 6)} assume true; {57246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:03,822 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {57246#(<= ~counter~0 6)} {57246#(<= ~counter~0 6)} #96#return; {57246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:03,823 INFO L290 TraceCheckUtils]: 64: Hoare triple {57246#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57246#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:03,823 INFO L290 TraceCheckUtils]: 65: Hoare triple {57246#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:03,824 INFO L290 TraceCheckUtils]: 66: Hoare triple {57271#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {57271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:03,824 INFO L272 TraceCheckUtils]: 67: Hoare triple {57271#(<= ~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)); {57271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:03,824 INFO L290 TraceCheckUtils]: 68: Hoare triple {57271#(<= ~counter~0 7)} ~cond := #in~cond; {57271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:03,825 INFO L290 TraceCheckUtils]: 69: Hoare triple {57271#(<= ~counter~0 7)} assume !(0 == ~cond); {57271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:03,825 INFO L290 TraceCheckUtils]: 70: Hoare triple {57271#(<= ~counter~0 7)} assume true; {57271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:03,825 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {57271#(<= ~counter~0 7)} {57271#(<= ~counter~0 7)} #96#return; {57271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:03,826 INFO L290 TraceCheckUtils]: 72: Hoare triple {57271#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57271#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:03,826 INFO L290 TraceCheckUtils]: 73: Hoare triple {57271#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57296#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:03,827 INFO L290 TraceCheckUtils]: 74: Hoare triple {57296#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {57296#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:03,827 INFO L272 TraceCheckUtils]: 75: Hoare triple {57296#(<= ~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)); {57296#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:03,827 INFO L290 TraceCheckUtils]: 76: Hoare triple {57296#(<= ~counter~0 8)} ~cond := #in~cond; {57296#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:03,828 INFO L290 TraceCheckUtils]: 77: Hoare triple {57296#(<= ~counter~0 8)} assume !(0 == ~cond); {57296#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:03,828 INFO L290 TraceCheckUtils]: 78: Hoare triple {57296#(<= ~counter~0 8)} assume true; {57296#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:03,828 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {57296#(<= ~counter~0 8)} {57296#(<= ~counter~0 8)} #96#return; {57296#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:03,829 INFO L290 TraceCheckUtils]: 80: Hoare triple {57296#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57296#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:03,829 INFO L290 TraceCheckUtils]: 81: Hoare triple {57296#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57321#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:03,830 INFO L290 TraceCheckUtils]: 82: Hoare triple {57321#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {57321#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:03,830 INFO L272 TraceCheckUtils]: 83: Hoare triple {57321#(<= ~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)); {57321#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:03,830 INFO L290 TraceCheckUtils]: 84: Hoare triple {57321#(<= ~counter~0 9)} ~cond := #in~cond; {57321#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:03,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {57321#(<= ~counter~0 9)} assume !(0 == ~cond); {57321#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:03,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {57321#(<= ~counter~0 9)} assume true; {57321#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:03,832 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {57321#(<= ~counter~0 9)} {57321#(<= ~counter~0 9)} #96#return; {57321#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:03,832 INFO L290 TraceCheckUtils]: 88: Hoare triple {57321#(<= ~counter~0 9)} assume !(~r~0 > 0); {57321#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:03,832 INFO L290 TraceCheckUtils]: 89: Hoare triple {57321#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57346#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:03,833 INFO L290 TraceCheckUtils]: 90: Hoare triple {57346#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {57346#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:03,833 INFO L272 TraceCheckUtils]: 91: Hoare triple {57346#(<= ~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)); {57346#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:03,834 INFO L290 TraceCheckUtils]: 92: Hoare triple {57346#(<= ~counter~0 10)} ~cond := #in~cond; {57346#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:03,834 INFO L290 TraceCheckUtils]: 93: Hoare triple {57346#(<= ~counter~0 10)} assume !(0 == ~cond); {57346#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:03,834 INFO L290 TraceCheckUtils]: 94: Hoare triple {57346#(<= ~counter~0 10)} assume true; {57346#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:03,835 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {57346#(<= ~counter~0 10)} {57346#(<= ~counter~0 10)} #98#return; {57346#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:03,835 INFO L290 TraceCheckUtils]: 96: Hoare triple {57346#(<= ~counter~0 10)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57346#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:03,836 INFO L290 TraceCheckUtils]: 97: Hoare triple {57346#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57371#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:03,836 INFO L290 TraceCheckUtils]: 98: Hoare triple {57371#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {57371#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:03,836 INFO L272 TraceCheckUtils]: 99: Hoare triple {57371#(<= ~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)); {57371#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:03,837 INFO L290 TraceCheckUtils]: 100: Hoare triple {57371#(<= ~counter~0 11)} ~cond := #in~cond; {57371#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:03,837 INFO L290 TraceCheckUtils]: 101: Hoare triple {57371#(<= ~counter~0 11)} assume !(0 == ~cond); {57371#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:03,837 INFO L290 TraceCheckUtils]: 102: Hoare triple {57371#(<= ~counter~0 11)} assume true; {57371#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:03,838 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {57371#(<= ~counter~0 11)} {57371#(<= ~counter~0 11)} #98#return; {57371#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:03,838 INFO L290 TraceCheckUtils]: 104: Hoare triple {57371#(<= ~counter~0 11)} assume !(~r~0 < 0); {57371#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:03,838 INFO L290 TraceCheckUtils]: 105: Hoare triple {57371#(<= ~counter~0 11)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57396#(<= |main_#t~post6| 11)} is VALID [2022-04-15 15:13:03,839 INFO L290 TraceCheckUtils]: 106: Hoare triple {57396#(<= |main_#t~post6| 11)} assume !(#t~post6 < 100);havoc #t~post6; {57065#false} is VALID [2022-04-15 15:13:03,839 INFO L272 TraceCheckUtils]: 107: Hoare triple {57065#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)); {57065#false} is VALID [2022-04-15 15:13:03,839 INFO L290 TraceCheckUtils]: 108: Hoare triple {57065#false} ~cond := #in~cond; {57065#false} is VALID [2022-04-15 15:13:03,839 INFO L290 TraceCheckUtils]: 109: Hoare triple {57065#false} assume 0 == ~cond; {57065#false} is VALID [2022-04-15 15:13:03,839 INFO L290 TraceCheckUtils]: 110: Hoare triple {57065#false} assume !false; {57065#false} is VALID [2022-04-15 15:13:03,839 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 292 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:13:03,839 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:04,521 INFO L290 TraceCheckUtils]: 110: Hoare triple {57065#false} assume !false; {57065#false} is VALID [2022-04-15 15:13:04,522 INFO L290 TraceCheckUtils]: 109: Hoare triple {57065#false} assume 0 == ~cond; {57065#false} is VALID [2022-04-15 15:13:04,522 INFO L290 TraceCheckUtils]: 108: Hoare triple {57065#false} ~cond := #in~cond; {57065#false} is VALID [2022-04-15 15:13:04,522 INFO L272 TraceCheckUtils]: 107: Hoare triple {57065#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)); {57065#false} is VALID [2022-04-15 15:13:04,522 INFO L290 TraceCheckUtils]: 106: Hoare triple {57424#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {57065#false} is VALID [2022-04-15 15:13:04,522 INFO L290 TraceCheckUtils]: 105: Hoare triple {57428#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57424#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:13:04,523 INFO L290 TraceCheckUtils]: 104: Hoare triple {57428#(< ~counter~0 100)} assume !(~r~0 < 0); {57428#(< ~counter~0 100)} is VALID [2022-04-15 15:13:04,523 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {57064#true} {57428#(< ~counter~0 100)} #98#return; {57428#(< ~counter~0 100)} is VALID [2022-04-15 15:13:04,523 INFO L290 TraceCheckUtils]: 102: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,523 INFO L290 TraceCheckUtils]: 101: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,523 INFO L290 TraceCheckUtils]: 100: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,523 INFO L272 TraceCheckUtils]: 99: Hoare triple {57428#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,524 INFO L290 TraceCheckUtils]: 98: Hoare triple {57428#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {57428#(< ~counter~0 100)} is VALID [2022-04-15 15:13:04,525 INFO L290 TraceCheckUtils]: 97: Hoare triple {57453#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57428#(< ~counter~0 100)} is VALID [2022-04-15 15:13:04,525 INFO L290 TraceCheckUtils]: 96: Hoare triple {57453#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57453#(< ~counter~0 99)} is VALID [2022-04-15 15:13:04,526 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {57064#true} {57453#(< ~counter~0 99)} #98#return; {57453#(< ~counter~0 99)} is VALID [2022-04-15 15:13:04,526 INFO L290 TraceCheckUtils]: 94: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,526 INFO L290 TraceCheckUtils]: 93: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,526 INFO L290 TraceCheckUtils]: 92: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,526 INFO L272 TraceCheckUtils]: 91: Hoare triple {57453#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,526 INFO L290 TraceCheckUtils]: 90: Hoare triple {57453#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {57453#(< ~counter~0 99)} is VALID [2022-04-15 15:13:04,527 INFO L290 TraceCheckUtils]: 89: Hoare triple {57478#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57453#(< ~counter~0 99)} is VALID [2022-04-15 15:13:04,527 INFO L290 TraceCheckUtils]: 88: Hoare triple {57478#(< ~counter~0 98)} assume !(~r~0 > 0); {57478#(< ~counter~0 98)} is VALID [2022-04-15 15:13:04,528 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {57064#true} {57478#(< ~counter~0 98)} #96#return; {57478#(< ~counter~0 98)} is VALID [2022-04-15 15:13:04,528 INFO L290 TraceCheckUtils]: 86: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,528 INFO L290 TraceCheckUtils]: 85: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,528 INFO L290 TraceCheckUtils]: 84: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,528 INFO L272 TraceCheckUtils]: 83: Hoare triple {57478#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,528 INFO L290 TraceCheckUtils]: 82: Hoare triple {57478#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {57478#(< ~counter~0 98)} is VALID [2022-04-15 15:13:04,529 INFO L290 TraceCheckUtils]: 81: Hoare triple {57503#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57478#(< ~counter~0 98)} is VALID [2022-04-15 15:13:04,535 INFO L290 TraceCheckUtils]: 80: Hoare triple {57503#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57503#(< ~counter~0 97)} is VALID [2022-04-15 15:13:04,536 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {57064#true} {57503#(< ~counter~0 97)} #96#return; {57503#(< ~counter~0 97)} is VALID [2022-04-15 15:13:04,536 INFO L290 TraceCheckUtils]: 78: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,536 INFO L290 TraceCheckUtils]: 77: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,536 INFO L290 TraceCheckUtils]: 76: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,536 INFO L272 TraceCheckUtils]: 75: Hoare triple {57503#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,537 INFO L290 TraceCheckUtils]: 74: Hoare triple {57503#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {57503#(< ~counter~0 97)} is VALID [2022-04-15 15:13:04,538 INFO L290 TraceCheckUtils]: 73: Hoare triple {57528#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57503#(< ~counter~0 97)} is VALID [2022-04-15 15:13:04,538 INFO L290 TraceCheckUtils]: 72: Hoare triple {57528#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57528#(< ~counter~0 96)} is VALID [2022-04-15 15:13:04,539 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {57064#true} {57528#(< ~counter~0 96)} #96#return; {57528#(< ~counter~0 96)} is VALID [2022-04-15 15:13:04,539 INFO L290 TraceCheckUtils]: 70: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,539 INFO L290 TraceCheckUtils]: 69: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,539 INFO L290 TraceCheckUtils]: 68: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,539 INFO L272 TraceCheckUtils]: 67: Hoare triple {57528#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,540 INFO L290 TraceCheckUtils]: 66: Hoare triple {57528#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {57528#(< ~counter~0 96)} is VALID [2022-04-15 15:13:04,541 INFO L290 TraceCheckUtils]: 65: Hoare triple {57553#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57528#(< ~counter~0 96)} is VALID [2022-04-15 15:13:04,541 INFO L290 TraceCheckUtils]: 64: Hoare triple {57553#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {57553#(< ~counter~0 95)} is VALID [2022-04-15 15:13:04,542 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {57064#true} {57553#(< ~counter~0 95)} #96#return; {57553#(< ~counter~0 95)} is VALID [2022-04-15 15:13:04,542 INFO L290 TraceCheckUtils]: 62: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,542 INFO L290 TraceCheckUtils]: 61: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,542 INFO L290 TraceCheckUtils]: 60: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,542 INFO L272 TraceCheckUtils]: 59: Hoare triple {57553#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,542 INFO L290 TraceCheckUtils]: 58: Hoare triple {57553#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {57553#(< ~counter~0 95)} is VALID [2022-04-15 15:13:04,543 INFO L290 TraceCheckUtils]: 57: Hoare triple {57578#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57553#(< ~counter~0 95)} is VALID [2022-04-15 15:13:04,544 INFO L290 TraceCheckUtils]: 56: Hoare triple {57578#(< ~counter~0 94)} assume !!(0 != ~r~0); {57578#(< ~counter~0 94)} is VALID [2022-04-15 15:13:04,544 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {57064#true} {57578#(< ~counter~0 94)} #94#return; {57578#(< ~counter~0 94)} is VALID [2022-04-15 15:13:04,545 INFO L290 TraceCheckUtils]: 54: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,545 INFO L290 TraceCheckUtils]: 53: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,545 INFO L290 TraceCheckUtils]: 52: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,545 INFO L272 TraceCheckUtils]: 51: Hoare triple {57578#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,545 INFO L290 TraceCheckUtils]: 50: Hoare triple {57578#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {57578#(< ~counter~0 94)} is VALID [2022-04-15 15:13:04,546 INFO L290 TraceCheckUtils]: 49: Hoare triple {57603#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57578#(< ~counter~0 94)} is VALID [2022-04-15 15:13:04,546 INFO L290 TraceCheckUtils]: 48: Hoare triple {57603#(< ~counter~0 93)} assume !(~r~0 < 0); {57603#(< ~counter~0 93)} is VALID [2022-04-15 15:13:04,547 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {57064#true} {57603#(< ~counter~0 93)} #98#return; {57603#(< ~counter~0 93)} is VALID [2022-04-15 15:13:04,547 INFO L290 TraceCheckUtils]: 46: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,547 INFO L290 TraceCheckUtils]: 45: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,547 INFO L290 TraceCheckUtils]: 44: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,547 INFO L272 TraceCheckUtils]: 43: Hoare triple {57603#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,548 INFO L290 TraceCheckUtils]: 42: Hoare triple {57603#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {57603#(< ~counter~0 93)} is VALID [2022-04-15 15:13:04,548 INFO L290 TraceCheckUtils]: 41: Hoare triple {57628#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57603#(< ~counter~0 93)} is VALID [2022-04-15 15:13:04,549 INFO L290 TraceCheckUtils]: 40: Hoare triple {57628#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {57628#(< ~counter~0 92)} is VALID [2022-04-15 15:13:04,549 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {57064#true} {57628#(< ~counter~0 92)} #98#return; {57628#(< ~counter~0 92)} is VALID [2022-04-15 15:13:04,549 INFO L290 TraceCheckUtils]: 38: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,549 INFO L290 TraceCheckUtils]: 37: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,549 INFO L290 TraceCheckUtils]: 36: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,549 INFO L272 TraceCheckUtils]: 35: Hoare triple {57628#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,550 INFO L290 TraceCheckUtils]: 34: Hoare triple {57628#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {57628#(< ~counter~0 92)} is VALID [2022-04-15 15:13:04,550 INFO L290 TraceCheckUtils]: 33: Hoare triple {57653#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {57628#(< ~counter~0 92)} is VALID [2022-04-15 15:13:04,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {57653#(< ~counter~0 91)} assume !(~r~0 > 0); {57653#(< ~counter~0 91)} is VALID [2022-04-15 15:13:04,551 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {57064#true} {57653#(< ~counter~0 91)} #96#return; {57653#(< ~counter~0 91)} is VALID [2022-04-15 15:13:04,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,551 INFO L290 TraceCheckUtils]: 28: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,552 INFO L272 TraceCheckUtils]: 27: Hoare triple {57653#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,552 INFO L290 TraceCheckUtils]: 26: Hoare triple {57653#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {57653#(< ~counter~0 91)} is VALID [2022-04-15 15:13:04,552 INFO L290 TraceCheckUtils]: 25: Hoare triple {57678#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {57653#(< ~counter~0 91)} is VALID [2022-04-15 15:13:04,553 INFO L290 TraceCheckUtils]: 24: Hoare triple {57678#(< ~counter~0 90)} assume !!(0 != ~r~0); {57678#(< ~counter~0 90)} is VALID [2022-04-15 15:13:04,553 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {57064#true} {57678#(< ~counter~0 90)} #94#return; {57678#(< ~counter~0 90)} is VALID [2022-04-15 15:13:04,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,553 INFO L290 TraceCheckUtils]: 21: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,554 INFO L290 TraceCheckUtils]: 20: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,554 INFO L272 TraceCheckUtils]: 19: Hoare triple {57678#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,554 INFO L290 TraceCheckUtils]: 18: Hoare triple {57678#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {57678#(< ~counter~0 90)} is VALID [2022-04-15 15:13:04,555 INFO L290 TraceCheckUtils]: 17: Hoare triple {57703#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {57678#(< ~counter~0 90)} is VALID [2022-04-15 15:13:04,555 INFO L290 TraceCheckUtils]: 16: Hoare triple {57703#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {57703#(< ~counter~0 89)} is VALID [2022-04-15 15:13:04,555 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {57064#true} {57703#(< ~counter~0 89)} #92#return; {57703#(< ~counter~0 89)} is VALID [2022-04-15 15:13:04,555 INFO L290 TraceCheckUtils]: 14: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,555 INFO L290 TraceCheckUtils]: 13: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,555 INFO L290 TraceCheckUtils]: 12: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,555 INFO L272 TraceCheckUtils]: 11: Hoare triple {57703#(< ~counter~0 89)} 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)); {57064#true} is VALID [2022-04-15 15:13:04,556 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {57064#true} {57703#(< ~counter~0 89)} #90#return; {57703#(< ~counter~0 89)} is VALID [2022-04-15 15:13:04,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {57064#true} assume true; {57064#true} is VALID [2022-04-15 15:13:04,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {57064#true} assume !(0 == ~cond); {57064#true} is VALID [2022-04-15 15:13:04,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {57064#true} ~cond := #in~cond; {57064#true} is VALID [2022-04-15 15:13:04,556 INFO L272 TraceCheckUtils]: 6: Hoare triple {57703#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {57064#true} is VALID [2022-04-15 15:13:04,556 INFO L290 TraceCheckUtils]: 5: Hoare triple {57703#(< ~counter~0 89)} 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; {57703#(< ~counter~0 89)} is VALID [2022-04-15 15:13:04,557 INFO L272 TraceCheckUtils]: 4: Hoare triple {57703#(< ~counter~0 89)} call #t~ret9 := main(); {57703#(< ~counter~0 89)} is VALID [2022-04-15 15:13:04,557 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57703#(< ~counter~0 89)} {57064#true} #102#return; {57703#(< ~counter~0 89)} is VALID [2022-04-15 15:13:04,557 INFO L290 TraceCheckUtils]: 2: Hoare triple {57703#(< ~counter~0 89)} assume true; {57703#(< ~counter~0 89)} is VALID [2022-04-15 15:13:04,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {57064#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; {57703#(< ~counter~0 89)} is VALID [2022-04-15 15:13:04,558 INFO L272 TraceCheckUtils]: 0: Hoare triple {57064#true} call ULTIMATE.init(); {57064#true} is VALID [2022-04-15 15:13:04,558 INFO L134 CoverageAnalysis]: Checked inductivity of 318 backedges. 22 proven. 72 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:13:04,558 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:04,558 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097912129] [2022-04-15 15:13:04,559 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:04,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1271187558] [2022-04-15 15:13:04,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1271187558] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:04,559 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:04,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-15 15:13:04,559 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:04,559 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [641719159] [2022-04-15 15:13:04,559 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [641719159] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:04,559 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:04,559 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:13:04,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254242413] [2022-04-15 15:13:04,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:04,560 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 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 111 [2022-04-15 15:13:04,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:04,560 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 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-15 15:13:04,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:04,647 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 15:13:04,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:04,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 15:13:04,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-15 15:13:04,648 INFO L87 Difference]: Start difference. First operand 542 states and 736 transitions. Second operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 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-15 15:13:06,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:06,854 INFO L93 Difference]: Finished difference Result 597 states and 813 transitions. [2022-04-15 15:13:06,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-04-15 15:13:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 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 111 [2022-04-15 15:13:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:06,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 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-15 15:13:06,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-15 15:13:06,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 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-15 15:13:06,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 234 transitions. [2022-04-15 15:13:06,858 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 23 states and 234 transitions. [2022-04-15 15:13:07,057 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:07,075 INFO L225 Difference]: With dead ends: 597 [2022-04-15 15:13:07,075 INFO L226 Difference]: Without dead ends: 586 [2022-04-15 15:13:07,075 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 229 GetRequests, 195 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 62 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=525, Invalid=735, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 15:13:07,076 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 136 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 94 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 304 SdHoareTripleChecker+Invalid, 276 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 94 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:07,076 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [136 Valid, 304 Invalid, 276 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [94 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:13:07,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 586 states. [2022-04-15 15:13:08,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 586 to 564. [2022-04-15 15:13:08,242 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:08,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 586 states. Second operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:08,243 INFO L74 IsIncluded]: Start isIncluded. First operand 586 states. Second operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:08,244 INFO L87 Difference]: Start difference. First operand 586 states. Second operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:08,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:08,262 INFO L93 Difference]: Finished difference Result 586 states and 797 transitions. [2022-04-15 15:13:08,263 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 797 transitions. [2022-04-15 15:13:08,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:08,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:08,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 586 states. [2022-04-15 15:13:08,265 INFO L87 Difference]: Start difference. First operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 586 states. [2022-04-15 15:13:08,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:08,284 INFO L93 Difference]: Finished difference Result 586 states and 797 transitions. [2022-04-15 15:13:08,284 INFO L276 IsEmpty]: Start isEmpty. Operand 586 states and 797 transitions. [2022-04-15 15:13:08,285 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:08,285 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:08,285 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:08,285 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:08,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:08,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 771 transitions. [2022-04-15 15:13:08,305 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 771 transitions. Word has length 111 [2022-04-15 15:13:08,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:08,306 INFO L478 AbstractCegarLoop]: Abstraction has 564 states and 771 transitions. [2022-04-15 15:13:08,306 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.2) internal successors, (78), 14 states have internal predecessors, (78), 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-15 15:13:08,306 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 564 states and 771 transitions. [2022-04-15 15:13:11,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 770 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:11,466 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 771 transitions. [2022-04-15 15:13:11,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 15:13:11,467 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:11,467 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 5, 5, 5, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:11,471 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (36)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:11,667 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2022-04-15 15:13:11,667 INFO L403 AbstractCegarLoop]: === Iteration 36 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:11,668 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:11,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 13 times [2022-04-15 15:13:11,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:11,668 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1501205761] [2022-04-15 15:13:11,669 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:11,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1038942829, now seen corresponding path program 14 times [2022-04-15 15:13:11,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:11,669 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [369907794] [2022-04-15 15:13:11,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:11,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:11,684 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:11,684 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [551195236] [2022-04-15 15:13:11,684 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:11,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:11,685 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:11,685 INFO L229 MonitoredProcess]: Starting monitored process 37 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:11,686 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Waiting until timeout for monitored process [2022-04-15 15:13:11,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:11,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:11,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 11 conjunts are in the unsatisfiable core [2022-04-15 15:13:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:11,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:12,669 INFO L272 TraceCheckUtils]: 0: Hoare triple {61267#true} call ULTIMATE.init(); {61267#true} is VALID [2022-04-15 15:13:12,669 INFO L290 TraceCheckUtils]: 1: Hoare triple {61267#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; {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L290 TraceCheckUtils]: 2: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61267#true} {61267#true} #102#return; {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L272 TraceCheckUtils]: 4: Hoare triple {61267#true} call #t~ret9 := main(); {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L290 TraceCheckUtils]: 5: Hoare triple {61267#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; {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L272 TraceCheckUtils]: 6: Hoare triple {61267#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61267#true} {61267#true} #90#return; {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {61267#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)); {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61267#true} {61267#true} #92#return; {61267#true} is VALID [2022-04-15 15:13:12,671 INFO L290 TraceCheckUtils]: 16: Hoare triple {61267#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {61320#(<= 1 main_~v~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {61320#(<= 1 main_~v~0)} assume !!(#t~post6 < 100);havoc #t~post6; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,671 INFO L272 TraceCheckUtils]: 19: Hoare triple {61320#(<= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:12,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,672 INFO L290 TraceCheckUtils]: 22: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,672 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {61267#true} {61320#(<= 1 main_~v~0)} #94#return; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,672 INFO L290 TraceCheckUtils]: 24: Hoare triple {61320#(<= 1 main_~v~0)} assume !!(0 != ~r~0); {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,673 INFO L290 TraceCheckUtils]: 25: Hoare triple {61320#(<= 1 main_~v~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,673 INFO L290 TraceCheckUtils]: 26: Hoare triple {61320#(<= 1 main_~v~0)} assume !!(#t~post7 < 100);havoc #t~post7; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,673 INFO L272 TraceCheckUtils]: 27: Hoare triple {61320#(<= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:12,673 INFO L290 TraceCheckUtils]: 28: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,673 INFO L290 TraceCheckUtils]: 29: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,673 INFO L290 TraceCheckUtils]: 30: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,674 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {61267#true} {61320#(<= 1 main_~v~0)} #96#return; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,674 INFO L290 TraceCheckUtils]: 32: Hoare triple {61320#(<= 1 main_~v~0)} assume !(~r~0 > 0); {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,674 INFO L290 TraceCheckUtils]: 33: Hoare triple {61320#(<= 1 main_~v~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,674 INFO L290 TraceCheckUtils]: 34: Hoare triple {61320#(<= 1 main_~v~0)} assume !!(#t~post8 < 100);havoc #t~post8; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,675 INFO L272 TraceCheckUtils]: 35: Hoare triple {61320#(<= 1 main_~v~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:12,675 INFO L290 TraceCheckUtils]: 36: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,675 INFO L290 TraceCheckUtils]: 37: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,675 INFO L290 TraceCheckUtils]: 38: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,675 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {61267#true} {61320#(<= 1 main_~v~0)} #98#return; {61320#(<= 1 main_~v~0)} is VALID [2022-04-15 15:13:12,677 INFO L290 TraceCheckUtils]: 40: Hoare triple {61320#(<= 1 main_~v~0)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,677 INFO L290 TraceCheckUtils]: 41: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,678 INFO L290 TraceCheckUtils]: 42: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post8 < 100);havoc #t~post8; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,678 INFO L272 TraceCheckUtils]: 43: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:12,678 INFO L290 TraceCheckUtils]: 44: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,678 INFO L290 TraceCheckUtils]: 45: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,678 INFO L290 TraceCheckUtils]: 46: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,678 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {61267#true} {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #98#return; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,679 INFO L290 TraceCheckUtils]: 48: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !(~r~0 < 0); {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,679 INFO L290 TraceCheckUtils]: 49: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,679 INFO L290 TraceCheckUtils]: 50: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post6 < 100);havoc #t~post6; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,680 INFO L272 TraceCheckUtils]: 51: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:12,680 INFO L290 TraceCheckUtils]: 52: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,680 INFO L290 TraceCheckUtils]: 53: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,680 INFO L290 TraceCheckUtils]: 54: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,680 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {61267#true} {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #94#return; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,680 INFO L290 TraceCheckUtils]: 56: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(0 != ~r~0); {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,681 INFO L290 TraceCheckUtils]: 57: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,681 INFO L290 TraceCheckUtils]: 58: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(#t~post7 < 100);havoc #t~post7; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,681 INFO L272 TraceCheckUtils]: 59: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:12,681 INFO L290 TraceCheckUtils]: 60: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,681 INFO L290 TraceCheckUtils]: 61: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,682 INFO L290 TraceCheckUtils]: 62: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,682 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61267#true} {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} #96#return; {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} is VALID [2022-04-15 15:13:12,683 INFO L290 TraceCheckUtils]: 64: Hoare triple {61393#(and (< (+ main_~r~0 2) main_~u~0) (<= 1 main_~v~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61466#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 15:13:12,683 INFO L290 TraceCheckUtils]: 65: Hoare triple {61466#(< (+ main_~r~0 3) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61466#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 15:13:12,683 INFO L290 TraceCheckUtils]: 66: Hoare triple {61466#(< (+ main_~r~0 3) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {61466#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 15:13:12,683 INFO L272 TraceCheckUtils]: 67: Hoare triple {61466#(< (+ main_~r~0 3) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:12,684 INFO L290 TraceCheckUtils]: 68: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,684 INFO L290 TraceCheckUtils]: 69: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,684 INFO L290 TraceCheckUtils]: 70: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,684 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {61267#true} {61466#(< (+ main_~r~0 3) main_~u~0)} #96#return; {61466#(< (+ main_~r~0 3) main_~u~0)} is VALID [2022-04-15 15:13:12,685 INFO L290 TraceCheckUtils]: 72: Hoare triple {61466#(< (+ main_~r~0 3) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61491#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 15:13:12,685 INFO L290 TraceCheckUtils]: 73: Hoare triple {61491#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61491#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 15:13:12,685 INFO L290 TraceCheckUtils]: 74: Hoare triple {61491#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {61491#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 15:13:12,685 INFO L272 TraceCheckUtils]: 75: Hoare triple {61491#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:12,685 INFO L290 TraceCheckUtils]: 76: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,685 INFO L290 TraceCheckUtils]: 77: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,685 INFO L290 TraceCheckUtils]: 78: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,686 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {61267#true} {61491#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} #96#return; {61491#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} is VALID [2022-04-15 15:13:12,686 INFO L290 TraceCheckUtils]: 80: Hoare triple {61491#(< (+ main_~v~0 main_~r~0 1) main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:12,687 INFO L290 TraceCheckUtils]: 81: Hoare triple {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:12,687 INFO L290 TraceCheckUtils]: 82: Hoare triple {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post7 < 100);havoc #t~post7; {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:12,687 INFO L272 TraceCheckUtils]: 83: Hoare triple {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~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)); {61267#true} is VALID [2022-04-15 15:13:12,687 INFO L290 TraceCheckUtils]: 84: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,687 INFO L290 TraceCheckUtils]: 85: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,687 INFO L290 TraceCheckUtils]: 86: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,688 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {61267#true} {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #96#return; {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:12,688 INFO L290 TraceCheckUtils]: 88: Hoare triple {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !(~r~0 > 0); {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:12,688 INFO L290 TraceCheckUtils]: 89: Hoare triple {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:12,689 INFO L290 TraceCheckUtils]: 90: Hoare triple {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:12,689 INFO L272 TraceCheckUtils]: 91: Hoare triple {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~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)); {61267#true} is VALID [2022-04-15 15:13:12,689 INFO L290 TraceCheckUtils]: 92: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,689 INFO L290 TraceCheckUtils]: 93: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,689 INFO L290 TraceCheckUtils]: 94: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,689 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {61267#true} {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} #98#return; {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} is VALID [2022-04-15 15:13:12,690 INFO L290 TraceCheckUtils]: 96: Hoare triple {61516#(< 0 (div (+ (- 2) main_~u~0 main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {61565#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 15:13:12,691 INFO L290 TraceCheckUtils]: 97: Hoare triple {61565#(< 0 (div (+ (- 2) main_~r~0) 2))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61565#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 15:13:12,691 INFO L290 TraceCheckUtils]: 98: Hoare triple {61565#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(#t~post8 < 100);havoc #t~post8; {61565#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 15:13:12,691 INFO L272 TraceCheckUtils]: 99: Hoare triple {61565#(< 0 (div (+ (- 2) main_~r~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)); {61267#true} is VALID [2022-04-15 15:13:12,691 INFO L290 TraceCheckUtils]: 100: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:12,691 INFO L290 TraceCheckUtils]: 101: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:12,691 INFO L290 TraceCheckUtils]: 102: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:12,692 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {61267#true} {61565#(< 0 (div (+ (- 2) main_~r~0) 2))} #98#return; {61565#(< 0 (div (+ (- 2) main_~r~0) 2))} is VALID [2022-04-15 15:13:12,692 INFO L290 TraceCheckUtils]: 104: Hoare triple {61565#(< 0 (div (+ (- 2) main_~r~0) 2))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {61268#false} is VALID [2022-04-15 15:13:12,692 INFO L290 TraceCheckUtils]: 105: Hoare triple {61268#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61268#false} is VALID [2022-04-15 15:13:12,693 INFO L290 TraceCheckUtils]: 106: Hoare triple {61268#false} assume !(#t~post8 < 100);havoc #t~post8; {61268#false} is VALID [2022-04-15 15:13:12,693 INFO L290 TraceCheckUtils]: 107: Hoare triple {61268#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61268#false} is VALID [2022-04-15 15:13:12,693 INFO L290 TraceCheckUtils]: 108: Hoare triple {61268#false} assume !(#t~post6 < 100);havoc #t~post6; {61268#false} is VALID [2022-04-15 15:13:12,693 INFO L272 TraceCheckUtils]: 109: Hoare triple {61268#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)); {61268#false} is VALID [2022-04-15 15:13:12,693 INFO L290 TraceCheckUtils]: 110: Hoare triple {61268#false} ~cond := #in~cond; {61268#false} is VALID [2022-04-15 15:13:12,693 INFO L290 TraceCheckUtils]: 111: Hoare triple {61268#false} assume 0 == ~cond; {61268#false} is VALID [2022-04-15 15:13:12,693 INFO L290 TraceCheckUtils]: 112: Hoare triple {61268#false} assume !false; {61268#false} is VALID [2022-04-15 15:13:12,693 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 46 proven. 56 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:13:12,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:13,150 INFO L290 TraceCheckUtils]: 112: Hoare triple {61268#false} assume !false; {61268#false} is VALID [2022-04-15 15:13:13,150 INFO L290 TraceCheckUtils]: 111: Hoare triple {61268#false} assume 0 == ~cond; {61268#false} is VALID [2022-04-15 15:13:13,151 INFO L290 TraceCheckUtils]: 110: Hoare triple {61268#false} ~cond := #in~cond; {61268#false} is VALID [2022-04-15 15:13:13,151 INFO L272 TraceCheckUtils]: 109: Hoare triple {61268#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)); {61268#false} is VALID [2022-04-15 15:13:13,151 INFO L290 TraceCheckUtils]: 108: Hoare triple {61268#false} assume !(#t~post6 < 100);havoc #t~post6; {61268#false} is VALID [2022-04-15 15:13:13,151 INFO L290 TraceCheckUtils]: 107: Hoare triple {61268#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61268#false} is VALID [2022-04-15 15:13:13,151 INFO L290 TraceCheckUtils]: 106: Hoare triple {61268#false} assume !(#t~post8 < 100);havoc #t~post8; {61268#false} is VALID [2022-04-15 15:13:13,151 INFO L290 TraceCheckUtils]: 105: Hoare triple {61268#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61268#false} is VALID [2022-04-15 15:13:13,151 INFO L290 TraceCheckUtils]: 104: Hoare triple {61638#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {61268#false} is VALID [2022-04-15 15:13:13,152 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {61267#true} {61638#(not (< main_~r~0 0))} #98#return; {61638#(not (< main_~r~0 0))} is VALID [2022-04-15 15:13:13,152 INFO L290 TraceCheckUtils]: 102: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,152 INFO L290 TraceCheckUtils]: 101: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,152 INFO L290 TraceCheckUtils]: 100: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,152 INFO L272 TraceCheckUtils]: 99: Hoare triple {61638#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:13,152 INFO L290 TraceCheckUtils]: 98: Hoare triple {61638#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {61638#(not (< main_~r~0 0))} is VALID [2022-04-15 15:13:13,153 INFO L290 TraceCheckUtils]: 97: Hoare triple {61638#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61638#(not (< main_~r~0 0))} is VALID [2022-04-15 15:13:13,153 INFO L290 TraceCheckUtils]: 96: Hoare triple {61663#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {61638#(not (< main_~r~0 0))} is VALID [2022-04-15 15:13:13,154 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {61267#true} {61663#(<= 0 (+ main_~u~0 main_~r~0))} #98#return; {61663#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:13:13,154 INFO L290 TraceCheckUtils]: 94: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,154 INFO L290 TraceCheckUtils]: 93: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,154 INFO L290 TraceCheckUtils]: 92: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,154 INFO L272 TraceCheckUtils]: 91: Hoare triple {61663#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:13,154 INFO L290 TraceCheckUtils]: 90: Hoare triple {61663#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {61663#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:13:13,155 INFO L290 TraceCheckUtils]: 89: Hoare triple {61663#(<= 0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61663#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:13:13,155 INFO L290 TraceCheckUtils]: 88: Hoare triple {61663#(<= 0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {61663#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:13:13,155 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {61267#true} {61663#(<= 0 (+ main_~u~0 main_~r~0))} #96#return; {61663#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:13:13,155 INFO L290 TraceCheckUtils]: 86: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,155 INFO L290 TraceCheckUtils]: 85: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,156 INFO L290 TraceCheckUtils]: 84: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,156 INFO L272 TraceCheckUtils]: 83: Hoare triple {61663#(<= 0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:13,156 INFO L290 TraceCheckUtils]: 82: Hoare triple {61663#(<= 0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {61663#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:13:13,156 INFO L290 TraceCheckUtils]: 81: Hoare triple {61663#(<= 0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61663#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:13:13,157 INFO L290 TraceCheckUtils]: 80: Hoare triple {61712#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61663#(<= 0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:13:13,157 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {61267#true} {61712#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #96#return; {61712#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:13:13,157 INFO L290 TraceCheckUtils]: 78: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,157 INFO L290 TraceCheckUtils]: 77: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,158 INFO L290 TraceCheckUtils]: 76: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,158 INFO L272 TraceCheckUtils]: 75: Hoare triple {61712#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:13,158 INFO L290 TraceCheckUtils]: 74: Hoare triple {61712#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {61712#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:13:13,158 INFO L290 TraceCheckUtils]: 73: Hoare triple {61712#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61712#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:13:13,160 INFO L290 TraceCheckUtils]: 72: Hoare triple {61737#(<= main_~r~0 main_~u~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61712#(or (<= main_~v~0 (+ main_~u~0 main_~r~0)) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:13:13,160 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {61267#true} {61737#(<= main_~r~0 main_~u~0)} #96#return; {61737#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:13:13,160 INFO L290 TraceCheckUtils]: 70: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,160 INFO L290 TraceCheckUtils]: 69: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,160 INFO L290 TraceCheckUtils]: 68: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,160 INFO L272 TraceCheckUtils]: 67: Hoare triple {61737#(<= main_~r~0 main_~u~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:13,161 INFO L290 TraceCheckUtils]: 66: Hoare triple {61737#(<= main_~r~0 main_~u~0)} assume !!(#t~post7 < 100);havoc #t~post7; {61737#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:13:13,161 INFO L290 TraceCheckUtils]: 65: Hoare triple {61737#(<= main_~r~0 main_~u~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61737#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:13:13,161 INFO L290 TraceCheckUtils]: 64: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {61737#(<= main_~r~0 main_~u~0)} is VALID [2022-04-15 15:13:13,162 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {61267#true} {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #96#return; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,162 INFO L290 TraceCheckUtils]: 62: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,162 INFO L290 TraceCheckUtils]: 61: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,162 INFO L290 TraceCheckUtils]: 60: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,162 INFO L272 TraceCheckUtils]: 59: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:13,162 INFO L290 TraceCheckUtils]: 58: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post7 < 100);havoc #t~post7; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,163 INFO L290 TraceCheckUtils]: 57: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,163 INFO L290 TraceCheckUtils]: 56: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(0 != ~r~0); {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,164 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {61267#true} {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #94#return; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,164 INFO L290 TraceCheckUtils]: 54: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,164 INFO L290 TraceCheckUtils]: 53: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,164 INFO L290 TraceCheckUtils]: 52: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,164 INFO L272 TraceCheckUtils]: 51: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:13,164 INFO L290 TraceCheckUtils]: 50: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post6 < 100);havoc #t~post6; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,165 INFO L290 TraceCheckUtils]: 49: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,165 INFO L290 TraceCheckUtils]: 48: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !(~r~0 < 0); {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,165 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {61267#true} {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #98#return; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,165 INFO L290 TraceCheckUtils]: 46: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,165 INFO L290 TraceCheckUtils]: 45: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,166 INFO L290 TraceCheckUtils]: 44: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,166 INFO L272 TraceCheckUtils]: 43: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:13,166 INFO L290 TraceCheckUtils]: 42: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} assume !!(#t~post8 < 100);havoc #t~post8; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,166 INFO L290 TraceCheckUtils]: 41: Hoare triple {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,167 INFO L290 TraceCheckUtils]: 40: Hoare triple {61835#(<= 0 (+ main_~v~0 3))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {61762#(<= main_~r~0 (+ main_~v~0 main_~u~0))} is VALID [2022-04-15 15:13:13,167 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {61267#true} {61835#(<= 0 (+ main_~v~0 3))} #98#return; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,167 INFO L290 TraceCheckUtils]: 38: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,167 INFO L290 TraceCheckUtils]: 37: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,167 INFO L290 TraceCheckUtils]: 36: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,167 INFO L272 TraceCheckUtils]: 35: Hoare triple {61835#(<= 0 (+ main_~v~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)); {61267#true} is VALID [2022-04-15 15:13:13,168 INFO L290 TraceCheckUtils]: 34: Hoare triple {61835#(<= 0 (+ main_~v~0 3))} assume !!(#t~post8 < 100);havoc #t~post8; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,168 INFO L290 TraceCheckUtils]: 33: Hoare triple {61835#(<= 0 (+ main_~v~0 3))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,168 INFO L290 TraceCheckUtils]: 32: Hoare triple {61835#(<= 0 (+ main_~v~0 3))} assume !(~r~0 > 0); {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,169 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {61267#true} {61835#(<= 0 (+ main_~v~0 3))} #96#return; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,169 INFO L290 TraceCheckUtils]: 30: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,169 INFO L290 TraceCheckUtils]: 29: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,169 INFO L290 TraceCheckUtils]: 28: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,169 INFO L272 TraceCheckUtils]: 27: Hoare triple {61835#(<= 0 (+ main_~v~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)); {61267#true} is VALID [2022-04-15 15:13:13,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {61835#(<= 0 (+ main_~v~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,170 INFO L290 TraceCheckUtils]: 25: Hoare triple {61835#(<= 0 (+ main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,170 INFO L290 TraceCheckUtils]: 24: Hoare triple {61835#(<= 0 (+ main_~v~0 3))} assume !!(0 != ~r~0); {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,171 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {61267#true} {61835#(<= 0 (+ main_~v~0 3))} #94#return; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,171 INFO L290 TraceCheckUtils]: 22: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,171 INFO L290 TraceCheckUtils]: 21: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,171 INFO L290 TraceCheckUtils]: 20: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,171 INFO L272 TraceCheckUtils]: 19: Hoare triple {61835#(<= 0 (+ main_~v~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)); {61267#true} is VALID [2022-04-15 15:13:13,171 INFO L290 TraceCheckUtils]: 18: Hoare triple {61835#(<= 0 (+ main_~v~0 3))} assume !!(#t~post6 < 100);havoc #t~post6; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,172 INFO L290 TraceCheckUtils]: 17: Hoare triple {61835#(<= 0 (+ main_~v~0 3))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,172 INFO L290 TraceCheckUtils]: 16: Hoare triple {61267#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {61835#(<= 0 (+ main_~v~0 3))} is VALID [2022-04-15 15:13:13,172 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {61267#true} {61267#true} #92#return; {61267#true} is VALID [2022-04-15 15:13:13,172 INFO L290 TraceCheckUtils]: 14: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,172 INFO L290 TraceCheckUtils]: 13: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,172 INFO L290 TraceCheckUtils]: 12: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,172 INFO L272 TraceCheckUtils]: 11: Hoare triple {61267#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)); {61267#true} is VALID [2022-04-15 15:13:13,172 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {61267#true} {61267#true} #90#return; {61267#true} is VALID [2022-04-15 15:13:13,172 INFO L290 TraceCheckUtils]: 9: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {61267#true} assume !(0 == ~cond); {61267#true} is VALID [2022-04-15 15:13:13,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {61267#true} ~cond := #in~cond; {61267#true} is VALID [2022-04-15 15:13:13,173 INFO L272 TraceCheckUtils]: 6: Hoare triple {61267#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {61267#true} is VALID [2022-04-15 15:13:13,173 INFO L290 TraceCheckUtils]: 5: Hoare triple {61267#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; {61267#true} is VALID [2022-04-15 15:13:13,173 INFO L272 TraceCheckUtils]: 4: Hoare triple {61267#true} call #t~ret9 := main(); {61267#true} is VALID [2022-04-15 15:13:13,173 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {61267#true} {61267#true} #102#return; {61267#true} is VALID [2022-04-15 15:13:13,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {61267#true} assume true; {61267#true} is VALID [2022-04-15 15:13:13,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {61267#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; {61267#true} is VALID [2022-04-15 15:13:13,173 INFO L272 TraceCheckUtils]: 0: Hoare triple {61267#true} call ULTIMATE.init(); {61267#true} is VALID [2022-04-15 15:13:13,173 INFO L134 CoverageAnalysis]: Checked inductivity of 326 backedges. 34 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:13:13,174 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:13,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [369907794] [2022-04-15 15:13:13,174 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:13,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [551195236] [2022-04-15 15:13:13,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [551195236] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:13,174 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:13,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 14 [2022-04-15 15:13:13,174 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:13,174 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1501205761] [2022-04-15 15:13:13,174 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1501205761] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:13,174 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:13,174 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-04-15 15:13:13,174 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664200073] [2022-04-15 15:13:13,174 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:13,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-15 15:13:13,175 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:13,175 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:13:13,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:13,267 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-04-15 15:13:13,267 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:13,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-04-15 15:13:13,268 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=148, Unknown=0, NotChecked=0, Total=182 [2022-04-15 15:13:13,268 INFO L87 Difference]: Start difference. First operand 564 states and 771 transitions. Second operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:13:16,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:16,534 INFO L93 Difference]: Finished difference Result 866 states and 1227 transitions. [2022-04-15 15:13:16,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:13:16,534 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) Word has length 113 [2022-04-15 15:13:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:16,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:13:16,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-15 15:13:16,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:13:16,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 190 transitions. [2022-04-15 15:13:16,537 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 190 transitions. [2022-04-15 15:13:16,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 190 edges. 190 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:16,736 INFO L225 Difference]: With dead ends: 866 [2022-04-15 15:13:16,736 INFO L226 Difference]: Without dead ends: 715 [2022-04-15 15:13:16,737 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 230 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2022-04-15 15:13:16,737 INFO L913 BasicCegarLoop]: 106 mSDtfsCounter, 71 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 355 SdHoareTripleChecker+Invalid, 290 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:16,738 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 355 Invalid, 290 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:13:16,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 715 states. [2022-04-15 15:13:18,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 715 to 564. [2022-04-15 15:13:18,271 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:18,271 INFO L82 GeneralOperation]: Start isEquivalent. First operand 715 states. Second operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:18,272 INFO L74 IsIncluded]: Start isIncluded. First operand 715 states. Second operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:18,272 INFO L87 Difference]: Start difference. First operand 715 states. Second operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:18,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:18,300 INFO L93 Difference]: Finished difference Result 715 states and 992 transitions. [2022-04-15 15:13:18,300 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 992 transitions. [2022-04-15 15:13:18,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:18,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:18,301 INFO L74 IsIncluded]: Start isIncluded. First operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 715 states. [2022-04-15 15:13:18,301 INFO L87 Difference]: Start difference. First operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) Second operand 715 states. [2022-04-15 15:13:18,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:18,323 INFO L93 Difference]: Finished difference Result 715 states and 992 transitions. [2022-04-15 15:13:18,323 INFO L276 IsEmpty]: Start isEmpty. Operand 715 states and 992 transitions. [2022-04-15 15:13:18,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:18,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:18,324 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:18,324 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:18,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 564 states, 421 states have (on average 1.2327790973871735) internal successors, (519), 431 states have internal predecessors, (519), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 115 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:18,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 564 states to 564 states and 771 transitions. [2022-04-15 15:13:18,340 INFO L78 Accepts]: Start accepts. Automaton has 564 states and 771 transitions. Word has length 113 [2022-04-15 15:13:18,340 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:18,340 INFO L478 AbstractCegarLoop]: Abstraction has 564 states and 771 transitions. [2022-04-15 15:13:18,340 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 6.25) internal successors, (50), 8 states have internal predecessors, (50), 8 states have call successors, (16), 2 states have call predecessors, (16), 1 states have return successors, (14), 7 states have call predecessors, (14), 7 states have call successors, (14) [2022-04-15 15:13:18,340 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 564 states and 771 transitions. [2022-04-15 15:13:21,551 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 771 edges. 770 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:21,552 INFO L276 IsEmpty]: Start isEmpty. Operand 564 states and 771 transitions. [2022-04-15 15:13:21,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2022-04-15 15:13:21,553 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:21,553 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 6, 6, 6, 6, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:21,569 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (37)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:21,753 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,37 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:21,753 INFO L403 AbstractCegarLoop]: === Iteration 37 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:21,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 15 times [2022-04-15 15:13:21,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:21,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [518685770] [2022-04-15 15:13:21,754 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:21,754 INFO L85 PathProgramCache]: Analyzing trace with hash -144297019, now seen corresponding path program 16 times [2022-04-15 15:13:21,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:21,754 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1347571405] [2022-04-15 15:13:21,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:21,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:21,766 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:21,766 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1423041507] [2022-04-15 15:13:21,766 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:13:21,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:21,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:21,767 INFO L229 MonitoredProcess]: Starting monitored process 38 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:21,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Waiting until timeout for monitored process [2022-04-15 15:13:22,167 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:13:22,167 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:22,168 INFO L263 TraceCheckSpWp]: Trace formula consists of 287 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:13:22,189 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:22,190 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:22,773 INFO L272 TraceCheckUtils]: 0: Hoare triple {66258#true} call ULTIMATE.init(); {66258#true} is VALID [2022-04-15 15:13:22,773 INFO L290 TraceCheckUtils]: 1: Hoare triple {66258#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; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {66266#(<= ~counter~0 0)} assume true; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,774 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66266#(<= ~counter~0 0)} {66258#true} #102#return; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,774 INFO L272 TraceCheckUtils]: 4: Hoare triple {66266#(<= ~counter~0 0)} call #t~ret9 := main(); {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {66266#(<= ~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; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,775 INFO L272 TraceCheckUtils]: 6: Hoare triple {66266#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,775 INFO L290 TraceCheckUtils]: 7: Hoare triple {66266#(<= ~counter~0 0)} ~cond := #in~cond; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,775 INFO L290 TraceCheckUtils]: 8: Hoare triple {66266#(<= ~counter~0 0)} assume !(0 == ~cond); {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,776 INFO L290 TraceCheckUtils]: 9: Hoare triple {66266#(<= ~counter~0 0)} assume true; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,776 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66266#(<= ~counter~0 0)} {66266#(<= ~counter~0 0)} #90#return; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,777 INFO L272 TraceCheckUtils]: 11: Hoare triple {66266#(<= ~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)); {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,777 INFO L290 TraceCheckUtils]: 12: Hoare triple {66266#(<= ~counter~0 0)} ~cond := #in~cond; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,777 INFO L290 TraceCheckUtils]: 13: Hoare triple {66266#(<= ~counter~0 0)} assume !(0 == ~cond); {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,777 INFO L290 TraceCheckUtils]: 14: Hoare triple {66266#(<= ~counter~0 0)} assume true; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,778 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66266#(<= ~counter~0 0)} {66266#(<= ~counter~0 0)} #92#return; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,778 INFO L290 TraceCheckUtils]: 16: Hoare triple {66266#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {66266#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:22,779 INFO L290 TraceCheckUtils]: 17: Hoare triple {66266#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66315#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:22,780 INFO L290 TraceCheckUtils]: 18: Hoare triple {66315#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {66315#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:22,780 INFO L272 TraceCheckUtils]: 19: Hoare triple {66315#(<= ~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)); {66315#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:22,780 INFO L290 TraceCheckUtils]: 20: Hoare triple {66315#(<= ~counter~0 1)} ~cond := #in~cond; {66315#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:22,781 INFO L290 TraceCheckUtils]: 21: Hoare triple {66315#(<= ~counter~0 1)} assume !(0 == ~cond); {66315#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:22,781 INFO L290 TraceCheckUtils]: 22: Hoare triple {66315#(<= ~counter~0 1)} assume true; {66315#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:22,782 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {66315#(<= ~counter~0 1)} {66315#(<= ~counter~0 1)} #94#return; {66315#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:22,782 INFO L290 TraceCheckUtils]: 24: Hoare triple {66315#(<= ~counter~0 1)} assume !!(0 != ~r~0); {66315#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:22,783 INFO L290 TraceCheckUtils]: 25: Hoare triple {66315#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66340#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:22,783 INFO L290 TraceCheckUtils]: 26: Hoare triple {66340#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {66340#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:22,783 INFO L272 TraceCheckUtils]: 27: Hoare triple {66340#(<= ~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)); {66340#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:22,784 INFO L290 TraceCheckUtils]: 28: Hoare triple {66340#(<= ~counter~0 2)} ~cond := #in~cond; {66340#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:22,784 INFO L290 TraceCheckUtils]: 29: Hoare triple {66340#(<= ~counter~0 2)} assume !(0 == ~cond); {66340#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:22,784 INFO L290 TraceCheckUtils]: 30: Hoare triple {66340#(<= ~counter~0 2)} assume true; {66340#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:22,785 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {66340#(<= ~counter~0 2)} {66340#(<= ~counter~0 2)} #96#return; {66340#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:22,785 INFO L290 TraceCheckUtils]: 32: Hoare triple {66340#(<= ~counter~0 2)} assume !(~r~0 > 0); {66340#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:22,786 INFO L290 TraceCheckUtils]: 33: Hoare triple {66340#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66365#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:22,786 INFO L290 TraceCheckUtils]: 34: Hoare triple {66365#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {66365#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:22,786 INFO L272 TraceCheckUtils]: 35: Hoare triple {66365#(<= ~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)); {66365#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:22,787 INFO L290 TraceCheckUtils]: 36: Hoare triple {66365#(<= ~counter~0 3)} ~cond := #in~cond; {66365#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:22,787 INFO L290 TraceCheckUtils]: 37: Hoare triple {66365#(<= ~counter~0 3)} assume !(0 == ~cond); {66365#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:22,787 INFO L290 TraceCheckUtils]: 38: Hoare triple {66365#(<= ~counter~0 3)} assume true; {66365#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:22,788 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {66365#(<= ~counter~0 3)} {66365#(<= ~counter~0 3)} #98#return; {66365#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:22,788 INFO L290 TraceCheckUtils]: 40: Hoare triple {66365#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {66365#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:22,789 INFO L290 TraceCheckUtils]: 41: Hoare triple {66365#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66390#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:22,789 INFO L290 TraceCheckUtils]: 42: Hoare triple {66390#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {66390#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:22,790 INFO L272 TraceCheckUtils]: 43: Hoare triple {66390#(<= ~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)); {66390#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:22,790 INFO L290 TraceCheckUtils]: 44: Hoare triple {66390#(<= ~counter~0 4)} ~cond := #in~cond; {66390#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:22,790 INFO L290 TraceCheckUtils]: 45: Hoare triple {66390#(<= ~counter~0 4)} assume !(0 == ~cond); {66390#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:22,790 INFO L290 TraceCheckUtils]: 46: Hoare triple {66390#(<= ~counter~0 4)} assume true; {66390#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:22,791 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {66390#(<= ~counter~0 4)} {66390#(<= ~counter~0 4)} #98#return; {66390#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:22,791 INFO L290 TraceCheckUtils]: 48: Hoare triple {66390#(<= ~counter~0 4)} assume !(~r~0 < 0); {66390#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:22,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {66390#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66415#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:22,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {66415#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {66415#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:22,793 INFO L272 TraceCheckUtils]: 51: Hoare triple {66415#(<= ~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)); {66415#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:22,793 INFO L290 TraceCheckUtils]: 52: Hoare triple {66415#(<= ~counter~0 5)} ~cond := #in~cond; {66415#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:22,793 INFO L290 TraceCheckUtils]: 53: Hoare triple {66415#(<= ~counter~0 5)} assume !(0 == ~cond); {66415#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:22,800 INFO L290 TraceCheckUtils]: 54: Hoare triple {66415#(<= ~counter~0 5)} assume true; {66415#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:22,800 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {66415#(<= ~counter~0 5)} {66415#(<= ~counter~0 5)} #94#return; {66415#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:22,801 INFO L290 TraceCheckUtils]: 56: Hoare triple {66415#(<= ~counter~0 5)} assume !!(0 != ~r~0); {66415#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:22,802 INFO L290 TraceCheckUtils]: 57: Hoare triple {66415#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66440#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:22,802 INFO L290 TraceCheckUtils]: 58: Hoare triple {66440#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {66440#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:22,803 INFO L272 TraceCheckUtils]: 59: Hoare triple {66440#(<= ~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)); {66440#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:22,803 INFO L290 TraceCheckUtils]: 60: Hoare triple {66440#(<= ~counter~0 6)} ~cond := #in~cond; {66440#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:22,803 INFO L290 TraceCheckUtils]: 61: Hoare triple {66440#(<= ~counter~0 6)} assume !(0 == ~cond); {66440#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:22,804 INFO L290 TraceCheckUtils]: 62: Hoare triple {66440#(<= ~counter~0 6)} assume true; {66440#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:22,804 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {66440#(<= ~counter~0 6)} {66440#(<= ~counter~0 6)} #96#return; {66440#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:22,804 INFO L290 TraceCheckUtils]: 64: Hoare triple {66440#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66440#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:22,805 INFO L290 TraceCheckUtils]: 65: Hoare triple {66440#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66465#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:22,805 INFO L290 TraceCheckUtils]: 66: Hoare triple {66465#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {66465#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:22,806 INFO L272 TraceCheckUtils]: 67: Hoare triple {66465#(<= ~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)); {66465#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:22,806 INFO L290 TraceCheckUtils]: 68: Hoare triple {66465#(<= ~counter~0 7)} ~cond := #in~cond; {66465#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:22,806 INFO L290 TraceCheckUtils]: 69: Hoare triple {66465#(<= ~counter~0 7)} assume !(0 == ~cond); {66465#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:22,807 INFO L290 TraceCheckUtils]: 70: Hoare triple {66465#(<= ~counter~0 7)} assume true; {66465#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:22,807 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {66465#(<= ~counter~0 7)} {66465#(<= ~counter~0 7)} #96#return; {66465#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:22,807 INFO L290 TraceCheckUtils]: 72: Hoare triple {66465#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66465#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:22,808 INFO L290 TraceCheckUtils]: 73: Hoare triple {66465#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66490#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:22,808 INFO L290 TraceCheckUtils]: 74: Hoare triple {66490#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {66490#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:22,809 INFO L272 TraceCheckUtils]: 75: Hoare triple {66490#(<= ~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)); {66490#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:22,809 INFO L290 TraceCheckUtils]: 76: Hoare triple {66490#(<= ~counter~0 8)} ~cond := #in~cond; {66490#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:22,809 INFO L290 TraceCheckUtils]: 77: Hoare triple {66490#(<= ~counter~0 8)} assume !(0 == ~cond); {66490#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:22,810 INFO L290 TraceCheckUtils]: 78: Hoare triple {66490#(<= ~counter~0 8)} assume true; {66490#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:22,810 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {66490#(<= ~counter~0 8)} {66490#(<= ~counter~0 8)} #96#return; {66490#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:22,811 INFO L290 TraceCheckUtils]: 80: Hoare triple {66490#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66490#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:22,811 INFO L290 TraceCheckUtils]: 81: Hoare triple {66490#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66515#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:22,812 INFO L290 TraceCheckUtils]: 82: Hoare triple {66515#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {66515#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:22,812 INFO L272 TraceCheckUtils]: 83: Hoare triple {66515#(<= ~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)); {66515#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:22,812 INFO L290 TraceCheckUtils]: 84: Hoare triple {66515#(<= ~counter~0 9)} ~cond := #in~cond; {66515#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:22,813 INFO L290 TraceCheckUtils]: 85: Hoare triple {66515#(<= ~counter~0 9)} assume !(0 == ~cond); {66515#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:22,813 INFO L290 TraceCheckUtils]: 86: Hoare triple {66515#(<= ~counter~0 9)} assume true; {66515#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:22,813 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {66515#(<= ~counter~0 9)} {66515#(<= ~counter~0 9)} #96#return; {66515#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:22,814 INFO L290 TraceCheckUtils]: 88: Hoare triple {66515#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66515#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:22,814 INFO L290 TraceCheckUtils]: 89: Hoare triple {66515#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66540#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:22,815 INFO L290 TraceCheckUtils]: 90: Hoare triple {66540#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {66540#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:22,815 INFO L272 TraceCheckUtils]: 91: Hoare triple {66540#(<= ~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)); {66540#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:22,815 INFO L290 TraceCheckUtils]: 92: Hoare triple {66540#(<= ~counter~0 10)} ~cond := #in~cond; {66540#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:22,816 INFO L290 TraceCheckUtils]: 93: Hoare triple {66540#(<= ~counter~0 10)} assume !(0 == ~cond); {66540#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:22,816 INFO L290 TraceCheckUtils]: 94: Hoare triple {66540#(<= ~counter~0 10)} assume true; {66540#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:22,816 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {66540#(<= ~counter~0 10)} {66540#(<= ~counter~0 10)} #96#return; {66540#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:22,817 INFO L290 TraceCheckUtils]: 96: Hoare triple {66540#(<= ~counter~0 10)} assume !(~r~0 > 0); {66540#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:22,817 INFO L290 TraceCheckUtils]: 97: Hoare triple {66540#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66565#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:22,818 INFO L290 TraceCheckUtils]: 98: Hoare triple {66565#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {66565#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:22,818 INFO L272 TraceCheckUtils]: 99: Hoare triple {66565#(<= ~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)); {66565#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:22,818 INFO L290 TraceCheckUtils]: 100: Hoare triple {66565#(<= ~counter~0 11)} ~cond := #in~cond; {66565#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:22,819 INFO L290 TraceCheckUtils]: 101: Hoare triple {66565#(<= ~counter~0 11)} assume !(0 == ~cond); {66565#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:22,819 INFO L290 TraceCheckUtils]: 102: Hoare triple {66565#(<= ~counter~0 11)} assume true; {66565#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:22,820 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {66565#(<= ~counter~0 11)} {66565#(<= ~counter~0 11)} #98#return; {66565#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:22,820 INFO L290 TraceCheckUtils]: 104: Hoare triple {66565#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {66565#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:22,820 INFO L290 TraceCheckUtils]: 105: Hoare triple {66565#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66590#(<= |main_#t~post8| 11)} is VALID [2022-04-15 15:13:22,820 INFO L290 TraceCheckUtils]: 106: Hoare triple {66590#(<= |main_#t~post8| 11)} assume !(#t~post8 < 100);havoc #t~post8; {66259#false} is VALID [2022-04-15 15:13:22,821 INFO L290 TraceCheckUtils]: 107: Hoare triple {66259#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66259#false} is VALID [2022-04-15 15:13:22,821 INFO L290 TraceCheckUtils]: 108: Hoare triple {66259#false} assume !(#t~post6 < 100);havoc #t~post6; {66259#false} is VALID [2022-04-15 15:13:22,821 INFO L272 TraceCheckUtils]: 109: Hoare triple {66259#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)); {66259#false} is VALID [2022-04-15 15:13:22,821 INFO L290 TraceCheckUtils]: 110: Hoare triple {66259#false} ~cond := #in~cond; {66259#false} is VALID [2022-04-15 15:13:22,821 INFO L290 TraceCheckUtils]: 111: Hoare triple {66259#false} assume 0 == ~cond; {66259#false} is VALID [2022-04-15 15:13:22,821 INFO L290 TraceCheckUtils]: 112: Hoare triple {66259#false} assume !false; {66259#false} is VALID [2022-04-15 15:13:22,821 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 302 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:13:22,821 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:23,450 INFO L290 TraceCheckUtils]: 112: Hoare triple {66259#false} assume !false; {66259#false} is VALID [2022-04-15 15:13:23,450 INFO L290 TraceCheckUtils]: 111: Hoare triple {66259#false} assume 0 == ~cond; {66259#false} is VALID [2022-04-15 15:13:23,450 INFO L290 TraceCheckUtils]: 110: Hoare triple {66259#false} ~cond := #in~cond; {66259#false} is VALID [2022-04-15 15:13:23,450 INFO L272 TraceCheckUtils]: 109: Hoare triple {66259#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)); {66259#false} is VALID [2022-04-15 15:13:23,450 INFO L290 TraceCheckUtils]: 108: Hoare triple {66259#false} assume !(#t~post6 < 100);havoc #t~post6; {66259#false} is VALID [2022-04-15 15:13:23,450 INFO L290 TraceCheckUtils]: 107: Hoare triple {66259#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66259#false} is VALID [2022-04-15 15:13:23,451 INFO L290 TraceCheckUtils]: 106: Hoare triple {66630#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {66259#false} is VALID [2022-04-15 15:13:23,451 INFO L290 TraceCheckUtils]: 105: Hoare triple {66634#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66630#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:13:23,451 INFO L290 TraceCheckUtils]: 104: Hoare triple {66634#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {66634#(< ~counter~0 100)} is VALID [2022-04-15 15:13:23,452 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {66258#true} {66634#(< ~counter~0 100)} #98#return; {66634#(< ~counter~0 100)} is VALID [2022-04-15 15:13:23,452 INFO L290 TraceCheckUtils]: 102: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,452 INFO L290 TraceCheckUtils]: 101: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,452 INFO L290 TraceCheckUtils]: 100: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,452 INFO L272 TraceCheckUtils]: 99: Hoare triple {66634#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,452 INFO L290 TraceCheckUtils]: 98: Hoare triple {66634#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {66634#(< ~counter~0 100)} is VALID [2022-04-15 15:13:23,454 INFO L290 TraceCheckUtils]: 97: Hoare triple {66659#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66634#(< ~counter~0 100)} is VALID [2022-04-15 15:13:23,454 INFO L290 TraceCheckUtils]: 96: Hoare triple {66659#(< ~counter~0 99)} assume !(~r~0 > 0); {66659#(< ~counter~0 99)} is VALID [2022-04-15 15:13:23,454 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {66258#true} {66659#(< ~counter~0 99)} #96#return; {66659#(< ~counter~0 99)} is VALID [2022-04-15 15:13:23,455 INFO L290 TraceCheckUtils]: 94: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,455 INFO L290 TraceCheckUtils]: 93: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,455 INFO L290 TraceCheckUtils]: 92: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,455 INFO L272 TraceCheckUtils]: 91: Hoare triple {66659#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,455 INFO L290 TraceCheckUtils]: 90: Hoare triple {66659#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {66659#(< ~counter~0 99)} is VALID [2022-04-15 15:13:23,456 INFO L290 TraceCheckUtils]: 89: Hoare triple {66684#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66659#(< ~counter~0 99)} is VALID [2022-04-15 15:13:23,456 INFO L290 TraceCheckUtils]: 88: Hoare triple {66684#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66684#(< ~counter~0 98)} is VALID [2022-04-15 15:13:23,457 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {66258#true} {66684#(< ~counter~0 98)} #96#return; {66684#(< ~counter~0 98)} is VALID [2022-04-15 15:13:23,457 INFO L290 TraceCheckUtils]: 86: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,457 INFO L290 TraceCheckUtils]: 85: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,457 INFO L290 TraceCheckUtils]: 84: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,457 INFO L272 TraceCheckUtils]: 83: Hoare triple {66684#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,457 INFO L290 TraceCheckUtils]: 82: Hoare triple {66684#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {66684#(< ~counter~0 98)} is VALID [2022-04-15 15:13:23,458 INFO L290 TraceCheckUtils]: 81: Hoare triple {66709#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66684#(< ~counter~0 98)} is VALID [2022-04-15 15:13:23,458 INFO L290 TraceCheckUtils]: 80: Hoare triple {66709#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66709#(< ~counter~0 97)} is VALID [2022-04-15 15:13:23,459 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {66258#true} {66709#(< ~counter~0 97)} #96#return; {66709#(< ~counter~0 97)} is VALID [2022-04-15 15:13:23,459 INFO L290 TraceCheckUtils]: 78: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,459 INFO L290 TraceCheckUtils]: 77: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,459 INFO L290 TraceCheckUtils]: 76: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,459 INFO L272 TraceCheckUtils]: 75: Hoare triple {66709#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,459 INFO L290 TraceCheckUtils]: 74: Hoare triple {66709#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {66709#(< ~counter~0 97)} is VALID [2022-04-15 15:13:23,460 INFO L290 TraceCheckUtils]: 73: Hoare triple {66734#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66709#(< ~counter~0 97)} is VALID [2022-04-15 15:13:23,460 INFO L290 TraceCheckUtils]: 72: Hoare triple {66734#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66734#(< ~counter~0 96)} is VALID [2022-04-15 15:13:23,461 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {66258#true} {66734#(< ~counter~0 96)} #96#return; {66734#(< ~counter~0 96)} is VALID [2022-04-15 15:13:23,461 INFO L290 TraceCheckUtils]: 70: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,461 INFO L290 TraceCheckUtils]: 69: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,461 INFO L290 TraceCheckUtils]: 68: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,461 INFO L272 TraceCheckUtils]: 67: Hoare triple {66734#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,461 INFO L290 TraceCheckUtils]: 66: Hoare triple {66734#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {66734#(< ~counter~0 96)} is VALID [2022-04-15 15:13:23,462 INFO L290 TraceCheckUtils]: 65: Hoare triple {66759#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66734#(< ~counter~0 96)} is VALID [2022-04-15 15:13:23,462 INFO L290 TraceCheckUtils]: 64: Hoare triple {66759#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {66759#(< ~counter~0 95)} is VALID [2022-04-15 15:13:23,463 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {66258#true} {66759#(< ~counter~0 95)} #96#return; {66759#(< ~counter~0 95)} is VALID [2022-04-15 15:13:23,463 INFO L290 TraceCheckUtils]: 62: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,463 INFO L290 TraceCheckUtils]: 61: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,463 INFO L290 TraceCheckUtils]: 60: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,463 INFO L272 TraceCheckUtils]: 59: Hoare triple {66759#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,463 INFO L290 TraceCheckUtils]: 58: Hoare triple {66759#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {66759#(< ~counter~0 95)} is VALID [2022-04-15 15:13:23,464 INFO L290 TraceCheckUtils]: 57: Hoare triple {66784#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66759#(< ~counter~0 95)} is VALID [2022-04-15 15:13:23,464 INFO L290 TraceCheckUtils]: 56: Hoare triple {66784#(< ~counter~0 94)} assume !!(0 != ~r~0); {66784#(< ~counter~0 94)} is VALID [2022-04-15 15:13:23,465 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {66258#true} {66784#(< ~counter~0 94)} #94#return; {66784#(< ~counter~0 94)} is VALID [2022-04-15 15:13:23,465 INFO L290 TraceCheckUtils]: 54: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,465 INFO L290 TraceCheckUtils]: 53: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,465 INFO L290 TraceCheckUtils]: 52: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,465 INFO L272 TraceCheckUtils]: 51: Hoare triple {66784#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,465 INFO L290 TraceCheckUtils]: 50: Hoare triple {66784#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {66784#(< ~counter~0 94)} is VALID [2022-04-15 15:13:23,466 INFO L290 TraceCheckUtils]: 49: Hoare triple {66809#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66784#(< ~counter~0 94)} is VALID [2022-04-15 15:13:23,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {66809#(< ~counter~0 93)} assume !(~r~0 < 0); {66809#(< ~counter~0 93)} is VALID [2022-04-15 15:13:23,467 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {66258#true} {66809#(< ~counter~0 93)} #98#return; {66809#(< ~counter~0 93)} is VALID [2022-04-15 15:13:23,467 INFO L290 TraceCheckUtils]: 46: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,467 INFO L290 TraceCheckUtils]: 45: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,467 INFO L290 TraceCheckUtils]: 44: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,467 INFO L272 TraceCheckUtils]: 43: Hoare triple {66809#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,467 INFO L290 TraceCheckUtils]: 42: Hoare triple {66809#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {66809#(< ~counter~0 93)} is VALID [2022-04-15 15:13:23,468 INFO L290 TraceCheckUtils]: 41: Hoare triple {66834#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66809#(< ~counter~0 93)} is VALID [2022-04-15 15:13:23,468 INFO L290 TraceCheckUtils]: 40: Hoare triple {66834#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {66834#(< ~counter~0 92)} is VALID [2022-04-15 15:13:23,469 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {66258#true} {66834#(< ~counter~0 92)} #98#return; {66834#(< ~counter~0 92)} is VALID [2022-04-15 15:13:23,469 INFO L290 TraceCheckUtils]: 38: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,469 INFO L290 TraceCheckUtils]: 37: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,469 INFO L290 TraceCheckUtils]: 36: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,469 INFO L272 TraceCheckUtils]: 35: Hoare triple {66834#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,469 INFO L290 TraceCheckUtils]: 34: Hoare triple {66834#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {66834#(< ~counter~0 92)} is VALID [2022-04-15 15:13:23,470 INFO L290 TraceCheckUtils]: 33: Hoare triple {66859#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {66834#(< ~counter~0 92)} is VALID [2022-04-15 15:13:23,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {66859#(< ~counter~0 91)} assume !(~r~0 > 0); {66859#(< ~counter~0 91)} is VALID [2022-04-15 15:13:23,471 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {66258#true} {66859#(< ~counter~0 91)} #96#return; {66859#(< ~counter~0 91)} is VALID [2022-04-15 15:13:23,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,471 INFO L272 TraceCheckUtils]: 27: Hoare triple {66859#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {66859#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {66859#(< ~counter~0 91)} is VALID [2022-04-15 15:13:23,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {66884#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {66859#(< ~counter~0 91)} is VALID [2022-04-15 15:13:23,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {66884#(< ~counter~0 90)} assume !!(0 != ~r~0); {66884#(< ~counter~0 90)} is VALID [2022-04-15 15:13:23,473 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {66258#true} {66884#(< ~counter~0 90)} #94#return; {66884#(< ~counter~0 90)} is VALID [2022-04-15 15:13:23,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,473 INFO L272 TraceCheckUtils]: 19: Hoare triple {66884#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {66884#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {66884#(< ~counter~0 90)} is VALID [2022-04-15 15:13:23,474 INFO L290 TraceCheckUtils]: 17: Hoare triple {66909#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {66884#(< ~counter~0 90)} is VALID [2022-04-15 15:13:23,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {66909#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {66909#(< ~counter~0 89)} is VALID [2022-04-15 15:13:23,475 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {66258#true} {66909#(< ~counter~0 89)} #92#return; {66909#(< ~counter~0 89)} is VALID [2022-04-15 15:13:23,475 INFO L290 TraceCheckUtils]: 14: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,475 INFO L290 TraceCheckUtils]: 13: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,475 INFO L290 TraceCheckUtils]: 12: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,475 INFO L272 TraceCheckUtils]: 11: Hoare triple {66909#(< ~counter~0 89)} 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)); {66258#true} is VALID [2022-04-15 15:13:23,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {66258#true} {66909#(< ~counter~0 89)} #90#return; {66909#(< ~counter~0 89)} is VALID [2022-04-15 15:13:23,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {66258#true} assume true; {66258#true} is VALID [2022-04-15 15:13:23,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {66258#true} assume !(0 == ~cond); {66258#true} is VALID [2022-04-15 15:13:23,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {66258#true} ~cond := #in~cond; {66258#true} is VALID [2022-04-15 15:13:23,476 INFO L272 TraceCheckUtils]: 6: Hoare triple {66909#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {66258#true} is VALID [2022-04-15 15:13:23,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {66909#(< ~counter~0 89)} 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; {66909#(< ~counter~0 89)} is VALID [2022-04-15 15:13:23,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {66909#(< ~counter~0 89)} call #t~ret9 := main(); {66909#(< ~counter~0 89)} is VALID [2022-04-15 15:13:23,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {66909#(< ~counter~0 89)} {66258#true} #102#return; {66909#(< ~counter~0 89)} is VALID [2022-04-15 15:13:23,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {66909#(< ~counter~0 89)} assume true; {66909#(< ~counter~0 89)} is VALID [2022-04-15 15:13:23,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {66258#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; {66909#(< ~counter~0 89)} is VALID [2022-04-15 15:13:23,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {66258#true} call ULTIMATE.init(); {66258#true} is VALID [2022-04-15 15:13:23,478 INFO L134 CoverageAnalysis]: Checked inductivity of 332 backedges. 26 proven. 82 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:13:23,478 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:23,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1347571405] [2022-04-15 15:13:23,478 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:23,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1423041507] [2022-04-15 15:13:23,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1423041507] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:23,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:23,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-15 15:13:23,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:23,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [518685770] [2022-04-15 15:13:23,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [518685770] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:23,479 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:23,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:13:23,479 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [911807724] [2022-04-15 15:13:23,479 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:23,479 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 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 113 [2022-04-15 15:13:23,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:23,480 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 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-15 15:13:23,572 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-15 15:13:23,573 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 15:13:23,573 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:23,573 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 15:13:23,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-15 15:13:23,574 INFO L87 Difference]: Start difference. First operand 564 states and 771 transitions. Second operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 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-15 15:13:26,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:26,182 INFO L93 Difference]: Finished difference Result 785 states and 1104 transitions. [2022-04-15 15:13:26,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-04-15 15:13:26,183 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 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 113 [2022-04-15 15:13:26,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:26,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 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-15 15:13:26,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-15 15:13:26,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 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-15 15:13:26,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 256 transitions. [2022-04-15 15:13:26,187 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 24 states and 256 transitions. [2022-04-15 15:13:26,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:26,413 INFO L225 Difference]: With dead ends: 785 [2022-04-15 15:13:26,413 INFO L226 Difference]: Without dead ends: 592 [2022-04-15 15:13:26,414 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 234 GetRequests, 199 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 70 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=555, Invalid=777, Unknown=0, NotChecked=0, Total=1332 [2022-04-15 15:13:26,414 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 165 mSDsluCounter, 195 mSDsCounter, 0 mSdLazyCounter, 141 mSolverCounterSat, 137 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 165 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 137 IncrementalHoareTripleChecker+Valid, 141 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:26,415 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [165 Valid, 258 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [137 Valid, 141 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:13:26,415 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2022-04-15 15:13:28,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 582. [2022-04-15 15:13:28,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:28,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 592 states. Second operand has 582 states, 439 states have (on average 1.2323462414578588) internal successors, (541), 443 states have internal predecessors, (541), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:28,051 INFO L74 IsIncluded]: Start isIncluded. First operand 592 states. Second operand has 582 states, 439 states have (on average 1.2323462414578588) internal successors, (541), 443 states have internal predecessors, (541), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:28,051 INFO L87 Difference]: Start difference. First operand 592 states. Second operand has 582 states, 439 states have (on average 1.2323462414578588) internal successors, (541), 443 states have internal predecessors, (541), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:28,070 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:28,070 INFO L93 Difference]: Finished difference Result 592 states and 803 transitions. [2022-04-15 15:13:28,070 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 803 transitions. [2022-04-15 15:13:28,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:28,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:28,072 INFO L74 IsIncluded]: Start isIncluded. First operand has 582 states, 439 states have (on average 1.2323462414578588) internal successors, (541), 443 states have internal predecessors, (541), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 592 states. [2022-04-15 15:13:28,072 INFO L87 Difference]: Start difference. First operand has 582 states, 439 states have (on average 1.2323462414578588) internal successors, (541), 443 states have internal predecessors, (541), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) Second operand 592 states. [2022-04-15 15:13:28,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:28,092 INFO L93 Difference]: Finished difference Result 592 states and 803 transitions. [2022-04-15 15:13:28,092 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 803 transitions. [2022-04-15 15:13:28,092 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:28,093 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:28,093 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:28,093 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 582 states, 439 states have (on average 1.2323462414578588) internal successors, (541), 443 states have internal predecessors, (541), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 121 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:28,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 582 states to 582 states and 793 transitions. [2022-04-15 15:13:28,118 INFO L78 Accepts]: Start accepts. Automaton has 582 states and 793 transitions. Word has length 113 [2022-04-15 15:13:28,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:28,118 INFO L478 AbstractCegarLoop]: Abstraction has 582 states and 793 transitions. [2022-04-15 15:13:28,118 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.333333333333333) internal successors, (80), 14 states have internal predecessors, (80), 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-15 15:13:28,118 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 582 states and 793 transitions. [2022-04-15 15:13:31,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 793 edges. 792 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:31,408 INFO L276 IsEmpty]: Start isEmpty. Operand 582 states and 793 transitions. [2022-04-15 15:13:31,409 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 116 [2022-04-15 15:13:31,409 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:31,409 INFO L499 BasicCegarLoop]: trace histogram [12, 11, 11, 5, 5, 4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:31,415 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (38)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:31,609 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2022-04-15 15:13:31,610 INFO L403 AbstractCegarLoop]: === Iteration 38 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:31,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:31,610 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 13 times [2022-04-15 15:13:31,610 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:31,610 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1927019968] [2022-04-15 15:13:31,610 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:31,611 INFO L85 PathProgramCache]: Analyzing trace with hash 533963976, now seen corresponding path program 14 times [2022-04-15 15:13:31,611 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:31,611 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443422210] [2022-04-15 15:13:31,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:31,611 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:31,632 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:31,632 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1516345056] [2022-04-15 15:13:31,632 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:31,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:31,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:31,633 INFO L229 MonitoredProcess]: Starting monitored process 39 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:31,634 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Waiting until timeout for monitored process [2022-04-15 15:13:31,728 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:31,728 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:31,730 INFO L263 TraceCheckSpWp]: Trace formula consists of 284 conjuncts, 27 conjunts are in the unsatisfiable core [2022-04-15 15:13:31,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:31,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:32,319 INFO L272 TraceCheckUtils]: 0: Hoare triple {70899#true} call ULTIMATE.init(); {70899#true} is VALID [2022-04-15 15:13:32,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {70899#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; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,320 INFO L290 TraceCheckUtils]: 2: Hoare triple {70907#(<= ~counter~0 0)} assume true; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,320 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {70907#(<= ~counter~0 0)} {70899#true} #102#return; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,320 INFO L272 TraceCheckUtils]: 4: Hoare triple {70907#(<= ~counter~0 0)} call #t~ret9 := main(); {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,321 INFO L290 TraceCheckUtils]: 5: Hoare triple {70907#(<= ~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; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,321 INFO L272 TraceCheckUtils]: 6: Hoare triple {70907#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {70907#(<= ~counter~0 0)} ~cond := #in~cond; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,322 INFO L290 TraceCheckUtils]: 8: Hoare triple {70907#(<= ~counter~0 0)} assume !(0 == ~cond); {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,322 INFO L290 TraceCheckUtils]: 9: Hoare triple {70907#(<= ~counter~0 0)} assume true; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,322 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70907#(<= ~counter~0 0)} {70907#(<= ~counter~0 0)} #90#return; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,323 INFO L272 TraceCheckUtils]: 11: Hoare triple {70907#(<= ~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)); {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,323 INFO L290 TraceCheckUtils]: 12: Hoare triple {70907#(<= ~counter~0 0)} ~cond := #in~cond; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,323 INFO L290 TraceCheckUtils]: 13: Hoare triple {70907#(<= ~counter~0 0)} assume !(0 == ~cond); {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {70907#(<= ~counter~0 0)} assume true; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,324 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70907#(<= ~counter~0 0)} {70907#(<= ~counter~0 0)} #92#return; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,324 INFO L290 TraceCheckUtils]: 16: Hoare triple {70907#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {70907#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:32,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {70907#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70956#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:32,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {70956#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {70956#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:32,327 INFO L272 TraceCheckUtils]: 19: Hoare triple {70956#(<= ~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)); {70956#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:32,327 INFO L290 TraceCheckUtils]: 20: Hoare triple {70956#(<= ~counter~0 1)} ~cond := #in~cond; {70956#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:32,327 INFO L290 TraceCheckUtils]: 21: Hoare triple {70956#(<= ~counter~0 1)} assume !(0 == ~cond); {70956#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:32,328 INFO L290 TraceCheckUtils]: 22: Hoare triple {70956#(<= ~counter~0 1)} assume true; {70956#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:32,328 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {70956#(<= ~counter~0 1)} {70956#(<= ~counter~0 1)} #94#return; {70956#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:32,328 INFO L290 TraceCheckUtils]: 24: Hoare triple {70956#(<= ~counter~0 1)} assume !!(0 != ~r~0); {70956#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:32,329 INFO L290 TraceCheckUtils]: 25: Hoare triple {70956#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {70981#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:32,330 INFO L290 TraceCheckUtils]: 26: Hoare triple {70981#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {70981#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:32,330 INFO L272 TraceCheckUtils]: 27: Hoare triple {70981#(<= ~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)); {70981#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:32,330 INFO L290 TraceCheckUtils]: 28: Hoare triple {70981#(<= ~counter~0 2)} ~cond := #in~cond; {70981#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:32,331 INFO L290 TraceCheckUtils]: 29: Hoare triple {70981#(<= ~counter~0 2)} assume !(0 == ~cond); {70981#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:32,331 INFO L290 TraceCheckUtils]: 30: Hoare triple {70981#(<= ~counter~0 2)} assume true; {70981#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:32,331 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {70981#(<= ~counter~0 2)} {70981#(<= ~counter~0 2)} #96#return; {70981#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:32,332 INFO L290 TraceCheckUtils]: 32: Hoare triple {70981#(<= ~counter~0 2)} assume !(~r~0 > 0); {70981#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:32,333 INFO L290 TraceCheckUtils]: 33: Hoare triple {70981#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {71006#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:32,333 INFO L290 TraceCheckUtils]: 34: Hoare triple {71006#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {71006#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:32,333 INFO L272 TraceCheckUtils]: 35: Hoare triple {71006#(<= ~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)); {71006#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:32,334 INFO L290 TraceCheckUtils]: 36: Hoare triple {71006#(<= ~counter~0 3)} ~cond := #in~cond; {71006#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:32,334 INFO L290 TraceCheckUtils]: 37: Hoare triple {71006#(<= ~counter~0 3)} assume !(0 == ~cond); {71006#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:32,334 INFO L290 TraceCheckUtils]: 38: Hoare triple {71006#(<= ~counter~0 3)} assume true; {71006#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:32,335 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {71006#(<= ~counter~0 3)} {71006#(<= ~counter~0 3)} #98#return; {71006#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:32,335 INFO L290 TraceCheckUtils]: 40: Hoare triple {71006#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {71006#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:32,336 INFO L290 TraceCheckUtils]: 41: Hoare triple {71006#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {71031#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:32,336 INFO L290 TraceCheckUtils]: 42: Hoare triple {71031#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {71031#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:32,337 INFO L272 TraceCheckUtils]: 43: Hoare triple {71031#(<= ~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)); {71031#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:32,337 INFO L290 TraceCheckUtils]: 44: Hoare triple {71031#(<= ~counter~0 4)} ~cond := #in~cond; {71031#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:32,337 INFO L290 TraceCheckUtils]: 45: Hoare triple {71031#(<= ~counter~0 4)} assume !(0 == ~cond); {71031#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:32,338 INFO L290 TraceCheckUtils]: 46: Hoare triple {71031#(<= ~counter~0 4)} assume true; {71031#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:32,338 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {71031#(<= ~counter~0 4)} {71031#(<= ~counter~0 4)} #98#return; {71031#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:32,338 INFO L290 TraceCheckUtils]: 48: Hoare triple {71031#(<= ~counter~0 4)} assume !(~r~0 < 0); {71031#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:32,339 INFO L290 TraceCheckUtils]: 49: Hoare triple {71031#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {71056#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:32,339 INFO L290 TraceCheckUtils]: 50: Hoare triple {71056#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {71056#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:32,340 INFO L272 TraceCheckUtils]: 51: Hoare triple {71056#(<= ~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)); {71056#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:32,340 INFO L290 TraceCheckUtils]: 52: Hoare triple {71056#(<= ~counter~0 5)} ~cond := #in~cond; {71056#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:32,341 INFO L290 TraceCheckUtils]: 53: Hoare triple {71056#(<= ~counter~0 5)} assume !(0 == ~cond); {71056#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:32,341 INFO L290 TraceCheckUtils]: 54: Hoare triple {71056#(<= ~counter~0 5)} assume true; {71056#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:32,341 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {71056#(<= ~counter~0 5)} {71056#(<= ~counter~0 5)} #94#return; {71056#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:32,342 INFO L290 TraceCheckUtils]: 56: Hoare triple {71056#(<= ~counter~0 5)} assume !!(0 != ~r~0); {71056#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:32,342 INFO L290 TraceCheckUtils]: 57: Hoare triple {71056#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {71081#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:32,343 INFO L290 TraceCheckUtils]: 58: Hoare triple {71081#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {71081#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:32,343 INFO L272 TraceCheckUtils]: 59: Hoare triple {71081#(<= ~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)); {71081#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:32,344 INFO L290 TraceCheckUtils]: 60: Hoare triple {71081#(<= ~counter~0 6)} ~cond := #in~cond; {71081#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:32,344 INFO L290 TraceCheckUtils]: 61: Hoare triple {71081#(<= ~counter~0 6)} assume !(0 == ~cond); {71081#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:32,344 INFO L290 TraceCheckUtils]: 62: Hoare triple {71081#(<= ~counter~0 6)} assume true; {71081#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:32,345 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {71081#(<= ~counter~0 6)} {71081#(<= ~counter~0 6)} #96#return; {71081#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:32,345 INFO L290 TraceCheckUtils]: 64: Hoare triple {71081#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {71081#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:32,346 INFO L290 TraceCheckUtils]: 65: Hoare triple {71081#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {71106#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:32,346 INFO L290 TraceCheckUtils]: 66: Hoare triple {71106#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {71106#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:32,346 INFO L272 TraceCheckUtils]: 67: Hoare triple {71106#(<= ~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)); {71106#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:32,347 INFO L290 TraceCheckUtils]: 68: Hoare triple {71106#(<= ~counter~0 7)} ~cond := #in~cond; {71106#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:32,347 INFO L290 TraceCheckUtils]: 69: Hoare triple {71106#(<= ~counter~0 7)} assume !(0 == ~cond); {71106#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:32,347 INFO L290 TraceCheckUtils]: 70: Hoare triple {71106#(<= ~counter~0 7)} assume true; {71106#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:32,348 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {71106#(<= ~counter~0 7)} {71106#(<= ~counter~0 7)} #96#return; {71106#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:32,348 INFO L290 TraceCheckUtils]: 72: Hoare triple {71106#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {71106#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:32,349 INFO L290 TraceCheckUtils]: 73: Hoare triple {71106#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {71131#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:32,349 INFO L290 TraceCheckUtils]: 74: Hoare triple {71131#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {71131#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:32,350 INFO L272 TraceCheckUtils]: 75: Hoare triple {71131#(<= ~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)); {71131#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:32,350 INFO L290 TraceCheckUtils]: 76: Hoare triple {71131#(<= ~counter~0 8)} ~cond := #in~cond; {71131#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:32,350 INFO L290 TraceCheckUtils]: 77: Hoare triple {71131#(<= ~counter~0 8)} assume !(0 == ~cond); {71131#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:32,351 INFO L290 TraceCheckUtils]: 78: Hoare triple {71131#(<= ~counter~0 8)} assume true; {71131#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:32,351 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {71131#(<= ~counter~0 8)} {71131#(<= ~counter~0 8)} #96#return; {71131#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:32,351 INFO L290 TraceCheckUtils]: 80: Hoare triple {71131#(<= ~counter~0 8)} assume !(~r~0 > 0); {71131#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:32,352 INFO L290 TraceCheckUtils]: 81: Hoare triple {71131#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {71156#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:32,352 INFO L290 TraceCheckUtils]: 82: Hoare triple {71156#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {71156#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:32,353 INFO L272 TraceCheckUtils]: 83: Hoare triple {71156#(<= ~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)); {71156#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:32,353 INFO L290 TraceCheckUtils]: 84: Hoare triple {71156#(<= ~counter~0 9)} ~cond := #in~cond; {71156#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:32,353 INFO L290 TraceCheckUtils]: 85: Hoare triple {71156#(<= ~counter~0 9)} assume !(0 == ~cond); {71156#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:32,354 INFO L290 TraceCheckUtils]: 86: Hoare triple {71156#(<= ~counter~0 9)} assume true; {71156#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:32,354 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {71156#(<= ~counter~0 9)} {71156#(<= ~counter~0 9)} #98#return; {71156#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:32,355 INFO L290 TraceCheckUtils]: 88: Hoare triple {71156#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {71156#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:32,355 INFO L290 TraceCheckUtils]: 89: Hoare triple {71156#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {71181#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:32,356 INFO L290 TraceCheckUtils]: 90: Hoare triple {71181#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {71181#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:32,356 INFO L272 TraceCheckUtils]: 91: Hoare triple {71181#(<= ~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)); {71181#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:32,356 INFO L290 TraceCheckUtils]: 92: Hoare triple {71181#(<= ~counter~0 10)} ~cond := #in~cond; {71181#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:32,357 INFO L290 TraceCheckUtils]: 93: Hoare triple {71181#(<= ~counter~0 10)} assume !(0 == ~cond); {71181#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:32,357 INFO L290 TraceCheckUtils]: 94: Hoare triple {71181#(<= ~counter~0 10)} assume true; {71181#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:32,357 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {71181#(<= ~counter~0 10)} {71181#(<= ~counter~0 10)} #98#return; {71181#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:32,358 INFO L290 TraceCheckUtils]: 96: Hoare triple {71181#(<= ~counter~0 10)} assume !(~r~0 < 0); {71181#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:32,359 INFO L290 TraceCheckUtils]: 97: Hoare triple {71181#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {71206#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:32,359 INFO L290 TraceCheckUtils]: 98: Hoare triple {71206#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {71206#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:32,359 INFO L272 TraceCheckUtils]: 99: Hoare triple {71206#(<= ~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)); {71206#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:32,360 INFO L290 TraceCheckUtils]: 100: Hoare triple {71206#(<= ~counter~0 11)} ~cond := #in~cond; {71206#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:32,360 INFO L290 TraceCheckUtils]: 101: Hoare triple {71206#(<= ~counter~0 11)} assume !(0 == ~cond); {71206#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:32,360 INFO L290 TraceCheckUtils]: 102: Hoare triple {71206#(<= ~counter~0 11)} assume true; {71206#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:32,361 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {71206#(<= ~counter~0 11)} {71206#(<= ~counter~0 11)} #94#return; {71206#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:32,361 INFO L290 TraceCheckUtils]: 104: Hoare triple {71206#(<= ~counter~0 11)} assume !!(0 != ~r~0); {71206#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:32,361 INFO L290 TraceCheckUtils]: 105: Hoare triple {71206#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {71231#(<= |main_#t~post7| 11)} is VALID [2022-04-15 15:13:32,362 INFO L290 TraceCheckUtils]: 106: Hoare triple {71231#(<= |main_#t~post7| 11)} assume !(#t~post7 < 100);havoc #t~post7; {70900#false} is VALID [2022-04-15 15:13:32,362 INFO L290 TraceCheckUtils]: 107: Hoare triple {70900#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70900#false} is VALID [2022-04-15 15:13:32,362 INFO L290 TraceCheckUtils]: 108: Hoare triple {70900#false} assume !(#t~post8 < 100);havoc #t~post8; {70900#false} is VALID [2022-04-15 15:13:32,362 INFO L290 TraceCheckUtils]: 109: Hoare triple {70900#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70900#false} is VALID [2022-04-15 15:13:32,362 INFO L290 TraceCheckUtils]: 110: Hoare triple {70900#false} assume !(#t~post6 < 100);havoc #t~post6; {70900#false} is VALID [2022-04-15 15:13:32,362 INFO L272 TraceCheckUtils]: 111: Hoare triple {70900#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)); {70900#false} is VALID [2022-04-15 15:13:32,362 INFO L290 TraceCheckUtils]: 112: Hoare triple {70900#false} ~cond := #in~cond; {70900#false} is VALID [2022-04-15 15:13:32,362 INFO L290 TraceCheckUtils]: 113: Hoare triple {70900#false} assume 0 == ~cond; {70900#false} is VALID [2022-04-15 15:13:32,362 INFO L290 TraceCheckUtils]: 114: Hoare triple {70900#false} assume !false; {70900#false} is VALID [2022-04-15 15:13:32,363 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 288 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:13:32,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:33,029 INFO L290 TraceCheckUtils]: 114: Hoare triple {70900#false} assume !false; {70900#false} is VALID [2022-04-15 15:13:33,030 INFO L290 TraceCheckUtils]: 113: Hoare triple {70900#false} assume 0 == ~cond; {70900#false} is VALID [2022-04-15 15:13:33,030 INFO L290 TraceCheckUtils]: 112: Hoare triple {70900#false} ~cond := #in~cond; {70900#false} is VALID [2022-04-15 15:13:33,030 INFO L272 TraceCheckUtils]: 111: Hoare triple {70900#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)); {70900#false} is VALID [2022-04-15 15:13:33,030 INFO L290 TraceCheckUtils]: 110: Hoare triple {70900#false} assume !(#t~post6 < 100);havoc #t~post6; {70900#false} is VALID [2022-04-15 15:13:33,030 INFO L290 TraceCheckUtils]: 109: Hoare triple {70900#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {70900#false} is VALID [2022-04-15 15:13:33,030 INFO L290 TraceCheckUtils]: 108: Hoare triple {70900#false} assume !(#t~post8 < 100);havoc #t~post8; {70900#false} is VALID [2022-04-15 15:13:33,030 INFO L290 TraceCheckUtils]: 107: Hoare triple {70900#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {70900#false} is VALID [2022-04-15 15:13:33,030 INFO L290 TraceCheckUtils]: 106: Hoare triple {71283#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {70900#false} is VALID [2022-04-15 15:13:33,031 INFO L290 TraceCheckUtils]: 105: Hoare triple {71287#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {71283#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:13:33,031 INFO L290 TraceCheckUtils]: 104: Hoare triple {71287#(< ~counter~0 100)} assume !!(0 != ~r~0); {71287#(< ~counter~0 100)} is VALID [2022-04-15 15:13:33,032 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {70899#true} {71287#(< ~counter~0 100)} #94#return; {71287#(< ~counter~0 100)} is VALID [2022-04-15 15:13:33,032 INFO L290 TraceCheckUtils]: 102: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,032 INFO L290 TraceCheckUtils]: 101: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,032 INFO L290 TraceCheckUtils]: 100: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,032 INFO L272 TraceCheckUtils]: 99: Hoare triple {71287#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,032 INFO L290 TraceCheckUtils]: 98: Hoare triple {71287#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {71287#(< ~counter~0 100)} is VALID [2022-04-15 15:13:33,034 INFO L290 TraceCheckUtils]: 97: Hoare triple {71312#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {71287#(< ~counter~0 100)} is VALID [2022-04-15 15:13:33,034 INFO L290 TraceCheckUtils]: 96: Hoare triple {71312#(< ~counter~0 99)} assume !(~r~0 < 0); {71312#(< ~counter~0 99)} is VALID [2022-04-15 15:13:33,034 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {70899#true} {71312#(< ~counter~0 99)} #98#return; {71312#(< ~counter~0 99)} is VALID [2022-04-15 15:13:33,034 INFO L290 TraceCheckUtils]: 94: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,035 INFO L290 TraceCheckUtils]: 93: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,035 INFO L290 TraceCheckUtils]: 92: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,035 INFO L272 TraceCheckUtils]: 91: Hoare triple {71312#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,035 INFO L290 TraceCheckUtils]: 90: Hoare triple {71312#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {71312#(< ~counter~0 99)} is VALID [2022-04-15 15:13:33,036 INFO L290 TraceCheckUtils]: 89: Hoare triple {71337#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {71312#(< ~counter~0 99)} is VALID [2022-04-15 15:13:33,036 INFO L290 TraceCheckUtils]: 88: Hoare triple {71337#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {71337#(< ~counter~0 98)} is VALID [2022-04-15 15:13:33,037 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {70899#true} {71337#(< ~counter~0 98)} #98#return; {71337#(< ~counter~0 98)} is VALID [2022-04-15 15:13:33,037 INFO L290 TraceCheckUtils]: 86: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,037 INFO L290 TraceCheckUtils]: 85: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,037 INFO L290 TraceCheckUtils]: 84: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,037 INFO L272 TraceCheckUtils]: 83: Hoare triple {71337#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,037 INFO L290 TraceCheckUtils]: 82: Hoare triple {71337#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {71337#(< ~counter~0 98)} is VALID [2022-04-15 15:13:33,038 INFO L290 TraceCheckUtils]: 81: Hoare triple {71362#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {71337#(< ~counter~0 98)} is VALID [2022-04-15 15:13:33,038 INFO L290 TraceCheckUtils]: 80: Hoare triple {71362#(< ~counter~0 97)} assume !(~r~0 > 0); {71362#(< ~counter~0 97)} is VALID [2022-04-15 15:13:33,039 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {70899#true} {71362#(< ~counter~0 97)} #96#return; {71362#(< ~counter~0 97)} is VALID [2022-04-15 15:13:33,039 INFO L290 TraceCheckUtils]: 78: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,040 INFO L290 TraceCheckUtils]: 77: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,040 INFO L290 TraceCheckUtils]: 76: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,040 INFO L272 TraceCheckUtils]: 75: Hoare triple {71362#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,040 INFO L290 TraceCheckUtils]: 74: Hoare triple {71362#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {71362#(< ~counter~0 97)} is VALID [2022-04-15 15:13:33,041 INFO L290 TraceCheckUtils]: 73: Hoare triple {71387#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {71362#(< ~counter~0 97)} is VALID [2022-04-15 15:13:33,041 INFO L290 TraceCheckUtils]: 72: Hoare triple {71387#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {71387#(< ~counter~0 96)} is VALID [2022-04-15 15:13:33,042 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {70899#true} {71387#(< ~counter~0 96)} #96#return; {71387#(< ~counter~0 96)} is VALID [2022-04-15 15:13:33,042 INFO L290 TraceCheckUtils]: 70: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,042 INFO L290 TraceCheckUtils]: 69: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,042 INFO L290 TraceCheckUtils]: 68: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,043 INFO L272 TraceCheckUtils]: 67: Hoare triple {71387#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,043 INFO L290 TraceCheckUtils]: 66: Hoare triple {71387#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {71387#(< ~counter~0 96)} is VALID [2022-04-15 15:13:33,044 INFO L290 TraceCheckUtils]: 65: Hoare triple {71412#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {71387#(< ~counter~0 96)} is VALID [2022-04-15 15:13:33,044 INFO L290 TraceCheckUtils]: 64: Hoare triple {71412#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {71412#(< ~counter~0 95)} is VALID [2022-04-15 15:13:33,045 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {70899#true} {71412#(< ~counter~0 95)} #96#return; {71412#(< ~counter~0 95)} is VALID [2022-04-15 15:13:33,045 INFO L290 TraceCheckUtils]: 62: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,045 INFO L290 TraceCheckUtils]: 61: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,045 INFO L290 TraceCheckUtils]: 60: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,045 INFO L272 TraceCheckUtils]: 59: Hoare triple {71412#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,046 INFO L290 TraceCheckUtils]: 58: Hoare triple {71412#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {71412#(< ~counter~0 95)} is VALID [2022-04-15 15:13:33,046 INFO L290 TraceCheckUtils]: 57: Hoare triple {71437#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {71412#(< ~counter~0 95)} is VALID [2022-04-15 15:13:33,047 INFO L290 TraceCheckUtils]: 56: Hoare triple {71437#(< ~counter~0 94)} assume !!(0 != ~r~0); {71437#(< ~counter~0 94)} is VALID [2022-04-15 15:13:33,047 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {70899#true} {71437#(< ~counter~0 94)} #94#return; {71437#(< ~counter~0 94)} is VALID [2022-04-15 15:13:33,048 INFO L290 TraceCheckUtils]: 54: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,048 INFO L290 TraceCheckUtils]: 53: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,048 INFO L290 TraceCheckUtils]: 52: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,048 INFO L272 TraceCheckUtils]: 51: Hoare triple {71437#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,048 INFO L290 TraceCheckUtils]: 50: Hoare triple {71437#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {71437#(< ~counter~0 94)} is VALID [2022-04-15 15:13:33,049 INFO L290 TraceCheckUtils]: 49: Hoare triple {71462#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {71437#(< ~counter~0 94)} is VALID [2022-04-15 15:13:33,049 INFO L290 TraceCheckUtils]: 48: Hoare triple {71462#(< ~counter~0 93)} assume !(~r~0 < 0); {71462#(< ~counter~0 93)} is VALID [2022-04-15 15:13:33,050 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {70899#true} {71462#(< ~counter~0 93)} #98#return; {71462#(< ~counter~0 93)} is VALID [2022-04-15 15:13:33,050 INFO L290 TraceCheckUtils]: 46: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,050 INFO L290 TraceCheckUtils]: 45: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,050 INFO L290 TraceCheckUtils]: 44: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,050 INFO L272 TraceCheckUtils]: 43: Hoare triple {71462#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,050 INFO L290 TraceCheckUtils]: 42: Hoare triple {71462#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {71462#(< ~counter~0 93)} is VALID [2022-04-15 15:13:33,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {71487#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {71462#(< ~counter~0 93)} is VALID [2022-04-15 15:13:33,051 INFO L290 TraceCheckUtils]: 40: Hoare triple {71487#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {71487#(< ~counter~0 92)} is VALID [2022-04-15 15:13:33,052 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {70899#true} {71487#(< ~counter~0 92)} #98#return; {71487#(< ~counter~0 92)} is VALID [2022-04-15 15:13:33,052 INFO L290 TraceCheckUtils]: 38: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,052 INFO L290 TraceCheckUtils]: 37: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,052 INFO L290 TraceCheckUtils]: 36: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,052 INFO L272 TraceCheckUtils]: 35: Hoare triple {71487#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,053 INFO L290 TraceCheckUtils]: 34: Hoare triple {71487#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {71487#(< ~counter~0 92)} is VALID [2022-04-15 15:13:33,053 INFO L290 TraceCheckUtils]: 33: Hoare triple {71512#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {71487#(< ~counter~0 92)} is VALID [2022-04-15 15:13:33,054 INFO L290 TraceCheckUtils]: 32: Hoare triple {71512#(< ~counter~0 91)} assume !(~r~0 > 0); {71512#(< ~counter~0 91)} is VALID [2022-04-15 15:13:33,054 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {70899#true} {71512#(< ~counter~0 91)} #96#return; {71512#(< ~counter~0 91)} is VALID [2022-04-15 15:13:33,054 INFO L290 TraceCheckUtils]: 30: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,054 INFO L290 TraceCheckUtils]: 29: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,054 INFO L290 TraceCheckUtils]: 28: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,054 INFO L272 TraceCheckUtils]: 27: Hoare triple {71512#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,055 INFO L290 TraceCheckUtils]: 26: Hoare triple {71512#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {71512#(< ~counter~0 91)} is VALID [2022-04-15 15:13:33,055 INFO L290 TraceCheckUtils]: 25: Hoare triple {71537#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {71512#(< ~counter~0 91)} is VALID [2022-04-15 15:13:33,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {71537#(< ~counter~0 90)} assume !!(0 != ~r~0); {71537#(< ~counter~0 90)} is VALID [2022-04-15 15:13:33,056 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {70899#true} {71537#(< ~counter~0 90)} #94#return; {71537#(< ~counter~0 90)} is VALID [2022-04-15 15:13:33,056 INFO L290 TraceCheckUtils]: 22: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,056 INFO L290 TraceCheckUtils]: 21: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,056 INFO L290 TraceCheckUtils]: 20: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,057 INFO L272 TraceCheckUtils]: 19: Hoare triple {71537#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {71537#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {71537#(< ~counter~0 90)} is VALID [2022-04-15 15:13:33,057 INFO L290 TraceCheckUtils]: 17: Hoare triple {71562#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {71537#(< ~counter~0 90)} is VALID [2022-04-15 15:13:33,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {71562#(< ~counter~0 89)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {71562#(< ~counter~0 89)} is VALID [2022-04-15 15:13:33,058 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {70899#true} {71562#(< ~counter~0 89)} #92#return; {71562#(< ~counter~0 89)} is VALID [2022-04-15 15:13:33,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,058 INFO L272 TraceCheckUtils]: 11: Hoare triple {71562#(< ~counter~0 89)} 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)); {70899#true} is VALID [2022-04-15 15:13:33,059 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {70899#true} {71562#(< ~counter~0 89)} #90#return; {71562#(< ~counter~0 89)} is VALID [2022-04-15 15:13:33,059 INFO L290 TraceCheckUtils]: 9: Hoare triple {70899#true} assume true; {70899#true} is VALID [2022-04-15 15:13:33,059 INFO L290 TraceCheckUtils]: 8: Hoare triple {70899#true} assume !(0 == ~cond); {70899#true} is VALID [2022-04-15 15:13:33,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {70899#true} ~cond := #in~cond; {70899#true} is VALID [2022-04-15 15:13:33,059 INFO L272 TraceCheckUtils]: 6: Hoare triple {71562#(< ~counter~0 89)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {70899#true} is VALID [2022-04-15 15:13:33,063 INFO L290 TraceCheckUtils]: 5: Hoare triple {71562#(< ~counter~0 89)} 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; {71562#(< ~counter~0 89)} is VALID [2022-04-15 15:13:33,064 INFO L272 TraceCheckUtils]: 4: Hoare triple {71562#(< ~counter~0 89)} call #t~ret9 := main(); {71562#(< ~counter~0 89)} is VALID [2022-04-15 15:13:33,064 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71562#(< ~counter~0 89)} {70899#true} #102#return; {71562#(< ~counter~0 89)} is VALID [2022-04-15 15:13:33,064 INFO L290 TraceCheckUtils]: 2: Hoare triple {71562#(< ~counter~0 89)} assume true; {71562#(< ~counter~0 89)} is VALID [2022-04-15 15:13:33,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {70899#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; {71562#(< ~counter~0 89)} is VALID [2022-04-15 15:13:33,065 INFO L272 TraceCheckUtils]: 0: Hoare triple {70899#true} call ULTIMATE.init(); {70899#true} is VALID [2022-04-15 15:13:33,066 INFO L134 CoverageAnalysis]: Checked inductivity of 328 backedges. 36 proven. 68 refuted. 0 times theorem prover too weak. 224 trivial. 0 not checked. [2022-04-15 15:13:33,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:33,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443422210] [2022-04-15 15:13:33,066 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:33,066 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1516345056] [2022-04-15 15:13:33,066 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1516345056] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:33,066 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:33,066 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 28 [2022-04-15 15:13:33,067 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:33,067 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1927019968] [2022-04-15 15:13:33,067 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1927019968] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:33,067 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:33,067 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2022-04-15 15:13:33,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743081309] [2022-04-15 15:13:33,067 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:33,067 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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 115 [2022-04-15 15:13:33,067 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:33,068 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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-15 15:13:33,155 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:33,155 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-04-15 15:13:33,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:33,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-04-15 15:13:33,156 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=426, Unknown=0, NotChecked=0, Total=756 [2022-04-15 15:13:33,156 INFO L87 Difference]: Start difference. First operand 582 states and 793 transitions. Second operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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-15 15:13:35,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:35,797 INFO L93 Difference]: Finished difference Result 795 states and 1117 transitions. [2022-04-15 15:13:35,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 15:13:35,797 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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 115 [2022-04-15 15:13:35,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:35,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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-15 15:13:35,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-15 15:13:35,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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-15 15:13:35,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 256 transitions. [2022-04-15 15:13:35,801 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 256 transitions. [2022-04-15 15:13:36,019 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 256 edges. 256 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:36,037 INFO L225 Difference]: With dead ends: 795 [2022-04-15 15:13:36,038 INFO L226 Difference]: Without dead ends: 598 [2022-04-15 15:13:36,038 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 239 GetRequests, 203 SyntacticMatches, 0 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=590, Invalid=816, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 15:13:36,039 INFO L913 BasicCegarLoop]: 63 mSDtfsCounter, 133 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 126 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 286 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 126 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:36,039 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 286 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [126 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:13:36,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 598 states. [2022-04-15 15:13:37,788 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 598 to 598. [2022-04-15 15:13:37,788 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:37,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 598 states. Second operand has 598 states, 455 states have (on average 1.2241758241758243) internal successors, (557), 455 states have internal predecessors, (557), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:37,789 INFO L74 IsIncluded]: Start isIncluded. First operand 598 states. Second operand has 598 states, 455 states have (on average 1.2241758241758243) internal successors, (557), 455 states have internal predecessors, (557), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:37,789 INFO L87 Difference]: Start difference. First operand 598 states. Second operand has 598 states, 455 states have (on average 1.2241758241758243) internal successors, (557), 455 states have internal predecessors, (557), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:37,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:37,802 INFO L93 Difference]: Finished difference Result 598 states and 809 transitions. [2022-04-15 15:13:37,802 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 809 transitions. [2022-04-15 15:13:37,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:37,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:37,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 598 states, 455 states have (on average 1.2241758241758243) internal successors, (557), 455 states have internal predecessors, (557), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 598 states. [2022-04-15 15:13:37,804 INFO L87 Difference]: Start difference. First operand has 598 states, 455 states have (on average 1.2241758241758243) internal successors, (557), 455 states have internal predecessors, (557), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) Second operand 598 states. [2022-04-15 15:13:37,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:37,818 INFO L93 Difference]: Finished difference Result 598 states and 809 transitions. [2022-04-15 15:13:37,818 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 809 transitions. [2022-04-15 15:13:37,819 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:37,819 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:37,819 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:37,819 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 598 states, 455 states have (on average 1.2241758241758243) internal successors, (557), 455 states have internal predecessors, (557), 127 states have call successors, (127), 17 states have call predecessors, (127), 15 states have return successors, (125), 125 states have call predecessors, (125), 125 states have call successors, (125) [2022-04-15 15:13:37,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 598 states to 598 states and 809 transitions. [2022-04-15 15:13:37,840 INFO L78 Accepts]: Start accepts. Automaton has 598 states and 809 transitions. Word has length 115 [2022-04-15 15:13:37,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:37,840 INFO L478 AbstractCegarLoop]: Abstraction has 598 states and 809 transitions. [2022-04-15 15:13:37,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 5.466666666666667) internal successors, (82), 14 states have internal predecessors, (82), 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-15 15:13:37,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 598 states and 809 transitions. [2022-04-15 15:13:41,093 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 809 edges. 809 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:41,093 INFO L276 IsEmpty]: Start isEmpty. Operand 598 states and 809 transitions. [2022-04-15 15:13:41,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 120 [2022-04-15 15:13:41,094 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:41,094 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 6, 6, 6, 4, 4, 4, 4, 4, 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-15 15:13:41,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (39)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:41,294 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 39 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2022-04-15 15:13:41,295 INFO L403 AbstractCegarLoop]: === Iteration 39 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:41,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:41,295 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 7 times [2022-04-15 15:13:41,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:41,295 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1044538621] [2022-04-15 15:13:41,296 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:41,296 INFO L85 PathProgramCache]: Analyzing trace with hash 650985841, now seen corresponding path program 8 times [2022-04-15 15:13:41,296 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:41,296 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2089646643] [2022-04-15 15:13:41,296 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:41,296 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:41,307 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:41,307 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [322096498] [2022-04-15 15:13:41,307 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:13:41,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:41,307 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:41,308 INFO L229 MonitoredProcess]: Starting monitored process 40 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:41,309 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Waiting until timeout for monitored process [2022-04-15 15:13:41,369 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:13:41,370 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:41,371 INFO L263 TraceCheckSpWp]: Trace formula consists of 297 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 15:13:41,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:41,394 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:42,022 INFO L272 TraceCheckUtils]: 0: Hoare triple {75618#true} call ULTIMATE.init(); {75618#true} is VALID [2022-04-15 15:13:42,022 INFO L290 TraceCheckUtils]: 1: Hoare triple {75618#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; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,022 INFO L290 TraceCheckUtils]: 2: Hoare triple {75626#(<= ~counter~0 0)} assume true; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,023 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {75626#(<= ~counter~0 0)} {75618#true} #102#return; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,023 INFO L272 TraceCheckUtils]: 4: Hoare triple {75626#(<= ~counter~0 0)} call #t~ret9 := main(); {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,023 INFO L290 TraceCheckUtils]: 5: Hoare triple {75626#(<= ~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; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,024 INFO L272 TraceCheckUtils]: 6: Hoare triple {75626#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,024 INFO L290 TraceCheckUtils]: 7: Hoare triple {75626#(<= ~counter~0 0)} ~cond := #in~cond; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,024 INFO L290 TraceCheckUtils]: 8: Hoare triple {75626#(<= ~counter~0 0)} assume !(0 == ~cond); {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,025 INFO L290 TraceCheckUtils]: 9: Hoare triple {75626#(<= ~counter~0 0)} assume true; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,025 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75626#(<= ~counter~0 0)} {75626#(<= ~counter~0 0)} #90#return; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,025 INFO L272 TraceCheckUtils]: 11: Hoare triple {75626#(<= ~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)); {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,026 INFO L290 TraceCheckUtils]: 12: Hoare triple {75626#(<= ~counter~0 0)} ~cond := #in~cond; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,026 INFO L290 TraceCheckUtils]: 13: Hoare triple {75626#(<= ~counter~0 0)} assume !(0 == ~cond); {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,026 INFO L290 TraceCheckUtils]: 14: Hoare triple {75626#(<= ~counter~0 0)} assume true; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,027 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75626#(<= ~counter~0 0)} {75626#(<= ~counter~0 0)} #92#return; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,027 INFO L290 TraceCheckUtils]: 16: Hoare triple {75626#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {75626#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:42,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {75626#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75675#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:42,029 INFO L290 TraceCheckUtils]: 18: Hoare triple {75675#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {75675#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:42,029 INFO L272 TraceCheckUtils]: 19: Hoare triple {75675#(<= ~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)); {75675#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:42,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {75675#(<= ~counter~0 1)} ~cond := #in~cond; {75675#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:42,030 INFO L290 TraceCheckUtils]: 21: Hoare triple {75675#(<= ~counter~0 1)} assume !(0 == ~cond); {75675#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:42,039 INFO L290 TraceCheckUtils]: 22: Hoare triple {75675#(<= ~counter~0 1)} assume true; {75675#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:42,040 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {75675#(<= ~counter~0 1)} {75675#(<= ~counter~0 1)} #94#return; {75675#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:42,041 INFO L290 TraceCheckUtils]: 24: Hoare triple {75675#(<= ~counter~0 1)} assume !!(0 != ~r~0); {75675#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:42,042 INFO L290 TraceCheckUtils]: 25: Hoare triple {75675#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75700#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:42,043 INFO L290 TraceCheckUtils]: 26: Hoare triple {75700#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {75700#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:42,044 INFO L272 TraceCheckUtils]: 27: Hoare triple {75700#(<= ~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)); {75700#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:42,044 INFO L290 TraceCheckUtils]: 28: Hoare triple {75700#(<= ~counter~0 2)} ~cond := #in~cond; {75700#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:42,045 INFO L290 TraceCheckUtils]: 29: Hoare triple {75700#(<= ~counter~0 2)} assume !(0 == ~cond); {75700#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:42,045 INFO L290 TraceCheckUtils]: 30: Hoare triple {75700#(<= ~counter~0 2)} assume true; {75700#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:42,046 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {75700#(<= ~counter~0 2)} {75700#(<= ~counter~0 2)} #96#return; {75700#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:42,046 INFO L290 TraceCheckUtils]: 32: Hoare triple {75700#(<= ~counter~0 2)} assume !(~r~0 > 0); {75700#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:42,047 INFO L290 TraceCheckUtils]: 33: Hoare triple {75700#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75725#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:42,047 INFO L290 TraceCheckUtils]: 34: Hoare triple {75725#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {75725#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:42,048 INFO L272 TraceCheckUtils]: 35: Hoare triple {75725#(<= ~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)); {75725#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:42,048 INFO L290 TraceCheckUtils]: 36: Hoare triple {75725#(<= ~counter~0 3)} ~cond := #in~cond; {75725#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:42,049 INFO L290 TraceCheckUtils]: 37: Hoare triple {75725#(<= ~counter~0 3)} assume !(0 == ~cond); {75725#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:42,049 INFO L290 TraceCheckUtils]: 38: Hoare triple {75725#(<= ~counter~0 3)} assume true; {75725#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:42,050 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {75725#(<= ~counter~0 3)} {75725#(<= ~counter~0 3)} #98#return; {75725#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:42,050 INFO L290 TraceCheckUtils]: 40: Hoare triple {75725#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75725#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:42,051 INFO L290 TraceCheckUtils]: 41: Hoare triple {75725#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75750#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:42,051 INFO L290 TraceCheckUtils]: 42: Hoare triple {75750#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {75750#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:42,052 INFO L272 TraceCheckUtils]: 43: Hoare triple {75750#(<= ~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)); {75750#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:42,052 INFO L290 TraceCheckUtils]: 44: Hoare triple {75750#(<= ~counter~0 4)} ~cond := #in~cond; {75750#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:42,053 INFO L290 TraceCheckUtils]: 45: Hoare triple {75750#(<= ~counter~0 4)} assume !(0 == ~cond); {75750#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:42,053 INFO L290 TraceCheckUtils]: 46: Hoare triple {75750#(<= ~counter~0 4)} assume true; {75750#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:42,054 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {75750#(<= ~counter~0 4)} {75750#(<= ~counter~0 4)} #98#return; {75750#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:42,054 INFO L290 TraceCheckUtils]: 48: Hoare triple {75750#(<= ~counter~0 4)} assume !(~r~0 < 0); {75750#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:42,055 INFO L290 TraceCheckUtils]: 49: Hoare triple {75750#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75775#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:42,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {75775#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {75775#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:42,056 INFO L272 TraceCheckUtils]: 51: Hoare triple {75775#(<= ~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)); {75775#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:42,056 INFO L290 TraceCheckUtils]: 52: Hoare triple {75775#(<= ~counter~0 5)} ~cond := #in~cond; {75775#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:42,057 INFO L290 TraceCheckUtils]: 53: Hoare triple {75775#(<= ~counter~0 5)} assume !(0 == ~cond); {75775#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:42,057 INFO L290 TraceCheckUtils]: 54: Hoare triple {75775#(<= ~counter~0 5)} assume true; {75775#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:42,058 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {75775#(<= ~counter~0 5)} {75775#(<= ~counter~0 5)} #94#return; {75775#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:42,058 INFO L290 TraceCheckUtils]: 56: Hoare triple {75775#(<= ~counter~0 5)} assume !!(0 != ~r~0); {75775#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:42,059 INFO L290 TraceCheckUtils]: 57: Hoare triple {75775#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75800#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:42,059 INFO L290 TraceCheckUtils]: 58: Hoare triple {75800#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {75800#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:42,060 INFO L272 TraceCheckUtils]: 59: Hoare triple {75800#(<= ~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)); {75800#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:42,060 INFO L290 TraceCheckUtils]: 60: Hoare triple {75800#(<= ~counter~0 6)} ~cond := #in~cond; {75800#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:42,061 INFO L290 TraceCheckUtils]: 61: Hoare triple {75800#(<= ~counter~0 6)} assume !(0 == ~cond); {75800#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:42,061 INFO L290 TraceCheckUtils]: 62: Hoare triple {75800#(<= ~counter~0 6)} assume true; {75800#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:42,061 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {75800#(<= ~counter~0 6)} {75800#(<= ~counter~0 6)} #96#return; {75800#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:42,062 INFO L290 TraceCheckUtils]: 64: Hoare triple {75800#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75800#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:42,063 INFO L290 TraceCheckUtils]: 65: Hoare triple {75800#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75825#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:42,063 INFO L290 TraceCheckUtils]: 66: Hoare triple {75825#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {75825#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:42,064 INFO L272 TraceCheckUtils]: 67: Hoare triple {75825#(<= ~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)); {75825#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:42,064 INFO L290 TraceCheckUtils]: 68: Hoare triple {75825#(<= ~counter~0 7)} ~cond := #in~cond; {75825#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:42,064 INFO L290 TraceCheckUtils]: 69: Hoare triple {75825#(<= ~counter~0 7)} assume !(0 == ~cond); {75825#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:42,065 INFO L290 TraceCheckUtils]: 70: Hoare triple {75825#(<= ~counter~0 7)} assume true; {75825#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:42,065 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {75825#(<= ~counter~0 7)} {75825#(<= ~counter~0 7)} #96#return; {75825#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:42,066 INFO L290 TraceCheckUtils]: 72: Hoare triple {75825#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75825#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:42,067 INFO L290 TraceCheckUtils]: 73: Hoare triple {75825#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75850#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:42,068 INFO L290 TraceCheckUtils]: 74: Hoare triple {75850#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {75850#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:42,068 INFO L272 TraceCheckUtils]: 75: Hoare triple {75850#(<= ~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)); {75850#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:42,069 INFO L290 TraceCheckUtils]: 76: Hoare triple {75850#(<= ~counter~0 8)} ~cond := #in~cond; {75850#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:42,069 INFO L290 TraceCheckUtils]: 77: Hoare triple {75850#(<= ~counter~0 8)} assume !(0 == ~cond); {75850#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:42,069 INFO L290 TraceCheckUtils]: 78: Hoare triple {75850#(<= ~counter~0 8)} assume true; {75850#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:42,070 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {75850#(<= ~counter~0 8)} {75850#(<= ~counter~0 8)} #96#return; {75850#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:42,070 INFO L290 TraceCheckUtils]: 80: Hoare triple {75850#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75850#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:42,071 INFO L290 TraceCheckUtils]: 81: Hoare triple {75850#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75875#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:42,072 INFO L290 TraceCheckUtils]: 82: Hoare triple {75875#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {75875#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:42,072 INFO L272 TraceCheckUtils]: 83: Hoare triple {75875#(<= ~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)); {75875#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:42,073 INFO L290 TraceCheckUtils]: 84: Hoare triple {75875#(<= ~counter~0 9)} ~cond := #in~cond; {75875#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:42,073 INFO L290 TraceCheckUtils]: 85: Hoare triple {75875#(<= ~counter~0 9)} assume !(0 == ~cond); {75875#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:42,073 INFO L290 TraceCheckUtils]: 86: Hoare triple {75875#(<= ~counter~0 9)} assume true; {75875#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:42,074 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {75875#(<= ~counter~0 9)} {75875#(<= ~counter~0 9)} #96#return; {75875#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:42,074 INFO L290 TraceCheckUtils]: 88: Hoare triple {75875#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {75875#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:42,075 INFO L290 TraceCheckUtils]: 89: Hoare triple {75875#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {75900#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:42,075 INFO L290 TraceCheckUtils]: 90: Hoare triple {75900#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {75900#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:42,076 INFO L272 TraceCheckUtils]: 91: Hoare triple {75900#(<= ~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)); {75900#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:42,076 INFO L290 TraceCheckUtils]: 92: Hoare triple {75900#(<= ~counter~0 10)} ~cond := #in~cond; {75900#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:42,077 INFO L290 TraceCheckUtils]: 93: Hoare triple {75900#(<= ~counter~0 10)} assume !(0 == ~cond); {75900#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:42,077 INFO L290 TraceCheckUtils]: 94: Hoare triple {75900#(<= ~counter~0 10)} assume true; {75900#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:42,078 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {75900#(<= ~counter~0 10)} {75900#(<= ~counter~0 10)} #96#return; {75900#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:42,078 INFO L290 TraceCheckUtils]: 96: Hoare triple {75900#(<= ~counter~0 10)} assume !(~r~0 > 0); {75900#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:42,079 INFO L290 TraceCheckUtils]: 97: Hoare triple {75900#(<= ~counter~0 10)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75925#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:42,079 INFO L290 TraceCheckUtils]: 98: Hoare triple {75925#(<= ~counter~0 11)} assume !!(#t~post8 < 100);havoc #t~post8; {75925#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:42,080 INFO L272 TraceCheckUtils]: 99: Hoare triple {75925#(<= ~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)); {75925#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:42,080 INFO L290 TraceCheckUtils]: 100: Hoare triple {75925#(<= ~counter~0 11)} ~cond := #in~cond; {75925#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:42,080 INFO L290 TraceCheckUtils]: 101: Hoare triple {75925#(<= ~counter~0 11)} assume !(0 == ~cond); {75925#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:42,081 INFO L290 TraceCheckUtils]: 102: Hoare triple {75925#(<= ~counter~0 11)} assume true; {75925#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:42,081 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {75925#(<= ~counter~0 11)} {75925#(<= ~counter~0 11)} #98#return; {75925#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:42,082 INFO L290 TraceCheckUtils]: 104: Hoare triple {75925#(<= ~counter~0 11)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {75925#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:42,083 INFO L290 TraceCheckUtils]: 105: Hoare triple {75925#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {75950#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:42,083 INFO L290 TraceCheckUtils]: 106: Hoare triple {75950#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {75950#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:42,084 INFO L272 TraceCheckUtils]: 107: Hoare triple {75950#(<= ~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)); {75950#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:42,084 INFO L290 TraceCheckUtils]: 108: Hoare triple {75950#(<= ~counter~0 12)} ~cond := #in~cond; {75950#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:42,084 INFO L290 TraceCheckUtils]: 109: Hoare triple {75950#(<= ~counter~0 12)} assume !(0 == ~cond); {75950#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:42,085 INFO L290 TraceCheckUtils]: 110: Hoare triple {75950#(<= ~counter~0 12)} assume true; {75950#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:42,085 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {75950#(<= ~counter~0 12)} {75950#(<= ~counter~0 12)} #98#return; {75950#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:42,085 INFO L290 TraceCheckUtils]: 112: Hoare triple {75950#(<= ~counter~0 12)} assume !(~r~0 < 0); {75950#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:42,086 INFO L290 TraceCheckUtils]: 113: Hoare triple {75950#(<= ~counter~0 12)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {75975#(<= |main_#t~post6| 12)} is VALID [2022-04-15 15:13:42,086 INFO L290 TraceCheckUtils]: 114: Hoare triple {75975#(<= |main_#t~post6| 12)} assume !(#t~post6 < 100);havoc #t~post6; {75619#false} is VALID [2022-04-15 15:13:42,086 INFO L272 TraceCheckUtils]: 115: Hoare triple {75619#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)); {75619#false} is VALID [2022-04-15 15:13:42,087 INFO L290 TraceCheckUtils]: 116: Hoare triple {75619#false} ~cond := #in~cond; {75619#false} is VALID [2022-04-15 15:13:42,087 INFO L290 TraceCheckUtils]: 117: Hoare triple {75619#false} assume 0 == ~cond; {75619#false} is VALID [2022-04-15 15:13:42,087 INFO L290 TraceCheckUtils]: 118: Hoare triple {75619#false} assume !false; {75619#false} is VALID [2022-04-15 15:13:42,087 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 356 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:13:42,087 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:42,859 INFO L290 TraceCheckUtils]: 118: Hoare triple {75619#false} assume !false; {75619#false} is VALID [2022-04-15 15:13:42,859 INFO L290 TraceCheckUtils]: 117: Hoare triple {75619#false} assume 0 == ~cond; {75619#false} is VALID [2022-04-15 15:13:42,859 INFO L290 TraceCheckUtils]: 116: Hoare triple {75619#false} ~cond := #in~cond; {75619#false} is VALID [2022-04-15 15:13:42,859 INFO L272 TraceCheckUtils]: 115: Hoare triple {75619#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)); {75619#false} is VALID [2022-04-15 15:13:42,863 INFO L290 TraceCheckUtils]: 114: Hoare triple {76003#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {75619#false} is VALID [2022-04-15 15:13:42,864 INFO L290 TraceCheckUtils]: 113: Hoare triple {76007#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {76003#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:13:42,864 INFO L290 TraceCheckUtils]: 112: Hoare triple {76007#(< ~counter~0 100)} assume !(~r~0 < 0); {76007#(< ~counter~0 100)} is VALID [2022-04-15 15:13:42,865 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {75618#true} {76007#(< ~counter~0 100)} #98#return; {76007#(< ~counter~0 100)} is VALID [2022-04-15 15:13:42,865 INFO L290 TraceCheckUtils]: 110: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,865 INFO L290 TraceCheckUtils]: 109: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,865 INFO L290 TraceCheckUtils]: 108: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,865 INFO L272 TraceCheckUtils]: 107: Hoare triple {76007#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,865 INFO L290 TraceCheckUtils]: 106: Hoare triple {76007#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {76007#(< ~counter~0 100)} is VALID [2022-04-15 15:13:42,867 INFO L290 TraceCheckUtils]: 105: Hoare triple {76032#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {76007#(< ~counter~0 100)} is VALID [2022-04-15 15:13:42,867 INFO L290 TraceCheckUtils]: 104: Hoare triple {76032#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {76032#(< ~counter~0 99)} is VALID [2022-04-15 15:13:42,868 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {75618#true} {76032#(< ~counter~0 99)} #98#return; {76032#(< ~counter~0 99)} is VALID [2022-04-15 15:13:42,868 INFO L290 TraceCheckUtils]: 102: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,868 INFO L290 TraceCheckUtils]: 101: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,869 INFO L290 TraceCheckUtils]: 100: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,869 INFO L272 TraceCheckUtils]: 99: Hoare triple {76032#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,869 INFO L290 TraceCheckUtils]: 98: Hoare triple {76032#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {76032#(< ~counter~0 99)} is VALID [2022-04-15 15:13:42,870 INFO L290 TraceCheckUtils]: 97: Hoare triple {76057#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {76032#(< ~counter~0 99)} is VALID [2022-04-15 15:13:42,870 INFO L290 TraceCheckUtils]: 96: Hoare triple {76057#(< ~counter~0 98)} assume !(~r~0 > 0); {76057#(< ~counter~0 98)} is VALID [2022-04-15 15:13:42,871 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {75618#true} {76057#(< ~counter~0 98)} #96#return; {76057#(< ~counter~0 98)} is VALID [2022-04-15 15:13:42,871 INFO L290 TraceCheckUtils]: 94: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,871 INFO L290 TraceCheckUtils]: 93: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,871 INFO L290 TraceCheckUtils]: 92: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,872 INFO L272 TraceCheckUtils]: 91: Hoare triple {76057#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,872 INFO L290 TraceCheckUtils]: 90: Hoare triple {76057#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {76057#(< ~counter~0 98)} is VALID [2022-04-15 15:13:42,873 INFO L290 TraceCheckUtils]: 89: Hoare triple {76082#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {76057#(< ~counter~0 98)} is VALID [2022-04-15 15:13:42,873 INFO L290 TraceCheckUtils]: 88: Hoare triple {76082#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {76082#(< ~counter~0 97)} is VALID [2022-04-15 15:13:42,874 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {75618#true} {76082#(< ~counter~0 97)} #96#return; {76082#(< ~counter~0 97)} is VALID [2022-04-15 15:13:42,874 INFO L290 TraceCheckUtils]: 86: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,874 INFO L290 TraceCheckUtils]: 85: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,874 INFO L290 TraceCheckUtils]: 84: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,874 INFO L272 TraceCheckUtils]: 83: Hoare triple {76082#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,875 INFO L290 TraceCheckUtils]: 82: Hoare triple {76082#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {76082#(< ~counter~0 97)} is VALID [2022-04-15 15:13:42,876 INFO L290 TraceCheckUtils]: 81: Hoare triple {76107#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {76082#(< ~counter~0 97)} is VALID [2022-04-15 15:13:42,876 INFO L290 TraceCheckUtils]: 80: Hoare triple {76107#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {76107#(< ~counter~0 96)} is VALID [2022-04-15 15:13:42,877 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {75618#true} {76107#(< ~counter~0 96)} #96#return; {76107#(< ~counter~0 96)} is VALID [2022-04-15 15:13:42,877 INFO L290 TraceCheckUtils]: 78: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,877 INFO L290 TraceCheckUtils]: 77: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,877 INFO L290 TraceCheckUtils]: 76: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,877 INFO L272 TraceCheckUtils]: 75: Hoare triple {76107#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,878 INFO L290 TraceCheckUtils]: 74: Hoare triple {76107#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {76107#(< ~counter~0 96)} is VALID [2022-04-15 15:13:42,878 INFO L290 TraceCheckUtils]: 73: Hoare triple {76132#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {76107#(< ~counter~0 96)} is VALID [2022-04-15 15:13:42,879 INFO L290 TraceCheckUtils]: 72: Hoare triple {76132#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {76132#(< ~counter~0 95)} is VALID [2022-04-15 15:13:42,880 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {75618#true} {76132#(< ~counter~0 95)} #96#return; {76132#(< ~counter~0 95)} is VALID [2022-04-15 15:13:42,880 INFO L290 TraceCheckUtils]: 70: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,880 INFO L290 TraceCheckUtils]: 69: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,880 INFO L290 TraceCheckUtils]: 68: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,880 INFO L272 TraceCheckUtils]: 67: Hoare triple {76132#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,880 INFO L290 TraceCheckUtils]: 66: Hoare triple {76132#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {76132#(< ~counter~0 95)} is VALID [2022-04-15 15:13:42,881 INFO L290 TraceCheckUtils]: 65: Hoare triple {76157#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {76132#(< ~counter~0 95)} is VALID [2022-04-15 15:13:42,882 INFO L290 TraceCheckUtils]: 64: Hoare triple {76157#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {76157#(< ~counter~0 94)} is VALID [2022-04-15 15:13:42,883 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {75618#true} {76157#(< ~counter~0 94)} #96#return; {76157#(< ~counter~0 94)} is VALID [2022-04-15 15:13:42,883 INFO L290 TraceCheckUtils]: 62: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,883 INFO L290 TraceCheckUtils]: 61: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,883 INFO L290 TraceCheckUtils]: 60: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,883 INFO L272 TraceCheckUtils]: 59: Hoare triple {76157#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,883 INFO L290 TraceCheckUtils]: 58: Hoare triple {76157#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {76157#(< ~counter~0 94)} is VALID [2022-04-15 15:13:42,884 INFO L290 TraceCheckUtils]: 57: Hoare triple {76182#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {76157#(< ~counter~0 94)} is VALID [2022-04-15 15:13:42,885 INFO L290 TraceCheckUtils]: 56: Hoare triple {76182#(< ~counter~0 93)} assume !!(0 != ~r~0); {76182#(< ~counter~0 93)} is VALID [2022-04-15 15:13:42,885 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {75618#true} {76182#(< ~counter~0 93)} #94#return; {76182#(< ~counter~0 93)} is VALID [2022-04-15 15:13:42,886 INFO L290 TraceCheckUtils]: 54: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,886 INFO L290 TraceCheckUtils]: 53: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,886 INFO L290 TraceCheckUtils]: 52: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,886 INFO L272 TraceCheckUtils]: 51: Hoare triple {76182#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,886 INFO L290 TraceCheckUtils]: 50: Hoare triple {76182#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {76182#(< ~counter~0 93)} is VALID [2022-04-15 15:13:42,887 INFO L290 TraceCheckUtils]: 49: Hoare triple {76207#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {76182#(< ~counter~0 93)} is VALID [2022-04-15 15:13:42,888 INFO L290 TraceCheckUtils]: 48: Hoare triple {76207#(< ~counter~0 92)} assume !(~r~0 < 0); {76207#(< ~counter~0 92)} is VALID [2022-04-15 15:13:42,888 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {75618#true} {76207#(< ~counter~0 92)} #98#return; {76207#(< ~counter~0 92)} is VALID [2022-04-15 15:13:42,888 INFO L290 TraceCheckUtils]: 46: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,888 INFO L290 TraceCheckUtils]: 45: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,889 INFO L290 TraceCheckUtils]: 44: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,889 INFO L272 TraceCheckUtils]: 43: Hoare triple {76207#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,889 INFO L290 TraceCheckUtils]: 42: Hoare triple {76207#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {76207#(< ~counter~0 92)} is VALID [2022-04-15 15:13:42,890 INFO L290 TraceCheckUtils]: 41: Hoare triple {76232#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {76207#(< ~counter~0 92)} is VALID [2022-04-15 15:13:42,890 INFO L290 TraceCheckUtils]: 40: Hoare triple {76232#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {76232#(< ~counter~0 91)} is VALID [2022-04-15 15:13:42,891 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {75618#true} {76232#(< ~counter~0 91)} #98#return; {76232#(< ~counter~0 91)} is VALID [2022-04-15 15:13:42,891 INFO L290 TraceCheckUtils]: 38: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,891 INFO L290 TraceCheckUtils]: 37: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,891 INFO L290 TraceCheckUtils]: 36: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,891 INFO L272 TraceCheckUtils]: 35: Hoare triple {76232#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,892 INFO L290 TraceCheckUtils]: 34: Hoare triple {76232#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {76232#(< ~counter~0 91)} is VALID [2022-04-15 15:13:42,893 INFO L290 TraceCheckUtils]: 33: Hoare triple {76257#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {76232#(< ~counter~0 91)} is VALID [2022-04-15 15:13:42,893 INFO L290 TraceCheckUtils]: 32: Hoare triple {76257#(< ~counter~0 90)} assume !(~r~0 > 0); {76257#(< ~counter~0 90)} is VALID [2022-04-15 15:13:42,894 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {75618#true} {76257#(< ~counter~0 90)} #96#return; {76257#(< ~counter~0 90)} is VALID [2022-04-15 15:13:42,894 INFO L290 TraceCheckUtils]: 30: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,894 INFO L290 TraceCheckUtils]: 29: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,894 INFO L290 TraceCheckUtils]: 28: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,894 INFO L272 TraceCheckUtils]: 27: Hoare triple {76257#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,895 INFO L290 TraceCheckUtils]: 26: Hoare triple {76257#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {76257#(< ~counter~0 90)} is VALID [2022-04-15 15:13:42,895 INFO L290 TraceCheckUtils]: 25: Hoare triple {76282#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {76257#(< ~counter~0 90)} is VALID [2022-04-15 15:13:42,896 INFO L290 TraceCheckUtils]: 24: Hoare triple {76282#(< ~counter~0 89)} assume !!(0 != ~r~0); {76282#(< ~counter~0 89)} is VALID [2022-04-15 15:13:42,896 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {75618#true} {76282#(< ~counter~0 89)} #94#return; {76282#(< ~counter~0 89)} is VALID [2022-04-15 15:13:42,897 INFO L290 TraceCheckUtils]: 22: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,897 INFO L290 TraceCheckUtils]: 21: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,897 INFO L290 TraceCheckUtils]: 20: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,897 INFO L272 TraceCheckUtils]: 19: Hoare triple {76282#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,897 INFO L290 TraceCheckUtils]: 18: Hoare triple {76282#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {76282#(< ~counter~0 89)} is VALID [2022-04-15 15:13:42,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {76307#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {76282#(< ~counter~0 89)} is VALID [2022-04-15 15:13:42,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {76307#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {76307#(< ~counter~0 88)} is VALID [2022-04-15 15:13:42,899 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {75618#true} {76307#(< ~counter~0 88)} #92#return; {76307#(< ~counter~0 88)} is VALID [2022-04-15 15:13:42,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,899 INFO L272 TraceCheckUtils]: 11: Hoare triple {76307#(< ~counter~0 88)} 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)); {75618#true} is VALID [2022-04-15 15:13:42,900 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {75618#true} {76307#(< ~counter~0 88)} #90#return; {76307#(< ~counter~0 88)} is VALID [2022-04-15 15:13:42,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {75618#true} assume true; {75618#true} is VALID [2022-04-15 15:13:42,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {75618#true} assume !(0 == ~cond); {75618#true} is VALID [2022-04-15 15:13:42,900 INFO L290 TraceCheckUtils]: 7: Hoare triple {75618#true} ~cond := #in~cond; {75618#true} is VALID [2022-04-15 15:13:42,900 INFO L272 TraceCheckUtils]: 6: Hoare triple {76307#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {75618#true} is VALID [2022-04-15 15:13:42,901 INFO L290 TraceCheckUtils]: 5: Hoare triple {76307#(< ~counter~0 88)} 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; {76307#(< ~counter~0 88)} is VALID [2022-04-15 15:13:42,901 INFO L272 TraceCheckUtils]: 4: Hoare triple {76307#(< ~counter~0 88)} call #t~ret9 := main(); {76307#(< ~counter~0 88)} is VALID [2022-04-15 15:13:42,901 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {76307#(< ~counter~0 88)} {75618#true} #102#return; {76307#(< ~counter~0 88)} is VALID [2022-04-15 15:13:42,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {76307#(< ~counter~0 88)} assume true; {76307#(< ~counter~0 88)} is VALID [2022-04-15 15:13:42,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {75618#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; {76307#(< ~counter~0 88)} is VALID [2022-04-15 15:13:42,902 INFO L272 TraceCheckUtils]: 0: Hoare triple {75618#true} call ULTIMATE.init(); {75618#true} is VALID [2022-04-15 15:13:42,903 INFO L134 CoverageAnalysis]: Checked inductivity of 384 backedges. 24 proven. 92 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 15:13:42,903 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:42,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2089646643] [2022-04-15 15:13:42,903 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:42,903 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [322096498] [2022-04-15 15:13:42,903 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [322096498] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:42,903 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:42,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-15 15:13:42,904 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:42,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1044538621] [2022-04-15 15:13:42,904 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1044538621] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:42,904 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:42,904 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 15:13:42,904 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436728480] [2022-04-15 15:13:42,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:42,905 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 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 119 [2022-04-15 15:13:42,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:42,905 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 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-15 15:13:43,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:43,013 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 15:13:43,013 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:43,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 15:13:43,014 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-15 15:13:43,014 INFO L87 Difference]: Start difference. First operand 598 states and 809 transitions. Second operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 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-15 15:13:45,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:45,955 INFO L93 Difference]: Finished difference Result 653 states and 886 transitions. [2022-04-15 15:13:45,956 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2022-04-15 15:13:45,956 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 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 119 [2022-04-15 15:13:45,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:45,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 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-15 15:13:45,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-15 15:13:45,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 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-15 15:13:45,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 254 transitions. [2022-04-15 15:13:45,959 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 25 states and 254 transitions. [2022-04-15 15:13:46,180 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 254 edges. 254 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:46,197 INFO L225 Difference]: With dead ends: 653 [2022-04-15 15:13:46,197 INFO L226 Difference]: Without dead ends: 642 [2022-04-15 15:13:46,198 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 246 GetRequests, 209 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 73 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=620, Invalid=862, Unknown=0, NotChecked=0, Total=1482 [2022-04-15 15:13:46,198 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 176 mSDsluCounter, 221 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 135 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 135 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:46,198 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 287 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [135 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:13:46,199 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 642 states. [2022-04-15 15:13:47,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 642 to 620. [2022-04-15 15:13:47,947 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:47,947 INFO L82 GeneralOperation]: Start isEquivalent. First operand 642 states. Second operand has 620 states, 463 states have (on average 1.2224622030237582) internal successors, (566), 473 states have internal predecessors, (566), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:13:47,948 INFO L74 IsIncluded]: Start isIncluded. First operand 642 states. Second operand has 620 states, 463 states have (on average 1.2224622030237582) internal successors, (566), 473 states have internal predecessors, (566), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:13:47,948 INFO L87 Difference]: Start difference. First operand 642 states. Second operand has 620 states, 463 states have (on average 1.2224622030237582) internal successors, (566), 473 states have internal predecessors, (566), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:13:47,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:47,962 INFO L93 Difference]: Finished difference Result 642 states and 870 transitions. [2022-04-15 15:13:47,962 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 870 transitions. [2022-04-15 15:13:47,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:47,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:47,963 INFO L74 IsIncluded]: Start isIncluded. First operand has 620 states, 463 states have (on average 1.2224622030237582) internal successors, (566), 473 states have internal predecessors, (566), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 642 states. [2022-04-15 15:13:47,964 INFO L87 Difference]: Start difference. First operand has 620 states, 463 states have (on average 1.2224622030237582) internal successors, (566), 473 states have internal predecessors, (566), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) Second operand 642 states. [2022-04-15 15:13:47,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:47,978 INFO L93 Difference]: Finished difference Result 642 states and 870 transitions. [2022-04-15 15:13:47,978 INFO L276 IsEmpty]: Start isEmpty. Operand 642 states and 870 transitions. [2022-04-15 15:13:47,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:47,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:47,979 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:47,979 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:47,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 620 states, 463 states have (on average 1.2224622030237582) internal successors, (566), 473 states have internal predecessors, (566), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 128 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:13:47,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 620 states to 620 states and 844 transitions. [2022-04-15 15:13:47,996 INFO L78 Accepts]: Start accepts. Automaton has 620 states and 844 transitions. Word has length 119 [2022-04-15 15:13:47,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:47,996 INFO L478 AbstractCegarLoop]: Abstraction has 620 states and 844 transitions. [2022-04-15 15:13:47,997 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.25) internal successors, (84), 15 states have internal predecessors, (84), 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-15 15:13:47,997 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 620 states and 844 transitions. [2022-04-15 15:13:50,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 844 edges. 844 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:50,632 INFO L276 IsEmpty]: Start isEmpty. Operand 620 states and 844 transitions. [2022-04-15 15:13:50,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 122 [2022-04-15 15:13:50,633 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:50,633 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 7, 7, 7, 7, 5, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:50,649 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (40)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:50,834 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 40 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-04-15 15:13:50,834 INFO L403 AbstractCegarLoop]: === Iteration 40 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:50,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:50,834 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 17 times [2022-04-15 15:13:50,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:50,834 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [356318492] [2022-04-15 15:13:50,835 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:50,835 INFO L85 PathProgramCache]: Analyzing trace with hash 1267134888, now seen corresponding path program 18 times [2022-04-15 15:13:50,835 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:50,835 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596462333] [2022-04-15 15:13:50,835 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:50,835 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:50,852 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:50,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1326166320] [2022-04-15 15:13:50,852 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:13:50,852 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:50,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:50,853 INFO L229 MonitoredProcess]: Starting monitored process 41 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:50,855 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Waiting until timeout for monitored process [2022-04-15 15:13:51,450 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 9 check-sat command(s) [2022-04-15 15:13:51,451 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:13:51,454 INFO L263 TraceCheckSpWp]: Trace formula consists of 306 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 15:13:51,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:13:51,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:13:52,058 INFO L272 TraceCheckUtils]: 0: Hoare triple {80209#true} call ULTIMATE.init(); {80209#true} is VALID [2022-04-15 15:13:52,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {80209#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; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {80217#(<= ~counter~0 0)} assume true; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80217#(<= ~counter~0 0)} {80209#true} #102#return; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,060 INFO L272 TraceCheckUtils]: 4: Hoare triple {80217#(<= ~counter~0 0)} call #t~ret9 := main(); {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {80217#(<= ~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; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {80217#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,061 INFO L290 TraceCheckUtils]: 7: Hoare triple {80217#(<= ~counter~0 0)} ~cond := #in~cond; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {80217#(<= ~counter~0 0)} assume !(0 == ~cond); {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {80217#(<= ~counter~0 0)} assume true; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,062 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {80217#(<= ~counter~0 0)} {80217#(<= ~counter~0 0)} #90#return; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,062 INFO L272 TraceCheckUtils]: 11: Hoare triple {80217#(<= ~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)); {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {80217#(<= ~counter~0 0)} ~cond := #in~cond; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {80217#(<= ~counter~0 0)} assume !(0 == ~cond); {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,064 INFO L290 TraceCheckUtils]: 14: Hoare triple {80217#(<= ~counter~0 0)} assume true; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,064 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {80217#(<= ~counter~0 0)} {80217#(<= ~counter~0 0)} #92#return; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {80217#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {80217#(<= ~counter~0 0)} is VALID [2022-04-15 15:13:52,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {80217#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80266#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:52,069 INFO L290 TraceCheckUtils]: 18: Hoare triple {80266#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {80266#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:52,070 INFO L272 TraceCheckUtils]: 19: Hoare triple {80266#(<= ~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)); {80266#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:52,070 INFO L290 TraceCheckUtils]: 20: Hoare triple {80266#(<= ~counter~0 1)} ~cond := #in~cond; {80266#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:52,070 INFO L290 TraceCheckUtils]: 21: Hoare triple {80266#(<= ~counter~0 1)} assume !(0 == ~cond); {80266#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:52,071 INFO L290 TraceCheckUtils]: 22: Hoare triple {80266#(<= ~counter~0 1)} assume true; {80266#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:52,071 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {80266#(<= ~counter~0 1)} {80266#(<= ~counter~0 1)} #94#return; {80266#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:52,072 INFO L290 TraceCheckUtils]: 24: Hoare triple {80266#(<= ~counter~0 1)} assume !!(0 != ~r~0); {80266#(<= ~counter~0 1)} is VALID [2022-04-15 15:13:52,073 INFO L290 TraceCheckUtils]: 25: Hoare triple {80266#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80291#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:52,073 INFO L290 TraceCheckUtils]: 26: Hoare triple {80291#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {80291#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:52,074 INFO L272 TraceCheckUtils]: 27: Hoare triple {80291#(<= ~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)); {80291#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:52,074 INFO L290 TraceCheckUtils]: 28: Hoare triple {80291#(<= ~counter~0 2)} ~cond := #in~cond; {80291#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:52,074 INFO L290 TraceCheckUtils]: 29: Hoare triple {80291#(<= ~counter~0 2)} assume !(0 == ~cond); {80291#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:52,075 INFO L290 TraceCheckUtils]: 30: Hoare triple {80291#(<= ~counter~0 2)} assume true; {80291#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:52,075 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {80291#(<= ~counter~0 2)} {80291#(<= ~counter~0 2)} #96#return; {80291#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:52,076 INFO L290 TraceCheckUtils]: 32: Hoare triple {80291#(<= ~counter~0 2)} assume !(~r~0 > 0); {80291#(<= ~counter~0 2)} is VALID [2022-04-15 15:13:52,077 INFO L290 TraceCheckUtils]: 33: Hoare triple {80291#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80316#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:52,077 INFO L290 TraceCheckUtils]: 34: Hoare triple {80316#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {80316#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:52,078 INFO L272 TraceCheckUtils]: 35: Hoare triple {80316#(<= ~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)); {80316#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:52,078 INFO L290 TraceCheckUtils]: 36: Hoare triple {80316#(<= ~counter~0 3)} ~cond := #in~cond; {80316#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:52,079 INFO L290 TraceCheckUtils]: 37: Hoare triple {80316#(<= ~counter~0 3)} assume !(0 == ~cond); {80316#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:52,079 INFO L290 TraceCheckUtils]: 38: Hoare triple {80316#(<= ~counter~0 3)} assume true; {80316#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:52,080 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {80316#(<= ~counter~0 3)} {80316#(<= ~counter~0 3)} #98#return; {80316#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:52,080 INFO L290 TraceCheckUtils]: 40: Hoare triple {80316#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80316#(<= ~counter~0 3)} is VALID [2022-04-15 15:13:52,081 INFO L290 TraceCheckUtils]: 41: Hoare triple {80316#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80341#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:52,081 INFO L290 TraceCheckUtils]: 42: Hoare triple {80341#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {80341#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:52,082 INFO L272 TraceCheckUtils]: 43: Hoare triple {80341#(<= ~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)); {80341#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:52,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {80341#(<= ~counter~0 4)} ~cond := #in~cond; {80341#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:52,083 INFO L290 TraceCheckUtils]: 45: Hoare triple {80341#(<= ~counter~0 4)} assume !(0 == ~cond); {80341#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:52,083 INFO L290 TraceCheckUtils]: 46: Hoare triple {80341#(<= ~counter~0 4)} assume true; {80341#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:52,084 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {80341#(<= ~counter~0 4)} {80341#(<= ~counter~0 4)} #98#return; {80341#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:52,084 INFO L290 TraceCheckUtils]: 48: Hoare triple {80341#(<= ~counter~0 4)} assume !(~r~0 < 0); {80341#(<= ~counter~0 4)} is VALID [2022-04-15 15:13:52,085 INFO L290 TraceCheckUtils]: 49: Hoare triple {80341#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80366#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:52,086 INFO L290 TraceCheckUtils]: 50: Hoare triple {80366#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {80366#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:52,086 INFO L272 TraceCheckUtils]: 51: Hoare triple {80366#(<= ~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)); {80366#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:52,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {80366#(<= ~counter~0 5)} ~cond := #in~cond; {80366#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:52,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {80366#(<= ~counter~0 5)} assume !(0 == ~cond); {80366#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:52,088 INFO L290 TraceCheckUtils]: 54: Hoare triple {80366#(<= ~counter~0 5)} assume true; {80366#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:52,088 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {80366#(<= ~counter~0 5)} {80366#(<= ~counter~0 5)} #94#return; {80366#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:52,089 INFO L290 TraceCheckUtils]: 56: Hoare triple {80366#(<= ~counter~0 5)} assume !!(0 != ~r~0); {80366#(<= ~counter~0 5)} is VALID [2022-04-15 15:13:52,090 INFO L290 TraceCheckUtils]: 57: Hoare triple {80366#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80391#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:52,090 INFO L290 TraceCheckUtils]: 58: Hoare triple {80391#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {80391#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:52,091 INFO L272 TraceCheckUtils]: 59: Hoare triple {80391#(<= ~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)); {80391#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:52,091 INFO L290 TraceCheckUtils]: 60: Hoare triple {80391#(<= ~counter~0 6)} ~cond := #in~cond; {80391#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:52,092 INFO L290 TraceCheckUtils]: 61: Hoare triple {80391#(<= ~counter~0 6)} assume !(0 == ~cond); {80391#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:52,092 INFO L290 TraceCheckUtils]: 62: Hoare triple {80391#(<= ~counter~0 6)} assume true; {80391#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:52,093 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {80391#(<= ~counter~0 6)} {80391#(<= ~counter~0 6)} #96#return; {80391#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:52,093 INFO L290 TraceCheckUtils]: 64: Hoare triple {80391#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80391#(<= ~counter~0 6)} is VALID [2022-04-15 15:13:52,094 INFO L290 TraceCheckUtils]: 65: Hoare triple {80391#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80416#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:52,095 INFO L290 TraceCheckUtils]: 66: Hoare triple {80416#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {80416#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:52,095 INFO L272 TraceCheckUtils]: 67: Hoare triple {80416#(<= ~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)); {80416#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:52,096 INFO L290 TraceCheckUtils]: 68: Hoare triple {80416#(<= ~counter~0 7)} ~cond := #in~cond; {80416#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:52,096 INFO L290 TraceCheckUtils]: 69: Hoare triple {80416#(<= ~counter~0 7)} assume !(0 == ~cond); {80416#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:52,096 INFO L290 TraceCheckUtils]: 70: Hoare triple {80416#(<= ~counter~0 7)} assume true; {80416#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:52,097 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {80416#(<= ~counter~0 7)} {80416#(<= ~counter~0 7)} #96#return; {80416#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:52,098 INFO L290 TraceCheckUtils]: 72: Hoare triple {80416#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80416#(<= ~counter~0 7)} is VALID [2022-04-15 15:13:52,099 INFO L290 TraceCheckUtils]: 73: Hoare triple {80416#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80441#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:52,099 INFO L290 TraceCheckUtils]: 74: Hoare triple {80441#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {80441#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:52,100 INFO L272 TraceCheckUtils]: 75: Hoare triple {80441#(<= ~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)); {80441#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:52,100 INFO L290 TraceCheckUtils]: 76: Hoare triple {80441#(<= ~counter~0 8)} ~cond := #in~cond; {80441#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:52,101 INFO L290 TraceCheckUtils]: 77: Hoare triple {80441#(<= ~counter~0 8)} assume !(0 == ~cond); {80441#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:52,101 INFO L290 TraceCheckUtils]: 78: Hoare triple {80441#(<= ~counter~0 8)} assume true; {80441#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:52,102 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {80441#(<= ~counter~0 8)} {80441#(<= ~counter~0 8)} #96#return; {80441#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:52,102 INFO L290 TraceCheckUtils]: 80: Hoare triple {80441#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80441#(<= ~counter~0 8)} is VALID [2022-04-15 15:13:52,103 INFO L290 TraceCheckUtils]: 81: Hoare triple {80441#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80466#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:52,103 INFO L290 TraceCheckUtils]: 82: Hoare triple {80466#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {80466#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:52,104 INFO L272 TraceCheckUtils]: 83: Hoare triple {80466#(<= ~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)); {80466#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:52,105 INFO L290 TraceCheckUtils]: 84: Hoare triple {80466#(<= ~counter~0 9)} ~cond := #in~cond; {80466#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:52,105 INFO L290 TraceCheckUtils]: 85: Hoare triple {80466#(<= ~counter~0 9)} assume !(0 == ~cond); {80466#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:52,105 INFO L290 TraceCheckUtils]: 86: Hoare triple {80466#(<= ~counter~0 9)} assume true; {80466#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:52,106 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {80466#(<= ~counter~0 9)} {80466#(<= ~counter~0 9)} #96#return; {80466#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:52,107 INFO L290 TraceCheckUtils]: 88: Hoare triple {80466#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80466#(<= ~counter~0 9)} is VALID [2022-04-15 15:13:52,108 INFO L290 TraceCheckUtils]: 89: Hoare triple {80466#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80491#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:52,108 INFO L290 TraceCheckUtils]: 90: Hoare triple {80491#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {80491#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:52,109 INFO L272 TraceCheckUtils]: 91: Hoare triple {80491#(<= ~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)); {80491#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:52,109 INFO L290 TraceCheckUtils]: 92: Hoare triple {80491#(<= ~counter~0 10)} ~cond := #in~cond; {80491#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:52,110 INFO L290 TraceCheckUtils]: 93: Hoare triple {80491#(<= ~counter~0 10)} assume !(0 == ~cond); {80491#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:52,110 INFO L290 TraceCheckUtils]: 94: Hoare triple {80491#(<= ~counter~0 10)} assume true; {80491#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:52,111 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {80491#(<= ~counter~0 10)} {80491#(<= ~counter~0 10)} #96#return; {80491#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:52,111 INFO L290 TraceCheckUtils]: 96: Hoare triple {80491#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80491#(<= ~counter~0 10)} is VALID [2022-04-15 15:13:52,112 INFO L290 TraceCheckUtils]: 97: Hoare triple {80491#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80516#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:52,112 INFO L290 TraceCheckUtils]: 98: Hoare triple {80516#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {80516#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:52,113 INFO L272 TraceCheckUtils]: 99: Hoare triple {80516#(<= ~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)); {80516#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:52,114 INFO L290 TraceCheckUtils]: 100: Hoare triple {80516#(<= ~counter~0 11)} ~cond := #in~cond; {80516#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:52,114 INFO L290 TraceCheckUtils]: 101: Hoare triple {80516#(<= ~counter~0 11)} assume !(0 == ~cond); {80516#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:52,114 INFO L290 TraceCheckUtils]: 102: Hoare triple {80516#(<= ~counter~0 11)} assume true; {80516#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:52,115 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {80516#(<= ~counter~0 11)} {80516#(<= ~counter~0 11)} #96#return; {80516#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:52,115 INFO L290 TraceCheckUtils]: 104: Hoare triple {80516#(<= ~counter~0 11)} assume !(~r~0 > 0); {80516#(<= ~counter~0 11)} is VALID [2022-04-15 15:13:52,116 INFO L290 TraceCheckUtils]: 105: Hoare triple {80516#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80541#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:52,117 INFO L290 TraceCheckUtils]: 106: Hoare triple {80541#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {80541#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:52,118 INFO L272 TraceCheckUtils]: 107: Hoare triple {80541#(<= ~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)); {80541#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:52,118 INFO L290 TraceCheckUtils]: 108: Hoare triple {80541#(<= ~counter~0 12)} ~cond := #in~cond; {80541#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:52,118 INFO L290 TraceCheckUtils]: 109: Hoare triple {80541#(<= ~counter~0 12)} assume !(0 == ~cond); {80541#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:52,119 INFO L290 TraceCheckUtils]: 110: Hoare triple {80541#(<= ~counter~0 12)} assume true; {80541#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:52,120 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {80541#(<= ~counter~0 12)} {80541#(<= ~counter~0 12)} #98#return; {80541#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:52,120 INFO L290 TraceCheckUtils]: 112: Hoare triple {80541#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80541#(<= ~counter~0 12)} is VALID [2022-04-15 15:13:52,120 INFO L290 TraceCheckUtils]: 113: Hoare triple {80541#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80566#(<= |main_#t~post8| 12)} is VALID [2022-04-15 15:13:52,121 INFO L290 TraceCheckUtils]: 114: Hoare triple {80566#(<= |main_#t~post8| 12)} assume !(#t~post8 < 100);havoc #t~post8; {80210#false} is VALID [2022-04-15 15:13:52,121 INFO L290 TraceCheckUtils]: 115: Hoare triple {80210#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80210#false} is VALID [2022-04-15 15:13:52,121 INFO L290 TraceCheckUtils]: 116: Hoare triple {80210#false} assume !(#t~post6 < 100);havoc #t~post6; {80210#false} is VALID [2022-04-15 15:13:52,121 INFO L272 TraceCheckUtils]: 117: Hoare triple {80210#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)); {80210#false} is VALID [2022-04-15 15:13:52,121 INFO L290 TraceCheckUtils]: 118: Hoare triple {80210#false} ~cond := #in~cond; {80210#false} is VALID [2022-04-15 15:13:52,121 INFO L290 TraceCheckUtils]: 119: Hoare triple {80210#false} assume 0 == ~cond; {80210#false} is VALID [2022-04-15 15:13:52,121 INFO L290 TraceCheckUtils]: 120: Hoare triple {80210#false} assume !false; {80210#false} is VALID [2022-04-15 15:13:52,122 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 370 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:13:52,122 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:13:52,799 INFO L290 TraceCheckUtils]: 120: Hoare triple {80210#false} assume !false; {80210#false} is VALID [2022-04-15 15:13:52,799 INFO L290 TraceCheckUtils]: 119: Hoare triple {80210#false} assume 0 == ~cond; {80210#false} is VALID [2022-04-15 15:13:52,799 INFO L290 TraceCheckUtils]: 118: Hoare triple {80210#false} ~cond := #in~cond; {80210#false} is VALID [2022-04-15 15:13:52,799 INFO L272 TraceCheckUtils]: 117: Hoare triple {80210#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)); {80210#false} is VALID [2022-04-15 15:13:52,799 INFO L290 TraceCheckUtils]: 116: Hoare triple {80210#false} assume !(#t~post6 < 100);havoc #t~post6; {80210#false} is VALID [2022-04-15 15:13:52,800 INFO L290 TraceCheckUtils]: 115: Hoare triple {80210#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80210#false} is VALID [2022-04-15 15:13:52,800 INFO L290 TraceCheckUtils]: 114: Hoare triple {80606#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {80210#false} is VALID [2022-04-15 15:13:52,800 INFO L290 TraceCheckUtils]: 113: Hoare triple {80610#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80606#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:13:52,800 INFO L290 TraceCheckUtils]: 112: Hoare triple {80610#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80610#(< ~counter~0 100)} is VALID [2022-04-15 15:13:52,801 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {80209#true} {80610#(< ~counter~0 100)} #98#return; {80610#(< ~counter~0 100)} is VALID [2022-04-15 15:13:52,801 INFO L290 TraceCheckUtils]: 110: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,801 INFO L290 TraceCheckUtils]: 109: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,801 INFO L290 TraceCheckUtils]: 108: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,801 INFO L272 TraceCheckUtils]: 107: Hoare triple {80610#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,802 INFO L290 TraceCheckUtils]: 106: Hoare triple {80610#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {80610#(< ~counter~0 100)} is VALID [2022-04-15 15:13:52,803 INFO L290 TraceCheckUtils]: 105: Hoare triple {80635#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80610#(< ~counter~0 100)} is VALID [2022-04-15 15:13:52,803 INFO L290 TraceCheckUtils]: 104: Hoare triple {80635#(< ~counter~0 99)} assume !(~r~0 > 0); {80635#(< ~counter~0 99)} is VALID [2022-04-15 15:13:52,804 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {80209#true} {80635#(< ~counter~0 99)} #96#return; {80635#(< ~counter~0 99)} is VALID [2022-04-15 15:13:52,804 INFO L290 TraceCheckUtils]: 102: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,804 INFO L290 TraceCheckUtils]: 101: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,804 INFO L290 TraceCheckUtils]: 100: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,804 INFO L272 TraceCheckUtils]: 99: Hoare triple {80635#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,804 INFO L290 TraceCheckUtils]: 98: Hoare triple {80635#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {80635#(< ~counter~0 99)} is VALID [2022-04-15 15:13:52,805 INFO L290 TraceCheckUtils]: 97: Hoare triple {80660#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80635#(< ~counter~0 99)} is VALID [2022-04-15 15:13:52,806 INFO L290 TraceCheckUtils]: 96: Hoare triple {80660#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80660#(< ~counter~0 98)} is VALID [2022-04-15 15:13:52,806 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {80209#true} {80660#(< ~counter~0 98)} #96#return; {80660#(< ~counter~0 98)} is VALID [2022-04-15 15:13:52,806 INFO L290 TraceCheckUtils]: 94: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,806 INFO L290 TraceCheckUtils]: 93: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,806 INFO L290 TraceCheckUtils]: 92: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,806 INFO L272 TraceCheckUtils]: 91: Hoare triple {80660#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,807 INFO L290 TraceCheckUtils]: 90: Hoare triple {80660#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {80660#(< ~counter~0 98)} is VALID [2022-04-15 15:13:52,807 INFO L290 TraceCheckUtils]: 89: Hoare triple {80685#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80660#(< ~counter~0 98)} is VALID [2022-04-15 15:13:52,808 INFO L290 TraceCheckUtils]: 88: Hoare triple {80685#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80685#(< ~counter~0 97)} is VALID [2022-04-15 15:13:52,808 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {80209#true} {80685#(< ~counter~0 97)} #96#return; {80685#(< ~counter~0 97)} is VALID [2022-04-15 15:13:52,808 INFO L290 TraceCheckUtils]: 86: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,808 INFO L290 TraceCheckUtils]: 85: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,808 INFO L290 TraceCheckUtils]: 84: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,808 INFO L272 TraceCheckUtils]: 83: Hoare triple {80685#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,809 INFO L290 TraceCheckUtils]: 82: Hoare triple {80685#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {80685#(< ~counter~0 97)} is VALID [2022-04-15 15:13:52,809 INFO L290 TraceCheckUtils]: 81: Hoare triple {80710#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80685#(< ~counter~0 97)} is VALID [2022-04-15 15:13:52,810 INFO L290 TraceCheckUtils]: 80: Hoare triple {80710#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80710#(< ~counter~0 96)} is VALID [2022-04-15 15:13:52,810 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {80209#true} {80710#(< ~counter~0 96)} #96#return; {80710#(< ~counter~0 96)} is VALID [2022-04-15 15:13:52,810 INFO L290 TraceCheckUtils]: 78: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,810 INFO L290 TraceCheckUtils]: 77: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,810 INFO L290 TraceCheckUtils]: 76: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,810 INFO L272 TraceCheckUtils]: 75: Hoare triple {80710#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,811 INFO L290 TraceCheckUtils]: 74: Hoare triple {80710#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {80710#(< ~counter~0 96)} is VALID [2022-04-15 15:13:52,812 INFO L290 TraceCheckUtils]: 73: Hoare triple {80735#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80710#(< ~counter~0 96)} is VALID [2022-04-15 15:13:52,812 INFO L290 TraceCheckUtils]: 72: Hoare triple {80735#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80735#(< ~counter~0 95)} is VALID [2022-04-15 15:13:52,812 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {80209#true} {80735#(< ~counter~0 95)} #96#return; {80735#(< ~counter~0 95)} is VALID [2022-04-15 15:13:52,812 INFO L290 TraceCheckUtils]: 70: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,812 INFO L290 TraceCheckUtils]: 69: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,812 INFO L290 TraceCheckUtils]: 68: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,813 INFO L272 TraceCheckUtils]: 67: Hoare triple {80735#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,813 INFO L290 TraceCheckUtils]: 66: Hoare triple {80735#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {80735#(< ~counter~0 95)} is VALID [2022-04-15 15:13:52,814 INFO L290 TraceCheckUtils]: 65: Hoare triple {80760#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80735#(< ~counter~0 95)} is VALID [2022-04-15 15:13:52,814 INFO L290 TraceCheckUtils]: 64: Hoare triple {80760#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {80760#(< ~counter~0 94)} is VALID [2022-04-15 15:13:52,814 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {80209#true} {80760#(< ~counter~0 94)} #96#return; {80760#(< ~counter~0 94)} is VALID [2022-04-15 15:13:52,814 INFO L290 TraceCheckUtils]: 62: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,815 INFO L290 TraceCheckUtils]: 61: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,815 INFO L290 TraceCheckUtils]: 60: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,815 INFO L272 TraceCheckUtils]: 59: Hoare triple {80760#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,815 INFO L290 TraceCheckUtils]: 58: Hoare triple {80760#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {80760#(< ~counter~0 94)} is VALID [2022-04-15 15:13:52,816 INFO L290 TraceCheckUtils]: 57: Hoare triple {80785#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80760#(< ~counter~0 94)} is VALID [2022-04-15 15:13:52,816 INFO L290 TraceCheckUtils]: 56: Hoare triple {80785#(< ~counter~0 93)} assume !!(0 != ~r~0); {80785#(< ~counter~0 93)} is VALID [2022-04-15 15:13:52,816 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {80209#true} {80785#(< ~counter~0 93)} #94#return; {80785#(< ~counter~0 93)} is VALID [2022-04-15 15:13:52,817 INFO L290 TraceCheckUtils]: 54: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,817 INFO L290 TraceCheckUtils]: 53: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,817 INFO L290 TraceCheckUtils]: 52: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,817 INFO L272 TraceCheckUtils]: 51: Hoare triple {80785#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,817 INFO L290 TraceCheckUtils]: 50: Hoare triple {80785#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {80785#(< ~counter~0 93)} is VALID [2022-04-15 15:13:52,818 INFO L290 TraceCheckUtils]: 49: Hoare triple {80810#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80785#(< ~counter~0 93)} is VALID [2022-04-15 15:13:52,818 INFO L290 TraceCheckUtils]: 48: Hoare triple {80810#(< ~counter~0 92)} assume !(~r~0 < 0); {80810#(< ~counter~0 92)} is VALID [2022-04-15 15:13:52,819 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {80209#true} {80810#(< ~counter~0 92)} #98#return; {80810#(< ~counter~0 92)} is VALID [2022-04-15 15:13:52,819 INFO L290 TraceCheckUtils]: 46: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,819 INFO L290 TraceCheckUtils]: 45: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,819 INFO L290 TraceCheckUtils]: 44: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,819 INFO L272 TraceCheckUtils]: 43: Hoare triple {80810#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,819 INFO L290 TraceCheckUtils]: 42: Hoare triple {80810#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {80810#(< ~counter~0 92)} is VALID [2022-04-15 15:13:52,820 INFO L290 TraceCheckUtils]: 41: Hoare triple {80835#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80810#(< ~counter~0 92)} is VALID [2022-04-15 15:13:52,820 INFO L290 TraceCheckUtils]: 40: Hoare triple {80835#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {80835#(< ~counter~0 91)} is VALID [2022-04-15 15:13:52,821 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {80209#true} {80835#(< ~counter~0 91)} #98#return; {80835#(< ~counter~0 91)} is VALID [2022-04-15 15:13:52,821 INFO L290 TraceCheckUtils]: 38: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,821 INFO L290 TraceCheckUtils]: 37: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,821 INFO L290 TraceCheckUtils]: 36: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,821 INFO L272 TraceCheckUtils]: 35: Hoare triple {80835#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,821 INFO L290 TraceCheckUtils]: 34: Hoare triple {80835#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {80835#(< ~counter~0 91)} is VALID [2022-04-15 15:13:52,822 INFO L290 TraceCheckUtils]: 33: Hoare triple {80860#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {80835#(< ~counter~0 91)} is VALID [2022-04-15 15:13:52,822 INFO L290 TraceCheckUtils]: 32: Hoare triple {80860#(< ~counter~0 90)} assume !(~r~0 > 0); {80860#(< ~counter~0 90)} is VALID [2022-04-15 15:13:52,823 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {80209#true} {80860#(< ~counter~0 90)} #96#return; {80860#(< ~counter~0 90)} is VALID [2022-04-15 15:13:52,823 INFO L290 TraceCheckUtils]: 30: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,823 INFO L290 TraceCheckUtils]: 29: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,823 INFO L290 TraceCheckUtils]: 28: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,823 INFO L272 TraceCheckUtils]: 27: Hoare triple {80860#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,823 INFO L290 TraceCheckUtils]: 26: Hoare triple {80860#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {80860#(< ~counter~0 90)} is VALID [2022-04-15 15:13:52,824 INFO L290 TraceCheckUtils]: 25: Hoare triple {80885#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {80860#(< ~counter~0 90)} is VALID [2022-04-15 15:13:52,824 INFO L290 TraceCheckUtils]: 24: Hoare triple {80885#(< ~counter~0 89)} assume !!(0 != ~r~0); {80885#(< ~counter~0 89)} is VALID [2022-04-15 15:13:52,825 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {80209#true} {80885#(< ~counter~0 89)} #94#return; {80885#(< ~counter~0 89)} is VALID [2022-04-15 15:13:52,825 INFO L290 TraceCheckUtils]: 22: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,825 INFO L290 TraceCheckUtils]: 21: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,825 INFO L272 TraceCheckUtils]: 19: Hoare triple {80885#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,825 INFO L290 TraceCheckUtils]: 18: Hoare triple {80885#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {80885#(< ~counter~0 89)} is VALID [2022-04-15 15:13:52,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {80910#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {80885#(< ~counter~0 89)} is VALID [2022-04-15 15:13:52,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {80910#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {80910#(< ~counter~0 88)} is VALID [2022-04-15 15:13:52,827 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {80209#true} {80910#(< ~counter~0 88)} #92#return; {80910#(< ~counter~0 88)} is VALID [2022-04-15 15:13:52,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,827 INFO L290 TraceCheckUtils]: 12: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,827 INFO L272 TraceCheckUtils]: 11: Hoare triple {80910#(< ~counter~0 88)} 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)); {80209#true} is VALID [2022-04-15 15:13:52,828 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {80209#true} {80910#(< ~counter~0 88)} #90#return; {80910#(< ~counter~0 88)} is VALID [2022-04-15 15:13:52,828 INFO L290 TraceCheckUtils]: 9: Hoare triple {80209#true} assume true; {80209#true} is VALID [2022-04-15 15:13:52,828 INFO L290 TraceCheckUtils]: 8: Hoare triple {80209#true} assume !(0 == ~cond); {80209#true} is VALID [2022-04-15 15:13:52,828 INFO L290 TraceCheckUtils]: 7: Hoare triple {80209#true} ~cond := #in~cond; {80209#true} is VALID [2022-04-15 15:13:52,828 INFO L272 TraceCheckUtils]: 6: Hoare triple {80910#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {80209#true} is VALID [2022-04-15 15:13:52,828 INFO L290 TraceCheckUtils]: 5: Hoare triple {80910#(< ~counter~0 88)} 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; {80910#(< ~counter~0 88)} is VALID [2022-04-15 15:13:52,828 INFO L272 TraceCheckUtils]: 4: Hoare triple {80910#(< ~counter~0 88)} call #t~ret9 := main(); {80910#(< ~counter~0 88)} is VALID [2022-04-15 15:13:52,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {80910#(< ~counter~0 88)} {80209#true} #102#return; {80910#(< ~counter~0 88)} is VALID [2022-04-15 15:13:52,829 INFO L290 TraceCheckUtils]: 2: Hoare triple {80910#(< ~counter~0 88)} assume true; {80910#(< ~counter~0 88)} is VALID [2022-04-15 15:13:52,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {80209#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; {80910#(< ~counter~0 88)} is VALID [2022-04-15 15:13:52,829 INFO L272 TraceCheckUtils]: 0: Hoare triple {80209#true} call ULTIMATE.init(); {80209#true} is VALID [2022-04-15 15:13:52,830 INFO L134 CoverageAnalysis]: Checked inductivity of 402 backedges. 28 proven. 106 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 15:13:52,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:13:52,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596462333] [2022-04-15 15:13:52,830 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:13:52,830 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1326166320] [2022-04-15 15:13:52,830 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1326166320] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:13:52,830 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:13:52,830 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-15 15:13:52,830 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:13:52,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [356318492] [2022-04-15 15:13:52,831 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [356318492] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:13:52,831 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:13:52,831 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 15:13:52,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917603725] [2022-04-15 15:13:52,831 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:13:52,831 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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 121 [2022-04-15 15:13:52,831 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:13:52,831 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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-15 15:13:52,948 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:52,949 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 15:13:52,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:52,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 15:13:52,949 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-15 15:13:52,949 INFO L87 Difference]: Start difference. First operand 620 states and 844 transitions. Second operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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-15 15:13:55,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:55,861 INFO L93 Difference]: Finished difference Result 841 states and 1177 transitions. [2022-04-15 15:13:55,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-04-15 15:13:55,861 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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 121 [2022-04-15 15:13:55,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:13:55,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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-15 15:13:55,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-15 15:13:55,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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-15 15:13:55,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 276 transitions. [2022-04-15 15:13:55,865 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 26 states and 276 transitions. [2022-04-15 15:13:56,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:56,129 INFO L225 Difference]: With dead ends: 841 [2022-04-15 15:13:56,129 INFO L226 Difference]: Without dead ends: 648 [2022-04-15 15:13:56,130 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 251 GetRequests, 213 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 82 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=653, Invalid=907, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 15:13:56,130 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 177 mSDsluCounter, 216 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 150 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 177 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 303 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 150 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:13:56,130 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [177 Valid, 282 Invalid, 303 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [150 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:13:56,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 648 states. [2022-04-15 15:13:58,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 648 to 638. [2022-04-15 15:13:58,018 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:13:58,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 648 states. Second operand has 638 states, 481 states have (on average 1.2224532224532225) internal successors, (588), 485 states have internal predecessors, (588), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:13:58,020 INFO L74 IsIncluded]: Start isIncluded. First operand 648 states. Second operand has 638 states, 481 states have (on average 1.2224532224532225) internal successors, (588), 485 states have internal predecessors, (588), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:13:58,020 INFO L87 Difference]: Start difference. First operand 648 states. Second operand has 638 states, 481 states have (on average 1.2224532224532225) internal successors, (588), 485 states have internal predecessors, (588), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:13:58,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:58,036 INFO L93 Difference]: Finished difference Result 648 states and 876 transitions. [2022-04-15 15:13:58,036 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 876 transitions. [2022-04-15 15:13:58,036 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:58,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:58,037 INFO L74 IsIncluded]: Start isIncluded. First operand has 638 states, 481 states have (on average 1.2224532224532225) internal successors, (588), 485 states have internal predecessors, (588), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 648 states. [2022-04-15 15:13:58,037 INFO L87 Difference]: Start difference. First operand has 638 states, 481 states have (on average 1.2224532224532225) internal successors, (588), 485 states have internal predecessors, (588), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) Second operand 648 states. [2022-04-15 15:13:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:13:58,052 INFO L93 Difference]: Finished difference Result 648 states and 876 transitions. [2022-04-15 15:13:58,052 INFO L276 IsEmpty]: Start isEmpty. Operand 648 states and 876 transitions. [2022-04-15 15:13:58,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:13:58,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:13:58,053 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:13:58,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:13:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 638 states, 481 states have (on average 1.2224532224532225) internal successors, (588), 485 states have internal predecessors, (588), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 134 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:13:58,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 638 states to 638 states and 866 transitions. [2022-04-15 15:13:58,074 INFO L78 Accepts]: Start accepts. Automaton has 638 states and 866 transitions. Word has length 121 [2022-04-15 15:13:58,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:13:58,075 INFO L478 AbstractCegarLoop]: Abstraction has 638 states and 866 transitions. [2022-04-15 15:13:58,075 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.375) internal successors, (86), 15 states have internal predecessors, (86), 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-15 15:13:58,075 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 638 states and 866 transitions. [2022-04-15 15:13:59,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 866 edges. 866 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:13:59,680 INFO L276 IsEmpty]: Start isEmpty. Operand 638 states and 866 transitions. [2022-04-15 15:13:59,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 124 [2022-04-15 15:13:59,681 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:13:59,681 INFO L499 BasicCegarLoop]: trace histogram [13, 12, 12, 6, 5, 5, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:13:59,686 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (41)] Forceful destruction successful, exit code 0 [2022-04-15 15:13:59,881 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 41 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2022-04-15 15:13:59,882 INFO L403 AbstractCegarLoop]: === Iteration 41 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:13:59,882 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:13:59,882 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 15 times [2022-04-15 15:13:59,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:13:59,882 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [711518171] [2022-04-15 15:13:59,882 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:13:59,883 INFO L85 PathProgramCache]: Analyzing trace with hash 487500267, now seen corresponding path program 16 times [2022-04-15 15:13:59,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:13:59,883 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039029280] [2022-04-15 15:13:59,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:13:59,883 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:13:59,894 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:13:59,894 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1403949853] [2022-04-15 15:13:59,894 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:13:59,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:13:59,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:13:59,896 INFO L229 MonitoredProcess]: Starting monitored process 42 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:13:59,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Waiting until timeout for monitored process [2022-04-15 15:14:00,010 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:14:00,010 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:00,012 INFO L263 TraceCheckSpWp]: Trace formula consists of 303 conjuncts, 29 conjunts are in the unsatisfiable core [2022-04-15 15:14:00,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:00,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:00,626 INFO L272 TraceCheckUtils]: 0: Hoare triple {85238#true} call ULTIMATE.init(); {85238#true} is VALID [2022-04-15 15:14:00,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {85238#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; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,627 INFO L290 TraceCheckUtils]: 2: Hoare triple {85246#(<= ~counter~0 0)} assume true; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,627 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85246#(<= ~counter~0 0)} {85238#true} #102#return; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,627 INFO L272 TraceCheckUtils]: 4: Hoare triple {85246#(<= ~counter~0 0)} call #t~ret9 := main(); {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {85246#(<= ~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; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,628 INFO L272 TraceCheckUtils]: 6: Hoare triple {85246#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {85246#(<= ~counter~0 0)} ~cond := #in~cond; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,628 INFO L290 TraceCheckUtils]: 8: Hoare triple {85246#(<= ~counter~0 0)} assume !(0 == ~cond); {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {85246#(<= ~counter~0 0)} assume true; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,629 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85246#(<= ~counter~0 0)} {85246#(<= ~counter~0 0)} #90#return; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,630 INFO L272 TraceCheckUtils]: 11: Hoare triple {85246#(<= ~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)); {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {85246#(<= ~counter~0 0)} ~cond := #in~cond; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {85246#(<= ~counter~0 0)} assume !(0 == ~cond); {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {85246#(<= ~counter~0 0)} assume true; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,631 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85246#(<= ~counter~0 0)} {85246#(<= ~counter~0 0)} #92#return; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {85246#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {85246#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:00,633 INFO L290 TraceCheckUtils]: 17: Hoare triple {85246#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85295#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:00,633 INFO L290 TraceCheckUtils]: 18: Hoare triple {85295#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {85295#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:00,633 INFO L272 TraceCheckUtils]: 19: Hoare triple {85295#(<= ~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)); {85295#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:00,634 INFO L290 TraceCheckUtils]: 20: Hoare triple {85295#(<= ~counter~0 1)} ~cond := #in~cond; {85295#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:00,634 INFO L290 TraceCheckUtils]: 21: Hoare triple {85295#(<= ~counter~0 1)} assume !(0 == ~cond); {85295#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:00,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {85295#(<= ~counter~0 1)} assume true; {85295#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:00,635 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {85295#(<= ~counter~0 1)} {85295#(<= ~counter~0 1)} #94#return; {85295#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:00,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {85295#(<= ~counter~0 1)} assume !!(0 != ~r~0); {85295#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:00,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {85295#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85320#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:00,636 INFO L290 TraceCheckUtils]: 26: Hoare triple {85320#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {85320#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:00,637 INFO L272 TraceCheckUtils]: 27: Hoare triple {85320#(<= ~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)); {85320#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:00,637 INFO L290 TraceCheckUtils]: 28: Hoare triple {85320#(<= ~counter~0 2)} ~cond := #in~cond; {85320#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:00,637 INFO L290 TraceCheckUtils]: 29: Hoare triple {85320#(<= ~counter~0 2)} assume !(0 == ~cond); {85320#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:00,637 INFO L290 TraceCheckUtils]: 30: Hoare triple {85320#(<= ~counter~0 2)} assume true; {85320#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:00,638 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {85320#(<= ~counter~0 2)} {85320#(<= ~counter~0 2)} #96#return; {85320#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:00,638 INFO L290 TraceCheckUtils]: 32: Hoare triple {85320#(<= ~counter~0 2)} assume !(~r~0 > 0); {85320#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:00,639 INFO L290 TraceCheckUtils]: 33: Hoare triple {85320#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85345#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:00,639 INFO L290 TraceCheckUtils]: 34: Hoare triple {85345#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {85345#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:00,640 INFO L272 TraceCheckUtils]: 35: Hoare triple {85345#(<= ~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)); {85345#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:00,640 INFO L290 TraceCheckUtils]: 36: Hoare triple {85345#(<= ~counter~0 3)} ~cond := #in~cond; {85345#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:00,640 INFO L290 TraceCheckUtils]: 37: Hoare triple {85345#(<= ~counter~0 3)} assume !(0 == ~cond); {85345#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:00,641 INFO L290 TraceCheckUtils]: 38: Hoare triple {85345#(<= ~counter~0 3)} assume true; {85345#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:00,641 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {85345#(<= ~counter~0 3)} {85345#(<= ~counter~0 3)} #98#return; {85345#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:00,641 INFO L290 TraceCheckUtils]: 40: Hoare triple {85345#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85345#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:00,642 INFO L290 TraceCheckUtils]: 41: Hoare triple {85345#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85370#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:00,642 INFO L290 TraceCheckUtils]: 42: Hoare triple {85370#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {85370#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:00,643 INFO L272 TraceCheckUtils]: 43: Hoare triple {85370#(<= ~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)); {85370#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:00,643 INFO L290 TraceCheckUtils]: 44: Hoare triple {85370#(<= ~counter~0 4)} ~cond := #in~cond; {85370#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:00,644 INFO L290 TraceCheckUtils]: 45: Hoare triple {85370#(<= ~counter~0 4)} assume !(0 == ~cond); {85370#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:00,644 INFO L290 TraceCheckUtils]: 46: Hoare triple {85370#(<= ~counter~0 4)} assume true; {85370#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:00,644 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {85370#(<= ~counter~0 4)} {85370#(<= ~counter~0 4)} #98#return; {85370#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:00,645 INFO L290 TraceCheckUtils]: 48: Hoare triple {85370#(<= ~counter~0 4)} assume !(~r~0 < 0); {85370#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:00,645 INFO L290 TraceCheckUtils]: 49: Hoare triple {85370#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85395#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:00,646 INFO L290 TraceCheckUtils]: 50: Hoare triple {85395#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {85395#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:00,646 INFO L272 TraceCheckUtils]: 51: Hoare triple {85395#(<= ~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)); {85395#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:00,646 INFO L290 TraceCheckUtils]: 52: Hoare triple {85395#(<= ~counter~0 5)} ~cond := #in~cond; {85395#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:00,647 INFO L290 TraceCheckUtils]: 53: Hoare triple {85395#(<= ~counter~0 5)} assume !(0 == ~cond); {85395#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:00,647 INFO L290 TraceCheckUtils]: 54: Hoare triple {85395#(<= ~counter~0 5)} assume true; {85395#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:00,647 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {85395#(<= ~counter~0 5)} {85395#(<= ~counter~0 5)} #94#return; {85395#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:00,648 INFO L290 TraceCheckUtils]: 56: Hoare triple {85395#(<= ~counter~0 5)} assume !!(0 != ~r~0); {85395#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:00,649 INFO L290 TraceCheckUtils]: 57: Hoare triple {85395#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85420#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:00,649 INFO L290 TraceCheckUtils]: 58: Hoare triple {85420#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {85420#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:00,649 INFO L272 TraceCheckUtils]: 59: Hoare triple {85420#(<= ~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)); {85420#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:00,650 INFO L290 TraceCheckUtils]: 60: Hoare triple {85420#(<= ~counter~0 6)} ~cond := #in~cond; {85420#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:00,650 INFO L290 TraceCheckUtils]: 61: Hoare triple {85420#(<= ~counter~0 6)} assume !(0 == ~cond); {85420#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:00,650 INFO L290 TraceCheckUtils]: 62: Hoare triple {85420#(<= ~counter~0 6)} assume true; {85420#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:00,651 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {85420#(<= ~counter~0 6)} {85420#(<= ~counter~0 6)} #96#return; {85420#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:00,651 INFO L290 TraceCheckUtils]: 64: Hoare triple {85420#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85420#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:00,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {85420#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85445#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:00,652 INFO L290 TraceCheckUtils]: 66: Hoare triple {85445#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {85445#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:00,652 INFO L272 TraceCheckUtils]: 67: Hoare triple {85445#(<= ~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)); {85445#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:00,653 INFO L290 TraceCheckUtils]: 68: Hoare triple {85445#(<= ~counter~0 7)} ~cond := #in~cond; {85445#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:00,653 INFO L290 TraceCheckUtils]: 69: Hoare triple {85445#(<= ~counter~0 7)} assume !(0 == ~cond); {85445#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:00,653 INFO L290 TraceCheckUtils]: 70: Hoare triple {85445#(<= ~counter~0 7)} assume true; {85445#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:00,654 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {85445#(<= ~counter~0 7)} {85445#(<= ~counter~0 7)} #96#return; {85445#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:00,654 INFO L290 TraceCheckUtils]: 72: Hoare triple {85445#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85445#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:00,655 INFO L290 TraceCheckUtils]: 73: Hoare triple {85445#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85470#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:00,655 INFO L290 TraceCheckUtils]: 74: Hoare triple {85470#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {85470#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:00,656 INFO L272 TraceCheckUtils]: 75: Hoare triple {85470#(<= ~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)); {85470#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:00,656 INFO L290 TraceCheckUtils]: 76: Hoare triple {85470#(<= ~counter~0 8)} ~cond := #in~cond; {85470#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:00,656 INFO L290 TraceCheckUtils]: 77: Hoare triple {85470#(<= ~counter~0 8)} assume !(0 == ~cond); {85470#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:00,656 INFO L290 TraceCheckUtils]: 78: Hoare triple {85470#(<= ~counter~0 8)} assume true; {85470#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:00,657 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {85470#(<= ~counter~0 8)} {85470#(<= ~counter~0 8)} #96#return; {85470#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:00,657 INFO L290 TraceCheckUtils]: 80: Hoare triple {85470#(<= ~counter~0 8)} assume !(~r~0 > 0); {85470#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:00,658 INFO L290 TraceCheckUtils]: 81: Hoare triple {85470#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85495#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:00,658 INFO L290 TraceCheckUtils]: 82: Hoare triple {85495#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {85495#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:00,659 INFO L272 TraceCheckUtils]: 83: Hoare triple {85495#(<= ~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)); {85495#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:00,659 INFO L290 TraceCheckUtils]: 84: Hoare triple {85495#(<= ~counter~0 9)} ~cond := #in~cond; {85495#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:00,659 INFO L290 TraceCheckUtils]: 85: Hoare triple {85495#(<= ~counter~0 9)} assume !(0 == ~cond); {85495#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:00,660 INFO L290 TraceCheckUtils]: 86: Hoare triple {85495#(<= ~counter~0 9)} assume true; {85495#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:00,660 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {85495#(<= ~counter~0 9)} {85495#(<= ~counter~0 9)} #98#return; {85495#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:00,660 INFO L290 TraceCheckUtils]: 88: Hoare triple {85495#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85495#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:00,661 INFO L290 TraceCheckUtils]: 89: Hoare triple {85495#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85520#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:00,661 INFO L290 TraceCheckUtils]: 90: Hoare triple {85520#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {85520#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:00,662 INFO L272 TraceCheckUtils]: 91: Hoare triple {85520#(<= ~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)); {85520#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:00,662 INFO L290 TraceCheckUtils]: 92: Hoare triple {85520#(<= ~counter~0 10)} ~cond := #in~cond; {85520#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:00,662 INFO L290 TraceCheckUtils]: 93: Hoare triple {85520#(<= ~counter~0 10)} assume !(0 == ~cond); {85520#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:00,663 INFO L290 TraceCheckUtils]: 94: Hoare triple {85520#(<= ~counter~0 10)} assume true; {85520#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:00,663 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {85520#(<= ~counter~0 10)} {85520#(<= ~counter~0 10)} #98#return; {85520#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:00,663 INFO L290 TraceCheckUtils]: 96: Hoare triple {85520#(<= ~counter~0 10)} assume !(~r~0 < 0); {85520#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:00,664 INFO L290 TraceCheckUtils]: 97: Hoare triple {85520#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85545#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:00,665 INFO L290 TraceCheckUtils]: 98: Hoare triple {85545#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {85545#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:00,665 INFO L272 TraceCheckUtils]: 99: Hoare triple {85545#(<= ~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)); {85545#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:00,665 INFO L290 TraceCheckUtils]: 100: Hoare triple {85545#(<= ~counter~0 11)} ~cond := #in~cond; {85545#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:00,666 INFO L290 TraceCheckUtils]: 101: Hoare triple {85545#(<= ~counter~0 11)} assume !(0 == ~cond); {85545#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:00,666 INFO L290 TraceCheckUtils]: 102: Hoare triple {85545#(<= ~counter~0 11)} assume true; {85545#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:00,666 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {85545#(<= ~counter~0 11)} {85545#(<= ~counter~0 11)} #94#return; {85545#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:00,667 INFO L290 TraceCheckUtils]: 104: Hoare triple {85545#(<= ~counter~0 11)} assume !!(0 != ~r~0); {85545#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:00,667 INFO L290 TraceCheckUtils]: 105: Hoare triple {85545#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85570#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:00,668 INFO L290 TraceCheckUtils]: 106: Hoare triple {85570#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {85570#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:00,668 INFO L272 TraceCheckUtils]: 107: Hoare triple {85570#(<= ~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)); {85570#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:00,668 INFO L290 TraceCheckUtils]: 108: Hoare triple {85570#(<= ~counter~0 12)} ~cond := #in~cond; {85570#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:00,669 INFO L290 TraceCheckUtils]: 109: Hoare triple {85570#(<= ~counter~0 12)} assume !(0 == ~cond); {85570#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:00,669 INFO L290 TraceCheckUtils]: 110: Hoare triple {85570#(<= ~counter~0 12)} assume true; {85570#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:00,670 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {85570#(<= ~counter~0 12)} {85570#(<= ~counter~0 12)} #96#return; {85570#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:00,670 INFO L290 TraceCheckUtils]: 112: Hoare triple {85570#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85570#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:00,670 INFO L290 TraceCheckUtils]: 113: Hoare triple {85570#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85595#(<= |main_#t~post7| 12)} is VALID [2022-04-15 15:14:00,670 INFO L290 TraceCheckUtils]: 114: Hoare triple {85595#(<= |main_#t~post7| 12)} assume !(#t~post7 < 100);havoc #t~post7; {85239#false} is VALID [2022-04-15 15:14:00,671 INFO L290 TraceCheckUtils]: 115: Hoare triple {85239#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85239#false} is VALID [2022-04-15 15:14:00,671 INFO L290 TraceCheckUtils]: 116: Hoare triple {85239#false} assume !(#t~post8 < 100);havoc #t~post8; {85239#false} is VALID [2022-04-15 15:14:00,671 INFO L290 TraceCheckUtils]: 117: Hoare triple {85239#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85239#false} is VALID [2022-04-15 15:14:00,671 INFO L290 TraceCheckUtils]: 118: Hoare triple {85239#false} assume !(#t~post6 < 100);havoc #t~post6; {85239#false} is VALID [2022-04-15 15:14:00,671 INFO L272 TraceCheckUtils]: 119: Hoare triple {85239#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)); {85239#false} is VALID [2022-04-15 15:14:00,671 INFO L290 TraceCheckUtils]: 120: Hoare triple {85239#false} ~cond := #in~cond; {85239#false} is VALID [2022-04-15 15:14:00,671 INFO L290 TraceCheckUtils]: 121: Hoare triple {85239#false} assume 0 == ~cond; {85239#false} is VALID [2022-04-15 15:14:00,671 INFO L290 TraceCheckUtils]: 122: Hoare triple {85239#false} assume !false; {85239#false} is VALID [2022-04-15 15:14:00,672 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 350 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:14:00,672 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:01,366 INFO L290 TraceCheckUtils]: 122: Hoare triple {85239#false} assume !false; {85239#false} is VALID [2022-04-15 15:14:01,367 INFO L290 TraceCheckUtils]: 121: Hoare triple {85239#false} assume 0 == ~cond; {85239#false} is VALID [2022-04-15 15:14:01,367 INFO L290 TraceCheckUtils]: 120: Hoare triple {85239#false} ~cond := #in~cond; {85239#false} is VALID [2022-04-15 15:14:01,367 INFO L272 TraceCheckUtils]: 119: Hoare triple {85239#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)); {85239#false} is VALID [2022-04-15 15:14:01,367 INFO L290 TraceCheckUtils]: 118: Hoare triple {85239#false} assume !(#t~post6 < 100);havoc #t~post6; {85239#false} is VALID [2022-04-15 15:14:01,367 INFO L290 TraceCheckUtils]: 117: Hoare triple {85239#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85239#false} is VALID [2022-04-15 15:14:01,367 INFO L290 TraceCheckUtils]: 116: Hoare triple {85239#false} assume !(#t~post8 < 100);havoc #t~post8; {85239#false} is VALID [2022-04-15 15:14:01,367 INFO L290 TraceCheckUtils]: 115: Hoare triple {85239#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85239#false} is VALID [2022-04-15 15:14:01,367 INFO L290 TraceCheckUtils]: 114: Hoare triple {85647#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {85239#false} is VALID [2022-04-15 15:14:01,368 INFO L290 TraceCheckUtils]: 113: Hoare triple {85651#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85647#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:14:01,368 INFO L290 TraceCheckUtils]: 112: Hoare triple {85651#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85651#(< ~counter~0 100)} is VALID [2022-04-15 15:14:01,368 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {85238#true} {85651#(< ~counter~0 100)} #96#return; {85651#(< ~counter~0 100)} is VALID [2022-04-15 15:14:01,369 INFO L290 TraceCheckUtils]: 110: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,369 INFO L290 TraceCheckUtils]: 109: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,369 INFO L290 TraceCheckUtils]: 108: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,369 INFO L272 TraceCheckUtils]: 107: Hoare triple {85651#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,369 INFO L290 TraceCheckUtils]: 106: Hoare triple {85651#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {85651#(< ~counter~0 100)} is VALID [2022-04-15 15:14:01,371 INFO L290 TraceCheckUtils]: 105: Hoare triple {85676#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85651#(< ~counter~0 100)} is VALID [2022-04-15 15:14:01,371 INFO L290 TraceCheckUtils]: 104: Hoare triple {85676#(< ~counter~0 99)} assume !!(0 != ~r~0); {85676#(< ~counter~0 99)} is VALID [2022-04-15 15:14:01,372 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {85238#true} {85676#(< ~counter~0 99)} #94#return; {85676#(< ~counter~0 99)} is VALID [2022-04-15 15:14:01,372 INFO L290 TraceCheckUtils]: 102: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,372 INFO L290 TraceCheckUtils]: 101: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,372 INFO L290 TraceCheckUtils]: 100: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,372 INFO L272 TraceCheckUtils]: 99: Hoare triple {85676#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,372 INFO L290 TraceCheckUtils]: 98: Hoare triple {85676#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {85676#(< ~counter~0 99)} is VALID [2022-04-15 15:14:01,373 INFO L290 TraceCheckUtils]: 97: Hoare triple {85701#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85676#(< ~counter~0 99)} is VALID [2022-04-15 15:14:01,373 INFO L290 TraceCheckUtils]: 96: Hoare triple {85701#(< ~counter~0 98)} assume !(~r~0 < 0); {85701#(< ~counter~0 98)} is VALID [2022-04-15 15:14:01,374 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {85238#true} {85701#(< ~counter~0 98)} #98#return; {85701#(< ~counter~0 98)} is VALID [2022-04-15 15:14:01,374 INFO L290 TraceCheckUtils]: 94: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,374 INFO L290 TraceCheckUtils]: 93: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,374 INFO L290 TraceCheckUtils]: 92: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,374 INFO L272 TraceCheckUtils]: 91: Hoare triple {85701#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,374 INFO L290 TraceCheckUtils]: 90: Hoare triple {85701#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {85701#(< ~counter~0 98)} is VALID [2022-04-15 15:14:01,375 INFO L290 TraceCheckUtils]: 89: Hoare triple {85726#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85701#(< ~counter~0 98)} is VALID [2022-04-15 15:14:01,375 INFO L290 TraceCheckUtils]: 88: Hoare triple {85726#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85726#(< ~counter~0 97)} is VALID [2022-04-15 15:14:01,376 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {85238#true} {85726#(< ~counter~0 97)} #98#return; {85726#(< ~counter~0 97)} is VALID [2022-04-15 15:14:01,376 INFO L290 TraceCheckUtils]: 86: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,376 INFO L290 TraceCheckUtils]: 85: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,376 INFO L290 TraceCheckUtils]: 84: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,376 INFO L272 TraceCheckUtils]: 83: Hoare triple {85726#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,376 INFO L290 TraceCheckUtils]: 82: Hoare triple {85726#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {85726#(< ~counter~0 97)} is VALID [2022-04-15 15:14:01,377 INFO L290 TraceCheckUtils]: 81: Hoare triple {85751#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85726#(< ~counter~0 97)} is VALID [2022-04-15 15:14:01,377 INFO L290 TraceCheckUtils]: 80: Hoare triple {85751#(< ~counter~0 96)} assume !(~r~0 > 0); {85751#(< ~counter~0 96)} is VALID [2022-04-15 15:14:01,378 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {85238#true} {85751#(< ~counter~0 96)} #96#return; {85751#(< ~counter~0 96)} is VALID [2022-04-15 15:14:01,378 INFO L290 TraceCheckUtils]: 78: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,378 INFO L290 TraceCheckUtils]: 77: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,378 INFO L290 TraceCheckUtils]: 76: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,378 INFO L272 TraceCheckUtils]: 75: Hoare triple {85751#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,378 INFO L290 TraceCheckUtils]: 74: Hoare triple {85751#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {85751#(< ~counter~0 96)} is VALID [2022-04-15 15:14:01,379 INFO L290 TraceCheckUtils]: 73: Hoare triple {85776#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85751#(< ~counter~0 96)} is VALID [2022-04-15 15:14:01,380 INFO L290 TraceCheckUtils]: 72: Hoare triple {85776#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85776#(< ~counter~0 95)} is VALID [2022-04-15 15:14:01,380 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {85238#true} {85776#(< ~counter~0 95)} #96#return; {85776#(< ~counter~0 95)} is VALID [2022-04-15 15:14:01,380 INFO L290 TraceCheckUtils]: 70: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,380 INFO L290 TraceCheckUtils]: 69: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,380 INFO L290 TraceCheckUtils]: 68: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,380 INFO L272 TraceCheckUtils]: 67: Hoare triple {85776#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,381 INFO L290 TraceCheckUtils]: 66: Hoare triple {85776#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {85776#(< ~counter~0 95)} is VALID [2022-04-15 15:14:01,381 INFO L290 TraceCheckUtils]: 65: Hoare triple {85801#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85776#(< ~counter~0 95)} is VALID [2022-04-15 15:14:01,382 INFO L290 TraceCheckUtils]: 64: Hoare triple {85801#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {85801#(< ~counter~0 94)} is VALID [2022-04-15 15:14:01,382 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {85238#true} {85801#(< ~counter~0 94)} #96#return; {85801#(< ~counter~0 94)} is VALID [2022-04-15 15:14:01,382 INFO L290 TraceCheckUtils]: 62: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,382 INFO L290 TraceCheckUtils]: 61: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,382 INFO L290 TraceCheckUtils]: 60: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,382 INFO L272 TraceCheckUtils]: 59: Hoare triple {85801#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,383 INFO L290 TraceCheckUtils]: 58: Hoare triple {85801#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {85801#(< ~counter~0 94)} is VALID [2022-04-15 15:14:01,384 INFO L290 TraceCheckUtils]: 57: Hoare triple {85826#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85801#(< ~counter~0 94)} is VALID [2022-04-15 15:14:01,384 INFO L290 TraceCheckUtils]: 56: Hoare triple {85826#(< ~counter~0 93)} assume !!(0 != ~r~0); {85826#(< ~counter~0 93)} is VALID [2022-04-15 15:14:01,384 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {85238#true} {85826#(< ~counter~0 93)} #94#return; {85826#(< ~counter~0 93)} is VALID [2022-04-15 15:14:01,384 INFO L290 TraceCheckUtils]: 54: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,384 INFO L290 TraceCheckUtils]: 53: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,385 INFO L290 TraceCheckUtils]: 52: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,385 INFO L272 TraceCheckUtils]: 51: Hoare triple {85826#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,385 INFO L290 TraceCheckUtils]: 50: Hoare triple {85826#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {85826#(< ~counter~0 93)} is VALID [2022-04-15 15:14:01,386 INFO L290 TraceCheckUtils]: 49: Hoare triple {85851#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85826#(< ~counter~0 93)} is VALID [2022-04-15 15:14:01,386 INFO L290 TraceCheckUtils]: 48: Hoare triple {85851#(< ~counter~0 92)} assume !(~r~0 < 0); {85851#(< ~counter~0 92)} is VALID [2022-04-15 15:14:01,386 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {85238#true} {85851#(< ~counter~0 92)} #98#return; {85851#(< ~counter~0 92)} is VALID [2022-04-15 15:14:01,387 INFO L290 TraceCheckUtils]: 46: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,387 INFO L290 TraceCheckUtils]: 45: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,387 INFO L290 TraceCheckUtils]: 44: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,387 INFO L272 TraceCheckUtils]: 43: Hoare triple {85851#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,387 INFO L290 TraceCheckUtils]: 42: Hoare triple {85851#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {85851#(< ~counter~0 92)} is VALID [2022-04-15 15:14:01,388 INFO L290 TraceCheckUtils]: 41: Hoare triple {85876#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85851#(< ~counter~0 92)} is VALID [2022-04-15 15:14:01,388 INFO L290 TraceCheckUtils]: 40: Hoare triple {85876#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {85876#(< ~counter~0 91)} is VALID [2022-04-15 15:14:01,389 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {85238#true} {85876#(< ~counter~0 91)} #98#return; {85876#(< ~counter~0 91)} is VALID [2022-04-15 15:14:01,389 INFO L290 TraceCheckUtils]: 38: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,389 INFO L290 TraceCheckUtils]: 37: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,389 INFO L272 TraceCheckUtils]: 35: Hoare triple {85876#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {85876#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {85876#(< ~counter~0 91)} is VALID [2022-04-15 15:14:01,390 INFO L290 TraceCheckUtils]: 33: Hoare triple {85901#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {85876#(< ~counter~0 91)} is VALID [2022-04-15 15:14:01,390 INFO L290 TraceCheckUtils]: 32: Hoare triple {85901#(< ~counter~0 90)} assume !(~r~0 > 0); {85901#(< ~counter~0 90)} is VALID [2022-04-15 15:14:01,391 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {85238#true} {85901#(< ~counter~0 90)} #96#return; {85901#(< ~counter~0 90)} is VALID [2022-04-15 15:14:01,391 INFO L290 TraceCheckUtils]: 30: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,391 INFO L290 TraceCheckUtils]: 29: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,391 INFO L290 TraceCheckUtils]: 28: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,391 INFO L272 TraceCheckUtils]: 27: Hoare triple {85901#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,391 INFO L290 TraceCheckUtils]: 26: Hoare triple {85901#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {85901#(< ~counter~0 90)} is VALID [2022-04-15 15:14:01,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {85926#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {85901#(< ~counter~0 90)} is VALID [2022-04-15 15:14:01,392 INFO L290 TraceCheckUtils]: 24: Hoare triple {85926#(< ~counter~0 89)} assume !!(0 != ~r~0); {85926#(< ~counter~0 89)} is VALID [2022-04-15 15:14:01,393 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {85238#true} {85926#(< ~counter~0 89)} #94#return; {85926#(< ~counter~0 89)} is VALID [2022-04-15 15:14:01,393 INFO L290 TraceCheckUtils]: 22: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,393 INFO L290 TraceCheckUtils]: 21: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,393 INFO L290 TraceCheckUtils]: 20: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,393 INFO L272 TraceCheckUtils]: 19: Hoare triple {85926#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,393 INFO L290 TraceCheckUtils]: 18: Hoare triple {85926#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {85926#(< ~counter~0 89)} is VALID [2022-04-15 15:14:01,394 INFO L290 TraceCheckUtils]: 17: Hoare triple {85951#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {85926#(< ~counter~0 89)} is VALID [2022-04-15 15:14:01,395 INFO L290 TraceCheckUtils]: 16: Hoare triple {85951#(< ~counter~0 88)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {85951#(< ~counter~0 88)} is VALID [2022-04-15 15:14:01,395 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {85238#true} {85951#(< ~counter~0 88)} #92#return; {85951#(< ~counter~0 88)} is VALID [2022-04-15 15:14:01,395 INFO L290 TraceCheckUtils]: 14: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,395 INFO L290 TraceCheckUtils]: 13: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,395 INFO L272 TraceCheckUtils]: 11: Hoare triple {85951#(< ~counter~0 88)} 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)); {85238#true} is VALID [2022-04-15 15:14:01,396 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {85238#true} {85951#(< ~counter~0 88)} #90#return; {85951#(< ~counter~0 88)} is VALID [2022-04-15 15:14:01,396 INFO L290 TraceCheckUtils]: 9: Hoare triple {85238#true} assume true; {85238#true} is VALID [2022-04-15 15:14:01,396 INFO L290 TraceCheckUtils]: 8: Hoare triple {85238#true} assume !(0 == ~cond); {85238#true} is VALID [2022-04-15 15:14:01,396 INFO L290 TraceCheckUtils]: 7: Hoare triple {85238#true} ~cond := #in~cond; {85238#true} is VALID [2022-04-15 15:14:01,396 INFO L272 TraceCheckUtils]: 6: Hoare triple {85951#(< ~counter~0 88)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {85238#true} is VALID [2022-04-15 15:14:01,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {85951#(< ~counter~0 88)} 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; {85951#(< ~counter~0 88)} is VALID [2022-04-15 15:14:01,397 INFO L272 TraceCheckUtils]: 4: Hoare triple {85951#(< ~counter~0 88)} call #t~ret9 := main(); {85951#(< ~counter~0 88)} is VALID [2022-04-15 15:14:01,397 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {85951#(< ~counter~0 88)} {85238#true} #102#return; {85951#(< ~counter~0 88)} is VALID [2022-04-15 15:14:01,397 INFO L290 TraceCheckUtils]: 2: Hoare triple {85951#(< ~counter~0 88)} assume true; {85951#(< ~counter~0 88)} is VALID [2022-04-15 15:14:01,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {85238#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; {85951#(< ~counter~0 88)} is VALID [2022-04-15 15:14:01,398 INFO L272 TraceCheckUtils]: 0: Hoare triple {85238#true} call ULTIMATE.init(); {85238#true} is VALID [2022-04-15 15:14:01,398 INFO L134 CoverageAnalysis]: Checked inductivity of 392 backedges. 38 proven. 86 refuted. 0 times theorem prover too weak. 268 trivial. 0 not checked. [2022-04-15 15:14:01,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:01,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039029280] [2022-04-15 15:14:01,398 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:01,398 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1403949853] [2022-04-15 15:14:01,398 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1403949853] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:01,398 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:01,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 30 [2022-04-15 15:14:01,399 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:01,399 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [711518171] [2022-04-15 15:14:01,399 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [711518171] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:01,399 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:01,399 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-04-15 15:14:01,399 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997872983] [2022-04-15 15:14:01,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:01,399 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 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 123 [2022-04-15 15:14:01,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:01,400 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 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-15 15:14:01,500 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:01,500 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-04-15 15:14:01,500 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:01,500 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-04-15 15:14:01,501 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=383, Invalid=487, Unknown=0, NotChecked=0, Total=870 [2022-04-15 15:14:01,501 INFO L87 Difference]: Start difference. First operand 638 states and 866 transitions. Second operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 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-15 15:14:04,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:04,552 INFO L93 Difference]: Finished difference Result 851 states and 1190 transitions. [2022-04-15 15:14:04,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 15:14:04,552 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 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 123 [2022-04-15 15:14:04,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:04,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 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-15 15:14:04,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-15 15:14:04,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 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-15 15:14:04,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 276 transitions. [2022-04-15 15:14:04,557 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 276 transitions. [2022-04-15 15:14:04,802 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 276 edges. 276 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:04,824 INFO L225 Difference]: With dead ends: 851 [2022-04-15 15:14:04,824 INFO L226 Difference]: Without dead ends: 654 [2022-04-15 15:14:04,825 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 256 GetRequests, 217 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=691, Invalid=949, Unknown=0, NotChecked=0, Total=1640 [2022-04-15 15:14:04,825 INFO L913 BasicCegarLoop]: 66 mSDtfsCounter, 221 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 224 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 376 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 224 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:04,825 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 276 Invalid, 376 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [224 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:14:04,826 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 654 states. [2022-04-15 15:14:06,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 654 to 654. [2022-04-15 15:14:06,780 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:06,780 INFO L82 GeneralOperation]: Start isEquivalent. First operand 654 states. Second operand has 654 states, 497 states have (on average 1.215291750503018) internal successors, (604), 497 states have internal predecessors, (604), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:14:06,781 INFO L74 IsIncluded]: Start isIncluded. First operand 654 states. Second operand has 654 states, 497 states have (on average 1.215291750503018) internal successors, (604), 497 states have internal predecessors, (604), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:14:06,781 INFO L87 Difference]: Start difference. First operand 654 states. Second operand has 654 states, 497 states have (on average 1.215291750503018) internal successors, (604), 497 states have internal predecessors, (604), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:14:06,795 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:06,795 INFO L93 Difference]: Finished difference Result 654 states and 882 transitions. [2022-04-15 15:14:06,796 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 882 transitions. [2022-04-15 15:14:06,796 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:06,796 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:06,797 INFO L74 IsIncluded]: Start isIncluded. First operand has 654 states, 497 states have (on average 1.215291750503018) internal successors, (604), 497 states have internal predecessors, (604), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 654 states. [2022-04-15 15:14:06,797 INFO L87 Difference]: Start difference. First operand has 654 states, 497 states have (on average 1.215291750503018) internal successors, (604), 497 states have internal predecessors, (604), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) Second operand 654 states. [2022-04-15 15:14:06,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:06,814 INFO L93 Difference]: Finished difference Result 654 states and 882 transitions. [2022-04-15 15:14:06,814 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 882 transitions. [2022-04-15 15:14:06,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:06,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:06,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:06,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:06,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 654 states, 497 states have (on average 1.215291750503018) internal successors, (604), 497 states have internal predecessors, (604), 140 states have call successors, (140), 18 states have call predecessors, (140), 16 states have return successors, (138), 138 states have call predecessors, (138), 138 states have call successors, (138) [2022-04-15 15:14:06,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 654 states to 654 states and 882 transitions. [2022-04-15 15:14:06,840 INFO L78 Accepts]: Start accepts. Automaton has 654 states and 882 transitions. Word has length 123 [2022-04-15 15:14:06,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:06,840 INFO L478 AbstractCegarLoop]: Abstraction has 654 states and 882 transitions. [2022-04-15 15:14:06,840 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 5.5) internal successors, (88), 15 states have internal predecessors, (88), 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-15 15:14:06,840 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 654 states and 882 transitions. [2022-04-15 15:14:09,107 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 882 edges. 882 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:09,108 INFO L276 IsEmpty]: Start isEmpty. Operand 654 states and 882 transitions. [2022-04-15 15:14:09,109 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 128 [2022-04-15 15:14:09,109 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:09,109 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 7, 7, 7, 5, 4, 4, 4, 4, 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-15 15:14:09,126 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (42)] Ended with exit code 0 [2022-04-15 15:14:09,313 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,42 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:09,314 INFO L403 AbstractCegarLoop]: === Iteration 42 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:09,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:09,314 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 9 times [2022-04-15 15:14:09,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:09,314 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1113877694] [2022-04-15 15:14:09,314 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:09,315 INFO L85 PathProgramCache]: Analyzing trace with hash -992818924, now seen corresponding path program 10 times [2022-04-15 15:14:09,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:09,315 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363529691] [2022-04-15 15:14:09,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:09,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:09,332 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:09,333 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1969960002] [2022-04-15 15:14:09,333 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:14:09,333 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:09,333 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:09,334 INFO L229 MonitoredProcess]: Starting monitored process 43 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:09,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Waiting until timeout for monitored process [2022-04-15 15:14:09,397 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:14:09,397 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:09,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 15:14:09,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:09,424 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:10,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {90345#true} call ULTIMATE.init(); {90345#true} is VALID [2022-04-15 15:14:10,043 INFO L290 TraceCheckUtils]: 1: Hoare triple {90345#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; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,043 INFO L290 TraceCheckUtils]: 2: Hoare triple {90353#(<= ~counter~0 0)} assume true; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {90353#(<= ~counter~0 0)} {90345#true} #102#return; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,044 INFO L272 TraceCheckUtils]: 4: Hoare triple {90353#(<= ~counter~0 0)} call #t~ret9 := main(); {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,044 INFO L290 TraceCheckUtils]: 5: Hoare triple {90353#(<= ~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; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {90353#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,045 INFO L290 TraceCheckUtils]: 7: Hoare triple {90353#(<= ~counter~0 0)} ~cond := #in~cond; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,045 INFO L290 TraceCheckUtils]: 8: Hoare triple {90353#(<= ~counter~0 0)} assume !(0 == ~cond); {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {90353#(<= ~counter~0 0)} assume true; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,046 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {90353#(<= ~counter~0 0)} {90353#(<= ~counter~0 0)} #90#return; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,046 INFO L272 TraceCheckUtils]: 11: Hoare triple {90353#(<= ~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)); {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {90353#(<= ~counter~0 0)} ~cond := #in~cond; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,047 INFO L290 TraceCheckUtils]: 13: Hoare triple {90353#(<= ~counter~0 0)} assume !(0 == ~cond); {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,047 INFO L290 TraceCheckUtils]: 14: Hoare triple {90353#(<= ~counter~0 0)} assume true; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,047 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {90353#(<= ~counter~0 0)} {90353#(<= ~counter~0 0)} #92#return; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {90353#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {90353#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:10,049 INFO L290 TraceCheckUtils]: 17: Hoare triple {90353#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90402#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:10,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {90402#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {90402#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:10,050 INFO L272 TraceCheckUtils]: 19: Hoare triple {90402#(<= ~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)); {90402#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:10,050 INFO L290 TraceCheckUtils]: 20: Hoare triple {90402#(<= ~counter~0 1)} ~cond := #in~cond; {90402#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:10,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {90402#(<= ~counter~0 1)} assume !(0 == ~cond); {90402#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:10,055 INFO L290 TraceCheckUtils]: 22: Hoare triple {90402#(<= ~counter~0 1)} assume true; {90402#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:10,056 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {90402#(<= ~counter~0 1)} {90402#(<= ~counter~0 1)} #94#return; {90402#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:10,056 INFO L290 TraceCheckUtils]: 24: Hoare triple {90402#(<= ~counter~0 1)} assume !!(0 != ~r~0); {90402#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:10,057 INFO L290 TraceCheckUtils]: 25: Hoare triple {90402#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90427#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:10,058 INFO L290 TraceCheckUtils]: 26: Hoare triple {90427#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {90427#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:10,058 INFO L272 TraceCheckUtils]: 27: Hoare triple {90427#(<= ~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)); {90427#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:10,059 INFO L290 TraceCheckUtils]: 28: Hoare triple {90427#(<= ~counter~0 2)} ~cond := #in~cond; {90427#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:10,059 INFO L290 TraceCheckUtils]: 29: Hoare triple {90427#(<= ~counter~0 2)} assume !(0 == ~cond); {90427#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:10,059 INFO L290 TraceCheckUtils]: 30: Hoare triple {90427#(<= ~counter~0 2)} assume true; {90427#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:10,060 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {90427#(<= ~counter~0 2)} {90427#(<= ~counter~0 2)} #96#return; {90427#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:10,060 INFO L290 TraceCheckUtils]: 32: Hoare triple {90427#(<= ~counter~0 2)} assume !(~r~0 > 0); {90427#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:10,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {90427#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90452#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:10,062 INFO L290 TraceCheckUtils]: 34: Hoare triple {90452#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {90452#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:10,062 INFO L272 TraceCheckUtils]: 35: Hoare triple {90452#(<= ~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)); {90452#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:10,063 INFO L290 TraceCheckUtils]: 36: Hoare triple {90452#(<= ~counter~0 3)} ~cond := #in~cond; {90452#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:10,063 INFO L290 TraceCheckUtils]: 37: Hoare triple {90452#(<= ~counter~0 3)} assume !(0 == ~cond); {90452#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:10,064 INFO L290 TraceCheckUtils]: 38: Hoare triple {90452#(<= ~counter~0 3)} assume true; {90452#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:10,064 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {90452#(<= ~counter~0 3)} {90452#(<= ~counter~0 3)} #98#return; {90452#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:10,065 INFO L290 TraceCheckUtils]: 40: Hoare triple {90452#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {90452#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:10,066 INFO L290 TraceCheckUtils]: 41: Hoare triple {90452#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90477#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:10,066 INFO L290 TraceCheckUtils]: 42: Hoare triple {90477#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {90477#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:10,067 INFO L272 TraceCheckUtils]: 43: Hoare triple {90477#(<= ~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)); {90477#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:10,067 INFO L290 TraceCheckUtils]: 44: Hoare triple {90477#(<= ~counter~0 4)} ~cond := #in~cond; {90477#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:10,068 INFO L290 TraceCheckUtils]: 45: Hoare triple {90477#(<= ~counter~0 4)} assume !(0 == ~cond); {90477#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:10,068 INFO L290 TraceCheckUtils]: 46: Hoare triple {90477#(<= ~counter~0 4)} assume true; {90477#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:10,069 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {90477#(<= ~counter~0 4)} {90477#(<= ~counter~0 4)} #98#return; {90477#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:10,069 INFO L290 TraceCheckUtils]: 48: Hoare triple {90477#(<= ~counter~0 4)} assume !(~r~0 < 0); {90477#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:10,070 INFO L290 TraceCheckUtils]: 49: Hoare triple {90477#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90502#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:10,071 INFO L290 TraceCheckUtils]: 50: Hoare triple {90502#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {90502#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:10,072 INFO L272 TraceCheckUtils]: 51: Hoare triple {90502#(<= ~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)); {90502#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:10,072 INFO L290 TraceCheckUtils]: 52: Hoare triple {90502#(<= ~counter~0 5)} ~cond := #in~cond; {90502#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:10,072 INFO L290 TraceCheckUtils]: 53: Hoare triple {90502#(<= ~counter~0 5)} assume !(0 == ~cond); {90502#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:10,073 INFO L290 TraceCheckUtils]: 54: Hoare triple {90502#(<= ~counter~0 5)} assume true; {90502#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:10,073 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {90502#(<= ~counter~0 5)} {90502#(<= ~counter~0 5)} #94#return; {90502#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:10,074 INFO L290 TraceCheckUtils]: 56: Hoare triple {90502#(<= ~counter~0 5)} assume !!(0 != ~r~0); {90502#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:10,075 INFO L290 TraceCheckUtils]: 57: Hoare triple {90502#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90527#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:10,075 INFO L290 TraceCheckUtils]: 58: Hoare triple {90527#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {90527#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:10,076 INFO L272 TraceCheckUtils]: 59: Hoare triple {90527#(<= ~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)); {90527#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:10,076 INFO L290 TraceCheckUtils]: 60: Hoare triple {90527#(<= ~counter~0 6)} ~cond := #in~cond; {90527#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:10,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {90527#(<= ~counter~0 6)} assume !(0 == ~cond); {90527#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:10,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {90527#(<= ~counter~0 6)} assume true; {90527#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:10,078 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {90527#(<= ~counter~0 6)} {90527#(<= ~counter~0 6)} #96#return; {90527#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:10,078 INFO L290 TraceCheckUtils]: 64: Hoare triple {90527#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90527#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:10,079 INFO L290 TraceCheckUtils]: 65: Hoare triple {90527#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90552#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:10,080 INFO L290 TraceCheckUtils]: 66: Hoare triple {90552#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {90552#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:10,081 INFO L272 TraceCheckUtils]: 67: Hoare triple {90552#(<= ~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)); {90552#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:10,081 INFO L290 TraceCheckUtils]: 68: Hoare triple {90552#(<= ~counter~0 7)} ~cond := #in~cond; {90552#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:10,081 INFO L290 TraceCheckUtils]: 69: Hoare triple {90552#(<= ~counter~0 7)} assume !(0 == ~cond); {90552#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:10,082 INFO L290 TraceCheckUtils]: 70: Hoare triple {90552#(<= ~counter~0 7)} assume true; {90552#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:10,082 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {90552#(<= ~counter~0 7)} {90552#(<= ~counter~0 7)} #96#return; {90552#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:10,083 INFO L290 TraceCheckUtils]: 72: Hoare triple {90552#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90552#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:10,084 INFO L290 TraceCheckUtils]: 73: Hoare triple {90552#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90577#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:10,084 INFO L290 TraceCheckUtils]: 74: Hoare triple {90577#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {90577#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:10,085 INFO L272 TraceCheckUtils]: 75: Hoare triple {90577#(<= ~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)); {90577#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:10,085 INFO L290 TraceCheckUtils]: 76: Hoare triple {90577#(<= ~counter~0 8)} ~cond := #in~cond; {90577#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:10,086 INFO L290 TraceCheckUtils]: 77: Hoare triple {90577#(<= ~counter~0 8)} assume !(0 == ~cond); {90577#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:10,086 INFO L290 TraceCheckUtils]: 78: Hoare triple {90577#(<= ~counter~0 8)} assume true; {90577#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:10,087 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {90577#(<= ~counter~0 8)} {90577#(<= ~counter~0 8)} #96#return; {90577#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:10,087 INFO L290 TraceCheckUtils]: 80: Hoare triple {90577#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90577#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:10,088 INFO L290 TraceCheckUtils]: 81: Hoare triple {90577#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90602#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:10,089 INFO L290 TraceCheckUtils]: 82: Hoare triple {90602#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {90602#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:10,089 INFO L272 TraceCheckUtils]: 83: Hoare triple {90602#(<= ~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)); {90602#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:10,090 INFO L290 TraceCheckUtils]: 84: Hoare triple {90602#(<= ~counter~0 9)} ~cond := #in~cond; {90602#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:10,090 INFO L290 TraceCheckUtils]: 85: Hoare triple {90602#(<= ~counter~0 9)} assume !(0 == ~cond); {90602#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:10,091 INFO L290 TraceCheckUtils]: 86: Hoare triple {90602#(<= ~counter~0 9)} assume true; {90602#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:10,091 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {90602#(<= ~counter~0 9)} {90602#(<= ~counter~0 9)} #96#return; {90602#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:10,092 INFO L290 TraceCheckUtils]: 88: Hoare triple {90602#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90602#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:10,093 INFO L290 TraceCheckUtils]: 89: Hoare triple {90602#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90627#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:10,093 INFO L290 TraceCheckUtils]: 90: Hoare triple {90627#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {90627#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:10,094 INFO L272 TraceCheckUtils]: 91: Hoare triple {90627#(<= ~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)); {90627#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:10,094 INFO L290 TraceCheckUtils]: 92: Hoare triple {90627#(<= ~counter~0 10)} ~cond := #in~cond; {90627#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:10,095 INFO L290 TraceCheckUtils]: 93: Hoare triple {90627#(<= ~counter~0 10)} assume !(0 == ~cond); {90627#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:10,095 INFO L290 TraceCheckUtils]: 94: Hoare triple {90627#(<= ~counter~0 10)} assume true; {90627#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:10,096 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {90627#(<= ~counter~0 10)} {90627#(<= ~counter~0 10)} #96#return; {90627#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:10,096 INFO L290 TraceCheckUtils]: 96: Hoare triple {90627#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90627#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:10,097 INFO L290 TraceCheckUtils]: 97: Hoare triple {90627#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90652#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:10,097 INFO L290 TraceCheckUtils]: 98: Hoare triple {90652#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {90652#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:10,098 INFO L272 TraceCheckUtils]: 99: Hoare triple {90652#(<= ~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)); {90652#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:10,099 INFO L290 TraceCheckUtils]: 100: Hoare triple {90652#(<= ~counter~0 11)} ~cond := #in~cond; {90652#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:10,099 INFO L290 TraceCheckUtils]: 101: Hoare triple {90652#(<= ~counter~0 11)} assume !(0 == ~cond); {90652#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:10,099 INFO L290 TraceCheckUtils]: 102: Hoare triple {90652#(<= ~counter~0 11)} assume true; {90652#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:10,100 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {90652#(<= ~counter~0 11)} {90652#(<= ~counter~0 11)} #96#return; {90652#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:10,100 INFO L290 TraceCheckUtils]: 104: Hoare triple {90652#(<= ~counter~0 11)} assume !(~r~0 > 0); {90652#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:10,101 INFO L290 TraceCheckUtils]: 105: Hoare triple {90652#(<= ~counter~0 11)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90677#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:10,102 INFO L290 TraceCheckUtils]: 106: Hoare triple {90677#(<= ~counter~0 12)} assume !!(#t~post8 < 100);havoc #t~post8; {90677#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:10,103 INFO L272 TraceCheckUtils]: 107: Hoare triple {90677#(<= ~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)); {90677#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:10,103 INFO L290 TraceCheckUtils]: 108: Hoare triple {90677#(<= ~counter~0 12)} ~cond := #in~cond; {90677#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:10,103 INFO L290 TraceCheckUtils]: 109: Hoare triple {90677#(<= ~counter~0 12)} assume !(0 == ~cond); {90677#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:10,104 INFO L290 TraceCheckUtils]: 110: Hoare triple {90677#(<= ~counter~0 12)} assume true; {90677#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:10,104 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {90677#(<= ~counter~0 12)} {90677#(<= ~counter~0 12)} #98#return; {90677#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:10,105 INFO L290 TraceCheckUtils]: 112: Hoare triple {90677#(<= ~counter~0 12)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {90677#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:10,106 INFO L290 TraceCheckUtils]: 113: Hoare triple {90677#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90702#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:10,107 INFO L290 TraceCheckUtils]: 114: Hoare triple {90702#(<= ~counter~0 13)} assume !!(#t~post8 < 100);havoc #t~post8; {90702#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:10,107 INFO L272 TraceCheckUtils]: 115: Hoare triple {90702#(<= ~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)); {90702#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:10,108 INFO L290 TraceCheckUtils]: 116: Hoare triple {90702#(<= ~counter~0 13)} ~cond := #in~cond; {90702#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:10,108 INFO L290 TraceCheckUtils]: 117: Hoare triple {90702#(<= ~counter~0 13)} assume !(0 == ~cond); {90702#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:10,108 INFO L290 TraceCheckUtils]: 118: Hoare triple {90702#(<= ~counter~0 13)} assume true; {90702#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:10,109 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {90702#(<= ~counter~0 13)} {90702#(<= ~counter~0 13)} #98#return; {90702#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:10,109 INFO L290 TraceCheckUtils]: 120: Hoare triple {90702#(<= ~counter~0 13)} assume !(~r~0 < 0); {90702#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:10,110 INFO L290 TraceCheckUtils]: 121: Hoare triple {90702#(<= ~counter~0 13)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90727#(<= |main_#t~post6| 13)} is VALID [2022-04-15 15:14:10,110 INFO L290 TraceCheckUtils]: 122: Hoare triple {90727#(<= |main_#t~post6| 13)} assume !(#t~post6 < 100);havoc #t~post6; {90346#false} is VALID [2022-04-15 15:14:10,110 INFO L272 TraceCheckUtils]: 123: Hoare triple {90346#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)); {90346#false} is VALID [2022-04-15 15:14:10,111 INFO L290 TraceCheckUtils]: 124: Hoare triple {90346#false} ~cond := #in~cond; {90346#false} is VALID [2022-04-15 15:14:10,111 INFO L290 TraceCheckUtils]: 125: Hoare triple {90346#false} assume 0 == ~cond; {90346#false} is VALID [2022-04-15 15:14:10,111 INFO L290 TraceCheckUtils]: 126: Hoare triple {90346#false} assume !false; {90346#false} is VALID [2022-04-15 15:14:10,111 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 428 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:14:10,111 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:10,851 INFO L290 TraceCheckUtils]: 126: Hoare triple {90346#false} assume !false; {90346#false} is VALID [2022-04-15 15:14:10,851 INFO L290 TraceCheckUtils]: 125: Hoare triple {90346#false} assume 0 == ~cond; {90346#false} is VALID [2022-04-15 15:14:10,852 INFO L290 TraceCheckUtils]: 124: Hoare triple {90346#false} ~cond := #in~cond; {90346#false} is VALID [2022-04-15 15:14:10,852 INFO L272 TraceCheckUtils]: 123: Hoare triple {90346#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)); {90346#false} is VALID [2022-04-15 15:14:10,852 INFO L290 TraceCheckUtils]: 122: Hoare triple {90755#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {90346#false} is VALID [2022-04-15 15:14:10,852 INFO L290 TraceCheckUtils]: 121: Hoare triple {90759#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90755#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:14:10,852 INFO L290 TraceCheckUtils]: 120: Hoare triple {90759#(< ~counter~0 100)} assume !(~r~0 < 0); {90759#(< ~counter~0 100)} is VALID [2022-04-15 15:14:10,853 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {90345#true} {90759#(< ~counter~0 100)} #98#return; {90759#(< ~counter~0 100)} is VALID [2022-04-15 15:14:10,853 INFO L290 TraceCheckUtils]: 118: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,853 INFO L290 TraceCheckUtils]: 117: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,853 INFO L290 TraceCheckUtils]: 116: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,853 INFO L272 TraceCheckUtils]: 115: Hoare triple {90759#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,853 INFO L290 TraceCheckUtils]: 114: Hoare triple {90759#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {90759#(< ~counter~0 100)} is VALID [2022-04-15 15:14:10,855 INFO L290 TraceCheckUtils]: 113: Hoare triple {90784#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90759#(< ~counter~0 100)} is VALID [2022-04-15 15:14:10,856 INFO L290 TraceCheckUtils]: 112: Hoare triple {90784#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {90784#(< ~counter~0 99)} is VALID [2022-04-15 15:14:10,856 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {90345#true} {90784#(< ~counter~0 99)} #98#return; {90784#(< ~counter~0 99)} is VALID [2022-04-15 15:14:10,856 INFO L290 TraceCheckUtils]: 110: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,856 INFO L290 TraceCheckUtils]: 109: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,856 INFO L290 TraceCheckUtils]: 108: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,856 INFO L272 TraceCheckUtils]: 107: Hoare triple {90784#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,857 INFO L290 TraceCheckUtils]: 106: Hoare triple {90784#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {90784#(< ~counter~0 99)} is VALID [2022-04-15 15:14:10,857 INFO L290 TraceCheckUtils]: 105: Hoare triple {90809#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90784#(< ~counter~0 99)} is VALID [2022-04-15 15:14:10,858 INFO L290 TraceCheckUtils]: 104: Hoare triple {90809#(< ~counter~0 98)} assume !(~r~0 > 0); {90809#(< ~counter~0 98)} is VALID [2022-04-15 15:14:10,858 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {90345#true} {90809#(< ~counter~0 98)} #96#return; {90809#(< ~counter~0 98)} is VALID [2022-04-15 15:14:10,858 INFO L290 TraceCheckUtils]: 102: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,858 INFO L290 TraceCheckUtils]: 101: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,858 INFO L290 TraceCheckUtils]: 100: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,858 INFO L272 TraceCheckUtils]: 99: Hoare triple {90809#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,859 INFO L290 TraceCheckUtils]: 98: Hoare triple {90809#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {90809#(< ~counter~0 98)} is VALID [2022-04-15 15:14:10,860 INFO L290 TraceCheckUtils]: 97: Hoare triple {90834#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90809#(< ~counter~0 98)} is VALID [2022-04-15 15:14:10,860 INFO L290 TraceCheckUtils]: 96: Hoare triple {90834#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90834#(< ~counter~0 97)} is VALID [2022-04-15 15:14:10,860 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {90345#true} {90834#(< ~counter~0 97)} #96#return; {90834#(< ~counter~0 97)} is VALID [2022-04-15 15:14:10,860 INFO L290 TraceCheckUtils]: 94: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,860 INFO L290 TraceCheckUtils]: 93: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,860 INFO L290 TraceCheckUtils]: 92: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,861 INFO L272 TraceCheckUtils]: 91: Hoare triple {90834#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,861 INFO L290 TraceCheckUtils]: 90: Hoare triple {90834#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {90834#(< ~counter~0 97)} is VALID [2022-04-15 15:14:10,862 INFO L290 TraceCheckUtils]: 89: Hoare triple {90859#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90834#(< ~counter~0 97)} is VALID [2022-04-15 15:14:10,862 INFO L290 TraceCheckUtils]: 88: Hoare triple {90859#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90859#(< ~counter~0 96)} is VALID [2022-04-15 15:14:10,862 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {90345#true} {90859#(< ~counter~0 96)} #96#return; {90859#(< ~counter~0 96)} is VALID [2022-04-15 15:14:10,862 INFO L290 TraceCheckUtils]: 86: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,863 INFO L290 TraceCheckUtils]: 85: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,863 INFO L290 TraceCheckUtils]: 84: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,863 INFO L272 TraceCheckUtils]: 83: Hoare triple {90859#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {90859#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {90859#(< ~counter~0 96)} is VALID [2022-04-15 15:14:10,864 INFO L290 TraceCheckUtils]: 81: Hoare triple {90884#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90859#(< ~counter~0 96)} is VALID [2022-04-15 15:14:10,864 INFO L290 TraceCheckUtils]: 80: Hoare triple {90884#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90884#(< ~counter~0 95)} is VALID [2022-04-15 15:14:10,864 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {90345#true} {90884#(< ~counter~0 95)} #96#return; {90884#(< ~counter~0 95)} is VALID [2022-04-15 15:14:10,865 INFO L290 TraceCheckUtils]: 78: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,865 INFO L290 TraceCheckUtils]: 77: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,865 INFO L290 TraceCheckUtils]: 76: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,865 INFO L272 TraceCheckUtils]: 75: Hoare triple {90884#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,865 INFO L290 TraceCheckUtils]: 74: Hoare triple {90884#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {90884#(< ~counter~0 95)} is VALID [2022-04-15 15:14:10,866 INFO L290 TraceCheckUtils]: 73: Hoare triple {90909#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90884#(< ~counter~0 95)} is VALID [2022-04-15 15:14:10,866 INFO L290 TraceCheckUtils]: 72: Hoare triple {90909#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90909#(< ~counter~0 94)} is VALID [2022-04-15 15:14:10,867 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {90345#true} {90909#(< ~counter~0 94)} #96#return; {90909#(< ~counter~0 94)} is VALID [2022-04-15 15:14:10,867 INFO L290 TraceCheckUtils]: 70: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,867 INFO L290 TraceCheckUtils]: 69: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,867 INFO L290 TraceCheckUtils]: 68: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,867 INFO L272 TraceCheckUtils]: 67: Hoare triple {90909#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,867 INFO L290 TraceCheckUtils]: 66: Hoare triple {90909#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {90909#(< ~counter~0 94)} is VALID [2022-04-15 15:14:10,868 INFO L290 TraceCheckUtils]: 65: Hoare triple {90934#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90909#(< ~counter~0 94)} is VALID [2022-04-15 15:14:10,868 INFO L290 TraceCheckUtils]: 64: Hoare triple {90934#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {90934#(< ~counter~0 93)} is VALID [2022-04-15 15:14:10,869 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {90345#true} {90934#(< ~counter~0 93)} #96#return; {90934#(< ~counter~0 93)} is VALID [2022-04-15 15:14:10,869 INFO L290 TraceCheckUtils]: 62: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,869 INFO L290 TraceCheckUtils]: 61: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,869 INFO L290 TraceCheckUtils]: 60: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,869 INFO L272 TraceCheckUtils]: 59: Hoare triple {90934#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,869 INFO L290 TraceCheckUtils]: 58: Hoare triple {90934#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {90934#(< ~counter~0 93)} is VALID [2022-04-15 15:14:10,870 INFO L290 TraceCheckUtils]: 57: Hoare triple {90959#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {90934#(< ~counter~0 93)} is VALID [2022-04-15 15:14:10,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {90959#(< ~counter~0 92)} assume !!(0 != ~r~0); {90959#(< ~counter~0 92)} is VALID [2022-04-15 15:14:10,871 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {90345#true} {90959#(< ~counter~0 92)} #94#return; {90959#(< ~counter~0 92)} is VALID [2022-04-15 15:14:10,871 INFO L290 TraceCheckUtils]: 54: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,871 INFO L290 TraceCheckUtils]: 53: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,871 INFO L290 TraceCheckUtils]: 52: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,871 INFO L272 TraceCheckUtils]: 51: Hoare triple {90959#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,871 INFO L290 TraceCheckUtils]: 50: Hoare triple {90959#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {90959#(< ~counter~0 92)} is VALID [2022-04-15 15:14:10,872 INFO L290 TraceCheckUtils]: 49: Hoare triple {90984#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {90959#(< ~counter~0 92)} is VALID [2022-04-15 15:14:10,873 INFO L290 TraceCheckUtils]: 48: Hoare triple {90984#(< ~counter~0 91)} assume !(~r~0 < 0); {90984#(< ~counter~0 91)} is VALID [2022-04-15 15:14:10,873 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {90345#true} {90984#(< ~counter~0 91)} #98#return; {90984#(< ~counter~0 91)} is VALID [2022-04-15 15:14:10,873 INFO L290 TraceCheckUtils]: 46: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,873 INFO L290 TraceCheckUtils]: 45: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,873 INFO L290 TraceCheckUtils]: 44: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,873 INFO L272 TraceCheckUtils]: 43: Hoare triple {90984#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,874 INFO L290 TraceCheckUtils]: 42: Hoare triple {90984#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {90984#(< ~counter~0 91)} is VALID [2022-04-15 15:14:10,874 INFO L290 TraceCheckUtils]: 41: Hoare triple {91009#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {90984#(< ~counter~0 91)} is VALID [2022-04-15 15:14:10,875 INFO L290 TraceCheckUtils]: 40: Hoare triple {91009#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {91009#(< ~counter~0 90)} is VALID [2022-04-15 15:14:10,875 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {90345#true} {91009#(< ~counter~0 90)} #98#return; {91009#(< ~counter~0 90)} is VALID [2022-04-15 15:14:10,875 INFO L290 TraceCheckUtils]: 38: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,875 INFO L290 TraceCheckUtils]: 37: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,875 INFO L272 TraceCheckUtils]: 35: Hoare triple {91009#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,876 INFO L290 TraceCheckUtils]: 34: Hoare triple {91009#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {91009#(< ~counter~0 90)} is VALID [2022-04-15 15:14:10,877 INFO L290 TraceCheckUtils]: 33: Hoare triple {91034#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {91009#(< ~counter~0 90)} is VALID [2022-04-15 15:14:10,877 INFO L290 TraceCheckUtils]: 32: Hoare triple {91034#(< ~counter~0 89)} assume !(~r~0 > 0); {91034#(< ~counter~0 89)} is VALID [2022-04-15 15:14:10,877 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {90345#true} {91034#(< ~counter~0 89)} #96#return; {91034#(< ~counter~0 89)} is VALID [2022-04-15 15:14:10,877 INFO L290 TraceCheckUtils]: 30: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,877 INFO L290 TraceCheckUtils]: 29: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,878 INFO L290 TraceCheckUtils]: 28: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,878 INFO L272 TraceCheckUtils]: 27: Hoare triple {91034#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,878 INFO L290 TraceCheckUtils]: 26: Hoare triple {91034#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {91034#(< ~counter~0 89)} is VALID [2022-04-15 15:14:10,879 INFO L290 TraceCheckUtils]: 25: Hoare triple {91059#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {91034#(< ~counter~0 89)} is VALID [2022-04-15 15:14:10,879 INFO L290 TraceCheckUtils]: 24: Hoare triple {91059#(< ~counter~0 88)} assume !!(0 != ~r~0); {91059#(< ~counter~0 88)} is VALID [2022-04-15 15:14:10,879 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {90345#true} {91059#(< ~counter~0 88)} #94#return; {91059#(< ~counter~0 88)} is VALID [2022-04-15 15:14:10,880 INFO L290 TraceCheckUtils]: 22: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,880 INFO L290 TraceCheckUtils]: 21: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,880 INFO L290 TraceCheckUtils]: 20: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,880 INFO L272 TraceCheckUtils]: 19: Hoare triple {91059#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,880 INFO L290 TraceCheckUtils]: 18: Hoare triple {91059#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {91059#(< ~counter~0 88)} is VALID [2022-04-15 15:14:10,881 INFO L290 TraceCheckUtils]: 17: Hoare triple {91084#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {91059#(< ~counter~0 88)} is VALID [2022-04-15 15:14:10,881 INFO L290 TraceCheckUtils]: 16: Hoare triple {91084#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {91084#(< ~counter~0 87)} is VALID [2022-04-15 15:14:10,881 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {90345#true} {91084#(< ~counter~0 87)} #92#return; {91084#(< ~counter~0 87)} is VALID [2022-04-15 15:14:10,882 INFO L290 TraceCheckUtils]: 14: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,882 INFO L290 TraceCheckUtils]: 13: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,882 INFO L290 TraceCheckUtils]: 12: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,882 INFO L272 TraceCheckUtils]: 11: Hoare triple {91084#(< ~counter~0 87)} 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)); {90345#true} is VALID [2022-04-15 15:14:10,882 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {90345#true} {91084#(< ~counter~0 87)} #90#return; {91084#(< ~counter~0 87)} is VALID [2022-04-15 15:14:10,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {90345#true} assume true; {90345#true} is VALID [2022-04-15 15:14:10,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {90345#true} assume !(0 == ~cond); {90345#true} is VALID [2022-04-15 15:14:10,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {90345#true} ~cond := #in~cond; {90345#true} is VALID [2022-04-15 15:14:10,882 INFO L272 TraceCheckUtils]: 6: Hoare triple {91084#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {90345#true} is VALID [2022-04-15 15:14:10,883 INFO L290 TraceCheckUtils]: 5: Hoare triple {91084#(< ~counter~0 87)} 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; {91084#(< ~counter~0 87)} is VALID [2022-04-15 15:14:10,883 INFO L272 TraceCheckUtils]: 4: Hoare triple {91084#(< ~counter~0 87)} call #t~ret9 := main(); {91084#(< ~counter~0 87)} is VALID [2022-04-15 15:14:10,883 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {91084#(< ~counter~0 87)} {90345#true} #102#return; {91084#(< ~counter~0 87)} is VALID [2022-04-15 15:14:10,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {91084#(< ~counter~0 87)} assume true; {91084#(< ~counter~0 87)} is VALID [2022-04-15 15:14:10,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {90345#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; {91084#(< ~counter~0 87)} is VALID [2022-04-15 15:14:10,884 INFO L272 TraceCheckUtils]: 0: Hoare triple {90345#true} call ULTIMATE.init(); {90345#true} is VALID [2022-04-15 15:14:10,884 INFO L134 CoverageAnalysis]: Checked inductivity of 458 backedges. 26 proven. 116 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 15:14:10,885 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [363529691] [2022-04-15 15:14:10,885 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1969960002] [2022-04-15 15:14:10,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1969960002] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:10,885 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:10,885 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-15 15:14:10,885 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:10,885 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1113877694] [2022-04-15 15:14:10,885 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1113877694] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:10,885 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:10,886 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:14:10,886 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [659652898] [2022-04-15 15:14:10,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:10,886 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 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 127 [2022-04-15 15:14:10,886 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:10,886 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 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-15 15:14:11,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:11,000 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:14:11,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:11,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:14:11,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:14:11,001 INFO L87 Difference]: Start difference. First operand 654 states and 882 transitions. Second operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 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-15 15:14:14,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:14,219 INFO L93 Difference]: Finished difference Result 709 states and 959 transitions. [2022-04-15 15:14:14,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-04-15 15:14:14,220 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 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 127 [2022-04-15 15:14:14,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:14,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 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-15 15:14:14,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-15 15:14:14,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 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-15 15:14:14,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 274 transitions. [2022-04-15 15:14:14,223 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 27 states and 274 transitions. [2022-04-15 15:14:14,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 274 edges. 274 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:14,497 INFO L225 Difference]: With dead ends: 709 [2022-04-15 15:14:14,497 INFO L226 Difference]: Without dead ends: 698 [2022-04-15 15:14:14,498 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 263 GetRequests, 223 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=723, Invalid=999, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 15:14:14,499 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 184 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 142 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 142 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:14,499 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 316 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [142 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-04-15 15:14:14,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 698 states. [2022-04-15 15:14:16,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 698 to 676. [2022-04-15 15:14:16,519 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:16,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 698 states. Second operand has 676 states, 505 states have (on average 1.2138613861386138) internal successors, (613), 515 states have internal predecessors, (613), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:16,521 INFO L74 IsIncluded]: Start isIncluded. First operand 698 states. Second operand has 676 states, 505 states have (on average 1.2138613861386138) internal successors, (613), 515 states have internal predecessors, (613), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:16,521 INFO L87 Difference]: Start difference. First operand 698 states. Second operand has 676 states, 505 states have (on average 1.2138613861386138) internal successors, (613), 515 states have internal predecessors, (613), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:16,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:16,539 INFO L93 Difference]: Finished difference Result 698 states and 943 transitions. [2022-04-15 15:14:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 943 transitions. [2022-04-15 15:14:16,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:16,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:16,540 INFO L74 IsIncluded]: Start isIncluded. First operand has 676 states, 505 states have (on average 1.2138613861386138) internal successors, (613), 515 states have internal predecessors, (613), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 698 states. [2022-04-15 15:14:16,540 INFO L87 Difference]: Start difference. First operand has 676 states, 505 states have (on average 1.2138613861386138) internal successors, (613), 515 states have internal predecessors, (613), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) Second operand 698 states. [2022-04-15 15:14:16,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:16,556 INFO L93 Difference]: Finished difference Result 698 states and 943 transitions. [2022-04-15 15:14:16,556 INFO L276 IsEmpty]: Start isEmpty. Operand 698 states and 943 transitions. [2022-04-15 15:14:16,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:16,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:16,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:16,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:16,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 676 states, 505 states have (on average 1.2138613861386138) internal successors, (613), 515 states have internal predecessors, (613), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 141 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:16,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 676 states to 676 states and 917 transitions. [2022-04-15 15:14:16,577 INFO L78 Accepts]: Start accepts. Automaton has 676 states and 917 transitions. Word has length 127 [2022-04-15 15:14:16,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:16,578 INFO L478 AbstractCegarLoop]: Abstraction has 676 states and 917 transitions. [2022-04-15 15:14:16,578 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.294117647058823) internal successors, (90), 16 states have internal predecessors, (90), 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-15 15:14:16,578 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 676 states and 917 transitions. [2022-04-15 15:14:18,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 917 edges. 917 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:18,825 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 917 transitions. [2022-04-15 15:14:18,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2022-04-15 15:14:18,826 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:18,826 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 6, 6, 6, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:14:18,843 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (43)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:19,031 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41,43 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:19,031 INFO L403 AbstractCegarLoop]: === Iteration 43 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:19,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 19 times [2022-04-15 15:14:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:19,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [46980392] [2022-04-15 15:14:19,032 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:19,032 INFO L85 PathProgramCache]: Analyzing trace with hash -1410231607, now seen corresponding path program 20 times [2022-04-15 15:14:19,032 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:19,032 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512193429] [2022-04-15 15:14:19,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:19,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:19,046 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:19,047 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [732748455] [2022-04-15 15:14:19,047 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:14:19,047 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:19,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:19,048 INFO L229 MonitoredProcess]: Starting monitored process 44 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:19,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Waiting until timeout for monitored process [2022-04-15 15:14:19,113 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:14:19,114 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:19,115 INFO L263 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 15:14:19,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:19,148 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:19,830 INFO L272 TraceCheckUtils]: 0: Hoare triple {95324#true} call ULTIMATE.init(); {95324#true} is VALID [2022-04-15 15:14:19,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {95324#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; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {95332#(<= ~counter~0 0)} assume true; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,831 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {95332#(<= ~counter~0 0)} {95324#true} #102#return; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,831 INFO L272 TraceCheckUtils]: 4: Hoare triple {95332#(<= ~counter~0 0)} call #t~ret9 := main(); {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,832 INFO L290 TraceCheckUtils]: 5: Hoare triple {95332#(<= ~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; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,832 INFO L272 TraceCheckUtils]: 6: Hoare triple {95332#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,832 INFO L290 TraceCheckUtils]: 7: Hoare triple {95332#(<= ~counter~0 0)} ~cond := #in~cond; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,833 INFO L290 TraceCheckUtils]: 8: Hoare triple {95332#(<= ~counter~0 0)} assume !(0 == ~cond); {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {95332#(<= ~counter~0 0)} assume true; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,833 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {95332#(<= ~counter~0 0)} {95332#(<= ~counter~0 0)} #90#return; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,834 INFO L272 TraceCheckUtils]: 11: Hoare triple {95332#(<= ~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)); {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,834 INFO L290 TraceCheckUtils]: 12: Hoare triple {95332#(<= ~counter~0 0)} ~cond := #in~cond; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,834 INFO L290 TraceCheckUtils]: 13: Hoare triple {95332#(<= ~counter~0 0)} assume !(0 == ~cond); {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {95332#(<= ~counter~0 0)} assume true; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,835 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {95332#(<= ~counter~0 0)} {95332#(<= ~counter~0 0)} #92#return; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {95332#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {95332#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:19,837 INFO L290 TraceCheckUtils]: 17: Hoare triple {95332#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95381#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:19,837 INFO L290 TraceCheckUtils]: 18: Hoare triple {95381#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {95381#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:19,838 INFO L272 TraceCheckUtils]: 19: Hoare triple {95381#(<= ~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)); {95381#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:19,838 INFO L290 TraceCheckUtils]: 20: Hoare triple {95381#(<= ~counter~0 1)} ~cond := #in~cond; {95381#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:19,838 INFO L290 TraceCheckUtils]: 21: Hoare triple {95381#(<= ~counter~0 1)} assume !(0 == ~cond); {95381#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:19,839 INFO L290 TraceCheckUtils]: 22: Hoare triple {95381#(<= ~counter~0 1)} assume true; {95381#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:19,839 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {95381#(<= ~counter~0 1)} {95381#(<= ~counter~0 1)} #94#return; {95381#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:19,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {95381#(<= ~counter~0 1)} assume !!(0 != ~r~0); {95381#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:19,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {95381#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95406#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:19,840 INFO L290 TraceCheckUtils]: 26: Hoare triple {95406#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {95406#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:19,841 INFO L272 TraceCheckUtils]: 27: Hoare triple {95406#(<= ~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)); {95406#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:19,841 INFO L290 TraceCheckUtils]: 28: Hoare triple {95406#(<= ~counter~0 2)} ~cond := #in~cond; {95406#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:19,841 INFO L290 TraceCheckUtils]: 29: Hoare triple {95406#(<= ~counter~0 2)} assume !(0 == ~cond); {95406#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:19,842 INFO L290 TraceCheckUtils]: 30: Hoare triple {95406#(<= ~counter~0 2)} assume true; {95406#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:19,842 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {95406#(<= ~counter~0 2)} {95406#(<= ~counter~0 2)} #96#return; {95406#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:19,842 INFO L290 TraceCheckUtils]: 32: Hoare triple {95406#(<= ~counter~0 2)} assume !(~r~0 > 0); {95406#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:19,843 INFO L290 TraceCheckUtils]: 33: Hoare triple {95406#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95431#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:19,844 INFO L290 TraceCheckUtils]: 34: Hoare triple {95431#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {95431#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:19,844 INFO L272 TraceCheckUtils]: 35: Hoare triple {95431#(<= ~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)); {95431#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:19,844 INFO L290 TraceCheckUtils]: 36: Hoare triple {95431#(<= ~counter~0 3)} ~cond := #in~cond; {95431#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:19,845 INFO L290 TraceCheckUtils]: 37: Hoare triple {95431#(<= ~counter~0 3)} assume !(0 == ~cond); {95431#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:19,845 INFO L290 TraceCheckUtils]: 38: Hoare triple {95431#(<= ~counter~0 3)} assume true; {95431#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:19,845 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {95431#(<= ~counter~0 3)} {95431#(<= ~counter~0 3)} #98#return; {95431#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:19,846 INFO L290 TraceCheckUtils]: 40: Hoare triple {95431#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95431#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:19,847 INFO L290 TraceCheckUtils]: 41: Hoare triple {95431#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95456#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:19,847 INFO L290 TraceCheckUtils]: 42: Hoare triple {95456#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {95456#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:19,847 INFO L272 TraceCheckUtils]: 43: Hoare triple {95456#(<= ~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)); {95456#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:19,848 INFO L290 TraceCheckUtils]: 44: Hoare triple {95456#(<= ~counter~0 4)} ~cond := #in~cond; {95456#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:19,848 INFO L290 TraceCheckUtils]: 45: Hoare triple {95456#(<= ~counter~0 4)} assume !(0 == ~cond); {95456#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:19,848 INFO L290 TraceCheckUtils]: 46: Hoare triple {95456#(<= ~counter~0 4)} assume true; {95456#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:19,849 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {95456#(<= ~counter~0 4)} {95456#(<= ~counter~0 4)} #98#return; {95456#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:19,849 INFO L290 TraceCheckUtils]: 48: Hoare triple {95456#(<= ~counter~0 4)} assume !(~r~0 < 0); {95456#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:19,850 INFO L290 TraceCheckUtils]: 49: Hoare triple {95456#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95481#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:19,850 INFO L290 TraceCheckUtils]: 50: Hoare triple {95481#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {95481#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:19,851 INFO L272 TraceCheckUtils]: 51: Hoare triple {95481#(<= ~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)); {95481#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:19,851 INFO L290 TraceCheckUtils]: 52: Hoare triple {95481#(<= ~counter~0 5)} ~cond := #in~cond; {95481#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:19,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {95481#(<= ~counter~0 5)} assume !(0 == ~cond); {95481#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:19,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {95481#(<= ~counter~0 5)} assume true; {95481#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:19,852 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {95481#(<= ~counter~0 5)} {95481#(<= ~counter~0 5)} #94#return; {95481#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:19,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {95481#(<= ~counter~0 5)} assume !!(0 != ~r~0); {95481#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:19,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {95481#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95506#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:19,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {95506#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {95506#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:19,854 INFO L272 TraceCheckUtils]: 59: Hoare triple {95506#(<= ~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)); {95506#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:19,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {95506#(<= ~counter~0 6)} ~cond := #in~cond; {95506#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:19,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {95506#(<= ~counter~0 6)} assume !(0 == ~cond); {95506#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:19,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {95506#(<= ~counter~0 6)} assume true; {95506#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:19,855 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {95506#(<= ~counter~0 6)} {95506#(<= ~counter~0 6)} #96#return; {95506#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:19,855 INFO L290 TraceCheckUtils]: 64: Hoare triple {95506#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95506#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:19,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {95506#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95531#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:19,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {95531#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {95531#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:19,857 INFO L272 TraceCheckUtils]: 67: Hoare triple {95531#(<= ~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)); {95531#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:19,857 INFO L290 TraceCheckUtils]: 68: Hoare triple {95531#(<= ~counter~0 7)} ~cond := #in~cond; {95531#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:19,857 INFO L290 TraceCheckUtils]: 69: Hoare triple {95531#(<= ~counter~0 7)} assume !(0 == ~cond); {95531#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:19,858 INFO L290 TraceCheckUtils]: 70: Hoare triple {95531#(<= ~counter~0 7)} assume true; {95531#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:19,858 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {95531#(<= ~counter~0 7)} {95531#(<= ~counter~0 7)} #96#return; {95531#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:19,858 INFO L290 TraceCheckUtils]: 72: Hoare triple {95531#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95531#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:19,859 INFO L290 TraceCheckUtils]: 73: Hoare triple {95531#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95556#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:19,860 INFO L290 TraceCheckUtils]: 74: Hoare triple {95556#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {95556#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:19,860 INFO L272 TraceCheckUtils]: 75: Hoare triple {95556#(<= ~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)); {95556#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:19,860 INFO L290 TraceCheckUtils]: 76: Hoare triple {95556#(<= ~counter~0 8)} ~cond := #in~cond; {95556#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:19,861 INFO L290 TraceCheckUtils]: 77: Hoare triple {95556#(<= ~counter~0 8)} assume !(0 == ~cond); {95556#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:19,861 INFO L290 TraceCheckUtils]: 78: Hoare triple {95556#(<= ~counter~0 8)} assume true; {95556#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:19,861 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {95556#(<= ~counter~0 8)} {95556#(<= ~counter~0 8)} #96#return; {95556#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:19,862 INFO L290 TraceCheckUtils]: 80: Hoare triple {95556#(<= ~counter~0 8)} assume !(~r~0 > 0); {95556#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:19,862 INFO L290 TraceCheckUtils]: 81: Hoare triple {95556#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95581#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:19,863 INFO L290 TraceCheckUtils]: 82: Hoare triple {95581#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {95581#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:19,863 INFO L272 TraceCheckUtils]: 83: Hoare triple {95581#(<= ~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)); {95581#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:19,864 INFO L290 TraceCheckUtils]: 84: Hoare triple {95581#(<= ~counter~0 9)} ~cond := #in~cond; {95581#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:19,864 INFO L290 TraceCheckUtils]: 85: Hoare triple {95581#(<= ~counter~0 9)} assume !(0 == ~cond); {95581#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:19,864 INFO L290 TraceCheckUtils]: 86: Hoare triple {95581#(<= ~counter~0 9)} assume true; {95581#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:19,865 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {95581#(<= ~counter~0 9)} {95581#(<= ~counter~0 9)} #98#return; {95581#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:19,865 INFO L290 TraceCheckUtils]: 88: Hoare triple {95581#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95581#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:19,866 INFO L290 TraceCheckUtils]: 89: Hoare triple {95581#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95606#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:19,866 INFO L290 TraceCheckUtils]: 90: Hoare triple {95606#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {95606#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:19,866 INFO L272 TraceCheckUtils]: 91: Hoare triple {95606#(<= ~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)); {95606#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:19,867 INFO L290 TraceCheckUtils]: 92: Hoare triple {95606#(<= ~counter~0 10)} ~cond := #in~cond; {95606#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:19,867 INFO L290 TraceCheckUtils]: 93: Hoare triple {95606#(<= ~counter~0 10)} assume !(0 == ~cond); {95606#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:19,867 INFO L290 TraceCheckUtils]: 94: Hoare triple {95606#(<= ~counter~0 10)} assume true; {95606#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:19,868 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {95606#(<= ~counter~0 10)} {95606#(<= ~counter~0 10)} #98#return; {95606#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:19,868 INFO L290 TraceCheckUtils]: 96: Hoare triple {95606#(<= ~counter~0 10)} assume !(~r~0 < 0); {95606#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:19,869 INFO L290 TraceCheckUtils]: 97: Hoare triple {95606#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95631#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:19,869 INFO L290 TraceCheckUtils]: 98: Hoare triple {95631#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {95631#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:19,870 INFO L272 TraceCheckUtils]: 99: Hoare triple {95631#(<= ~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)); {95631#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:19,870 INFO L290 TraceCheckUtils]: 100: Hoare triple {95631#(<= ~counter~0 11)} ~cond := #in~cond; {95631#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:19,870 INFO L290 TraceCheckUtils]: 101: Hoare triple {95631#(<= ~counter~0 11)} assume !(0 == ~cond); {95631#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:19,870 INFO L290 TraceCheckUtils]: 102: Hoare triple {95631#(<= ~counter~0 11)} assume true; {95631#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:19,871 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {95631#(<= ~counter~0 11)} {95631#(<= ~counter~0 11)} #94#return; {95631#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:19,871 INFO L290 TraceCheckUtils]: 104: Hoare triple {95631#(<= ~counter~0 11)} assume !!(0 != ~r~0); {95631#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:19,872 INFO L290 TraceCheckUtils]: 105: Hoare triple {95631#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95656#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:19,872 INFO L290 TraceCheckUtils]: 106: Hoare triple {95656#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {95656#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:19,873 INFO L272 TraceCheckUtils]: 107: Hoare triple {95656#(<= ~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)); {95656#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:19,873 INFO L290 TraceCheckUtils]: 108: Hoare triple {95656#(<= ~counter~0 12)} ~cond := #in~cond; {95656#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:19,873 INFO L290 TraceCheckUtils]: 109: Hoare triple {95656#(<= ~counter~0 12)} assume !(0 == ~cond); {95656#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:19,874 INFO L290 TraceCheckUtils]: 110: Hoare triple {95656#(<= ~counter~0 12)} assume true; {95656#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:19,874 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {95656#(<= ~counter~0 12)} {95656#(<= ~counter~0 12)} #96#return; {95656#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:19,874 INFO L290 TraceCheckUtils]: 112: Hoare triple {95656#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95656#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:19,875 INFO L290 TraceCheckUtils]: 113: Hoare triple {95656#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95681#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:19,875 INFO L290 TraceCheckUtils]: 114: Hoare triple {95681#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {95681#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:19,876 INFO L272 TraceCheckUtils]: 115: Hoare triple {95681#(<= ~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)); {95681#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:19,876 INFO L290 TraceCheckUtils]: 116: Hoare triple {95681#(<= ~counter~0 13)} ~cond := #in~cond; {95681#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:19,876 INFO L290 TraceCheckUtils]: 117: Hoare triple {95681#(<= ~counter~0 13)} assume !(0 == ~cond); {95681#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:19,877 INFO L290 TraceCheckUtils]: 118: Hoare triple {95681#(<= ~counter~0 13)} assume true; {95681#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:19,877 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {95681#(<= ~counter~0 13)} {95681#(<= ~counter~0 13)} #96#return; {95681#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:19,878 INFO L290 TraceCheckUtils]: 120: Hoare triple {95681#(<= ~counter~0 13)} assume !(~r~0 > 0); {95681#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:19,878 INFO L290 TraceCheckUtils]: 121: Hoare triple {95681#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95706#(<= |main_#t~post8| 13)} is VALID [2022-04-15 15:14:19,878 INFO L290 TraceCheckUtils]: 122: Hoare triple {95706#(<= |main_#t~post8| 13)} assume !(#t~post8 < 100);havoc #t~post8; {95325#false} is VALID [2022-04-15 15:14:19,878 INFO L290 TraceCheckUtils]: 123: Hoare triple {95325#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95325#false} is VALID [2022-04-15 15:14:19,878 INFO L290 TraceCheckUtils]: 124: Hoare triple {95325#false} assume !(#t~post6 < 100);havoc #t~post6; {95325#false} is VALID [2022-04-15 15:14:19,878 INFO L272 TraceCheckUtils]: 125: Hoare triple {95325#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)); {95325#false} is VALID [2022-04-15 15:14:19,878 INFO L290 TraceCheckUtils]: 126: Hoare triple {95325#false} ~cond := #in~cond; {95325#false} is VALID [2022-04-15 15:14:19,879 INFO L290 TraceCheckUtils]: 127: Hoare triple {95325#false} assume 0 == ~cond; {95325#false} is VALID [2022-04-15 15:14:19,879 INFO L290 TraceCheckUtils]: 128: Hoare triple {95325#false} assume !false; {95325#false} is VALID [2022-04-15 15:14:19,879 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 416 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:14:19,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:20,643 INFO L290 TraceCheckUtils]: 128: Hoare triple {95325#false} assume !false; {95325#false} is VALID [2022-04-15 15:14:20,643 INFO L290 TraceCheckUtils]: 127: Hoare triple {95325#false} assume 0 == ~cond; {95325#false} is VALID [2022-04-15 15:14:20,643 INFO L290 TraceCheckUtils]: 126: Hoare triple {95325#false} ~cond := #in~cond; {95325#false} is VALID [2022-04-15 15:14:20,643 INFO L272 TraceCheckUtils]: 125: Hoare triple {95325#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)); {95325#false} is VALID [2022-04-15 15:14:20,643 INFO L290 TraceCheckUtils]: 124: Hoare triple {95325#false} assume !(#t~post6 < 100);havoc #t~post6; {95325#false} is VALID [2022-04-15 15:14:20,643 INFO L290 TraceCheckUtils]: 123: Hoare triple {95325#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95325#false} is VALID [2022-04-15 15:14:20,644 INFO L290 TraceCheckUtils]: 122: Hoare triple {95746#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {95325#false} is VALID [2022-04-15 15:14:20,644 INFO L290 TraceCheckUtils]: 121: Hoare triple {95750#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95746#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:14:20,644 INFO L290 TraceCheckUtils]: 120: Hoare triple {95750#(< ~counter~0 100)} assume !(~r~0 > 0); {95750#(< ~counter~0 100)} is VALID [2022-04-15 15:14:20,645 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {95324#true} {95750#(< ~counter~0 100)} #96#return; {95750#(< ~counter~0 100)} is VALID [2022-04-15 15:14:20,645 INFO L290 TraceCheckUtils]: 118: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,645 INFO L290 TraceCheckUtils]: 117: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,645 INFO L290 TraceCheckUtils]: 116: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,645 INFO L272 TraceCheckUtils]: 115: Hoare triple {95750#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,645 INFO L290 TraceCheckUtils]: 114: Hoare triple {95750#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {95750#(< ~counter~0 100)} is VALID [2022-04-15 15:14:20,647 INFO L290 TraceCheckUtils]: 113: Hoare triple {95775#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95750#(< ~counter~0 100)} is VALID [2022-04-15 15:14:20,647 INFO L290 TraceCheckUtils]: 112: Hoare triple {95775#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95775#(< ~counter~0 99)} is VALID [2022-04-15 15:14:20,648 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {95324#true} {95775#(< ~counter~0 99)} #96#return; {95775#(< ~counter~0 99)} is VALID [2022-04-15 15:14:20,648 INFO L290 TraceCheckUtils]: 110: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,648 INFO L290 TraceCheckUtils]: 109: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,648 INFO L290 TraceCheckUtils]: 108: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,648 INFO L272 TraceCheckUtils]: 107: Hoare triple {95775#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,648 INFO L290 TraceCheckUtils]: 106: Hoare triple {95775#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {95775#(< ~counter~0 99)} is VALID [2022-04-15 15:14:20,652 INFO L290 TraceCheckUtils]: 105: Hoare triple {95800#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95775#(< ~counter~0 99)} is VALID [2022-04-15 15:14:20,652 INFO L290 TraceCheckUtils]: 104: Hoare triple {95800#(< ~counter~0 98)} assume !!(0 != ~r~0); {95800#(< ~counter~0 98)} is VALID [2022-04-15 15:14:20,653 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {95324#true} {95800#(< ~counter~0 98)} #94#return; {95800#(< ~counter~0 98)} is VALID [2022-04-15 15:14:20,653 INFO L290 TraceCheckUtils]: 102: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,653 INFO L290 TraceCheckUtils]: 101: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,653 INFO L290 TraceCheckUtils]: 100: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,653 INFO L272 TraceCheckUtils]: 99: Hoare triple {95800#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,654 INFO L290 TraceCheckUtils]: 98: Hoare triple {95800#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {95800#(< ~counter~0 98)} is VALID [2022-04-15 15:14:20,655 INFO L290 TraceCheckUtils]: 97: Hoare triple {95825#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95800#(< ~counter~0 98)} is VALID [2022-04-15 15:14:20,655 INFO L290 TraceCheckUtils]: 96: Hoare triple {95825#(< ~counter~0 97)} assume !(~r~0 < 0); {95825#(< ~counter~0 97)} is VALID [2022-04-15 15:14:20,656 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {95324#true} {95825#(< ~counter~0 97)} #98#return; {95825#(< ~counter~0 97)} is VALID [2022-04-15 15:14:20,656 INFO L290 TraceCheckUtils]: 94: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,656 INFO L290 TraceCheckUtils]: 93: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,656 INFO L290 TraceCheckUtils]: 92: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,656 INFO L272 TraceCheckUtils]: 91: Hoare triple {95825#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,656 INFO L290 TraceCheckUtils]: 90: Hoare triple {95825#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {95825#(< ~counter~0 97)} is VALID [2022-04-15 15:14:20,657 INFO L290 TraceCheckUtils]: 89: Hoare triple {95850#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95825#(< ~counter~0 97)} is VALID [2022-04-15 15:14:20,658 INFO L290 TraceCheckUtils]: 88: Hoare triple {95850#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {95850#(< ~counter~0 96)} is VALID [2022-04-15 15:14:20,659 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {95324#true} {95850#(< ~counter~0 96)} #98#return; {95850#(< ~counter~0 96)} is VALID [2022-04-15 15:14:20,659 INFO L290 TraceCheckUtils]: 86: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,659 INFO L290 TraceCheckUtils]: 85: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,659 INFO L290 TraceCheckUtils]: 84: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,659 INFO L272 TraceCheckUtils]: 83: Hoare triple {95850#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,659 INFO L290 TraceCheckUtils]: 82: Hoare triple {95850#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {95850#(< ~counter~0 96)} is VALID [2022-04-15 15:14:20,660 INFO L290 TraceCheckUtils]: 81: Hoare triple {95875#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95850#(< ~counter~0 96)} is VALID [2022-04-15 15:14:20,661 INFO L290 TraceCheckUtils]: 80: Hoare triple {95875#(< ~counter~0 95)} assume !(~r~0 > 0); {95875#(< ~counter~0 95)} is VALID [2022-04-15 15:14:20,662 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {95324#true} {95875#(< ~counter~0 95)} #96#return; {95875#(< ~counter~0 95)} is VALID [2022-04-15 15:14:20,662 INFO L290 TraceCheckUtils]: 78: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,662 INFO L290 TraceCheckUtils]: 77: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,662 INFO L290 TraceCheckUtils]: 76: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,662 INFO L272 TraceCheckUtils]: 75: Hoare triple {95875#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,662 INFO L290 TraceCheckUtils]: 74: Hoare triple {95875#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {95875#(< ~counter~0 95)} is VALID [2022-04-15 15:14:20,663 INFO L290 TraceCheckUtils]: 73: Hoare triple {95900#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95875#(< ~counter~0 95)} is VALID [2022-04-15 15:14:20,664 INFO L290 TraceCheckUtils]: 72: Hoare triple {95900#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95900#(< ~counter~0 94)} is VALID [2022-04-15 15:14:20,665 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {95324#true} {95900#(< ~counter~0 94)} #96#return; {95900#(< ~counter~0 94)} is VALID [2022-04-15 15:14:20,665 INFO L290 TraceCheckUtils]: 70: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,665 INFO L290 TraceCheckUtils]: 69: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,665 INFO L290 TraceCheckUtils]: 68: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,665 INFO L272 TraceCheckUtils]: 67: Hoare triple {95900#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,665 INFO L290 TraceCheckUtils]: 66: Hoare triple {95900#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {95900#(< ~counter~0 94)} is VALID [2022-04-15 15:14:20,666 INFO L290 TraceCheckUtils]: 65: Hoare triple {95925#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95900#(< ~counter~0 94)} is VALID [2022-04-15 15:14:20,667 INFO L290 TraceCheckUtils]: 64: Hoare triple {95925#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {95925#(< ~counter~0 93)} is VALID [2022-04-15 15:14:20,668 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {95324#true} {95925#(< ~counter~0 93)} #96#return; {95925#(< ~counter~0 93)} is VALID [2022-04-15 15:14:20,668 INFO L290 TraceCheckUtils]: 62: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,668 INFO L290 TraceCheckUtils]: 61: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,668 INFO L290 TraceCheckUtils]: 60: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,668 INFO L272 TraceCheckUtils]: 59: Hoare triple {95925#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,668 INFO L290 TraceCheckUtils]: 58: Hoare triple {95925#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {95925#(< ~counter~0 93)} is VALID [2022-04-15 15:14:20,669 INFO L290 TraceCheckUtils]: 57: Hoare triple {95950#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {95925#(< ~counter~0 93)} is VALID [2022-04-15 15:14:20,670 INFO L290 TraceCheckUtils]: 56: Hoare triple {95950#(< ~counter~0 92)} assume !!(0 != ~r~0); {95950#(< ~counter~0 92)} is VALID [2022-04-15 15:14:20,670 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {95324#true} {95950#(< ~counter~0 92)} #94#return; {95950#(< ~counter~0 92)} is VALID [2022-04-15 15:14:20,671 INFO L290 TraceCheckUtils]: 54: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,671 INFO L290 TraceCheckUtils]: 53: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,671 INFO L290 TraceCheckUtils]: 52: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,671 INFO L272 TraceCheckUtils]: 51: Hoare triple {95950#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,671 INFO L290 TraceCheckUtils]: 50: Hoare triple {95950#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {95950#(< ~counter~0 92)} is VALID [2022-04-15 15:14:20,672 INFO L290 TraceCheckUtils]: 49: Hoare triple {95975#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {95950#(< ~counter~0 92)} is VALID [2022-04-15 15:14:20,673 INFO L290 TraceCheckUtils]: 48: Hoare triple {95975#(< ~counter~0 91)} assume !(~r~0 < 0); {95975#(< ~counter~0 91)} is VALID [2022-04-15 15:14:20,673 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {95324#true} {95975#(< ~counter~0 91)} #98#return; {95975#(< ~counter~0 91)} is VALID [2022-04-15 15:14:20,674 INFO L290 TraceCheckUtils]: 46: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,674 INFO L290 TraceCheckUtils]: 45: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,674 INFO L290 TraceCheckUtils]: 44: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,674 INFO L272 TraceCheckUtils]: 43: Hoare triple {95975#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,674 INFO L290 TraceCheckUtils]: 42: Hoare triple {95975#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {95975#(< ~counter~0 91)} is VALID [2022-04-15 15:14:20,675 INFO L290 TraceCheckUtils]: 41: Hoare triple {96000#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {95975#(< ~counter~0 91)} is VALID [2022-04-15 15:14:20,676 INFO L290 TraceCheckUtils]: 40: Hoare triple {96000#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {96000#(< ~counter~0 90)} is VALID [2022-04-15 15:14:20,676 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {95324#true} {96000#(< ~counter~0 90)} #98#return; {96000#(< ~counter~0 90)} is VALID [2022-04-15 15:14:20,676 INFO L290 TraceCheckUtils]: 38: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,677 INFO L290 TraceCheckUtils]: 37: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,677 INFO L290 TraceCheckUtils]: 36: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,677 INFO L272 TraceCheckUtils]: 35: Hoare triple {96000#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,677 INFO L290 TraceCheckUtils]: 34: Hoare triple {96000#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {96000#(< ~counter~0 90)} is VALID [2022-04-15 15:14:20,678 INFO L290 TraceCheckUtils]: 33: Hoare triple {96025#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {96000#(< ~counter~0 90)} is VALID [2022-04-15 15:14:20,679 INFO L290 TraceCheckUtils]: 32: Hoare triple {96025#(< ~counter~0 89)} assume !(~r~0 > 0); {96025#(< ~counter~0 89)} is VALID [2022-04-15 15:14:20,679 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {95324#true} {96025#(< ~counter~0 89)} #96#return; {96025#(< ~counter~0 89)} is VALID [2022-04-15 15:14:20,679 INFO L290 TraceCheckUtils]: 30: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,679 INFO L290 TraceCheckUtils]: 29: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,680 INFO L290 TraceCheckUtils]: 28: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,680 INFO L272 TraceCheckUtils]: 27: Hoare triple {96025#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,680 INFO L290 TraceCheckUtils]: 26: Hoare triple {96025#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {96025#(< ~counter~0 89)} is VALID [2022-04-15 15:14:20,681 INFO L290 TraceCheckUtils]: 25: Hoare triple {96050#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {96025#(< ~counter~0 89)} is VALID [2022-04-15 15:14:20,681 INFO L290 TraceCheckUtils]: 24: Hoare triple {96050#(< ~counter~0 88)} assume !!(0 != ~r~0); {96050#(< ~counter~0 88)} is VALID [2022-04-15 15:14:20,682 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {95324#true} {96050#(< ~counter~0 88)} #94#return; {96050#(< ~counter~0 88)} is VALID [2022-04-15 15:14:20,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,683 INFO L272 TraceCheckUtils]: 19: Hoare triple {96050#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,683 INFO L290 TraceCheckUtils]: 18: Hoare triple {96050#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {96050#(< ~counter~0 88)} is VALID [2022-04-15 15:14:20,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {96075#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {96050#(< ~counter~0 88)} is VALID [2022-04-15 15:14:20,684 INFO L290 TraceCheckUtils]: 16: Hoare triple {96075#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {96075#(< ~counter~0 87)} is VALID [2022-04-15 15:14:20,685 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {95324#true} {96075#(< ~counter~0 87)} #92#return; {96075#(< ~counter~0 87)} is VALID [2022-04-15 15:14:20,685 INFO L290 TraceCheckUtils]: 14: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,685 INFO L290 TraceCheckUtils]: 13: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,685 INFO L290 TraceCheckUtils]: 12: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,685 INFO L272 TraceCheckUtils]: 11: Hoare triple {96075#(< ~counter~0 87)} 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)); {95324#true} is VALID [2022-04-15 15:14:20,686 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {95324#true} {96075#(< ~counter~0 87)} #90#return; {96075#(< ~counter~0 87)} is VALID [2022-04-15 15:14:20,686 INFO L290 TraceCheckUtils]: 9: Hoare triple {95324#true} assume true; {95324#true} is VALID [2022-04-15 15:14:20,686 INFO L290 TraceCheckUtils]: 8: Hoare triple {95324#true} assume !(0 == ~cond); {95324#true} is VALID [2022-04-15 15:14:20,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {95324#true} ~cond := #in~cond; {95324#true} is VALID [2022-04-15 15:14:20,686 INFO L272 TraceCheckUtils]: 6: Hoare triple {96075#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {95324#true} is VALID [2022-04-15 15:14:20,687 INFO L290 TraceCheckUtils]: 5: Hoare triple {96075#(< ~counter~0 87)} 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; {96075#(< ~counter~0 87)} is VALID [2022-04-15 15:14:20,687 INFO L272 TraceCheckUtils]: 4: Hoare triple {96075#(< ~counter~0 87)} call #t~ret9 := main(); {96075#(< ~counter~0 87)} is VALID [2022-04-15 15:14:20,688 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96075#(< ~counter~0 87)} {95324#true} #102#return; {96075#(< ~counter~0 87)} is VALID [2022-04-15 15:14:20,688 INFO L290 TraceCheckUtils]: 2: Hoare triple {96075#(< ~counter~0 87)} assume true; {96075#(< ~counter~0 87)} is VALID [2022-04-15 15:14:20,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {95324#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; {96075#(< ~counter~0 87)} is VALID [2022-04-15 15:14:20,689 INFO L272 TraceCheckUtils]: 0: Hoare triple {95324#true} call ULTIMATE.init(); {95324#true} is VALID [2022-04-15 15:14:20,689 INFO L134 CoverageAnalysis]: Checked inductivity of 452 backedges. 32 proven. 104 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 15:14:20,689 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:20,689 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512193429] [2022-04-15 15:14:20,689 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:20,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732748455] [2022-04-15 15:14:20,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732748455] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:20,690 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:20,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-15 15:14:20,690 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:20,690 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [46980392] [2022-04-15 15:14:20,690 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [46980392] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:20,690 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:20,690 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:14:20,691 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2033673983] [2022-04-15 15:14:20,691 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:20,691 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 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 129 [2022-04-15 15:14:20,691 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:20,691 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 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-15 15:14:20,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:20,809 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:14:20,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:20,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:14:20,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:14:20,810 INFO L87 Difference]: Start difference. First operand 676 states and 917 transitions. Second operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 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-15 15:14:24,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:24,181 INFO L93 Difference]: Finished difference Result 897 states and 1250 transitions. [2022-04-15 15:14:24,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-04-15 15:14:24,181 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 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 129 [2022-04-15 15:14:24,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:24,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 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-15 15:14:24,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-15 15:14:24,183 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 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-15 15:14:24,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 296 transitions. [2022-04-15 15:14:24,189 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 28 states and 296 transitions. [2022-04-15 15:14:24,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:24,474 INFO L225 Difference]: With dead ends: 897 [2022-04-15 15:14:24,474 INFO L226 Difference]: Without dead ends: 704 [2022-04-15 15:14:24,475 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 268 GetRequests, 227 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=759, Invalid=1047, Unknown=0, NotChecked=0, Total=1806 [2022-04-15 15:14:24,476 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 196 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 182 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 369 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 182 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:24,476 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 324 Invalid, 369 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [182 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:14:24,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-04-15 15:14:26,585 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 694. [2022-04-15 15:14:26,585 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:26,586 INFO L82 GeneralOperation]: Start isEquivalent. First operand 704 states. Second operand has 694 states, 523 states have (on average 1.21414913957935) internal successors, (635), 527 states have internal predecessors, (635), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:26,587 INFO L74 IsIncluded]: Start isIncluded. First operand 704 states. Second operand has 694 states, 523 states have (on average 1.21414913957935) internal successors, (635), 527 states have internal predecessors, (635), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:26,587 INFO L87 Difference]: Start difference. First operand 704 states. Second operand has 694 states, 523 states have (on average 1.21414913957935) internal successors, (635), 527 states have internal predecessors, (635), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:26,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:26,604 INFO L93 Difference]: Finished difference Result 704 states and 949 transitions. [2022-04-15 15:14:26,605 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 949 transitions. [2022-04-15 15:14:26,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:26,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:26,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 694 states, 523 states have (on average 1.21414913957935) internal successors, (635), 527 states have internal predecessors, (635), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 704 states. [2022-04-15 15:14:26,606 INFO L87 Difference]: Start difference. First operand has 694 states, 523 states have (on average 1.21414913957935) internal successors, (635), 527 states have internal predecessors, (635), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) Second operand 704 states. [2022-04-15 15:14:26,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:26,623 INFO L93 Difference]: Finished difference Result 704 states and 949 transitions. [2022-04-15 15:14:26,623 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 949 transitions. [2022-04-15 15:14:26,623 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:26,623 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:26,623 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:26,623 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:26,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 694 states, 523 states have (on average 1.21414913957935) internal successors, (635), 527 states have internal predecessors, (635), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 147 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:26,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 694 states to 694 states and 939 transitions. [2022-04-15 15:14:26,651 INFO L78 Accepts]: Start accepts. Automaton has 694 states and 939 transitions. Word has length 129 [2022-04-15 15:14:26,651 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:26,651 INFO L478 AbstractCegarLoop]: Abstraction has 694 states and 939 transitions. [2022-04-15 15:14:26,651 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.411764705882353) internal successors, (92), 16 states have internal predecessors, (92), 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-15 15:14:26,651 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 694 states and 939 transitions. [2022-04-15 15:14:29,879 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 939 edges. 939 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:29,880 INFO L276 IsEmpty]: Start isEmpty. Operand 694 states and 939 transitions. [2022-04-15 15:14:29,881 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 132 [2022-04-15 15:14:29,881 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:29,881 INFO L499 BasicCegarLoop]: trace histogram [14, 13, 13, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:14:29,897 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (44)] Ended with exit code 0 [2022-04-15 15:14:30,081 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 44 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable42 [2022-04-15 15:14:30,081 INFO L403 AbstractCegarLoop]: === Iteration 44 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:30,082 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 17 times [2022-04-15 15:14:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:30,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [841928508] [2022-04-15 15:14:30,082 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:30,082 INFO L85 PathProgramCache]: Analyzing trace with hash 1255136270, now seen corresponding path program 18 times [2022-04-15 15:14:30,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:30,082 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924498282] [2022-04-15 15:14:30,082 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:30,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:30,095 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:30,095 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1176400737] [2022-04-15 15:14:30,095 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:14:30,095 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:30,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:30,096 INFO L229 MonitoredProcess]: Starting monitored process 45 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:30,098 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Waiting until timeout for monitored process [2022-04-15 15:14:30,276 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:14:30,276 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:30,278 INFO L263 TraceCheckSpWp]: Trace formula consists of 322 conjuncts, 31 conjunts are in the unsatisfiable core [2022-04-15 15:14:30,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:30,307 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:30,964 INFO L272 TraceCheckUtils]: 0: Hoare triple {100741#true} call ULTIMATE.init(); {100741#true} is VALID [2022-04-15 15:14:30,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {100741#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; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {100749#(<= ~counter~0 0)} assume true; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,966 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {100749#(<= ~counter~0 0)} {100741#true} #102#return; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,966 INFO L272 TraceCheckUtils]: 4: Hoare triple {100749#(<= ~counter~0 0)} call #t~ret9 := main(); {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {100749#(<= ~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; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,967 INFO L272 TraceCheckUtils]: 6: Hoare triple {100749#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,967 INFO L290 TraceCheckUtils]: 7: Hoare triple {100749#(<= ~counter~0 0)} ~cond := #in~cond; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,967 INFO L290 TraceCheckUtils]: 8: Hoare triple {100749#(<= ~counter~0 0)} assume !(0 == ~cond); {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,968 INFO L290 TraceCheckUtils]: 9: Hoare triple {100749#(<= ~counter~0 0)} assume true; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,968 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {100749#(<= ~counter~0 0)} {100749#(<= ~counter~0 0)} #90#return; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,968 INFO L272 TraceCheckUtils]: 11: Hoare triple {100749#(<= ~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)); {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,969 INFO L290 TraceCheckUtils]: 12: Hoare triple {100749#(<= ~counter~0 0)} ~cond := #in~cond; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,969 INFO L290 TraceCheckUtils]: 13: Hoare triple {100749#(<= ~counter~0 0)} assume !(0 == ~cond); {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {100749#(<= ~counter~0 0)} assume true; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,969 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {100749#(<= ~counter~0 0)} {100749#(<= ~counter~0 0)} #92#return; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,970 INFO L290 TraceCheckUtils]: 16: Hoare triple {100749#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {100749#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:30,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {100749#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100798#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:30,972 INFO L290 TraceCheckUtils]: 18: Hoare triple {100798#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {100798#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:30,973 INFO L272 TraceCheckUtils]: 19: Hoare triple {100798#(<= ~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)); {100798#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:30,973 INFO L290 TraceCheckUtils]: 20: Hoare triple {100798#(<= ~counter~0 1)} ~cond := #in~cond; {100798#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:30,973 INFO L290 TraceCheckUtils]: 21: Hoare triple {100798#(<= ~counter~0 1)} assume !(0 == ~cond); {100798#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:30,973 INFO L290 TraceCheckUtils]: 22: Hoare triple {100798#(<= ~counter~0 1)} assume true; {100798#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:30,974 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {100798#(<= ~counter~0 1)} {100798#(<= ~counter~0 1)} #94#return; {100798#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:30,974 INFO L290 TraceCheckUtils]: 24: Hoare triple {100798#(<= ~counter~0 1)} assume !!(0 != ~r~0); {100798#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:30,975 INFO L290 TraceCheckUtils]: 25: Hoare triple {100798#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100823#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:30,975 INFO L290 TraceCheckUtils]: 26: Hoare triple {100823#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {100823#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:30,976 INFO L272 TraceCheckUtils]: 27: Hoare triple {100823#(<= ~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)); {100823#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:30,976 INFO L290 TraceCheckUtils]: 28: Hoare triple {100823#(<= ~counter~0 2)} ~cond := #in~cond; {100823#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:30,976 INFO L290 TraceCheckUtils]: 29: Hoare triple {100823#(<= ~counter~0 2)} assume !(0 == ~cond); {100823#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:30,977 INFO L290 TraceCheckUtils]: 30: Hoare triple {100823#(<= ~counter~0 2)} assume true; {100823#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:30,977 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {100823#(<= ~counter~0 2)} {100823#(<= ~counter~0 2)} #96#return; {100823#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:30,977 INFO L290 TraceCheckUtils]: 32: Hoare triple {100823#(<= ~counter~0 2)} assume !(~r~0 > 0); {100823#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:30,978 INFO L290 TraceCheckUtils]: 33: Hoare triple {100823#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100848#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:30,978 INFO L290 TraceCheckUtils]: 34: Hoare triple {100848#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {100848#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:30,979 INFO L272 TraceCheckUtils]: 35: Hoare triple {100848#(<= ~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)); {100848#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:30,979 INFO L290 TraceCheckUtils]: 36: Hoare triple {100848#(<= ~counter~0 3)} ~cond := #in~cond; {100848#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:30,979 INFO L290 TraceCheckUtils]: 37: Hoare triple {100848#(<= ~counter~0 3)} assume !(0 == ~cond); {100848#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:30,980 INFO L290 TraceCheckUtils]: 38: Hoare triple {100848#(<= ~counter~0 3)} assume true; {100848#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:30,980 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {100848#(<= ~counter~0 3)} {100848#(<= ~counter~0 3)} #98#return; {100848#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:30,981 INFO L290 TraceCheckUtils]: 40: Hoare triple {100848#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100848#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:30,981 INFO L290 TraceCheckUtils]: 41: Hoare triple {100848#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100873#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:30,982 INFO L290 TraceCheckUtils]: 42: Hoare triple {100873#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {100873#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:30,982 INFO L272 TraceCheckUtils]: 43: Hoare triple {100873#(<= ~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)); {100873#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:30,982 INFO L290 TraceCheckUtils]: 44: Hoare triple {100873#(<= ~counter~0 4)} ~cond := #in~cond; {100873#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:30,983 INFO L290 TraceCheckUtils]: 45: Hoare triple {100873#(<= ~counter~0 4)} assume !(0 == ~cond); {100873#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:30,983 INFO L290 TraceCheckUtils]: 46: Hoare triple {100873#(<= ~counter~0 4)} assume true; {100873#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:30,983 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {100873#(<= ~counter~0 4)} {100873#(<= ~counter~0 4)} #98#return; {100873#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:30,984 INFO L290 TraceCheckUtils]: 48: Hoare triple {100873#(<= ~counter~0 4)} assume !(~r~0 < 0); {100873#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:30,985 INFO L290 TraceCheckUtils]: 49: Hoare triple {100873#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100898#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:30,985 INFO L290 TraceCheckUtils]: 50: Hoare triple {100898#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {100898#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:30,985 INFO L272 TraceCheckUtils]: 51: Hoare triple {100898#(<= ~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)); {100898#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:30,986 INFO L290 TraceCheckUtils]: 52: Hoare triple {100898#(<= ~counter~0 5)} ~cond := #in~cond; {100898#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:30,986 INFO L290 TraceCheckUtils]: 53: Hoare triple {100898#(<= ~counter~0 5)} assume !(0 == ~cond); {100898#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:30,986 INFO L290 TraceCheckUtils]: 54: Hoare triple {100898#(<= ~counter~0 5)} assume true; {100898#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:30,987 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {100898#(<= ~counter~0 5)} {100898#(<= ~counter~0 5)} #94#return; {100898#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:30,987 INFO L290 TraceCheckUtils]: 56: Hoare triple {100898#(<= ~counter~0 5)} assume !!(0 != ~r~0); {100898#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:30,988 INFO L290 TraceCheckUtils]: 57: Hoare triple {100898#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100923#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:30,988 INFO L290 TraceCheckUtils]: 58: Hoare triple {100923#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {100923#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:30,989 INFO L272 TraceCheckUtils]: 59: Hoare triple {100923#(<= ~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)); {100923#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:30,989 INFO L290 TraceCheckUtils]: 60: Hoare triple {100923#(<= ~counter~0 6)} ~cond := #in~cond; {100923#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:30,989 INFO L290 TraceCheckUtils]: 61: Hoare triple {100923#(<= ~counter~0 6)} assume !(0 == ~cond); {100923#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:30,989 INFO L290 TraceCheckUtils]: 62: Hoare triple {100923#(<= ~counter~0 6)} assume true; {100923#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:30,990 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {100923#(<= ~counter~0 6)} {100923#(<= ~counter~0 6)} #96#return; {100923#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:30,990 INFO L290 TraceCheckUtils]: 64: Hoare triple {100923#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100923#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:30,991 INFO L290 TraceCheckUtils]: 65: Hoare triple {100923#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100948#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:30,991 INFO L290 TraceCheckUtils]: 66: Hoare triple {100948#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {100948#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:30,992 INFO L272 TraceCheckUtils]: 67: Hoare triple {100948#(<= ~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)); {100948#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:30,992 INFO L290 TraceCheckUtils]: 68: Hoare triple {100948#(<= ~counter~0 7)} ~cond := #in~cond; {100948#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:30,992 INFO L290 TraceCheckUtils]: 69: Hoare triple {100948#(<= ~counter~0 7)} assume !(0 == ~cond); {100948#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:30,993 INFO L290 TraceCheckUtils]: 70: Hoare triple {100948#(<= ~counter~0 7)} assume true; {100948#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:30,993 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {100948#(<= ~counter~0 7)} {100948#(<= ~counter~0 7)} #96#return; {100948#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:30,993 INFO L290 TraceCheckUtils]: 72: Hoare triple {100948#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {100948#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:30,994 INFO L290 TraceCheckUtils]: 73: Hoare triple {100948#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {100973#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:30,995 INFO L290 TraceCheckUtils]: 74: Hoare triple {100973#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {100973#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:30,995 INFO L272 TraceCheckUtils]: 75: Hoare triple {100973#(<= ~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)); {100973#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:30,995 INFO L290 TraceCheckUtils]: 76: Hoare triple {100973#(<= ~counter~0 8)} ~cond := #in~cond; {100973#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:30,996 INFO L290 TraceCheckUtils]: 77: Hoare triple {100973#(<= ~counter~0 8)} assume !(0 == ~cond); {100973#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:30,996 INFO L290 TraceCheckUtils]: 78: Hoare triple {100973#(<= ~counter~0 8)} assume true; {100973#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:30,996 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {100973#(<= ~counter~0 8)} {100973#(<= ~counter~0 8)} #96#return; {100973#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:30,997 INFO L290 TraceCheckUtils]: 80: Hoare triple {100973#(<= ~counter~0 8)} assume !(~r~0 > 0); {100973#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:30,997 INFO L290 TraceCheckUtils]: 81: Hoare triple {100973#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100998#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:30,998 INFO L290 TraceCheckUtils]: 82: Hoare triple {100998#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {100998#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:30,998 INFO L272 TraceCheckUtils]: 83: Hoare triple {100998#(<= ~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)); {100998#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:30,998 INFO L290 TraceCheckUtils]: 84: Hoare triple {100998#(<= ~counter~0 9)} ~cond := #in~cond; {100998#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:30,999 INFO L290 TraceCheckUtils]: 85: Hoare triple {100998#(<= ~counter~0 9)} assume !(0 == ~cond); {100998#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:30,999 INFO L290 TraceCheckUtils]: 86: Hoare triple {100998#(<= ~counter~0 9)} assume true; {100998#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:31,000 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {100998#(<= ~counter~0 9)} {100998#(<= ~counter~0 9)} #98#return; {100998#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:31,000 INFO L290 TraceCheckUtils]: 88: Hoare triple {100998#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {100998#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:31,001 INFO L290 TraceCheckUtils]: 89: Hoare triple {100998#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {101023#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:31,001 INFO L290 TraceCheckUtils]: 90: Hoare triple {101023#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {101023#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:31,001 INFO L272 TraceCheckUtils]: 91: Hoare triple {101023#(<= ~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)); {101023#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:31,002 INFO L290 TraceCheckUtils]: 92: Hoare triple {101023#(<= ~counter~0 10)} ~cond := #in~cond; {101023#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:31,002 INFO L290 TraceCheckUtils]: 93: Hoare triple {101023#(<= ~counter~0 10)} assume !(0 == ~cond); {101023#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:31,002 INFO L290 TraceCheckUtils]: 94: Hoare triple {101023#(<= ~counter~0 10)} assume true; {101023#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:31,003 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {101023#(<= ~counter~0 10)} {101023#(<= ~counter~0 10)} #98#return; {101023#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:31,003 INFO L290 TraceCheckUtils]: 96: Hoare triple {101023#(<= ~counter~0 10)} assume !(~r~0 < 0); {101023#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:31,004 INFO L290 TraceCheckUtils]: 97: Hoare triple {101023#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {101048#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:31,004 INFO L290 TraceCheckUtils]: 98: Hoare triple {101048#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {101048#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:31,005 INFO L272 TraceCheckUtils]: 99: Hoare triple {101048#(<= ~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)); {101048#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:31,005 INFO L290 TraceCheckUtils]: 100: Hoare triple {101048#(<= ~counter~0 11)} ~cond := #in~cond; {101048#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:31,005 INFO L290 TraceCheckUtils]: 101: Hoare triple {101048#(<= ~counter~0 11)} assume !(0 == ~cond); {101048#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:31,006 INFO L290 TraceCheckUtils]: 102: Hoare triple {101048#(<= ~counter~0 11)} assume true; {101048#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:31,006 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {101048#(<= ~counter~0 11)} {101048#(<= ~counter~0 11)} #94#return; {101048#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:31,006 INFO L290 TraceCheckUtils]: 104: Hoare triple {101048#(<= ~counter~0 11)} assume !!(0 != ~r~0); {101048#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:31,007 INFO L290 TraceCheckUtils]: 105: Hoare triple {101048#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101073#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:31,007 INFO L290 TraceCheckUtils]: 106: Hoare triple {101073#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {101073#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:31,008 INFO L272 TraceCheckUtils]: 107: Hoare triple {101073#(<= ~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)); {101073#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:31,008 INFO L290 TraceCheckUtils]: 108: Hoare triple {101073#(<= ~counter~0 12)} ~cond := #in~cond; {101073#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:31,008 INFO L290 TraceCheckUtils]: 109: Hoare triple {101073#(<= ~counter~0 12)} assume !(0 == ~cond); {101073#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:31,009 INFO L290 TraceCheckUtils]: 110: Hoare triple {101073#(<= ~counter~0 12)} assume true; {101073#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:31,009 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {101073#(<= ~counter~0 12)} {101073#(<= ~counter~0 12)} #96#return; {101073#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:31,009 INFO L290 TraceCheckUtils]: 112: Hoare triple {101073#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {101073#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:31,010 INFO L290 TraceCheckUtils]: 113: Hoare triple {101073#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101098#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:31,011 INFO L290 TraceCheckUtils]: 114: Hoare triple {101098#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {101098#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:31,011 INFO L272 TraceCheckUtils]: 115: Hoare triple {101098#(<= ~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)); {101098#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:31,011 INFO L290 TraceCheckUtils]: 116: Hoare triple {101098#(<= ~counter~0 13)} ~cond := #in~cond; {101098#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:31,012 INFO L290 TraceCheckUtils]: 117: Hoare triple {101098#(<= ~counter~0 13)} assume !(0 == ~cond); {101098#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:31,012 INFO L290 TraceCheckUtils]: 118: Hoare triple {101098#(<= ~counter~0 13)} assume true; {101098#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:31,012 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {101098#(<= ~counter~0 13)} {101098#(<= ~counter~0 13)} #96#return; {101098#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:31,013 INFO L290 TraceCheckUtils]: 120: Hoare triple {101098#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {101098#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:31,013 INFO L290 TraceCheckUtils]: 121: Hoare triple {101098#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101123#(<= |main_#t~post7| 13)} is VALID [2022-04-15 15:14:31,013 INFO L290 TraceCheckUtils]: 122: Hoare triple {101123#(<= |main_#t~post7| 13)} assume !(#t~post7 < 100);havoc #t~post7; {100742#false} is VALID [2022-04-15 15:14:31,013 INFO L290 TraceCheckUtils]: 123: Hoare triple {100742#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100742#false} is VALID [2022-04-15 15:14:31,014 INFO L290 TraceCheckUtils]: 124: Hoare triple {100742#false} assume !(#t~post8 < 100);havoc #t~post8; {100742#false} is VALID [2022-04-15 15:14:31,014 INFO L290 TraceCheckUtils]: 125: Hoare triple {100742#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100742#false} is VALID [2022-04-15 15:14:31,014 INFO L290 TraceCheckUtils]: 126: Hoare triple {100742#false} assume !(#t~post6 < 100);havoc #t~post6; {100742#false} is VALID [2022-04-15 15:14:31,014 INFO L272 TraceCheckUtils]: 127: Hoare triple {100742#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)); {100742#false} is VALID [2022-04-15 15:14:31,014 INFO L290 TraceCheckUtils]: 128: Hoare triple {100742#false} ~cond := #in~cond; {100742#false} is VALID [2022-04-15 15:14:31,014 INFO L290 TraceCheckUtils]: 129: Hoare triple {100742#false} assume 0 == ~cond; {100742#false} is VALID [2022-04-15 15:14:31,014 INFO L290 TraceCheckUtils]: 130: Hoare triple {100742#false} assume !false; {100742#false} is VALID [2022-04-15 15:14:31,014 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 420 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:14:31,014 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:31,759 INFO L290 TraceCheckUtils]: 130: Hoare triple {100742#false} assume !false; {100742#false} is VALID [2022-04-15 15:14:31,760 INFO L290 TraceCheckUtils]: 129: Hoare triple {100742#false} assume 0 == ~cond; {100742#false} is VALID [2022-04-15 15:14:31,760 INFO L290 TraceCheckUtils]: 128: Hoare triple {100742#false} ~cond := #in~cond; {100742#false} is VALID [2022-04-15 15:14:31,760 INFO L272 TraceCheckUtils]: 127: Hoare triple {100742#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)); {100742#false} is VALID [2022-04-15 15:14:31,760 INFO L290 TraceCheckUtils]: 126: Hoare triple {100742#false} assume !(#t~post6 < 100);havoc #t~post6; {100742#false} is VALID [2022-04-15 15:14:31,760 INFO L290 TraceCheckUtils]: 125: Hoare triple {100742#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {100742#false} is VALID [2022-04-15 15:14:31,760 INFO L290 TraceCheckUtils]: 124: Hoare triple {100742#false} assume !(#t~post8 < 100);havoc #t~post8; {100742#false} is VALID [2022-04-15 15:14:31,760 INFO L290 TraceCheckUtils]: 123: Hoare triple {100742#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {100742#false} is VALID [2022-04-15 15:14:31,760 INFO L290 TraceCheckUtils]: 122: Hoare triple {101175#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {100742#false} is VALID [2022-04-15 15:14:31,761 INFO L290 TraceCheckUtils]: 121: Hoare triple {101179#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101175#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:14:31,761 INFO L290 TraceCheckUtils]: 120: Hoare triple {101179#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {101179#(< ~counter~0 100)} is VALID [2022-04-15 15:14:31,762 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {100741#true} {101179#(< ~counter~0 100)} #96#return; {101179#(< ~counter~0 100)} is VALID [2022-04-15 15:14:31,762 INFO L290 TraceCheckUtils]: 118: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,762 INFO L290 TraceCheckUtils]: 117: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,762 INFO L290 TraceCheckUtils]: 116: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,762 INFO L272 TraceCheckUtils]: 115: Hoare triple {101179#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,762 INFO L290 TraceCheckUtils]: 114: Hoare triple {101179#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {101179#(< ~counter~0 100)} is VALID [2022-04-15 15:14:31,764 INFO L290 TraceCheckUtils]: 113: Hoare triple {101204#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101179#(< ~counter~0 100)} is VALID [2022-04-15 15:14:31,764 INFO L290 TraceCheckUtils]: 112: Hoare triple {101204#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {101204#(< ~counter~0 99)} is VALID [2022-04-15 15:14:31,765 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {100741#true} {101204#(< ~counter~0 99)} #96#return; {101204#(< ~counter~0 99)} is VALID [2022-04-15 15:14:31,765 INFO L290 TraceCheckUtils]: 110: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,765 INFO L290 TraceCheckUtils]: 109: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,765 INFO L290 TraceCheckUtils]: 108: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,765 INFO L272 TraceCheckUtils]: 107: Hoare triple {101204#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,765 INFO L290 TraceCheckUtils]: 106: Hoare triple {101204#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {101204#(< ~counter~0 99)} is VALID [2022-04-15 15:14:31,766 INFO L290 TraceCheckUtils]: 105: Hoare triple {101229#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101204#(< ~counter~0 99)} is VALID [2022-04-15 15:14:31,766 INFO L290 TraceCheckUtils]: 104: Hoare triple {101229#(< ~counter~0 98)} assume !!(0 != ~r~0); {101229#(< ~counter~0 98)} is VALID [2022-04-15 15:14:31,767 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {100741#true} {101229#(< ~counter~0 98)} #94#return; {101229#(< ~counter~0 98)} is VALID [2022-04-15 15:14:31,767 INFO L290 TraceCheckUtils]: 102: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,767 INFO L290 TraceCheckUtils]: 101: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,767 INFO L290 TraceCheckUtils]: 100: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,767 INFO L272 TraceCheckUtils]: 99: Hoare triple {101229#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,768 INFO L290 TraceCheckUtils]: 98: Hoare triple {101229#(< ~counter~0 98)} assume !!(#t~post6 < 100);havoc #t~post6; {101229#(< ~counter~0 98)} is VALID [2022-04-15 15:14:31,768 INFO L290 TraceCheckUtils]: 97: Hoare triple {101254#(< ~counter~0 97)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {101229#(< ~counter~0 98)} is VALID [2022-04-15 15:14:31,769 INFO L290 TraceCheckUtils]: 96: Hoare triple {101254#(< ~counter~0 97)} assume !(~r~0 < 0); {101254#(< ~counter~0 97)} is VALID [2022-04-15 15:14:31,769 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {100741#true} {101254#(< ~counter~0 97)} #98#return; {101254#(< ~counter~0 97)} is VALID [2022-04-15 15:14:31,769 INFO L290 TraceCheckUtils]: 94: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,769 INFO L290 TraceCheckUtils]: 93: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,769 INFO L290 TraceCheckUtils]: 92: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,769 INFO L272 TraceCheckUtils]: 91: Hoare triple {101254#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,770 INFO L290 TraceCheckUtils]: 90: Hoare triple {101254#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {101254#(< ~counter~0 97)} is VALID [2022-04-15 15:14:31,771 INFO L290 TraceCheckUtils]: 89: Hoare triple {101279#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {101254#(< ~counter~0 97)} is VALID [2022-04-15 15:14:31,771 INFO L290 TraceCheckUtils]: 88: Hoare triple {101279#(< ~counter~0 96)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {101279#(< ~counter~0 96)} is VALID [2022-04-15 15:14:31,771 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {100741#true} {101279#(< ~counter~0 96)} #98#return; {101279#(< ~counter~0 96)} is VALID [2022-04-15 15:14:31,771 INFO L290 TraceCheckUtils]: 86: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,772 INFO L290 TraceCheckUtils]: 85: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,772 INFO L290 TraceCheckUtils]: 84: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,772 INFO L272 TraceCheckUtils]: 83: Hoare triple {101279#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,772 INFO L290 TraceCheckUtils]: 82: Hoare triple {101279#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {101279#(< ~counter~0 96)} is VALID [2022-04-15 15:14:31,773 INFO L290 TraceCheckUtils]: 81: Hoare triple {101304#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {101279#(< ~counter~0 96)} is VALID [2022-04-15 15:14:31,773 INFO L290 TraceCheckUtils]: 80: Hoare triple {101304#(< ~counter~0 95)} assume !(~r~0 > 0); {101304#(< ~counter~0 95)} is VALID [2022-04-15 15:14:31,774 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {100741#true} {101304#(< ~counter~0 95)} #96#return; {101304#(< ~counter~0 95)} is VALID [2022-04-15 15:14:31,774 INFO L290 TraceCheckUtils]: 78: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,774 INFO L290 TraceCheckUtils]: 77: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,774 INFO L290 TraceCheckUtils]: 76: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,774 INFO L272 TraceCheckUtils]: 75: Hoare triple {101304#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,774 INFO L290 TraceCheckUtils]: 74: Hoare triple {101304#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {101304#(< ~counter~0 95)} is VALID [2022-04-15 15:14:31,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {101329#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101304#(< ~counter~0 95)} is VALID [2022-04-15 15:14:31,775 INFO L290 TraceCheckUtils]: 72: Hoare triple {101329#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {101329#(< ~counter~0 94)} is VALID [2022-04-15 15:14:31,776 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {100741#true} {101329#(< ~counter~0 94)} #96#return; {101329#(< ~counter~0 94)} is VALID [2022-04-15 15:14:31,776 INFO L290 TraceCheckUtils]: 70: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,776 INFO L290 TraceCheckUtils]: 69: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,776 INFO L290 TraceCheckUtils]: 68: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,776 INFO L272 TraceCheckUtils]: 67: Hoare triple {101329#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,776 INFO L290 TraceCheckUtils]: 66: Hoare triple {101329#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {101329#(< ~counter~0 94)} is VALID [2022-04-15 15:14:31,777 INFO L290 TraceCheckUtils]: 65: Hoare triple {101354#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101329#(< ~counter~0 94)} is VALID [2022-04-15 15:14:31,777 INFO L290 TraceCheckUtils]: 64: Hoare triple {101354#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {101354#(< ~counter~0 93)} is VALID [2022-04-15 15:14:31,778 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {100741#true} {101354#(< ~counter~0 93)} #96#return; {101354#(< ~counter~0 93)} is VALID [2022-04-15 15:14:31,778 INFO L290 TraceCheckUtils]: 62: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,778 INFO L290 TraceCheckUtils]: 61: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,778 INFO L290 TraceCheckUtils]: 60: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,778 INFO L272 TraceCheckUtils]: 59: Hoare triple {101354#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,778 INFO L290 TraceCheckUtils]: 58: Hoare triple {101354#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {101354#(< ~counter~0 93)} is VALID [2022-04-15 15:14:31,779 INFO L290 TraceCheckUtils]: 57: Hoare triple {101379#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101354#(< ~counter~0 93)} is VALID [2022-04-15 15:14:31,780 INFO L290 TraceCheckUtils]: 56: Hoare triple {101379#(< ~counter~0 92)} assume !!(0 != ~r~0); {101379#(< ~counter~0 92)} is VALID [2022-04-15 15:14:31,780 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {100741#true} {101379#(< ~counter~0 92)} #94#return; {101379#(< ~counter~0 92)} is VALID [2022-04-15 15:14:31,780 INFO L290 TraceCheckUtils]: 54: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,780 INFO L290 TraceCheckUtils]: 53: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,780 INFO L290 TraceCheckUtils]: 52: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,785 INFO L272 TraceCheckUtils]: 51: Hoare triple {101379#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,786 INFO L290 TraceCheckUtils]: 50: Hoare triple {101379#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {101379#(< ~counter~0 92)} is VALID [2022-04-15 15:14:31,788 INFO L290 TraceCheckUtils]: 49: Hoare triple {101404#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {101379#(< ~counter~0 92)} is VALID [2022-04-15 15:14:31,789 INFO L290 TraceCheckUtils]: 48: Hoare triple {101404#(< ~counter~0 91)} assume !(~r~0 < 0); {101404#(< ~counter~0 91)} is VALID [2022-04-15 15:14:31,789 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {100741#true} {101404#(< ~counter~0 91)} #98#return; {101404#(< ~counter~0 91)} is VALID [2022-04-15 15:14:31,789 INFO L290 TraceCheckUtils]: 46: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,789 INFO L290 TraceCheckUtils]: 45: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,789 INFO L290 TraceCheckUtils]: 44: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,789 INFO L272 TraceCheckUtils]: 43: Hoare triple {101404#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,790 INFO L290 TraceCheckUtils]: 42: Hoare triple {101404#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {101404#(< ~counter~0 91)} is VALID [2022-04-15 15:14:31,791 INFO L290 TraceCheckUtils]: 41: Hoare triple {101429#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {101404#(< ~counter~0 91)} is VALID [2022-04-15 15:14:31,791 INFO L290 TraceCheckUtils]: 40: Hoare triple {101429#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {101429#(< ~counter~0 90)} is VALID [2022-04-15 15:14:31,791 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {100741#true} {101429#(< ~counter~0 90)} #98#return; {101429#(< ~counter~0 90)} is VALID [2022-04-15 15:14:31,791 INFO L290 TraceCheckUtils]: 38: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,791 INFO L290 TraceCheckUtils]: 37: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,792 INFO L272 TraceCheckUtils]: 35: Hoare triple {101429#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {101429#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {101429#(< ~counter~0 90)} is VALID [2022-04-15 15:14:31,793 INFO L290 TraceCheckUtils]: 33: Hoare triple {101454#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {101429#(< ~counter~0 90)} is VALID [2022-04-15 15:14:31,793 INFO L290 TraceCheckUtils]: 32: Hoare triple {101454#(< ~counter~0 89)} assume !(~r~0 > 0); {101454#(< ~counter~0 89)} is VALID [2022-04-15 15:14:31,794 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {100741#true} {101454#(< ~counter~0 89)} #96#return; {101454#(< ~counter~0 89)} is VALID [2022-04-15 15:14:31,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,794 INFO L272 TraceCheckUtils]: 27: Hoare triple {101454#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,794 INFO L290 TraceCheckUtils]: 26: Hoare triple {101454#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {101454#(< ~counter~0 89)} is VALID [2022-04-15 15:14:31,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {101479#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {101454#(< ~counter~0 89)} is VALID [2022-04-15 15:14:31,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {101479#(< ~counter~0 88)} assume !!(0 != ~r~0); {101479#(< ~counter~0 88)} is VALID [2022-04-15 15:14:31,796 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {100741#true} {101479#(< ~counter~0 88)} #94#return; {101479#(< ~counter~0 88)} is VALID [2022-04-15 15:14:31,796 INFO L290 TraceCheckUtils]: 22: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,796 INFO L290 TraceCheckUtils]: 21: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,796 INFO L290 TraceCheckUtils]: 20: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,796 INFO L272 TraceCheckUtils]: 19: Hoare triple {101479#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {101479#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {101479#(< ~counter~0 88)} is VALID [2022-04-15 15:14:31,797 INFO L290 TraceCheckUtils]: 17: Hoare triple {101504#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {101479#(< ~counter~0 88)} is VALID [2022-04-15 15:14:31,797 INFO L290 TraceCheckUtils]: 16: Hoare triple {101504#(< ~counter~0 87)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {101504#(< ~counter~0 87)} is VALID [2022-04-15 15:14:31,798 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {100741#true} {101504#(< ~counter~0 87)} #92#return; {101504#(< ~counter~0 87)} is VALID [2022-04-15 15:14:31,798 INFO L290 TraceCheckUtils]: 14: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,798 INFO L272 TraceCheckUtils]: 11: Hoare triple {101504#(< ~counter~0 87)} 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)); {100741#true} is VALID [2022-04-15 15:14:31,798 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {100741#true} {101504#(< ~counter~0 87)} #90#return; {101504#(< ~counter~0 87)} is VALID [2022-04-15 15:14:31,799 INFO L290 TraceCheckUtils]: 9: Hoare triple {100741#true} assume true; {100741#true} is VALID [2022-04-15 15:14:31,799 INFO L290 TraceCheckUtils]: 8: Hoare triple {100741#true} assume !(0 == ~cond); {100741#true} is VALID [2022-04-15 15:14:31,799 INFO L290 TraceCheckUtils]: 7: Hoare triple {100741#true} ~cond := #in~cond; {100741#true} is VALID [2022-04-15 15:14:31,799 INFO L272 TraceCheckUtils]: 6: Hoare triple {101504#(< ~counter~0 87)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {100741#true} is VALID [2022-04-15 15:14:31,799 INFO L290 TraceCheckUtils]: 5: Hoare triple {101504#(< ~counter~0 87)} 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; {101504#(< ~counter~0 87)} is VALID [2022-04-15 15:14:31,799 INFO L272 TraceCheckUtils]: 4: Hoare triple {101504#(< ~counter~0 87)} call #t~ret9 := main(); {101504#(< ~counter~0 87)} is VALID [2022-04-15 15:14:31,800 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {101504#(< ~counter~0 87)} {100741#true} #102#return; {101504#(< ~counter~0 87)} is VALID [2022-04-15 15:14:31,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {101504#(< ~counter~0 87)} assume true; {101504#(< ~counter~0 87)} is VALID [2022-04-15 15:14:31,800 INFO L290 TraceCheckUtils]: 1: Hoare triple {100741#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; {101504#(< ~counter~0 87)} is VALID [2022-04-15 15:14:31,800 INFO L272 TraceCheckUtils]: 0: Hoare triple {100741#true} call ULTIMATE.init(); {100741#true} is VALID [2022-04-15 15:14:31,801 INFO L134 CoverageAnalysis]: Checked inductivity of 464 backedges. 40 proven. 108 refuted. 0 times theorem prover too weak. 316 trivial. 0 not checked. [2022-04-15 15:14:31,801 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:31,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924498282] [2022-04-15 15:14:31,801 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:31,801 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1176400737] [2022-04-15 15:14:31,801 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1176400737] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:31,801 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:31,801 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17] total 32 [2022-04-15 15:14:31,801 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:31,802 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [841928508] [2022-04-15 15:14:31,802 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [841928508] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:31,802 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:31,802 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-04-15 15:14:31,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220745717] [2022-04-15 15:14:31,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:31,802 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 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 131 [2022-04-15 15:14:31,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:31,802 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 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-15 15:14:31,908 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-15 15:14:31,908 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-04-15 15:14:31,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:31,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-04-15 15:14:31,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=440, Invalid=552, Unknown=0, NotChecked=0, Total=992 [2022-04-15 15:14:31,909 INFO L87 Difference]: Start difference. First operand 694 states and 939 transitions. Second operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 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-15 15:14:35,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:35,335 INFO L93 Difference]: Finished difference Result 907 states and 1263 transitions. [2022-04-15 15:14:35,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 15:14:35,335 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 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 131 [2022-04-15 15:14:35,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:35,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 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-15 15:14:35,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-15 15:14:35,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 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-15 15:14:35,339 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 296 transitions. [2022-04-15 15:14:35,339 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 296 transitions. [2022-04-15 15:14:35,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 296 edges. 296 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:35,631 INFO L225 Difference]: With dead ends: 907 [2022-04-15 15:14:35,631 INFO L226 Difference]: Without dead ends: 710 [2022-04-15 15:14:35,632 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 273 GetRequests, 231 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 106 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=800, Invalid=1092, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 15:14:35,633 INFO L913 BasicCegarLoop]: 69 mSDtfsCounter, 249 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 215 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 249 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 215 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:35,633 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [249 Valid, 288 Invalid, 384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [215 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:14:35,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 710 states. [2022-04-15 15:14:37,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 710 to 710. [2022-04-15 15:14:37,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:37,917 INFO L82 GeneralOperation]: Start isEquivalent. First operand 710 states. Second operand has 710 states, 539 states have (on average 1.2077922077922079) internal successors, (651), 539 states have internal predecessors, (651), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:37,917 INFO L74 IsIncluded]: Start isIncluded. First operand 710 states. Second operand has 710 states, 539 states have (on average 1.2077922077922079) internal successors, (651), 539 states have internal predecessors, (651), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:37,918 INFO L87 Difference]: Start difference. First operand 710 states. Second operand has 710 states, 539 states have (on average 1.2077922077922079) internal successors, (651), 539 states have internal predecessors, (651), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:37,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:37,937 INFO L93 Difference]: Finished difference Result 710 states and 955 transitions. [2022-04-15 15:14:37,937 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 955 transitions. [2022-04-15 15:14:37,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:37,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:37,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 710 states, 539 states have (on average 1.2077922077922079) internal successors, (651), 539 states have internal predecessors, (651), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 710 states. [2022-04-15 15:14:37,939 INFO L87 Difference]: Start difference. First operand has 710 states, 539 states have (on average 1.2077922077922079) internal successors, (651), 539 states have internal predecessors, (651), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) Second operand 710 states. [2022-04-15 15:14:37,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:37,956 INFO L93 Difference]: Finished difference Result 710 states and 955 transitions. [2022-04-15 15:14:37,956 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 955 transitions. [2022-04-15 15:14:37,957 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:37,957 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:37,957 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:37,957 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:37,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 710 states, 539 states have (on average 1.2077922077922079) internal successors, (651), 539 states have internal predecessors, (651), 153 states have call successors, (153), 19 states have call predecessors, (153), 17 states have return successors, (151), 151 states have call predecessors, (151), 151 states have call successors, (151) [2022-04-15 15:14:37,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 710 states to 710 states and 955 transitions. [2022-04-15 15:14:37,980 INFO L78 Accepts]: Start accepts. Automaton has 710 states and 955 transitions. Word has length 131 [2022-04-15 15:14:37,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:37,981 INFO L478 AbstractCegarLoop]: Abstraction has 710 states and 955 transitions. [2022-04-15 15:14:37,981 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 5.529411764705882) internal successors, (94), 16 states have internal predecessors, (94), 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-15 15:14:37,981 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 710 states and 955 transitions. [2022-04-15 15:14:41,051 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 955 edges. 955 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:41,051 INFO L276 IsEmpty]: Start isEmpty. Operand 710 states and 955 transitions. [2022-04-15 15:14:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 15:14:41,052 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:41,053 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:14:41,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (45)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:41,253 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable43,45 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:41,253 INFO L403 AbstractCegarLoop]: === Iteration 45 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:41,253 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 11 times [2022-04-15 15:14:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:41,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1073622177] [2022-04-15 15:14:41,254 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:41,254 INFO L85 PathProgramCache]: Analyzing trace with hash 1252937077, now seen corresponding path program 12 times [2022-04-15 15:14:41,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:41,254 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139099983] [2022-04-15 15:14:41,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:41,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:41,267 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:41,267 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1255515789] [2022-04-15 15:14:41,267 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:14:41,267 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:41,268 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:41,268 INFO L229 MonitoredProcess]: Starting monitored process 46 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:41,271 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Waiting until timeout for monitored process [2022-04-15 15:14:41,354 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 5 check-sat command(s) [2022-04-15 15:14:41,354 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:41,355 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 10 conjunts are in the unsatisfiable core [2022-04-15 15:14:41,372 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:41,373 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:42,027 INFO L272 TraceCheckUtils]: 0: Hoare triple {106236#true} call ULTIMATE.init(); {106236#true} is VALID [2022-04-15 15:14:42,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {106236#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; {106236#true} is VALID [2022-04-15 15:14:42,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,027 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {106236#true} {106236#true} #102#return; {106236#true} is VALID [2022-04-15 15:14:42,027 INFO L272 TraceCheckUtils]: 4: Hoare triple {106236#true} call #t~ret9 := main(); {106236#true} is VALID [2022-04-15 15:14:42,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {106236#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; {106236#true} is VALID [2022-04-15 15:14:42,027 INFO L272 TraceCheckUtils]: 6: Hoare triple {106236#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {106236#true} is VALID [2022-04-15 15:14:42,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {106236#true} {106236#true} #90#return; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {106236#true} {106236#true} #92#return; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {106236#true} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {106236#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {106236#true} assume !!(#t~post6 < 100);havoc #t~post6; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L272 TraceCheckUtils]: 19: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 20: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 21: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 22: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {106236#true} {106236#true} #94#return; {106236#true} is VALID [2022-04-15 15:14:42,028 INFO L290 TraceCheckUtils]: 24: Hoare triple {106236#true} assume !!(0 != ~r~0); {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {106236#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {106236#true} assume !!(#t~post7 < 100);havoc #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L272 TraceCheckUtils]: 27: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 28: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 29: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 30: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {106236#true} {106236#true} #96#return; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 32: Hoare triple {106236#true} assume !(~r~0 > 0); {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 33: Hoare triple {106236#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 34: Hoare triple {106236#true} assume !!(#t~post8 < 100);havoc #t~post8; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L272 TraceCheckUtils]: 35: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 36: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 37: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 38: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {106236#true} {106236#true} #98#return; {106236#true} is VALID [2022-04-15 15:14:42,029 INFO L290 TraceCheckUtils]: 40: Hoare triple {106236#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 41: Hoare triple {106236#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 42: Hoare triple {106236#true} assume !!(#t~post8 < 100);havoc #t~post8; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L272 TraceCheckUtils]: 43: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 44: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 45: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 46: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {106236#true} {106236#true} #98#return; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 48: Hoare triple {106236#true} assume !(~r~0 < 0); {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 49: Hoare triple {106236#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 50: Hoare triple {106236#true} assume !!(#t~post6 < 100);havoc #t~post6; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L272 TraceCheckUtils]: 51: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 52: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 53: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L290 TraceCheckUtils]: 54: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,030 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {106236#true} {106236#true} #94#return; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 56: Hoare triple {106236#true} assume !!(0 != ~r~0); {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 57: Hoare triple {106236#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 58: Hoare triple {106236#true} assume !!(#t~post7 < 100);havoc #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L272 TraceCheckUtils]: 59: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 60: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 61: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 62: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {106236#true} {106236#true} #96#return; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 64: Hoare triple {106236#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 65: Hoare triple {106236#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 66: Hoare triple {106236#true} assume !!(#t~post7 < 100);havoc #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L272 TraceCheckUtils]: 67: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 68: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 69: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L290 TraceCheckUtils]: 70: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,031 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {106236#true} {106236#true} #96#return; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 72: Hoare triple {106236#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 73: Hoare triple {106236#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 74: Hoare triple {106236#true} assume !!(#t~post7 < 100);havoc #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L272 TraceCheckUtils]: 75: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 76: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 77: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 78: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {106236#true} {106236#true} #96#return; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 80: Hoare triple {106236#true} assume !(~r~0 > 0); {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 81: Hoare triple {106236#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 82: Hoare triple {106236#true} assume !!(#t~post8 < 100);havoc #t~post8; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L272 TraceCheckUtils]: 83: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 84: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 85: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,032 INFO L290 TraceCheckUtils]: 86: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {106236#true} {106236#true} #98#return; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 88: Hoare triple {106236#true} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 89: Hoare triple {106236#true} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 90: Hoare triple {106236#true} assume !!(#t~post8 < 100);havoc #t~post8; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L272 TraceCheckUtils]: 91: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 92: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 93: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 94: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {106236#true} {106236#true} #98#return; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 96: Hoare triple {106236#true} assume !(~r~0 < 0); {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 97: Hoare triple {106236#true} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 98: Hoare triple {106236#true} assume !!(#t~post6 < 100);havoc #t~post6; {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L272 TraceCheckUtils]: 99: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,033 INFO L290 TraceCheckUtils]: 100: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 101: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 102: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {106236#true} {106236#true} #94#return; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 104: Hoare triple {106236#true} assume !!(0 != ~r~0); {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 105: Hoare triple {106236#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 106: Hoare triple {106236#true} assume !!(#t~post7 < 100);havoc #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L272 TraceCheckUtils]: 107: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 108: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 109: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 110: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {106236#true} {106236#true} #96#return; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 112: Hoare triple {106236#true} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 113: Hoare triple {106236#true} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,034 INFO L290 TraceCheckUtils]: 114: Hoare triple {106236#true} assume !!(#t~post7 < 100);havoc #t~post7; {106236#true} is VALID [2022-04-15 15:14:42,035 INFO L272 TraceCheckUtils]: 115: Hoare triple {106236#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)); {106236#true} is VALID [2022-04-15 15:14:42,035 INFO L290 TraceCheckUtils]: 116: Hoare triple {106236#true} ~cond := #in~cond; {106236#true} is VALID [2022-04-15 15:14:42,035 INFO L290 TraceCheckUtils]: 117: Hoare triple {106236#true} assume !(0 == ~cond); {106236#true} is VALID [2022-04-15 15:14:42,035 INFO L290 TraceCheckUtils]: 118: Hoare triple {106236#true} assume true; {106236#true} is VALID [2022-04-15 15:14:42,035 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {106236#true} {106236#true} #96#return; {106236#true} is VALID [2022-04-15 15:14:42,035 INFO L290 TraceCheckUtils]: 120: Hoare triple {106236#true} assume !(~r~0 > 0); {106601#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:14:42,035 INFO L290 TraceCheckUtils]: 121: Hoare triple {106601#(not (< 0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {106601#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:14:42,036 INFO L290 TraceCheckUtils]: 122: Hoare triple {106601#(not (< 0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {106601#(not (< 0 main_~r~0))} is VALID [2022-04-15 15:14:42,036 INFO L272 TraceCheckUtils]: 123: Hoare triple {106601#(not (< 0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {106236#true} is VALID [2022-04-15 15:14:42,036 INFO L290 TraceCheckUtils]: 124: Hoare triple {106236#true} ~cond := #in~cond; {106614#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:14:42,036 INFO L290 TraceCheckUtils]: 125: Hoare triple {106614#(= |__VERIFIER_assert_#in~cond| __VERIFIER_assert_~cond)} assume !(0 == ~cond); {106618#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:14:42,037 INFO L290 TraceCheckUtils]: 126: Hoare triple {106618#(not (= |__VERIFIER_assert_#in~cond| 0))} assume true; {106618#(not (= |__VERIFIER_assert_#in~cond| 0))} is VALID [2022-04-15 15:14:42,037 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {106618#(not (= |__VERIFIER_assert_#in~cond| 0))} {106601#(not (< 0 main_~r~0))} #98#return; {106625#(and (= (+ (* 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))) (not (< 0 main_~r~0)))} is VALID [2022-04-15 15:14:42,040 INFO L290 TraceCheckUtils]: 128: Hoare triple {106625#(and (= (+ (* 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))) (not (< 0 main_~r~0)))} assume !(~r~0 < 0); {106629#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-15 15:14:42,040 INFO L290 TraceCheckUtils]: 129: Hoare triple {106629#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {106629#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-15 15:14:42,041 INFO L290 TraceCheckUtils]: 130: Hoare triple {106629#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} assume !(#t~post6 < 100);havoc #t~post6; {106629#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)))))} is VALID [2022-04-15 15:14:42,042 INFO L272 TraceCheckUtils]: 131: Hoare triple {106629#(and (= (mod (+ (* main_~v~0 2) (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* main_~u~0 2)) 4) 0) (not (< (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 4)) main_~A~0)) (not (< main_~A~0 (div (+ (* (- 1) main_~u~0 main_~u~0) (* main_~v~0 main_~v~0) (* (- 2) main_~v~0) (* main_~u~0 2)) (- 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)); {106639#(<= 1 |__VERIFIER_assert_#in~cond|)} is VALID [2022-04-15 15:14:42,042 INFO L290 TraceCheckUtils]: 132: Hoare triple {106639#(<= 1 |__VERIFIER_assert_#in~cond|)} ~cond := #in~cond; {106643#(<= 1 __VERIFIER_assert_~cond)} is VALID [2022-04-15 15:14:42,042 INFO L290 TraceCheckUtils]: 133: Hoare triple {106643#(<= 1 __VERIFIER_assert_~cond)} assume 0 == ~cond; {106237#false} is VALID [2022-04-15 15:14:42,043 INFO L290 TraceCheckUtils]: 134: Hoare triple {106237#false} assume !false; {106237#false} is VALID [2022-04-15 15:14:42,043 INFO L134 CoverageAnalysis]: Checked inductivity of 514 backedges. 88 proven. 1 refuted. 0 times theorem prover too weak. 425 trivial. 0 not checked. [2022-04-15 15:14:42,043 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:44,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:44,625 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139099983] [2022-04-15 15:14:44,626 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:44,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1255515789] [2022-04-15 15:14:44,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1255515789] provided 0 perfect and 1 imperfect interpolant sequences [2022-04-15 15:14:44,626 INFO L184 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-04-15 15:14:44,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9] total 9 [2022-04-15 15:14:44,626 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:44,626 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1073622177] [2022-04-15 15:14:44,626 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1073622177] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:44,626 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:44,626 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-04-15 15:14:44,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065222891] [2022-04-15 15:14:44,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:44,627 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-15 15:14:44,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:44,627 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:14:44,680 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:44,680 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-04-15 15:14:44,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:44,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-04-15 15:14:44,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=84, Unknown=1, NotChecked=0, Total=110 [2022-04-15 15:14:44,681 INFO L87 Difference]: Start difference. First operand 710 states and 955 transitions. Second operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:14:47,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:47,854 INFO L93 Difference]: Finished difference Result 762 states and 1031 transitions. [2022-04-15 15:14:47,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-04-15 15:14:47,854 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) Word has length 135 [2022-04-15 15:14:47,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:14:47,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:14:47,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-15 15:14:47,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:14:47,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 79 transitions. [2022-04-15 15:14:47,856 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 9 states and 79 transitions. [2022-04-15 15:14:47,949 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:47,975 INFO L225 Difference]: With dead ends: 762 [2022-04-15 15:14:47,975 INFO L226 Difference]: Without dead ends: 750 [2022-04-15 15:14:47,975 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 132 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=43, Invalid=138, Unknown=1, NotChecked=0, Total=182 [2022-04-15 15:14:47,976 INFO L913 BasicCegarLoop]: 51 mSDtfsCounter, 35 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 243 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-04-15 15:14:47,976 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 243 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-04-15 15:14:47,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-04-15 15:14:50,243 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 687. [2022-04-15 15:14:50,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:14:50,244 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 687 states, 518 states have (on average 1.191119691119691) internal successors, (617), 525 states have internal predecessors, (617), 150 states have call successors, (150), 20 states have call predecessors, (150), 18 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 15:14:50,245 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 687 states, 518 states have (on average 1.191119691119691) internal successors, (617), 525 states have internal predecessors, (617), 150 states have call successors, (150), 20 states have call predecessors, (150), 18 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 15:14:50,245 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 687 states, 518 states have (on average 1.191119691119691) internal successors, (617), 525 states have internal predecessors, (617), 150 states have call successors, (150), 20 states have call predecessors, (150), 18 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 15:14:50,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:50,263 INFO L93 Difference]: Finished difference Result 750 states and 1013 transitions. [2022-04-15 15:14:50,263 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1013 transitions. [2022-04-15 15:14:50,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:50,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:50,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 687 states, 518 states have (on average 1.191119691119691) internal successors, (617), 525 states have internal predecessors, (617), 150 states have call successors, (150), 20 states have call predecessors, (150), 18 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 750 states. [2022-04-15 15:14:50,264 INFO L87 Difference]: Start difference. First operand has 687 states, 518 states have (on average 1.191119691119691) internal successors, (617), 525 states have internal predecessors, (617), 150 states have call successors, (150), 20 states have call predecessors, (150), 18 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) Second operand 750 states. [2022-04-15 15:14:50,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:14:50,282 INFO L93 Difference]: Finished difference Result 750 states and 1013 transitions. [2022-04-15 15:14:50,282 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 1013 transitions. [2022-04-15 15:14:50,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:14:50,282 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:14:50,282 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:14:50,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:14:50,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 687 states, 518 states have (on average 1.191119691119691) internal successors, (617), 525 states have internal predecessors, (617), 150 states have call successors, (150), 20 states have call predecessors, (150), 18 states have return successors, (148), 141 states have call predecessors, (148), 148 states have call successors, (148) [2022-04-15 15:14:50,302 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 687 states to 687 states and 915 transitions. [2022-04-15 15:14:50,303 INFO L78 Accepts]: Start accepts. Automaton has 687 states and 915 transitions. Word has length 135 [2022-04-15 15:14:50,303 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:14:50,303 INFO L478 AbstractCegarLoop]: Abstraction has 687 states and 915 transitions. [2022-04-15 15:14:50,303 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.6666666666666665) internal successors, (33), 7 states have internal predecessors, (33), 3 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (7), 2 states have call predecessors, (7), 2 states have call successors, (7) [2022-04-15 15:14:50,303 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 687 states and 915 transitions. [2022-04-15 15:14:54,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 915 edges. 914 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:54,173 INFO L276 IsEmpty]: Start isEmpty. Operand 687 states and 915 transitions. [2022-04-15 15:14:54,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 136 [2022-04-15 15:14:54,174 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:14:54,174 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 8, 8, 8, 6, 4, 4, 4, 4, 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-15 15:14:54,181 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (46)] Forceful destruction successful, exit code 0 [2022-04-15 15:14:54,374 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 46 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable44 [2022-04-15 15:14:54,375 INFO L403 AbstractCegarLoop]: === Iteration 46 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:14:54,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:14:54,375 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 13 times [2022-04-15 15:14:54,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:54,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [621933721] [2022-04-15 15:14:54,375 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:14:54,375 INFO L85 PathProgramCache]: Analyzing trace with hash 200539575, now seen corresponding path program 14 times [2022-04-15 15:14:54,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:14:54,376 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [304830437] [2022-04-15 15:14:54,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:14:54,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:14:54,400 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:14:54,400 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1038434163] [2022-04-15 15:14:54,400 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:14:54,400 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:14:54,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:14:54,401 INFO L229 MonitoredProcess]: Starting monitored process 47 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:14:54,402 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Waiting until timeout for monitored process [2022-04-15 15:14:54,468 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:14:54,468 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:14:54,469 INFO L263 TraceCheckSpWp]: Trace formula consists of 335 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 15:14:54,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:14:54,510 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:14:55,308 INFO L272 TraceCheckUtils]: 0: Hoare triple {111080#true} call ULTIMATE.init(); {111080#true} is VALID [2022-04-15 15:14:55,309 INFO L290 TraceCheckUtils]: 1: Hoare triple {111080#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; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {111088#(<= ~counter~0 0)} assume true; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111088#(<= ~counter~0 0)} {111080#true} #102#return; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {111088#(<= ~counter~0 0)} call #t~ret9 := main(); {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {111088#(<= ~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; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,310 INFO L272 TraceCheckUtils]: 6: Hoare triple {111088#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {111088#(<= ~counter~0 0)} ~cond := #in~cond; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {111088#(<= ~counter~0 0)} assume !(0 == ~cond); {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,311 INFO L290 TraceCheckUtils]: 9: Hoare triple {111088#(<= ~counter~0 0)} assume true; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {111088#(<= ~counter~0 0)} {111088#(<= ~counter~0 0)} #90#return; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,312 INFO L272 TraceCheckUtils]: 11: Hoare triple {111088#(<= ~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)); {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,312 INFO L290 TraceCheckUtils]: 12: Hoare triple {111088#(<= ~counter~0 0)} ~cond := #in~cond; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {111088#(<= ~counter~0 0)} assume !(0 == ~cond); {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {111088#(<= ~counter~0 0)} assume true; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,313 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {111088#(<= ~counter~0 0)} {111088#(<= ~counter~0 0)} #92#return; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {111088#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {111088#(<= ~counter~0 0)} is VALID [2022-04-15 15:14:55,316 INFO L290 TraceCheckUtils]: 17: Hoare triple {111088#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111137#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:55,316 INFO L290 TraceCheckUtils]: 18: Hoare triple {111137#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {111137#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:55,316 INFO L272 TraceCheckUtils]: 19: Hoare triple {111137#(<= ~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)); {111137#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:55,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {111137#(<= ~counter~0 1)} ~cond := #in~cond; {111137#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:55,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {111137#(<= ~counter~0 1)} assume !(0 == ~cond); {111137#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:55,317 INFO L290 TraceCheckUtils]: 22: Hoare triple {111137#(<= ~counter~0 1)} assume true; {111137#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:55,318 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {111137#(<= ~counter~0 1)} {111137#(<= ~counter~0 1)} #94#return; {111137#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:55,318 INFO L290 TraceCheckUtils]: 24: Hoare triple {111137#(<= ~counter~0 1)} assume !!(0 != ~r~0); {111137#(<= ~counter~0 1)} is VALID [2022-04-15 15:14:55,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {111137#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111162#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:55,319 INFO L290 TraceCheckUtils]: 26: Hoare triple {111162#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {111162#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:55,320 INFO L272 TraceCheckUtils]: 27: Hoare triple {111162#(<= ~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)); {111162#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:55,320 INFO L290 TraceCheckUtils]: 28: Hoare triple {111162#(<= ~counter~0 2)} ~cond := #in~cond; {111162#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:55,320 INFO L290 TraceCheckUtils]: 29: Hoare triple {111162#(<= ~counter~0 2)} assume !(0 == ~cond); {111162#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:55,321 INFO L290 TraceCheckUtils]: 30: Hoare triple {111162#(<= ~counter~0 2)} assume true; {111162#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:55,321 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {111162#(<= ~counter~0 2)} {111162#(<= ~counter~0 2)} #96#return; {111162#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:55,321 INFO L290 TraceCheckUtils]: 32: Hoare triple {111162#(<= ~counter~0 2)} assume !(~r~0 > 0); {111162#(<= ~counter~0 2)} is VALID [2022-04-15 15:14:55,322 INFO L290 TraceCheckUtils]: 33: Hoare triple {111162#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111187#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:55,323 INFO L290 TraceCheckUtils]: 34: Hoare triple {111187#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {111187#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:55,323 INFO L272 TraceCheckUtils]: 35: Hoare triple {111187#(<= ~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)); {111187#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:55,323 INFO L290 TraceCheckUtils]: 36: Hoare triple {111187#(<= ~counter~0 3)} ~cond := #in~cond; {111187#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:55,324 INFO L290 TraceCheckUtils]: 37: Hoare triple {111187#(<= ~counter~0 3)} assume !(0 == ~cond); {111187#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:55,324 INFO L290 TraceCheckUtils]: 38: Hoare triple {111187#(<= ~counter~0 3)} assume true; {111187#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:55,324 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {111187#(<= ~counter~0 3)} {111187#(<= ~counter~0 3)} #98#return; {111187#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:55,325 INFO L290 TraceCheckUtils]: 40: Hoare triple {111187#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111187#(<= ~counter~0 3)} is VALID [2022-04-15 15:14:55,326 INFO L290 TraceCheckUtils]: 41: Hoare triple {111187#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111212#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:55,326 INFO L290 TraceCheckUtils]: 42: Hoare triple {111212#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {111212#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:55,327 INFO L272 TraceCheckUtils]: 43: Hoare triple {111212#(<= ~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)); {111212#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:55,327 INFO L290 TraceCheckUtils]: 44: Hoare triple {111212#(<= ~counter~0 4)} ~cond := #in~cond; {111212#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:55,327 INFO L290 TraceCheckUtils]: 45: Hoare triple {111212#(<= ~counter~0 4)} assume !(0 == ~cond); {111212#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:55,327 INFO L290 TraceCheckUtils]: 46: Hoare triple {111212#(<= ~counter~0 4)} assume true; {111212#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:55,328 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {111212#(<= ~counter~0 4)} {111212#(<= ~counter~0 4)} #98#return; {111212#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:55,328 INFO L290 TraceCheckUtils]: 48: Hoare triple {111212#(<= ~counter~0 4)} assume !(~r~0 < 0); {111212#(<= ~counter~0 4)} is VALID [2022-04-15 15:14:55,329 INFO L290 TraceCheckUtils]: 49: Hoare triple {111212#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111237#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:55,329 INFO L290 TraceCheckUtils]: 50: Hoare triple {111237#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {111237#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:55,330 INFO L272 TraceCheckUtils]: 51: Hoare triple {111237#(<= ~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)); {111237#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:55,330 INFO L290 TraceCheckUtils]: 52: Hoare triple {111237#(<= ~counter~0 5)} ~cond := #in~cond; {111237#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:55,330 INFO L290 TraceCheckUtils]: 53: Hoare triple {111237#(<= ~counter~0 5)} assume !(0 == ~cond); {111237#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:55,331 INFO L290 TraceCheckUtils]: 54: Hoare triple {111237#(<= ~counter~0 5)} assume true; {111237#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:55,331 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {111237#(<= ~counter~0 5)} {111237#(<= ~counter~0 5)} #94#return; {111237#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:55,332 INFO L290 TraceCheckUtils]: 56: Hoare triple {111237#(<= ~counter~0 5)} assume !!(0 != ~r~0); {111237#(<= ~counter~0 5)} is VALID [2022-04-15 15:14:55,332 INFO L290 TraceCheckUtils]: 57: Hoare triple {111237#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111262#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:55,333 INFO L290 TraceCheckUtils]: 58: Hoare triple {111262#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {111262#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:55,333 INFO L272 TraceCheckUtils]: 59: Hoare triple {111262#(<= ~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)); {111262#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:55,334 INFO L290 TraceCheckUtils]: 60: Hoare triple {111262#(<= ~counter~0 6)} ~cond := #in~cond; {111262#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:55,334 INFO L290 TraceCheckUtils]: 61: Hoare triple {111262#(<= ~counter~0 6)} assume !(0 == ~cond); {111262#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:55,334 INFO L290 TraceCheckUtils]: 62: Hoare triple {111262#(<= ~counter~0 6)} assume true; {111262#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:55,335 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {111262#(<= ~counter~0 6)} {111262#(<= ~counter~0 6)} #96#return; {111262#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:55,335 INFO L290 TraceCheckUtils]: 64: Hoare triple {111262#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111262#(<= ~counter~0 6)} is VALID [2022-04-15 15:14:55,336 INFO L290 TraceCheckUtils]: 65: Hoare triple {111262#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111287#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:55,336 INFO L290 TraceCheckUtils]: 66: Hoare triple {111287#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {111287#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:55,337 INFO L272 TraceCheckUtils]: 67: Hoare triple {111287#(<= ~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)); {111287#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:55,337 INFO L290 TraceCheckUtils]: 68: Hoare triple {111287#(<= ~counter~0 7)} ~cond := #in~cond; {111287#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:55,337 INFO L290 TraceCheckUtils]: 69: Hoare triple {111287#(<= ~counter~0 7)} assume !(0 == ~cond); {111287#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:55,337 INFO L290 TraceCheckUtils]: 70: Hoare triple {111287#(<= ~counter~0 7)} assume true; {111287#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:55,338 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {111287#(<= ~counter~0 7)} {111287#(<= ~counter~0 7)} #96#return; {111287#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:55,338 INFO L290 TraceCheckUtils]: 72: Hoare triple {111287#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111287#(<= ~counter~0 7)} is VALID [2022-04-15 15:14:55,339 INFO L290 TraceCheckUtils]: 73: Hoare triple {111287#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111312#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:55,339 INFO L290 TraceCheckUtils]: 74: Hoare triple {111312#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {111312#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:55,340 INFO L272 TraceCheckUtils]: 75: Hoare triple {111312#(<= ~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)); {111312#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:55,340 INFO L290 TraceCheckUtils]: 76: Hoare triple {111312#(<= ~counter~0 8)} ~cond := #in~cond; {111312#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:55,341 INFO L290 TraceCheckUtils]: 77: Hoare triple {111312#(<= ~counter~0 8)} assume !(0 == ~cond); {111312#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:55,341 INFO L290 TraceCheckUtils]: 78: Hoare triple {111312#(<= ~counter~0 8)} assume true; {111312#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:55,341 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {111312#(<= ~counter~0 8)} {111312#(<= ~counter~0 8)} #96#return; {111312#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:55,342 INFO L290 TraceCheckUtils]: 80: Hoare triple {111312#(<= ~counter~0 8)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111312#(<= ~counter~0 8)} is VALID [2022-04-15 15:14:55,343 INFO L290 TraceCheckUtils]: 81: Hoare triple {111312#(<= ~counter~0 8)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111337#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:55,343 INFO L290 TraceCheckUtils]: 82: Hoare triple {111337#(<= ~counter~0 9)} assume !!(#t~post7 < 100);havoc #t~post7; {111337#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:55,343 INFO L272 TraceCheckUtils]: 83: Hoare triple {111337#(<= ~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)); {111337#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:55,344 INFO L290 TraceCheckUtils]: 84: Hoare triple {111337#(<= ~counter~0 9)} ~cond := #in~cond; {111337#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:55,344 INFO L290 TraceCheckUtils]: 85: Hoare triple {111337#(<= ~counter~0 9)} assume !(0 == ~cond); {111337#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:55,344 INFO L290 TraceCheckUtils]: 86: Hoare triple {111337#(<= ~counter~0 9)} assume true; {111337#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:55,345 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {111337#(<= ~counter~0 9)} {111337#(<= ~counter~0 9)} #96#return; {111337#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:55,345 INFO L290 TraceCheckUtils]: 88: Hoare triple {111337#(<= ~counter~0 9)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111337#(<= ~counter~0 9)} is VALID [2022-04-15 15:14:55,346 INFO L290 TraceCheckUtils]: 89: Hoare triple {111337#(<= ~counter~0 9)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111362#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:55,346 INFO L290 TraceCheckUtils]: 90: Hoare triple {111362#(<= ~counter~0 10)} assume !!(#t~post7 < 100);havoc #t~post7; {111362#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:55,347 INFO L272 TraceCheckUtils]: 91: Hoare triple {111362#(<= ~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)); {111362#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:55,347 INFO L290 TraceCheckUtils]: 92: Hoare triple {111362#(<= ~counter~0 10)} ~cond := #in~cond; {111362#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:55,347 INFO L290 TraceCheckUtils]: 93: Hoare triple {111362#(<= ~counter~0 10)} assume !(0 == ~cond); {111362#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:55,348 INFO L290 TraceCheckUtils]: 94: Hoare triple {111362#(<= ~counter~0 10)} assume true; {111362#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:55,348 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {111362#(<= ~counter~0 10)} {111362#(<= ~counter~0 10)} #96#return; {111362#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:55,348 INFO L290 TraceCheckUtils]: 96: Hoare triple {111362#(<= ~counter~0 10)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111362#(<= ~counter~0 10)} is VALID [2022-04-15 15:14:55,349 INFO L290 TraceCheckUtils]: 97: Hoare triple {111362#(<= ~counter~0 10)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111387#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:55,350 INFO L290 TraceCheckUtils]: 98: Hoare triple {111387#(<= ~counter~0 11)} assume !!(#t~post7 < 100);havoc #t~post7; {111387#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:55,350 INFO L272 TraceCheckUtils]: 99: Hoare triple {111387#(<= ~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)); {111387#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:55,351 INFO L290 TraceCheckUtils]: 100: Hoare triple {111387#(<= ~counter~0 11)} ~cond := #in~cond; {111387#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:55,351 INFO L290 TraceCheckUtils]: 101: Hoare triple {111387#(<= ~counter~0 11)} assume !(0 == ~cond); {111387#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:55,351 INFO L290 TraceCheckUtils]: 102: Hoare triple {111387#(<= ~counter~0 11)} assume true; {111387#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:55,352 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {111387#(<= ~counter~0 11)} {111387#(<= ~counter~0 11)} #96#return; {111387#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:55,352 INFO L290 TraceCheckUtils]: 104: Hoare triple {111387#(<= ~counter~0 11)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111387#(<= ~counter~0 11)} is VALID [2022-04-15 15:14:55,353 INFO L290 TraceCheckUtils]: 105: Hoare triple {111387#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111412#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:55,353 INFO L290 TraceCheckUtils]: 106: Hoare triple {111412#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {111412#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:55,354 INFO L272 TraceCheckUtils]: 107: Hoare triple {111412#(<= ~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)); {111412#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:55,354 INFO L290 TraceCheckUtils]: 108: Hoare triple {111412#(<= ~counter~0 12)} ~cond := #in~cond; {111412#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:55,354 INFO L290 TraceCheckUtils]: 109: Hoare triple {111412#(<= ~counter~0 12)} assume !(0 == ~cond); {111412#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:55,354 INFO L290 TraceCheckUtils]: 110: Hoare triple {111412#(<= ~counter~0 12)} assume true; {111412#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:55,355 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {111412#(<= ~counter~0 12)} {111412#(<= ~counter~0 12)} #96#return; {111412#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:55,355 INFO L290 TraceCheckUtils]: 112: Hoare triple {111412#(<= ~counter~0 12)} assume !(~r~0 > 0); {111412#(<= ~counter~0 12)} is VALID [2022-04-15 15:14:55,356 INFO L290 TraceCheckUtils]: 113: Hoare triple {111412#(<= ~counter~0 12)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111437#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:55,356 INFO L290 TraceCheckUtils]: 114: Hoare triple {111437#(<= ~counter~0 13)} assume !!(#t~post8 < 100);havoc #t~post8; {111437#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:55,357 INFO L272 TraceCheckUtils]: 115: Hoare triple {111437#(<= ~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)); {111437#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:55,357 INFO L290 TraceCheckUtils]: 116: Hoare triple {111437#(<= ~counter~0 13)} ~cond := #in~cond; {111437#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:55,358 INFO L290 TraceCheckUtils]: 117: Hoare triple {111437#(<= ~counter~0 13)} assume !(0 == ~cond); {111437#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:55,358 INFO L290 TraceCheckUtils]: 118: Hoare triple {111437#(<= ~counter~0 13)} assume true; {111437#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:55,358 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {111437#(<= ~counter~0 13)} {111437#(<= ~counter~0 13)} #98#return; {111437#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:55,359 INFO L290 TraceCheckUtils]: 120: Hoare triple {111437#(<= ~counter~0 13)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111437#(<= ~counter~0 13)} is VALID [2022-04-15 15:14:55,360 INFO L290 TraceCheckUtils]: 121: Hoare triple {111437#(<= ~counter~0 13)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111462#(<= ~counter~0 14)} is VALID [2022-04-15 15:14:55,360 INFO L290 TraceCheckUtils]: 122: Hoare triple {111462#(<= ~counter~0 14)} assume !!(#t~post8 < 100);havoc #t~post8; {111462#(<= ~counter~0 14)} is VALID [2022-04-15 15:14:55,360 INFO L272 TraceCheckUtils]: 123: Hoare triple {111462#(<= ~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)); {111462#(<= ~counter~0 14)} is VALID [2022-04-15 15:14:55,361 INFO L290 TraceCheckUtils]: 124: Hoare triple {111462#(<= ~counter~0 14)} ~cond := #in~cond; {111462#(<= ~counter~0 14)} is VALID [2022-04-15 15:14:55,361 INFO L290 TraceCheckUtils]: 125: Hoare triple {111462#(<= ~counter~0 14)} assume !(0 == ~cond); {111462#(<= ~counter~0 14)} is VALID [2022-04-15 15:14:55,361 INFO L290 TraceCheckUtils]: 126: Hoare triple {111462#(<= ~counter~0 14)} assume true; {111462#(<= ~counter~0 14)} is VALID [2022-04-15 15:14:55,362 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {111462#(<= ~counter~0 14)} {111462#(<= ~counter~0 14)} #98#return; {111462#(<= ~counter~0 14)} is VALID [2022-04-15 15:14:55,362 INFO L290 TraceCheckUtils]: 128: Hoare triple {111462#(<= ~counter~0 14)} assume !(~r~0 < 0); {111462#(<= ~counter~0 14)} is VALID [2022-04-15 15:14:55,362 INFO L290 TraceCheckUtils]: 129: Hoare triple {111462#(<= ~counter~0 14)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111487#(<= |main_#t~post6| 14)} is VALID [2022-04-15 15:14:55,363 INFO L290 TraceCheckUtils]: 130: Hoare triple {111487#(<= |main_#t~post6| 14)} assume !(#t~post6 < 100);havoc #t~post6; {111081#false} is VALID [2022-04-15 15:14:55,363 INFO L272 TraceCheckUtils]: 131: Hoare triple {111081#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)); {111081#false} is VALID [2022-04-15 15:14:55,363 INFO L290 TraceCheckUtils]: 132: Hoare triple {111081#false} ~cond := #in~cond; {111081#false} is VALID [2022-04-15 15:14:55,363 INFO L290 TraceCheckUtils]: 133: Hoare triple {111081#false} assume 0 == ~cond; {111081#false} is VALID [2022-04-15 15:14:55,363 INFO L290 TraceCheckUtils]: 134: Hoare triple {111081#false} assume !false; {111081#false} is VALID [2022-04-15 15:14:55,363 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 508 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:14:55,363 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:14:56,239 INFO L290 TraceCheckUtils]: 134: Hoare triple {111081#false} assume !false; {111081#false} is VALID [2022-04-15 15:14:56,239 INFO L290 TraceCheckUtils]: 133: Hoare triple {111081#false} assume 0 == ~cond; {111081#false} is VALID [2022-04-15 15:14:56,239 INFO L290 TraceCheckUtils]: 132: Hoare triple {111081#false} ~cond := #in~cond; {111081#false} is VALID [2022-04-15 15:14:56,239 INFO L272 TraceCheckUtils]: 131: Hoare triple {111081#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)); {111081#false} is VALID [2022-04-15 15:14:56,240 INFO L290 TraceCheckUtils]: 130: Hoare triple {111515#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {111081#false} is VALID [2022-04-15 15:14:56,240 INFO L290 TraceCheckUtils]: 129: Hoare triple {111519#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111515#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:14:56,240 INFO L290 TraceCheckUtils]: 128: Hoare triple {111519#(< ~counter~0 100)} assume !(~r~0 < 0); {111519#(< ~counter~0 100)} is VALID [2022-04-15 15:14:56,241 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {111080#true} {111519#(< ~counter~0 100)} #98#return; {111519#(< ~counter~0 100)} is VALID [2022-04-15 15:14:56,241 INFO L290 TraceCheckUtils]: 126: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,241 INFO L290 TraceCheckUtils]: 125: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,241 INFO L290 TraceCheckUtils]: 124: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,241 INFO L272 TraceCheckUtils]: 123: Hoare triple {111519#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,241 INFO L290 TraceCheckUtils]: 122: Hoare triple {111519#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {111519#(< ~counter~0 100)} is VALID [2022-04-15 15:14:56,244 INFO L290 TraceCheckUtils]: 121: Hoare triple {111544#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111519#(< ~counter~0 100)} is VALID [2022-04-15 15:14:56,244 INFO L290 TraceCheckUtils]: 120: Hoare triple {111544#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111544#(< ~counter~0 99)} is VALID [2022-04-15 15:14:56,244 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {111080#true} {111544#(< ~counter~0 99)} #98#return; {111544#(< ~counter~0 99)} is VALID [2022-04-15 15:14:56,244 INFO L290 TraceCheckUtils]: 118: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,244 INFO L290 TraceCheckUtils]: 117: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,245 INFO L290 TraceCheckUtils]: 116: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,245 INFO L272 TraceCheckUtils]: 115: Hoare triple {111544#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,245 INFO L290 TraceCheckUtils]: 114: Hoare triple {111544#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {111544#(< ~counter~0 99)} is VALID [2022-04-15 15:14:56,246 INFO L290 TraceCheckUtils]: 113: Hoare triple {111569#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111544#(< ~counter~0 99)} is VALID [2022-04-15 15:14:56,246 INFO L290 TraceCheckUtils]: 112: Hoare triple {111569#(< ~counter~0 98)} assume !(~r~0 > 0); {111569#(< ~counter~0 98)} is VALID [2022-04-15 15:14:56,247 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {111080#true} {111569#(< ~counter~0 98)} #96#return; {111569#(< ~counter~0 98)} is VALID [2022-04-15 15:14:56,247 INFO L290 TraceCheckUtils]: 110: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,247 INFO L290 TraceCheckUtils]: 109: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,247 INFO L290 TraceCheckUtils]: 108: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,247 INFO L272 TraceCheckUtils]: 107: Hoare triple {111569#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,247 INFO L290 TraceCheckUtils]: 106: Hoare triple {111569#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {111569#(< ~counter~0 98)} is VALID [2022-04-15 15:14:56,248 INFO L290 TraceCheckUtils]: 105: Hoare triple {111594#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111569#(< ~counter~0 98)} is VALID [2022-04-15 15:14:56,248 INFO L290 TraceCheckUtils]: 104: Hoare triple {111594#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111594#(< ~counter~0 97)} is VALID [2022-04-15 15:14:56,249 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {111080#true} {111594#(< ~counter~0 97)} #96#return; {111594#(< ~counter~0 97)} is VALID [2022-04-15 15:14:56,249 INFO L290 TraceCheckUtils]: 102: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,249 INFO L290 TraceCheckUtils]: 101: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,249 INFO L290 TraceCheckUtils]: 100: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,249 INFO L272 TraceCheckUtils]: 99: Hoare triple {111594#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,250 INFO L290 TraceCheckUtils]: 98: Hoare triple {111594#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {111594#(< ~counter~0 97)} is VALID [2022-04-15 15:14:56,250 INFO L290 TraceCheckUtils]: 97: Hoare triple {111619#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111594#(< ~counter~0 97)} is VALID [2022-04-15 15:14:56,251 INFO L290 TraceCheckUtils]: 96: Hoare triple {111619#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111619#(< ~counter~0 96)} is VALID [2022-04-15 15:14:56,251 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {111080#true} {111619#(< ~counter~0 96)} #96#return; {111619#(< ~counter~0 96)} is VALID [2022-04-15 15:14:56,251 INFO L290 TraceCheckUtils]: 94: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,251 INFO L290 TraceCheckUtils]: 93: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,251 INFO L290 TraceCheckUtils]: 92: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,252 INFO L272 TraceCheckUtils]: 91: Hoare triple {111619#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,252 INFO L290 TraceCheckUtils]: 90: Hoare triple {111619#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {111619#(< ~counter~0 96)} is VALID [2022-04-15 15:14:56,253 INFO L290 TraceCheckUtils]: 89: Hoare triple {111644#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111619#(< ~counter~0 96)} is VALID [2022-04-15 15:14:56,253 INFO L290 TraceCheckUtils]: 88: Hoare triple {111644#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111644#(< ~counter~0 95)} is VALID [2022-04-15 15:14:56,254 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {111080#true} {111644#(< ~counter~0 95)} #96#return; {111644#(< ~counter~0 95)} is VALID [2022-04-15 15:14:56,254 INFO L290 TraceCheckUtils]: 86: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,254 INFO L290 TraceCheckUtils]: 85: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,254 INFO L290 TraceCheckUtils]: 84: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,254 INFO L272 TraceCheckUtils]: 83: Hoare triple {111644#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,254 INFO L290 TraceCheckUtils]: 82: Hoare triple {111644#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {111644#(< ~counter~0 95)} is VALID [2022-04-15 15:14:56,255 INFO L290 TraceCheckUtils]: 81: Hoare triple {111669#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111644#(< ~counter~0 95)} is VALID [2022-04-15 15:14:56,255 INFO L290 TraceCheckUtils]: 80: Hoare triple {111669#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111669#(< ~counter~0 94)} is VALID [2022-04-15 15:14:56,256 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {111080#true} {111669#(< ~counter~0 94)} #96#return; {111669#(< ~counter~0 94)} is VALID [2022-04-15 15:14:56,256 INFO L290 TraceCheckUtils]: 78: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,256 INFO L290 TraceCheckUtils]: 77: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,256 INFO L290 TraceCheckUtils]: 76: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,256 INFO L272 TraceCheckUtils]: 75: Hoare triple {111669#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,256 INFO L290 TraceCheckUtils]: 74: Hoare triple {111669#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {111669#(< ~counter~0 94)} is VALID [2022-04-15 15:14:56,257 INFO L290 TraceCheckUtils]: 73: Hoare triple {111694#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111669#(< ~counter~0 94)} is VALID [2022-04-15 15:14:56,258 INFO L290 TraceCheckUtils]: 72: Hoare triple {111694#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111694#(< ~counter~0 93)} is VALID [2022-04-15 15:14:56,258 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {111080#true} {111694#(< ~counter~0 93)} #96#return; {111694#(< ~counter~0 93)} is VALID [2022-04-15 15:14:56,258 INFO L290 TraceCheckUtils]: 70: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,258 INFO L290 TraceCheckUtils]: 69: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,258 INFO L290 TraceCheckUtils]: 68: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,258 INFO L272 TraceCheckUtils]: 67: Hoare triple {111694#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,259 INFO L290 TraceCheckUtils]: 66: Hoare triple {111694#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {111694#(< ~counter~0 93)} is VALID [2022-04-15 15:14:56,260 INFO L290 TraceCheckUtils]: 65: Hoare triple {111719#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111694#(< ~counter~0 93)} is VALID [2022-04-15 15:14:56,260 INFO L290 TraceCheckUtils]: 64: Hoare triple {111719#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {111719#(< ~counter~0 92)} is VALID [2022-04-15 15:14:56,260 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {111080#true} {111719#(< ~counter~0 92)} #96#return; {111719#(< ~counter~0 92)} is VALID [2022-04-15 15:14:56,261 INFO L290 TraceCheckUtils]: 62: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,261 INFO L290 TraceCheckUtils]: 61: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,261 INFO L290 TraceCheckUtils]: 60: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,261 INFO L272 TraceCheckUtils]: 59: Hoare triple {111719#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,261 INFO L290 TraceCheckUtils]: 58: Hoare triple {111719#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {111719#(< ~counter~0 92)} is VALID [2022-04-15 15:14:56,262 INFO L290 TraceCheckUtils]: 57: Hoare triple {111744#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111719#(< ~counter~0 92)} is VALID [2022-04-15 15:14:56,262 INFO L290 TraceCheckUtils]: 56: Hoare triple {111744#(< ~counter~0 91)} assume !!(0 != ~r~0); {111744#(< ~counter~0 91)} is VALID [2022-04-15 15:14:56,263 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {111080#true} {111744#(< ~counter~0 91)} #94#return; {111744#(< ~counter~0 91)} is VALID [2022-04-15 15:14:56,263 INFO L290 TraceCheckUtils]: 54: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,263 INFO L290 TraceCheckUtils]: 53: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,263 INFO L290 TraceCheckUtils]: 52: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,263 INFO L272 TraceCheckUtils]: 51: Hoare triple {111744#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,263 INFO L290 TraceCheckUtils]: 50: Hoare triple {111744#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {111744#(< ~counter~0 91)} is VALID [2022-04-15 15:14:56,264 INFO L290 TraceCheckUtils]: 49: Hoare triple {111769#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111744#(< ~counter~0 91)} is VALID [2022-04-15 15:14:56,265 INFO L290 TraceCheckUtils]: 48: Hoare triple {111769#(< ~counter~0 90)} assume !(~r~0 < 0); {111769#(< ~counter~0 90)} is VALID [2022-04-15 15:14:56,265 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {111080#true} {111769#(< ~counter~0 90)} #98#return; {111769#(< ~counter~0 90)} is VALID [2022-04-15 15:14:56,265 INFO L290 TraceCheckUtils]: 46: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,265 INFO L290 TraceCheckUtils]: 45: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,265 INFO L290 TraceCheckUtils]: 44: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,265 INFO L272 TraceCheckUtils]: 43: Hoare triple {111769#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,266 INFO L290 TraceCheckUtils]: 42: Hoare triple {111769#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {111769#(< ~counter~0 90)} is VALID [2022-04-15 15:14:56,267 INFO L290 TraceCheckUtils]: 41: Hoare triple {111794#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111769#(< ~counter~0 90)} is VALID [2022-04-15 15:14:56,267 INFO L290 TraceCheckUtils]: 40: Hoare triple {111794#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {111794#(< ~counter~0 89)} is VALID [2022-04-15 15:14:56,267 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {111080#true} {111794#(< ~counter~0 89)} #98#return; {111794#(< ~counter~0 89)} is VALID [2022-04-15 15:14:56,267 INFO L290 TraceCheckUtils]: 38: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,267 INFO L290 TraceCheckUtils]: 37: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,268 INFO L290 TraceCheckUtils]: 36: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,268 INFO L272 TraceCheckUtils]: 35: Hoare triple {111794#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,268 INFO L290 TraceCheckUtils]: 34: Hoare triple {111794#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {111794#(< ~counter~0 89)} is VALID [2022-04-15 15:14:56,269 INFO L290 TraceCheckUtils]: 33: Hoare triple {111819#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {111794#(< ~counter~0 89)} is VALID [2022-04-15 15:14:56,269 INFO L290 TraceCheckUtils]: 32: Hoare triple {111819#(< ~counter~0 88)} assume !(~r~0 > 0); {111819#(< ~counter~0 88)} is VALID [2022-04-15 15:14:56,270 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {111080#true} {111819#(< ~counter~0 88)} #96#return; {111819#(< ~counter~0 88)} is VALID [2022-04-15 15:14:56,270 INFO L290 TraceCheckUtils]: 30: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,270 INFO L290 TraceCheckUtils]: 29: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,270 INFO L290 TraceCheckUtils]: 28: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,270 INFO L272 TraceCheckUtils]: 27: Hoare triple {111819#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,270 INFO L290 TraceCheckUtils]: 26: Hoare triple {111819#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {111819#(< ~counter~0 88)} is VALID [2022-04-15 15:14:56,271 INFO L290 TraceCheckUtils]: 25: Hoare triple {111844#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {111819#(< ~counter~0 88)} is VALID [2022-04-15 15:14:56,271 INFO L290 TraceCheckUtils]: 24: Hoare triple {111844#(< ~counter~0 87)} assume !!(0 != ~r~0); {111844#(< ~counter~0 87)} is VALID [2022-04-15 15:14:56,272 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {111080#true} {111844#(< ~counter~0 87)} #94#return; {111844#(< ~counter~0 87)} is VALID [2022-04-15 15:14:56,272 INFO L290 TraceCheckUtils]: 22: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,272 INFO L290 TraceCheckUtils]: 21: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,272 INFO L290 TraceCheckUtils]: 20: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,272 INFO L272 TraceCheckUtils]: 19: Hoare triple {111844#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,272 INFO L290 TraceCheckUtils]: 18: Hoare triple {111844#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {111844#(< ~counter~0 87)} is VALID [2022-04-15 15:14:56,273 INFO L290 TraceCheckUtils]: 17: Hoare triple {111869#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {111844#(< ~counter~0 87)} is VALID [2022-04-15 15:14:56,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {111869#(< ~counter~0 86)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {111869#(< ~counter~0 86)} is VALID [2022-04-15 15:14:56,274 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {111080#true} {111869#(< ~counter~0 86)} #92#return; {111869#(< ~counter~0 86)} is VALID [2022-04-15 15:14:56,274 INFO L290 TraceCheckUtils]: 14: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,274 INFO L290 TraceCheckUtils]: 13: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,274 INFO L290 TraceCheckUtils]: 12: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,274 INFO L272 TraceCheckUtils]: 11: Hoare triple {111869#(< ~counter~0 86)} 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)); {111080#true} is VALID [2022-04-15 15:14:56,275 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {111080#true} {111869#(< ~counter~0 86)} #90#return; {111869#(< ~counter~0 86)} is VALID [2022-04-15 15:14:56,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {111080#true} assume true; {111080#true} is VALID [2022-04-15 15:14:56,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {111080#true} assume !(0 == ~cond); {111080#true} is VALID [2022-04-15 15:14:56,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {111080#true} ~cond := #in~cond; {111080#true} is VALID [2022-04-15 15:14:56,275 INFO L272 TraceCheckUtils]: 6: Hoare triple {111869#(< ~counter~0 86)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {111080#true} is VALID [2022-04-15 15:14:56,275 INFO L290 TraceCheckUtils]: 5: Hoare triple {111869#(< ~counter~0 86)} 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; {111869#(< ~counter~0 86)} is VALID [2022-04-15 15:14:56,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {111869#(< ~counter~0 86)} call #t~ret9 := main(); {111869#(< ~counter~0 86)} is VALID [2022-04-15 15:14:56,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {111869#(< ~counter~0 86)} {111080#true} #102#return; {111869#(< ~counter~0 86)} is VALID [2022-04-15 15:14:56,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {111869#(< ~counter~0 86)} assume true; {111869#(< ~counter~0 86)} is VALID [2022-04-15 15:14:56,277 INFO L290 TraceCheckUtils]: 1: Hoare triple {111080#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; {111869#(< ~counter~0 86)} is VALID [2022-04-15 15:14:56,277 INFO L272 TraceCheckUtils]: 0: Hoare triple {111080#true} call ULTIMATE.init(); {111080#true} is VALID [2022-04-15 15:14:56,277 INFO L134 CoverageAnalysis]: Checked inductivity of 540 backedges. 28 proven. 144 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-15 15:14:56,277 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:14:56,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [304830437] [2022-04-15 15:14:56,277 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:14:56,277 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1038434163] [2022-04-15 15:14:56,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1038434163] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:14:56,278 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:14:56,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-15 15:14:56,278 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:14:56,278 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [621933721] [2022-04-15 15:14:56,278 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [621933721] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:14:56,278 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:14:56,278 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 15:14:56,278 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1618761435] [2022-04-15 15:14:56,278 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:14:56,279 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 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 135 [2022-04-15 15:14:56,279 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:14:56,279 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 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-15 15:14:56,404 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:14:56,405 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 15:14:56,405 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:14:56,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 15:14:56,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 15:14:56,405 INFO L87 Difference]: Start difference. First operand 687 states and 915 transitions. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 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-15 15:15:00,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:00,295 INFO L93 Difference]: Finished difference Result 738 states and 985 transitions. [2022-04-15 15:15:00,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2022-04-15 15:15:00,295 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 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 135 [2022-04-15 15:15:00,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:15:00,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 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-15 15:15:00,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-15 15:15:00,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 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-15 15:15:00,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 294 transitions. [2022-04-15 15:15:00,301 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 29 states and 294 transitions. [2022-04-15 15:15:00,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 294 edges. 294 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:00,641 INFO L225 Difference]: With dead ends: 738 [2022-04-15 15:15:00,641 INFO L226 Difference]: Without dead ends: 733 [2022-04-15 15:15:00,642 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 280 GetRequests, 237 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=834, Invalid=1146, Unknown=0, NotChecked=0, Total=1980 [2022-04-15 15:15:00,642 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 217 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 202 mSolverCounterSat, 192 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 394 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 192 IncrementalHoareTripleChecker+Valid, 202 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-04-15 15:15:00,642 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 315 Invalid, 394 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [192 Valid, 202 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-04-15 15:15:00,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 733 states. [2022-04-15 15:15:02,960 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 733 to 711. [2022-04-15 15:15:02,960 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:15:02,961 INFO L82 GeneralOperation]: Start isEquivalent. First operand 733 states. Second operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:15:02,961 INFO L74 IsIncluded]: Start isIncluded. First operand 733 states. Second operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:15:02,962 INFO L87 Difference]: Start difference. First operand 733 states. Second operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:15:02,978 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:02,978 INFO L93 Difference]: Finished difference Result 733 states and 979 transitions. [2022-04-15 15:15:02,978 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 979 transitions. [2022-04-15 15:15:02,979 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:02,979 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:02,979 INFO L74 IsIncluded]: Start isIncluded. First operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 733 states. [2022-04-15 15:15:02,980 INFO L87 Difference]: Start difference. First operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 733 states. [2022-04-15 15:15:02,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:15:02,996 INFO L93 Difference]: Finished difference Result 733 states and 979 transitions. [2022-04-15 15:15:02,996 INFO L276 IsEmpty]: Start isEmpty. Operand 733 states and 979 transitions. [2022-04-15 15:15:02,997 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:15:02,997 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:15:02,997 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:15:02,997 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:15:02,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:15:03,026 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 953 transitions. [2022-04-15 15:15:03,026 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 953 transitions. Word has length 135 [2022-04-15 15:15:03,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:15:03,027 INFO L478 AbstractCegarLoop]: Abstraction has 711 states and 953 transitions. [2022-04-15 15:15:03,027 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 17 states have internal predecessors, (96), 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-15 15:15:03,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 711 states and 953 transitions. [2022-04-15 15:15:07,110 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 953 edges. 952 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:15:07,110 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 953 transitions. [2022-04-15 15:15:07,111 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 15:15:07,111 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:15:07,111 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 6, 6, 6, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:15:07,128 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (47)] Forceful destruction successful, exit code 0 [2022-04-15 15:15:07,312 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45,47 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:07,312 INFO L403 AbstractCegarLoop]: === Iteration 47 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:15:07,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:15:07,312 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 21 times [2022-04-15 15:15:07,312 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:15:07,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1187030110] [2022-04-15 15:15:07,313 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:15:07,313 INFO L85 PathProgramCache]: Analyzing trace with hash -972958086, now seen corresponding path program 22 times [2022-04-15 15:15:07,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:15:07,313 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351726533] [2022-04-15 15:15:07,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:15:07,313 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:15:07,330 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:15:07,331 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1004583679] [2022-04-15 15:15:07,331 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:15:07,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:15:07,331 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:15:07,332 INFO L229 MonitoredProcess]: Starting monitored process 48 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:15:07,333 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Waiting until timeout for monitored process [2022-04-15 15:15:07,395 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:15:07,395 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:15:07,396 INFO L263 TraceCheckSpWp]: Trace formula consists of 283 conjuncts, 22 conjunts are in the unsatisfiable core [2022-04-15 15:15:07,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:15:07,418 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:17:17,057 INFO L272 TraceCheckUtils]: 0: Hoare triple {116309#true} call ULTIMATE.init(); {116309#true} is VALID [2022-04-15 15:17:17,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {116309#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; {116309#true} is VALID [2022-04-15 15:17:17,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:17,057 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116309#true} {116309#true} #102#return; {116309#true} is VALID [2022-04-15 15:17:17,057 INFO L272 TraceCheckUtils]: 4: Hoare triple {116309#true} call #t~ret9 := main(); {116309#true} is VALID [2022-04-15 15:17:17,057 INFO L290 TraceCheckUtils]: 5: Hoare triple {116309#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; {116309#true} is VALID [2022-04-15 15:17:17,057 INFO L272 TraceCheckUtils]: 6: Hoare triple {116309#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:17,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:17,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:17,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:17,058 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {116309#true} {116309#true} #90#return; {116309#true} is VALID [2022-04-15 15:17:17,058 INFO L272 TraceCheckUtils]: 11: Hoare triple {116309#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)); {116309#true} is VALID [2022-04-15 15:17:17,058 INFO L290 TraceCheckUtils]: 12: Hoare triple {116309#true} ~cond := #in~cond; {116350#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} is VALID [2022-04-15 15:17:17,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {116350#(= assume_abort_if_not_~cond |assume_abort_if_not_#in~cond|)} assume !(0 == ~cond); {116354#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:17:17,059 INFO L290 TraceCheckUtils]: 14: Hoare triple {116354#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {116354#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:17:17,059 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {116354#(not (= |assume_abort_if_not_#in~cond| 0))} {116309#true} #92#return; {116361#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} is VALID [2022-04-15 15:17:19,062 WARN L290 TraceCheckUtils]: 16: Hoare triple {116361#(and (<= 0 main_~A~0) (= (mod main_~A~0 2) 1))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is UNKNOWN [2022-04-15 15:17:19,063 INFO L290 TraceCheckUtils]: 17: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,063 INFO L290 TraceCheckUtils]: 18: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post6 < 100);havoc #t~post6; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,064 INFO L272 TraceCheckUtils]: 19: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 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)); {116309#true} is VALID [2022-04-15 15:17:19,064 INFO L290 TraceCheckUtils]: 20: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:19,064 INFO L290 TraceCheckUtils]: 21: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:19,064 INFO L290 TraceCheckUtils]: 22: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:19,064 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {116309#true} {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #94#return; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,065 INFO L290 TraceCheckUtils]: 24: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(0 != ~r~0); {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,066 INFO L290 TraceCheckUtils]: 26: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post7 < 100);havoc #t~post7; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,066 INFO L272 TraceCheckUtils]: 27: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 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)); {116309#true} is VALID [2022-04-15 15:17:19,066 INFO L290 TraceCheckUtils]: 28: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:19,066 INFO L290 TraceCheckUtils]: 29: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:19,066 INFO L290 TraceCheckUtils]: 30: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:19,066 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {116309#true} {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #96#return; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,067 INFO L290 TraceCheckUtils]: 32: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !(~r~0 > 0); {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,067 INFO L290 TraceCheckUtils]: 33: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,068 INFO L290 TraceCheckUtils]: 34: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(#t~post8 < 100);havoc #t~post8; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:19,068 INFO L272 TraceCheckUtils]: 35: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 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)); {116309#true} is VALID [2022-04-15 15:17:19,068 INFO L290 TraceCheckUtils]: 36: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:19,068 INFO L290 TraceCheckUtils]: 37: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:19,068 INFO L290 TraceCheckUtils]: 38: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:19,069 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {116309#true} {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} #98#return; {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} is VALID [2022-04-15 15:17:20,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {116365#(and (= (mod (+ main_~u~0 1) 2) 0) (<= main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) (= main_~v~0 1) (= (mod (+ main_~r~0 (* (div (+ (* (- 1) main_~u~0) 1) (- 2)) (div (+ (* (- 1) main_~u~0) 1) (- 2)))) 2) 1))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,202 INFO L290 TraceCheckUtils]: 42: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post8 < 100);havoc #t~post8; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,202 INFO L272 TraceCheckUtils]: 43: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:20,202 INFO L290 TraceCheckUtils]: 44: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,202 INFO L290 TraceCheckUtils]: 45: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,202 INFO L290 TraceCheckUtils]: 46: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,205 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {116309#true} {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #98#return; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,206 INFO L290 TraceCheckUtils]: 48: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !(~r~0 < 0); {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,210 INFO L290 TraceCheckUtils]: 49: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,211 INFO L290 TraceCheckUtils]: 50: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post6 < 100);havoc #t~post6; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,211 INFO L272 TraceCheckUtils]: 51: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:20,211 INFO L290 TraceCheckUtils]: 52: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,211 INFO L290 TraceCheckUtils]: 53: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,211 INFO L290 TraceCheckUtils]: 54: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,212 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {116309#true} {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #94#return; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,213 INFO L290 TraceCheckUtils]: 56: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(0 != ~r~0); {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,213 INFO L290 TraceCheckUtils]: 57: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,214 INFO L290 TraceCheckUtils]: 58: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(#t~post7 < 100);havoc #t~post7; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,215 INFO L272 TraceCheckUtils]: 59: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:20,215 INFO L290 TraceCheckUtils]: 60: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,215 INFO L290 TraceCheckUtils]: 61: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,215 INFO L290 TraceCheckUtils]: 62: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,215 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {116309#true} {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} #96#return; {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} is VALID [2022-04-15 15:17:20,232 INFO L290 TraceCheckUtils]: 64: Hoare triple {116438#(and (= main_~v~0 1) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (<= (+ main_~r~0 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29) 1) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116511#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-15 15:17:20,345 INFO L290 TraceCheckUtils]: 65: Hoare triple {116511#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116511#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-15 15:17:20,352 INFO L290 TraceCheckUtils]: 66: Hoare triple {116511#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} assume !!(#t~post7 < 100);havoc #t~post7; {116511#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-15 15:17:20,352 INFO L272 TraceCheckUtils]: 67: Hoare triple {116511#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~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)); {116309#true} is VALID [2022-04-15 15:17:20,352 INFO L290 TraceCheckUtils]: 68: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,352 INFO L290 TraceCheckUtils]: 69: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,352 INFO L290 TraceCheckUtils]: 70: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,353 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {116309#true} {116511#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} #96#return; {116511#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} is VALID [2022-04-15 15:17:20,354 INFO L290 TraceCheckUtils]: 72: Hoare triple {116511#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (<= (+ main_~r~0 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (<= main_~v~0 3))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 15:17:20,355 INFO L290 TraceCheckUtils]: 73: Hoare triple {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 15:17:20,361 INFO L290 TraceCheckUtils]: 74: Hoare triple {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post7 < 100);havoc #t~post7; {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 15:17:20,361 INFO L272 TraceCheckUtils]: 75: Hoare triple {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~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)); {116309#true} is VALID [2022-04-15 15:17:20,361 INFO L290 TraceCheckUtils]: 76: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,361 INFO L290 TraceCheckUtils]: 77: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,362 INFO L290 TraceCheckUtils]: 78: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,362 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {116309#true} {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #96#return; {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 15:17:20,363 INFO L290 TraceCheckUtils]: 80: Hoare triple {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !(~r~0 > 0); {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 15:17:20,363 INFO L290 TraceCheckUtils]: 81: Hoare triple {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 15:17:20,364 INFO L290 TraceCheckUtils]: 82: Hoare triple {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(#t~post8 < 100);havoc #t~post8; {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 15:17:20,364 INFO L272 TraceCheckUtils]: 83: Hoare triple {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~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)); {116309#true} is VALID [2022-04-15 15:17:20,364 INFO L290 TraceCheckUtils]: 84: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,364 INFO L290 TraceCheckUtils]: 85: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,364 INFO L290 TraceCheckUtils]: 86: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,365 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {116309#true} {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} #98#return; {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} is VALID [2022-04-15 15:17:20,369 INFO L290 TraceCheckUtils]: 88: Hoare triple {116536#(and (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (<= (+ (* aux_div_v_main_~u~0_152_29 2) 1) main_~u~0) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)))) (< 0 (+ main_~r~0 3)) (<= main_~v~0 5))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,370 INFO L290 TraceCheckUtils]: 89: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,371 INFO L290 TraceCheckUtils]: 90: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post8 < 100);havoc #t~post8; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,371 INFO L272 TraceCheckUtils]: 91: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~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)); {116309#true} is VALID [2022-04-15 15:17:20,372 INFO L290 TraceCheckUtils]: 92: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,372 INFO L290 TraceCheckUtils]: 93: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,372 INFO L290 TraceCheckUtils]: 94: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,372 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {116309#true} {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #98#return; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,374 INFO L290 TraceCheckUtils]: 96: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !(~r~0 < 0); {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,375 INFO L290 TraceCheckUtils]: 97: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,376 INFO L290 TraceCheckUtils]: 98: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post6 < 100);havoc #t~post6; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,376 INFO L272 TraceCheckUtils]: 99: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~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)); {116309#true} is VALID [2022-04-15 15:17:20,376 INFO L290 TraceCheckUtils]: 100: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,376 INFO L290 TraceCheckUtils]: 101: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,376 INFO L290 TraceCheckUtils]: 102: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,377 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {116309#true} {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #94#return; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,381 INFO L290 TraceCheckUtils]: 104: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(0 != ~r~0); {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,388 INFO L290 TraceCheckUtils]: 105: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,390 INFO L290 TraceCheckUtils]: 106: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(#t~post7 < 100);havoc #t~post7; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,390 INFO L272 TraceCheckUtils]: 107: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~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)); {116309#true} is VALID [2022-04-15 15:17:20,390 INFO L290 TraceCheckUtils]: 108: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,390 INFO L290 TraceCheckUtils]: 109: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,390 INFO L290 TraceCheckUtils]: 110: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,391 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {116309#true} {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} #96#return; {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} is VALID [2022-04-15 15:17:20,408 INFO L290 TraceCheckUtils]: 112: Hoare triple {116585#(and (<= main_~v~0 5) (exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ main_~r~0 2)))))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 15:17:20,411 INFO L290 TraceCheckUtils]: 113: Hoare triple {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 15:17:20,421 INFO L290 TraceCheckUtils]: 114: Hoare triple {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(#t~post7 < 100);havoc #t~post7; {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 15:17:20,421 INFO L272 TraceCheckUtils]: 115: Hoare triple {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:20,421 INFO L290 TraceCheckUtils]: 116: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,421 INFO L290 TraceCheckUtils]: 117: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,421 INFO L290 TraceCheckUtils]: 118: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,422 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {116309#true} {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #96#return; {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 15:17:20,423 INFO L290 TraceCheckUtils]: 120: Hoare triple {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !(~r~0 > 0); {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 15:17:20,424 INFO L290 TraceCheckUtils]: 121: Hoare triple {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 15:17:20,427 INFO L290 TraceCheckUtils]: 122: Hoare triple {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(#t~post8 < 100);havoc #t~post8; {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 15:17:20,427 INFO L272 TraceCheckUtils]: 123: Hoare triple {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:20,427 INFO L290 TraceCheckUtils]: 124: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:20,427 INFO L290 TraceCheckUtils]: 125: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:20,427 INFO L290 TraceCheckUtils]: 126: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:20,428 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {116309#true} {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} #98#return; {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} is VALID [2022-04-15 15:17:20,431 INFO L290 TraceCheckUtils]: 128: Hoare triple {116658#(exists ((aux_div_v_main_~r~0_241_114 Int) (aux_div_v_main_~u~0_152_29 Int)) (and (< (+ 2 (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (+ (* aux_div_v_main_~u~0_152_29 4) (* 2 aux_div_v_main_~r~0_241_114))) (< (+ (* aux_div_v_main_~u~0_152_29 2) (* 2 aux_div_v_main_~r~0_241_114)) (* aux_div_v_main_~u~0_152_29 aux_div_v_main_~u~0_152_29)) (< (* aux_div_v_main_~u~0_152_29 2) (+ 7 main_~r~0))))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116310#false} is VALID [2022-04-15 15:17:20,431 INFO L290 TraceCheckUtils]: 129: Hoare triple {116310#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116310#false} is VALID [2022-04-15 15:17:20,431 INFO L290 TraceCheckUtils]: 130: Hoare triple {116310#false} assume !(#t~post8 < 100);havoc #t~post8; {116310#false} is VALID [2022-04-15 15:17:20,432 INFO L290 TraceCheckUtils]: 131: Hoare triple {116310#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116310#false} is VALID [2022-04-15 15:17:20,432 INFO L290 TraceCheckUtils]: 132: Hoare triple {116310#false} assume !(#t~post6 < 100);havoc #t~post6; {116310#false} is VALID [2022-04-15 15:17:20,432 INFO L272 TraceCheckUtils]: 133: Hoare triple {116310#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)); {116310#false} is VALID [2022-04-15 15:17:20,432 INFO L290 TraceCheckUtils]: 134: Hoare triple {116310#false} ~cond := #in~cond; {116310#false} is VALID [2022-04-15 15:17:20,432 INFO L290 TraceCheckUtils]: 135: Hoare triple {116310#false} assume 0 == ~cond; {116310#false} is VALID [2022-04-15 15:17:20,432 INFO L290 TraceCheckUtils]: 136: Hoare triple {116310#false} assume !false; {116310#false} is VALID [2022-04-15 15:17:20,433 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 47 proven. 112 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-15 15:17:20,433 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:17:23,408 INFO L290 TraceCheckUtils]: 136: Hoare triple {116310#false} assume !false; {116310#false} is VALID [2022-04-15 15:17:23,408 INFO L290 TraceCheckUtils]: 135: Hoare triple {116310#false} assume 0 == ~cond; {116310#false} is VALID [2022-04-15 15:17:23,408 INFO L290 TraceCheckUtils]: 134: Hoare triple {116310#false} ~cond := #in~cond; {116310#false} is VALID [2022-04-15 15:17:23,408 INFO L272 TraceCheckUtils]: 133: Hoare triple {116310#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)); {116310#false} is VALID [2022-04-15 15:17:23,408 INFO L290 TraceCheckUtils]: 132: Hoare triple {116310#false} assume !(#t~post6 < 100);havoc #t~post6; {116310#false} is VALID [2022-04-15 15:17:23,408 INFO L290 TraceCheckUtils]: 131: Hoare triple {116310#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116310#false} is VALID [2022-04-15 15:17:23,408 INFO L290 TraceCheckUtils]: 130: Hoare triple {116310#false} assume !(#t~post8 < 100);havoc #t~post8; {116310#false} is VALID [2022-04-15 15:17:23,408 INFO L290 TraceCheckUtils]: 129: Hoare triple {116310#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116310#false} is VALID [2022-04-15 15:17:23,409 INFO L290 TraceCheckUtils]: 128: Hoare triple {116755#(not (< main_~r~0 0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116310#false} is VALID [2022-04-15 15:17:23,409 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {116309#true} {116755#(not (< main_~r~0 0))} #98#return; {116755#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:23,410 INFO L290 TraceCheckUtils]: 126: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,410 INFO L290 TraceCheckUtils]: 125: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,410 INFO L290 TraceCheckUtils]: 124: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,410 INFO L272 TraceCheckUtils]: 123: Hoare triple {116755#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,410 INFO L290 TraceCheckUtils]: 122: Hoare triple {116755#(not (< main_~r~0 0))} assume !!(#t~post8 < 100);havoc #t~post8; {116755#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:23,411 INFO L290 TraceCheckUtils]: 121: Hoare triple {116755#(not (< main_~r~0 0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116755#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:23,412 INFO L290 TraceCheckUtils]: 120: Hoare triple {116755#(not (< main_~r~0 0))} assume !(~r~0 > 0); {116755#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:23,413 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {116309#true} {116755#(not (< main_~r~0 0))} #96#return; {116755#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:23,413 INFO L290 TraceCheckUtils]: 118: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,413 INFO L290 TraceCheckUtils]: 117: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,413 INFO L290 TraceCheckUtils]: 116: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,413 INFO L272 TraceCheckUtils]: 115: Hoare triple {116755#(not (< main_~r~0 0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,414 INFO L290 TraceCheckUtils]: 114: Hoare triple {116755#(not (< main_~r~0 0))} assume !!(#t~post7 < 100);havoc #t~post7; {116755#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:23,414 INFO L290 TraceCheckUtils]: 113: Hoare triple {116755#(not (< main_~r~0 0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116755#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:23,416 INFO L290 TraceCheckUtils]: 112: Hoare triple {116804#(<= main_~v~0 main_~r~0)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116755#(not (< main_~r~0 0))} is VALID [2022-04-15 15:17:23,416 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {116309#true} {116804#(<= main_~v~0 main_~r~0)} #96#return; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,417 INFO L290 TraceCheckUtils]: 110: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,417 INFO L290 TraceCheckUtils]: 109: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,417 INFO L290 TraceCheckUtils]: 108: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,417 INFO L272 TraceCheckUtils]: 107: Hoare triple {116804#(<= main_~v~0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,417 INFO L290 TraceCheckUtils]: 106: Hoare triple {116804#(<= main_~v~0 main_~r~0)} assume !!(#t~post7 < 100);havoc #t~post7; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,418 INFO L290 TraceCheckUtils]: 105: Hoare triple {116804#(<= main_~v~0 main_~r~0)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,418 INFO L290 TraceCheckUtils]: 104: Hoare triple {116804#(<= main_~v~0 main_~r~0)} assume !!(0 != ~r~0); {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,419 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {116309#true} {116804#(<= main_~v~0 main_~r~0)} #94#return; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,419 INFO L290 TraceCheckUtils]: 102: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,420 INFO L290 TraceCheckUtils]: 101: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,420 INFO L290 TraceCheckUtils]: 100: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,420 INFO L272 TraceCheckUtils]: 99: Hoare triple {116804#(<= main_~v~0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,420 INFO L290 TraceCheckUtils]: 98: Hoare triple {116804#(<= main_~v~0 main_~r~0)} assume !!(#t~post6 < 100);havoc #t~post6; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,421 INFO L290 TraceCheckUtils]: 97: Hoare triple {116804#(<= main_~v~0 main_~r~0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,421 INFO L290 TraceCheckUtils]: 96: Hoare triple {116804#(<= main_~v~0 main_~r~0)} assume !(~r~0 < 0); {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,422 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {116309#true} {116804#(<= main_~v~0 main_~r~0)} #98#return; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,422 INFO L290 TraceCheckUtils]: 94: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,422 INFO L290 TraceCheckUtils]: 93: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,422 INFO L290 TraceCheckUtils]: 92: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,422 INFO L272 TraceCheckUtils]: 91: Hoare triple {116804#(<= main_~v~0 main_~r~0)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,423 INFO L290 TraceCheckUtils]: 90: Hoare triple {116804#(<= main_~v~0 main_~r~0)} assume !!(#t~post8 < 100);havoc #t~post8; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,423 INFO L290 TraceCheckUtils]: 89: Hoare triple {116804#(<= main_~v~0 main_~r~0)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,426 INFO L290 TraceCheckUtils]: 88: Hoare triple {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116804#(<= main_~v~0 main_~r~0)} is VALID [2022-04-15 15:17:23,427 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {116309#true} {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #98#return; {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:23,427 INFO L290 TraceCheckUtils]: 86: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,427 INFO L290 TraceCheckUtils]: 85: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,427 INFO L290 TraceCheckUtils]: 84: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,427 INFO L272 TraceCheckUtils]: 83: Hoare triple {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,427 INFO L290 TraceCheckUtils]: 82: Hoare triple {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post8 < 100);havoc #t~post8; {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:23,428 INFO L290 TraceCheckUtils]: 81: Hoare triple {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:23,428 INFO L290 TraceCheckUtils]: 80: Hoare triple {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !(~r~0 > 0); {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:23,429 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {116309#true} {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #96#return; {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:23,429 INFO L290 TraceCheckUtils]: 78: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,429 INFO L290 TraceCheckUtils]: 77: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,429 INFO L290 TraceCheckUtils]: 76: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,429 INFO L272 TraceCheckUtils]: 75: Hoare triple {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,430 INFO L290 TraceCheckUtils]: 74: Hoare triple {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} assume !!(#t~post7 < 100);havoc #t~post7; {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:23,430 INFO L290 TraceCheckUtils]: 73: Hoare triple {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:23,431 INFO L290 TraceCheckUtils]: 72: Hoare triple {116926#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116877#(<= main_~v~0 (+ main_~u~0 main_~r~0))} is VALID [2022-04-15 15:17:23,432 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {116309#true} {116926#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #96#return; {116926#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-15 15:17:23,432 INFO L290 TraceCheckUtils]: 70: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,432 INFO L290 TraceCheckUtils]: 69: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,432 INFO L290 TraceCheckUtils]: 68: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,432 INFO L272 TraceCheckUtils]: 67: Hoare triple {116926#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,433 INFO L290 TraceCheckUtils]: 66: Hoare triple {116926#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} assume !!(#t~post7 < 100);havoc #t~post7; {116926#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-15 15:17:23,433 INFO L290 TraceCheckUtils]: 65: Hoare triple {116926#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116926#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-15 15:17:23,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {116926#(or (not (< 0 main_~r~0)) (<= (+ (* main_~v~0 2) 2) (+ main_~u~0 main_~r~0)))} is VALID [2022-04-15 15:17:23,435 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {116309#true} {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #96#return; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,435 INFO L290 TraceCheckUtils]: 62: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,436 INFO L290 TraceCheckUtils]: 61: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,436 INFO L290 TraceCheckUtils]: 60: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,436 INFO L272 TraceCheckUtils]: 59: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~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)); {116309#true} is VALID [2022-04-15 15:17:23,436 INFO L290 TraceCheckUtils]: 58: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post7 < 100);havoc #t~post7; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,437 INFO L290 TraceCheckUtils]: 57: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,437 INFO L290 TraceCheckUtils]: 56: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(0 != ~r~0); {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,438 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {116309#true} {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #94#return; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,438 INFO L290 TraceCheckUtils]: 54: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,438 INFO L290 TraceCheckUtils]: 53: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,438 INFO L290 TraceCheckUtils]: 52: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,438 INFO L272 TraceCheckUtils]: 51: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~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)); {116309#true} is VALID [2022-04-15 15:17:23,439 INFO L290 TraceCheckUtils]: 50: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post6 < 100);havoc #t~post6; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,439 INFO L290 TraceCheckUtils]: 49: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,440 INFO L290 TraceCheckUtils]: 48: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !(~r~0 < 0); {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,441 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {116309#true} {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #98#return; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,441 INFO L290 TraceCheckUtils]: 46: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,441 INFO L290 TraceCheckUtils]: 45: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,441 INFO L290 TraceCheckUtils]: 44: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,441 INFO L272 TraceCheckUtils]: 43: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~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)); {116309#true} is VALID [2022-04-15 15:17:23,442 INFO L290 TraceCheckUtils]: 42: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} assume !!(#t~post8 < 100);havoc #t~post8; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,442 INFO L290 TraceCheckUtils]: 41: Hoare triple {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,445 INFO L290 TraceCheckUtils]: 40: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {116951#(or (<= main_~r~0 main_~v~0) (<= (+ main_~v~0 2) (div (+ (- 1) main_~u~0) 2)))} is VALID [2022-04-15 15:17:23,446 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {116309#true} {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #98#return; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,446 INFO L272 TraceCheckUtils]: 35: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,447 INFO L290 TraceCheckUtils]: 34: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post8 < 100);havoc #t~post8; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,448 INFO L290 TraceCheckUtils]: 33: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,448 INFO L290 TraceCheckUtils]: 32: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !(~r~0 > 0); {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,449 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {116309#true} {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #96#return; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,449 INFO L290 TraceCheckUtils]: 30: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,449 INFO L290 TraceCheckUtils]: 29: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,449 INFO L290 TraceCheckUtils]: 28: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,449 INFO L272 TraceCheckUtils]: 27: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,450 INFO L290 TraceCheckUtils]: 26: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post7 < 100);havoc #t~post7; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,450 INFO L290 TraceCheckUtils]: 25: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,451 INFO L290 TraceCheckUtils]: 24: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(0 != ~r~0); {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,451 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {116309#true} {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #94#return; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,451 INFO L290 TraceCheckUtils]: 22: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,452 INFO L290 TraceCheckUtils]: 21: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,452 INFO L290 TraceCheckUtils]: 20: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,452 INFO L272 TraceCheckUtils]: 19: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} assume !!(#t~post6 < 100);havoc #t~post6; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,453 INFO L290 TraceCheckUtils]: 17: Hoare triple {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,454 INFO L290 TraceCheckUtils]: 16: Hoare triple {117097#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {117024#(or (<= (+ main_~v~0 1) (div (+ (- 1) main_~u~0) 2)) (not (< main_~r~0 0)) (<= (+ main_~u~0 main_~r~0) main_~v~0))} is VALID [2022-04-15 15:17:23,456 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {116354#(not (= |assume_abort_if_not_#in~cond| 0))} {116309#true} #92#return; {117097#(forall ((main_~R~0 Int)) (or (<= 2 main_~R~0) (<= (+ (* main_~R~0 main_~R~0) (* main_~R~0 2)) main_~A~0) (not (< (* main_~R~0 main_~R~0) main_~A~0))))} is VALID [2022-04-15 15:17:23,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {116354#(not (= |assume_abort_if_not_#in~cond| 0))} assume true; {116354#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:17:23,457 INFO L290 TraceCheckUtils]: 13: Hoare triple {117110#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} assume !(0 == ~cond); {116354#(not (= |assume_abort_if_not_#in~cond| 0))} is VALID [2022-04-15 15:17:23,457 INFO L290 TraceCheckUtils]: 12: Hoare triple {116309#true} ~cond := #in~cond; {117110#(or (not (= |assume_abort_if_not_#in~cond| 0)) (= assume_abort_if_not_~cond 0))} is VALID [2022-04-15 15:17:23,458 INFO L272 TraceCheckUtils]: 11: Hoare triple {116309#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)); {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {116309#true} {116309#true} #90#return; {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L290 TraceCheckUtils]: 9: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L290 TraceCheckUtils]: 8: Hoare triple {116309#true} assume !(0 == ~cond); {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {116309#true} ~cond := #in~cond; {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L272 TraceCheckUtils]: 6: Hoare triple {116309#true} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {116309#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; {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L272 TraceCheckUtils]: 4: Hoare triple {116309#true} call #t~ret9 := main(); {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {116309#true} {116309#true} #102#return; {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {116309#true} assume true; {116309#true} is VALID [2022-04-15 15:17:23,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {116309#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; {116309#true} is VALID [2022-04-15 15:17:23,459 INFO L272 TraceCheckUtils]: 0: Hoare triple {116309#true} call ULTIMATE.init(); {116309#true} is VALID [2022-04-15 15:17:23,459 INFO L134 CoverageAnalysis]: Checked inductivity of 524 backedges. 67 proven. 92 refuted. 0 times theorem prover too weak. 365 trivial. 0 not checked. [2022-04-15 15:17:23,459 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:17:23,459 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351726533] [2022-04-15 15:17:23,459 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:17:23,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1004583679] [2022-04-15 15:17:23,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1004583679] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:17:23,460 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:17:23,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-04-15 15:17:23,460 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:17:23,460 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1187030110] [2022-04-15 15:17:23,460 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1187030110] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:17:23,460 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:17:23,460 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-04-15 15:17:23,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037125398] [2022-04-15 15:17:23,461 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:17:23,461 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-15 15:17:23,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:17:23,461 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 15:17:29,252 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 96 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:29,252 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-04-15 15:17:29,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:29,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-04-15 15:17:29,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=289, Unknown=1, NotChecked=0, Total=342 [2022-04-15 15:17:29,253 INFO L87 Difference]: Start difference. First operand 711 states and 953 transitions. Second operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 15:17:34,633 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, Int], hasArrays=false, hasNonlinArith=true, quantifiers [] [2022-04-15 15:17:39,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:39,208 INFO L93 Difference]: Finished difference Result 968 states and 1339 transitions. [2022-04-15 15:17:39,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-04-15 15:17:39,208 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) Word has length 137 [2022-04-15 15:17:39,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:17:39,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 15:17:39,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-15 15:17:39,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 15:17:39,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-04-15 15:17:39,210 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-04-15 15:17:44,058 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 159 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:44,089 INFO L225 Difference]: With dead ends: 968 [2022-04-15 15:17:44,089 INFO L226 Difference]: Without dead ends: 855 [2022-04-15 15:17:44,089 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 276 GetRequests, 256 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=70, Invalid=391, Unknown=1, NotChecked=0, Total=462 [2022-04-15 15:17:44,090 INFO L913 BasicCegarLoop]: 79 mSDtfsCounter, 28 mSDsluCounter, 403 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 5 mSolverCounterUnsat, 1 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 482 SdHoareTripleChecker+Invalid, 266 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 1 IncrementalHoareTripleChecker+Unknown, 203 IncrementalHoareTripleChecker+Unchecked, 3.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:17:44,090 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 482 Invalid, 266 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 57 Invalid, 1 Unknown, 203 Unchecked, 3.4s Time] [2022-04-15 15:17:44,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-04-15 15:17:46,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 711. [2022-04-15 15:17:46,606 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:17:46,606 INFO L82 GeneralOperation]: Start isEquivalent. First operand 855 states. Second operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:17:46,607 INFO L74 IsIncluded]: Start isIncluded. First operand 855 states. Second operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:17:46,607 INFO L87 Difference]: Start difference. First operand 855 states. Second operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:17:46,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:46,632 INFO L93 Difference]: Finished difference Result 855 states and 1171 transitions. [2022-04-15 15:17:46,632 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1171 transitions. [2022-04-15 15:17:46,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:17:46,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:17:46,634 INFO L74 IsIncluded]: Start isIncluded. First operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 855 states. [2022-04-15 15:17:46,634 INFO L87 Difference]: Start difference. First operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) Second operand 855 states. [2022-04-15 15:17:46,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:17:46,667 INFO L93 Difference]: Finished difference Result 855 states and 1171 transitions. [2022-04-15 15:17:46,667 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1171 transitions. [2022-04-15 15:17:46,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:17:46,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:17:46,668 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:17:46,668 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:17:46,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 711 states, 528 states have (on average 1.191287878787879) internal successors, (629), 545 states have internal predecessors, (629), 163 states have call successors, (163), 21 states have call predecessors, (163), 19 states have return successors, (161), 144 states have call predecessors, (161), 161 states have call successors, (161) [2022-04-15 15:17:46,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 711 states to 711 states and 953 transitions. [2022-04-15 15:17:46,692 INFO L78 Accepts]: Start accepts. Automaton has 711 states and 953 transitions. Word has length 137 [2022-04-15 15:17:46,692 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:17:46,692 INFO L478 AbstractCegarLoop]: Abstraction has 711 states and 953 transitions. [2022-04-15 15:17:46,692 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 5.636363636363637) internal successors, (62), 10 states have internal predecessors, (62), 8 states have call successors, (19), 2 states have call predecessors, (19), 2 states have return successors, (17), 8 states have call predecessors, (17), 7 states have call successors, (17) [2022-04-15 15:17:46,692 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 711 states and 953 transitions. [2022-04-15 15:17:53,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 953 edges. 952 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:53,926 INFO L276 IsEmpty]: Start isEmpty. Operand 711 states and 953 transitions. [2022-04-15 15:17:53,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 138 [2022-04-15 15:17:53,927 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:17:53,927 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 7, 7, 7, 7, 5, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:17:53,944 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (48)] Forceful destruction successful, exit code 0 [2022-04-15 15:17:54,127 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46,48 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:17:54,128 INFO L403 AbstractCegarLoop]: === Iteration 48 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:17:54,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:17:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 23 times [2022-04-15 15:17:54,128 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:54,128 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [789706426] [2022-04-15 15:17:54,128 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:17:54,128 INFO L85 PathProgramCache]: Analyzing trace with hash -134259028, now seen corresponding path program 24 times [2022-04-15 15:17:54,129 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:17:54,129 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [660274291] [2022-04-15 15:17:54,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:17:54,129 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:17:54,151 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:17:54,152 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [329415521] [2022-04-15 15:17:54,152 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:17:54,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:17:54,152 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:17:54,153 INFO L229 MonitoredProcess]: Starting monitored process 49 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:17:54,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Waiting until timeout for monitored process [2022-04-15 15:17:54,330 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:17:54,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:17:54,332 INFO L263 TraceCheckSpWp]: Trace formula consists of 332 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 15:17:54,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:17:54,360 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:17:55,083 INFO L272 TraceCheckUtils]: 0: Hoare triple {122223#true} call ULTIMATE.init(); {122223#true} is VALID [2022-04-15 15:17:55,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {122223#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; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {122231#(<= ~counter~0 0)} assume true; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,084 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {122231#(<= ~counter~0 0)} {122223#true} #102#return; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,085 INFO L272 TraceCheckUtils]: 4: Hoare triple {122231#(<= ~counter~0 0)} call #t~ret9 := main(); {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,085 INFO L290 TraceCheckUtils]: 5: Hoare triple {122231#(<= ~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; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,085 INFO L272 TraceCheckUtils]: 6: Hoare triple {122231#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,086 INFO L290 TraceCheckUtils]: 7: Hoare triple {122231#(<= ~counter~0 0)} ~cond := #in~cond; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,086 INFO L290 TraceCheckUtils]: 8: Hoare triple {122231#(<= ~counter~0 0)} assume !(0 == ~cond); {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {122231#(<= ~counter~0 0)} assume true; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,087 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {122231#(<= ~counter~0 0)} {122231#(<= ~counter~0 0)} #90#return; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,087 INFO L272 TraceCheckUtils]: 11: Hoare triple {122231#(<= ~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)); {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,087 INFO L290 TraceCheckUtils]: 12: Hoare triple {122231#(<= ~counter~0 0)} ~cond := #in~cond; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {122231#(<= ~counter~0 0)} assume !(0 == ~cond); {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {122231#(<= ~counter~0 0)} assume true; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,088 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {122231#(<= ~counter~0 0)} {122231#(<= ~counter~0 0)} #92#return; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {122231#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {122231#(<= ~counter~0 0)} is VALID [2022-04-15 15:17:55,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {122231#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122280#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:55,091 INFO L290 TraceCheckUtils]: 18: Hoare triple {122280#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {122280#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:55,092 INFO L272 TraceCheckUtils]: 19: Hoare triple {122280#(<= ~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)); {122280#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:55,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {122280#(<= ~counter~0 1)} ~cond := #in~cond; {122280#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:55,092 INFO L290 TraceCheckUtils]: 21: Hoare triple {122280#(<= ~counter~0 1)} assume !(0 == ~cond); {122280#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:55,092 INFO L290 TraceCheckUtils]: 22: Hoare triple {122280#(<= ~counter~0 1)} assume true; {122280#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:55,093 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {122280#(<= ~counter~0 1)} {122280#(<= ~counter~0 1)} #94#return; {122280#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:55,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {122280#(<= ~counter~0 1)} assume !!(0 != ~r~0); {122280#(<= ~counter~0 1)} is VALID [2022-04-15 15:17:55,094 INFO L290 TraceCheckUtils]: 25: Hoare triple {122280#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122305#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:55,095 INFO L290 TraceCheckUtils]: 26: Hoare triple {122305#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {122305#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:55,095 INFO L272 TraceCheckUtils]: 27: Hoare triple {122305#(<= ~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)); {122305#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:55,095 INFO L290 TraceCheckUtils]: 28: Hoare triple {122305#(<= ~counter~0 2)} ~cond := #in~cond; {122305#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:55,096 INFO L290 TraceCheckUtils]: 29: Hoare triple {122305#(<= ~counter~0 2)} assume !(0 == ~cond); {122305#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:55,096 INFO L290 TraceCheckUtils]: 30: Hoare triple {122305#(<= ~counter~0 2)} assume true; {122305#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:55,096 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {122305#(<= ~counter~0 2)} {122305#(<= ~counter~0 2)} #96#return; {122305#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:55,097 INFO L290 TraceCheckUtils]: 32: Hoare triple {122305#(<= ~counter~0 2)} assume !(~r~0 > 0); {122305#(<= ~counter~0 2)} is VALID [2022-04-15 15:17:55,098 INFO L290 TraceCheckUtils]: 33: Hoare triple {122305#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122330#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:55,098 INFO L290 TraceCheckUtils]: 34: Hoare triple {122330#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {122330#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:55,098 INFO L272 TraceCheckUtils]: 35: Hoare triple {122330#(<= ~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)); {122330#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:55,099 INFO L290 TraceCheckUtils]: 36: Hoare triple {122330#(<= ~counter~0 3)} ~cond := #in~cond; {122330#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:55,099 INFO L290 TraceCheckUtils]: 37: Hoare triple {122330#(<= ~counter~0 3)} assume !(0 == ~cond); {122330#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:55,099 INFO L290 TraceCheckUtils]: 38: Hoare triple {122330#(<= ~counter~0 3)} assume true; {122330#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:55,100 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {122330#(<= ~counter~0 3)} {122330#(<= ~counter~0 3)} #98#return; {122330#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:55,100 INFO L290 TraceCheckUtils]: 40: Hoare triple {122330#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122330#(<= ~counter~0 3)} is VALID [2022-04-15 15:17:55,101 INFO L290 TraceCheckUtils]: 41: Hoare triple {122330#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122355#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:55,101 INFO L290 TraceCheckUtils]: 42: Hoare triple {122355#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {122355#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:55,102 INFO L272 TraceCheckUtils]: 43: Hoare triple {122355#(<= ~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)); {122355#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:55,102 INFO L290 TraceCheckUtils]: 44: Hoare triple {122355#(<= ~counter~0 4)} ~cond := #in~cond; {122355#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:55,102 INFO L290 TraceCheckUtils]: 45: Hoare triple {122355#(<= ~counter~0 4)} assume !(0 == ~cond); {122355#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:55,103 INFO L290 TraceCheckUtils]: 46: Hoare triple {122355#(<= ~counter~0 4)} assume true; {122355#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:55,103 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {122355#(<= ~counter~0 4)} {122355#(<= ~counter~0 4)} #98#return; {122355#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:55,103 INFO L290 TraceCheckUtils]: 48: Hoare triple {122355#(<= ~counter~0 4)} assume !(~r~0 < 0); {122355#(<= ~counter~0 4)} is VALID [2022-04-15 15:17:55,104 INFO L290 TraceCheckUtils]: 49: Hoare triple {122355#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122380#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:55,105 INFO L290 TraceCheckUtils]: 50: Hoare triple {122380#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {122380#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:55,105 INFO L272 TraceCheckUtils]: 51: Hoare triple {122380#(<= ~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)); {122380#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:55,105 INFO L290 TraceCheckUtils]: 52: Hoare triple {122380#(<= ~counter~0 5)} ~cond := #in~cond; {122380#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:55,106 INFO L290 TraceCheckUtils]: 53: Hoare triple {122380#(<= ~counter~0 5)} assume !(0 == ~cond); {122380#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:55,106 INFO L290 TraceCheckUtils]: 54: Hoare triple {122380#(<= ~counter~0 5)} assume true; {122380#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:55,107 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {122380#(<= ~counter~0 5)} {122380#(<= ~counter~0 5)} #94#return; {122380#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:55,107 INFO L290 TraceCheckUtils]: 56: Hoare triple {122380#(<= ~counter~0 5)} assume !!(0 != ~r~0); {122380#(<= ~counter~0 5)} is VALID [2022-04-15 15:17:55,108 INFO L290 TraceCheckUtils]: 57: Hoare triple {122380#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122405#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:55,108 INFO L290 TraceCheckUtils]: 58: Hoare triple {122405#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {122405#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:55,109 INFO L272 TraceCheckUtils]: 59: Hoare triple {122405#(<= ~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)); {122405#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:55,109 INFO L290 TraceCheckUtils]: 60: Hoare triple {122405#(<= ~counter~0 6)} ~cond := #in~cond; {122405#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:55,109 INFO L290 TraceCheckUtils]: 61: Hoare triple {122405#(<= ~counter~0 6)} assume !(0 == ~cond); {122405#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:55,109 INFO L290 TraceCheckUtils]: 62: Hoare triple {122405#(<= ~counter~0 6)} assume true; {122405#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:55,110 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {122405#(<= ~counter~0 6)} {122405#(<= ~counter~0 6)} #96#return; {122405#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:55,110 INFO L290 TraceCheckUtils]: 64: Hoare triple {122405#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122405#(<= ~counter~0 6)} is VALID [2022-04-15 15:17:55,111 INFO L290 TraceCheckUtils]: 65: Hoare triple {122405#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122430#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:55,111 INFO L290 TraceCheckUtils]: 66: Hoare triple {122430#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {122430#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:55,112 INFO L272 TraceCheckUtils]: 67: Hoare triple {122430#(<= ~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)); {122430#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:55,112 INFO L290 TraceCheckUtils]: 68: Hoare triple {122430#(<= ~counter~0 7)} ~cond := #in~cond; {122430#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:55,113 INFO L290 TraceCheckUtils]: 69: Hoare triple {122430#(<= ~counter~0 7)} assume !(0 == ~cond); {122430#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:55,113 INFO L290 TraceCheckUtils]: 70: Hoare triple {122430#(<= ~counter~0 7)} assume true; {122430#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:55,113 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {122430#(<= ~counter~0 7)} {122430#(<= ~counter~0 7)} #96#return; {122430#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:55,114 INFO L290 TraceCheckUtils]: 72: Hoare triple {122430#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122430#(<= ~counter~0 7)} is VALID [2022-04-15 15:17:55,115 INFO L290 TraceCheckUtils]: 73: Hoare triple {122430#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122455#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:55,115 INFO L290 TraceCheckUtils]: 74: Hoare triple {122455#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {122455#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:55,115 INFO L272 TraceCheckUtils]: 75: Hoare triple {122455#(<= ~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)); {122455#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:55,116 INFO L290 TraceCheckUtils]: 76: Hoare triple {122455#(<= ~counter~0 8)} ~cond := #in~cond; {122455#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:55,116 INFO L290 TraceCheckUtils]: 77: Hoare triple {122455#(<= ~counter~0 8)} assume !(0 == ~cond); {122455#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:55,116 INFO L290 TraceCheckUtils]: 78: Hoare triple {122455#(<= ~counter~0 8)} assume true; {122455#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:55,117 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {122455#(<= ~counter~0 8)} {122455#(<= ~counter~0 8)} #96#return; {122455#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:55,117 INFO L290 TraceCheckUtils]: 80: Hoare triple {122455#(<= ~counter~0 8)} assume !(~r~0 > 0); {122455#(<= ~counter~0 8)} is VALID [2022-04-15 15:17:55,118 INFO L290 TraceCheckUtils]: 81: Hoare triple {122455#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122480#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:55,118 INFO L290 TraceCheckUtils]: 82: Hoare triple {122480#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {122480#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:55,119 INFO L272 TraceCheckUtils]: 83: Hoare triple {122480#(<= ~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)); {122480#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:55,119 INFO L290 TraceCheckUtils]: 84: Hoare triple {122480#(<= ~counter~0 9)} ~cond := #in~cond; {122480#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:55,119 INFO L290 TraceCheckUtils]: 85: Hoare triple {122480#(<= ~counter~0 9)} assume !(0 == ~cond); {122480#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:55,120 INFO L290 TraceCheckUtils]: 86: Hoare triple {122480#(<= ~counter~0 9)} assume true; {122480#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:55,120 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {122480#(<= ~counter~0 9)} {122480#(<= ~counter~0 9)} #98#return; {122480#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:55,120 INFO L290 TraceCheckUtils]: 88: Hoare triple {122480#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122480#(<= ~counter~0 9)} is VALID [2022-04-15 15:17:55,121 INFO L290 TraceCheckUtils]: 89: Hoare triple {122480#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122505#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:55,122 INFO L290 TraceCheckUtils]: 90: Hoare triple {122505#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {122505#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:55,122 INFO L272 TraceCheckUtils]: 91: Hoare triple {122505#(<= ~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)); {122505#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:55,122 INFO L290 TraceCheckUtils]: 92: Hoare triple {122505#(<= ~counter~0 10)} ~cond := #in~cond; {122505#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:55,123 INFO L290 TraceCheckUtils]: 93: Hoare triple {122505#(<= ~counter~0 10)} assume !(0 == ~cond); {122505#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:55,123 INFO L290 TraceCheckUtils]: 94: Hoare triple {122505#(<= ~counter~0 10)} assume true; {122505#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:55,123 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {122505#(<= ~counter~0 10)} {122505#(<= ~counter~0 10)} #98#return; {122505#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:55,124 INFO L290 TraceCheckUtils]: 96: Hoare triple {122505#(<= ~counter~0 10)} assume !(~r~0 < 0); {122505#(<= ~counter~0 10)} is VALID [2022-04-15 15:17:55,125 INFO L290 TraceCheckUtils]: 97: Hoare triple {122505#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122530#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:55,125 INFO L290 TraceCheckUtils]: 98: Hoare triple {122530#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {122530#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:55,125 INFO L272 TraceCheckUtils]: 99: Hoare triple {122530#(<= ~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)); {122530#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:55,126 INFO L290 TraceCheckUtils]: 100: Hoare triple {122530#(<= ~counter~0 11)} ~cond := #in~cond; {122530#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:55,126 INFO L290 TraceCheckUtils]: 101: Hoare triple {122530#(<= ~counter~0 11)} assume !(0 == ~cond); {122530#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:55,126 INFO L290 TraceCheckUtils]: 102: Hoare triple {122530#(<= ~counter~0 11)} assume true; {122530#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:55,127 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {122530#(<= ~counter~0 11)} {122530#(<= ~counter~0 11)} #94#return; {122530#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:55,127 INFO L290 TraceCheckUtils]: 104: Hoare triple {122530#(<= ~counter~0 11)} assume !!(0 != ~r~0); {122530#(<= ~counter~0 11)} is VALID [2022-04-15 15:17:55,128 INFO L290 TraceCheckUtils]: 105: Hoare triple {122530#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122555#(<= ~counter~0 12)} is VALID [2022-04-15 15:17:55,128 INFO L290 TraceCheckUtils]: 106: Hoare triple {122555#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {122555#(<= ~counter~0 12)} is VALID [2022-04-15 15:17:55,129 INFO L272 TraceCheckUtils]: 107: Hoare triple {122555#(<= ~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)); {122555#(<= ~counter~0 12)} is VALID [2022-04-15 15:17:55,129 INFO L290 TraceCheckUtils]: 108: Hoare triple {122555#(<= ~counter~0 12)} ~cond := #in~cond; {122555#(<= ~counter~0 12)} is VALID [2022-04-15 15:17:55,129 INFO L290 TraceCheckUtils]: 109: Hoare triple {122555#(<= ~counter~0 12)} assume !(0 == ~cond); {122555#(<= ~counter~0 12)} is VALID [2022-04-15 15:17:55,130 INFO L290 TraceCheckUtils]: 110: Hoare triple {122555#(<= ~counter~0 12)} assume true; {122555#(<= ~counter~0 12)} is VALID [2022-04-15 15:17:55,130 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {122555#(<= ~counter~0 12)} {122555#(<= ~counter~0 12)} #96#return; {122555#(<= ~counter~0 12)} is VALID [2022-04-15 15:17:55,131 INFO L290 TraceCheckUtils]: 112: Hoare triple {122555#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122555#(<= ~counter~0 12)} is VALID [2022-04-15 15:17:55,131 INFO L290 TraceCheckUtils]: 113: Hoare triple {122555#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122580#(<= ~counter~0 13)} is VALID [2022-04-15 15:17:55,132 INFO L290 TraceCheckUtils]: 114: Hoare triple {122580#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {122580#(<= ~counter~0 13)} is VALID [2022-04-15 15:17:55,132 INFO L272 TraceCheckUtils]: 115: Hoare triple {122580#(<= ~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)); {122580#(<= ~counter~0 13)} is VALID [2022-04-15 15:17:55,133 INFO L290 TraceCheckUtils]: 116: Hoare triple {122580#(<= ~counter~0 13)} ~cond := #in~cond; {122580#(<= ~counter~0 13)} is VALID [2022-04-15 15:17:55,133 INFO L290 TraceCheckUtils]: 117: Hoare triple {122580#(<= ~counter~0 13)} assume !(0 == ~cond); {122580#(<= ~counter~0 13)} is VALID [2022-04-15 15:17:55,133 INFO L290 TraceCheckUtils]: 118: Hoare triple {122580#(<= ~counter~0 13)} assume true; {122580#(<= ~counter~0 13)} is VALID [2022-04-15 15:17:55,134 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {122580#(<= ~counter~0 13)} {122580#(<= ~counter~0 13)} #96#return; {122580#(<= ~counter~0 13)} is VALID [2022-04-15 15:17:55,134 INFO L290 TraceCheckUtils]: 120: Hoare triple {122580#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122580#(<= ~counter~0 13)} is VALID [2022-04-15 15:17:55,135 INFO L290 TraceCheckUtils]: 121: Hoare triple {122580#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122605#(<= ~counter~0 14)} is VALID [2022-04-15 15:17:55,135 INFO L290 TraceCheckUtils]: 122: Hoare triple {122605#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {122605#(<= ~counter~0 14)} is VALID [2022-04-15 15:17:55,136 INFO L272 TraceCheckUtils]: 123: Hoare triple {122605#(<= ~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)); {122605#(<= ~counter~0 14)} is VALID [2022-04-15 15:17:55,136 INFO L290 TraceCheckUtils]: 124: Hoare triple {122605#(<= ~counter~0 14)} ~cond := #in~cond; {122605#(<= ~counter~0 14)} is VALID [2022-04-15 15:17:55,136 INFO L290 TraceCheckUtils]: 125: Hoare triple {122605#(<= ~counter~0 14)} assume !(0 == ~cond); {122605#(<= ~counter~0 14)} is VALID [2022-04-15 15:17:55,136 INFO L290 TraceCheckUtils]: 126: Hoare triple {122605#(<= ~counter~0 14)} assume true; {122605#(<= ~counter~0 14)} is VALID [2022-04-15 15:17:55,137 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {122605#(<= ~counter~0 14)} {122605#(<= ~counter~0 14)} #96#return; {122605#(<= ~counter~0 14)} is VALID [2022-04-15 15:17:55,137 INFO L290 TraceCheckUtils]: 128: Hoare triple {122605#(<= ~counter~0 14)} assume !(~r~0 > 0); {122605#(<= ~counter~0 14)} is VALID [2022-04-15 15:17:55,138 INFO L290 TraceCheckUtils]: 129: Hoare triple {122605#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122630#(<= ~counter~0 15)} is VALID [2022-04-15 15:17:55,139 INFO L290 TraceCheckUtils]: 130: Hoare triple {122630#(<= ~counter~0 15)} assume !(#t~post8 < 100);havoc #t~post8; {122630#(<= ~counter~0 15)} is VALID [2022-04-15 15:17:55,139 INFO L290 TraceCheckUtils]: 131: Hoare triple {122630#(<= ~counter~0 15)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122637#(<= |main_#t~post6| 15)} is VALID [2022-04-15 15:17:55,139 INFO L290 TraceCheckUtils]: 132: Hoare triple {122637#(<= |main_#t~post6| 15)} assume !(#t~post6 < 100);havoc #t~post6; {122224#false} is VALID [2022-04-15 15:17:55,139 INFO L272 TraceCheckUtils]: 133: Hoare triple {122224#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)); {122224#false} is VALID [2022-04-15 15:17:55,139 INFO L290 TraceCheckUtils]: 134: Hoare triple {122224#false} ~cond := #in~cond; {122224#false} is VALID [2022-04-15 15:17:55,139 INFO L290 TraceCheckUtils]: 135: Hoare triple {122224#false} assume 0 == ~cond; {122224#false} is VALID [2022-04-15 15:17:55,140 INFO L290 TraceCheckUtils]: 136: Hoare triple {122224#false} assume !false; {122224#false} is VALID [2022-04-15 15:17:55,140 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:17:55,140 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:17:56,054 INFO L290 TraceCheckUtils]: 136: Hoare triple {122224#false} assume !false; {122224#false} is VALID [2022-04-15 15:17:56,054 INFO L290 TraceCheckUtils]: 135: Hoare triple {122224#false} assume 0 == ~cond; {122224#false} is VALID [2022-04-15 15:17:56,054 INFO L290 TraceCheckUtils]: 134: Hoare triple {122224#false} ~cond := #in~cond; {122224#false} is VALID [2022-04-15 15:17:56,054 INFO L272 TraceCheckUtils]: 133: Hoare triple {122224#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)); {122224#false} is VALID [2022-04-15 15:17:56,055 INFO L290 TraceCheckUtils]: 132: Hoare triple {122665#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {122224#false} is VALID [2022-04-15 15:17:56,055 INFO L290 TraceCheckUtils]: 131: Hoare triple {122669#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122665#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:17:56,055 INFO L290 TraceCheckUtils]: 130: Hoare triple {122669#(< ~counter~0 100)} assume !(#t~post8 < 100);havoc #t~post8; {122669#(< ~counter~0 100)} is VALID [2022-04-15 15:17:56,058 INFO L290 TraceCheckUtils]: 129: Hoare triple {122676#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122669#(< ~counter~0 100)} is VALID [2022-04-15 15:17:56,058 INFO L290 TraceCheckUtils]: 128: Hoare triple {122676#(< ~counter~0 99)} assume !(~r~0 > 0); {122676#(< ~counter~0 99)} is VALID [2022-04-15 15:17:56,058 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {122223#true} {122676#(< ~counter~0 99)} #96#return; {122676#(< ~counter~0 99)} is VALID [2022-04-15 15:17:56,059 INFO L290 TraceCheckUtils]: 126: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,059 INFO L290 TraceCheckUtils]: 125: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,059 INFO L290 TraceCheckUtils]: 124: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,059 INFO L272 TraceCheckUtils]: 123: Hoare triple {122676#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,059 INFO L290 TraceCheckUtils]: 122: Hoare triple {122676#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {122676#(< ~counter~0 99)} is VALID [2022-04-15 15:17:56,060 INFO L290 TraceCheckUtils]: 121: Hoare triple {122701#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122676#(< ~counter~0 99)} is VALID [2022-04-15 15:17:56,060 INFO L290 TraceCheckUtils]: 120: Hoare triple {122701#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122701#(< ~counter~0 98)} is VALID [2022-04-15 15:17:56,061 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {122223#true} {122701#(< ~counter~0 98)} #96#return; {122701#(< ~counter~0 98)} is VALID [2022-04-15 15:17:56,061 INFO L290 TraceCheckUtils]: 118: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,061 INFO L290 TraceCheckUtils]: 117: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,061 INFO L290 TraceCheckUtils]: 116: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,061 INFO L272 TraceCheckUtils]: 115: Hoare triple {122701#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,061 INFO L290 TraceCheckUtils]: 114: Hoare triple {122701#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {122701#(< ~counter~0 98)} is VALID [2022-04-15 15:17:56,062 INFO L290 TraceCheckUtils]: 113: Hoare triple {122726#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122701#(< ~counter~0 98)} is VALID [2022-04-15 15:17:56,063 INFO L290 TraceCheckUtils]: 112: Hoare triple {122726#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122726#(< ~counter~0 97)} is VALID [2022-04-15 15:17:56,063 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {122223#true} {122726#(< ~counter~0 97)} #96#return; {122726#(< ~counter~0 97)} is VALID [2022-04-15 15:17:56,063 INFO L290 TraceCheckUtils]: 110: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,063 INFO L290 TraceCheckUtils]: 109: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,063 INFO L290 TraceCheckUtils]: 108: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,064 INFO L272 TraceCheckUtils]: 107: Hoare triple {122726#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,064 INFO L290 TraceCheckUtils]: 106: Hoare triple {122726#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {122726#(< ~counter~0 97)} is VALID [2022-04-15 15:17:56,065 INFO L290 TraceCheckUtils]: 105: Hoare triple {122751#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122726#(< ~counter~0 97)} is VALID [2022-04-15 15:17:56,065 INFO L290 TraceCheckUtils]: 104: Hoare triple {122751#(< ~counter~0 96)} assume !!(0 != ~r~0); {122751#(< ~counter~0 96)} is VALID [2022-04-15 15:17:56,066 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {122223#true} {122751#(< ~counter~0 96)} #94#return; {122751#(< ~counter~0 96)} is VALID [2022-04-15 15:17:56,066 INFO L290 TraceCheckUtils]: 102: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,066 INFO L290 TraceCheckUtils]: 101: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,066 INFO L290 TraceCheckUtils]: 100: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,066 INFO L272 TraceCheckUtils]: 99: Hoare triple {122751#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,066 INFO L290 TraceCheckUtils]: 98: Hoare triple {122751#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {122751#(< ~counter~0 96)} is VALID [2022-04-15 15:17:56,067 INFO L290 TraceCheckUtils]: 97: Hoare triple {122776#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122751#(< ~counter~0 96)} is VALID [2022-04-15 15:17:56,067 INFO L290 TraceCheckUtils]: 96: Hoare triple {122776#(< ~counter~0 95)} assume !(~r~0 < 0); {122776#(< ~counter~0 95)} is VALID [2022-04-15 15:17:56,068 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {122223#true} {122776#(< ~counter~0 95)} #98#return; {122776#(< ~counter~0 95)} is VALID [2022-04-15 15:17:56,068 INFO L290 TraceCheckUtils]: 94: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,068 INFO L290 TraceCheckUtils]: 93: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,068 INFO L290 TraceCheckUtils]: 92: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,068 INFO L272 TraceCheckUtils]: 91: Hoare triple {122776#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,068 INFO L290 TraceCheckUtils]: 90: Hoare triple {122776#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {122776#(< ~counter~0 95)} is VALID [2022-04-15 15:17:56,069 INFO L290 TraceCheckUtils]: 89: Hoare triple {122801#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122776#(< ~counter~0 95)} is VALID [2022-04-15 15:17:56,070 INFO L290 TraceCheckUtils]: 88: Hoare triple {122801#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122801#(< ~counter~0 94)} is VALID [2022-04-15 15:17:56,070 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {122223#true} {122801#(< ~counter~0 94)} #98#return; {122801#(< ~counter~0 94)} is VALID [2022-04-15 15:17:56,070 INFO L290 TraceCheckUtils]: 86: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,070 INFO L290 TraceCheckUtils]: 85: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,070 INFO L290 TraceCheckUtils]: 84: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,070 INFO L272 TraceCheckUtils]: 83: Hoare triple {122801#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,071 INFO L290 TraceCheckUtils]: 82: Hoare triple {122801#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {122801#(< ~counter~0 94)} is VALID [2022-04-15 15:17:56,072 INFO L290 TraceCheckUtils]: 81: Hoare triple {122826#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122801#(< ~counter~0 94)} is VALID [2022-04-15 15:17:56,072 INFO L290 TraceCheckUtils]: 80: Hoare triple {122826#(< ~counter~0 93)} assume !(~r~0 > 0); {122826#(< ~counter~0 93)} is VALID [2022-04-15 15:17:56,072 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {122223#true} {122826#(< ~counter~0 93)} #96#return; {122826#(< ~counter~0 93)} is VALID [2022-04-15 15:17:56,073 INFO L290 TraceCheckUtils]: 78: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,073 INFO L290 TraceCheckUtils]: 77: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,073 INFO L290 TraceCheckUtils]: 76: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,073 INFO L272 TraceCheckUtils]: 75: Hoare triple {122826#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,073 INFO L290 TraceCheckUtils]: 74: Hoare triple {122826#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {122826#(< ~counter~0 93)} is VALID [2022-04-15 15:17:56,074 INFO L290 TraceCheckUtils]: 73: Hoare triple {122851#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122826#(< ~counter~0 93)} is VALID [2022-04-15 15:17:56,074 INFO L290 TraceCheckUtils]: 72: Hoare triple {122851#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122851#(< ~counter~0 92)} is VALID [2022-04-15 15:17:56,075 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {122223#true} {122851#(< ~counter~0 92)} #96#return; {122851#(< ~counter~0 92)} is VALID [2022-04-15 15:17:56,075 INFO L290 TraceCheckUtils]: 70: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,075 INFO L290 TraceCheckUtils]: 69: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,075 INFO L290 TraceCheckUtils]: 68: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,075 INFO L272 TraceCheckUtils]: 67: Hoare triple {122851#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,075 INFO L290 TraceCheckUtils]: 66: Hoare triple {122851#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {122851#(< ~counter~0 92)} is VALID [2022-04-15 15:17:56,076 INFO L290 TraceCheckUtils]: 65: Hoare triple {122876#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122851#(< ~counter~0 92)} is VALID [2022-04-15 15:17:56,077 INFO L290 TraceCheckUtils]: 64: Hoare triple {122876#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {122876#(< ~counter~0 91)} is VALID [2022-04-15 15:17:56,077 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {122223#true} {122876#(< ~counter~0 91)} #96#return; {122876#(< ~counter~0 91)} is VALID [2022-04-15 15:17:56,077 INFO L290 TraceCheckUtils]: 62: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,077 INFO L290 TraceCheckUtils]: 61: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,077 INFO L290 TraceCheckUtils]: 60: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,077 INFO L272 TraceCheckUtils]: 59: Hoare triple {122876#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,078 INFO L290 TraceCheckUtils]: 58: Hoare triple {122876#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {122876#(< ~counter~0 91)} is VALID [2022-04-15 15:17:56,079 INFO L290 TraceCheckUtils]: 57: Hoare triple {122901#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122876#(< ~counter~0 91)} is VALID [2022-04-15 15:17:56,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {122901#(< ~counter~0 90)} assume !!(0 != ~r~0); {122901#(< ~counter~0 90)} is VALID [2022-04-15 15:17:56,079 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {122223#true} {122901#(< ~counter~0 90)} #94#return; {122901#(< ~counter~0 90)} is VALID [2022-04-15 15:17:56,079 INFO L290 TraceCheckUtils]: 54: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,080 INFO L290 TraceCheckUtils]: 53: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,080 INFO L290 TraceCheckUtils]: 52: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,080 INFO L272 TraceCheckUtils]: 51: Hoare triple {122901#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,080 INFO L290 TraceCheckUtils]: 50: Hoare triple {122901#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {122901#(< ~counter~0 90)} is VALID [2022-04-15 15:17:56,081 INFO L290 TraceCheckUtils]: 49: Hoare triple {122926#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {122901#(< ~counter~0 90)} is VALID [2022-04-15 15:17:56,081 INFO L290 TraceCheckUtils]: 48: Hoare triple {122926#(< ~counter~0 89)} assume !(~r~0 < 0); {122926#(< ~counter~0 89)} is VALID [2022-04-15 15:17:56,082 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {122223#true} {122926#(< ~counter~0 89)} #98#return; {122926#(< ~counter~0 89)} is VALID [2022-04-15 15:17:56,082 INFO L290 TraceCheckUtils]: 46: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,082 INFO L290 TraceCheckUtils]: 45: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,082 INFO L290 TraceCheckUtils]: 44: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,082 INFO L272 TraceCheckUtils]: 43: Hoare triple {122926#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,082 INFO L290 TraceCheckUtils]: 42: Hoare triple {122926#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {122926#(< ~counter~0 89)} is VALID [2022-04-15 15:17:56,083 INFO L290 TraceCheckUtils]: 41: Hoare triple {122951#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122926#(< ~counter~0 89)} is VALID [2022-04-15 15:17:56,083 INFO L290 TraceCheckUtils]: 40: Hoare triple {122951#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {122951#(< ~counter~0 88)} is VALID [2022-04-15 15:17:56,084 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {122223#true} {122951#(< ~counter~0 88)} #98#return; {122951#(< ~counter~0 88)} is VALID [2022-04-15 15:17:56,084 INFO L290 TraceCheckUtils]: 38: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,084 INFO L290 TraceCheckUtils]: 37: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,084 INFO L290 TraceCheckUtils]: 36: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,084 INFO L272 TraceCheckUtils]: 35: Hoare triple {122951#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,084 INFO L290 TraceCheckUtils]: 34: Hoare triple {122951#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {122951#(< ~counter~0 88)} is VALID [2022-04-15 15:17:56,085 INFO L290 TraceCheckUtils]: 33: Hoare triple {122976#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {122951#(< ~counter~0 88)} is VALID [2022-04-15 15:17:56,086 INFO L290 TraceCheckUtils]: 32: Hoare triple {122976#(< ~counter~0 87)} assume !(~r~0 > 0); {122976#(< ~counter~0 87)} is VALID [2022-04-15 15:17:56,086 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {122223#true} {122976#(< ~counter~0 87)} #96#return; {122976#(< ~counter~0 87)} is VALID [2022-04-15 15:17:56,086 INFO L290 TraceCheckUtils]: 30: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,086 INFO L290 TraceCheckUtils]: 29: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,086 INFO L290 TraceCheckUtils]: 28: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,087 INFO L272 TraceCheckUtils]: 27: Hoare triple {122976#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,087 INFO L290 TraceCheckUtils]: 26: Hoare triple {122976#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {122976#(< ~counter~0 87)} is VALID [2022-04-15 15:17:56,088 INFO L290 TraceCheckUtils]: 25: Hoare triple {123001#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {122976#(< ~counter~0 87)} is VALID [2022-04-15 15:17:56,088 INFO L290 TraceCheckUtils]: 24: Hoare triple {123001#(< ~counter~0 86)} assume !!(0 != ~r~0); {123001#(< ~counter~0 86)} is VALID [2022-04-15 15:17:56,089 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {122223#true} {123001#(< ~counter~0 86)} #94#return; {123001#(< ~counter~0 86)} is VALID [2022-04-15 15:17:56,089 INFO L290 TraceCheckUtils]: 22: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,089 INFO L290 TraceCheckUtils]: 21: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,089 INFO L290 TraceCheckUtils]: 20: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,089 INFO L272 TraceCheckUtils]: 19: Hoare triple {123001#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,089 INFO L290 TraceCheckUtils]: 18: Hoare triple {123001#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {123001#(< ~counter~0 86)} is VALID [2022-04-15 15:17:56,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {123026#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {123001#(< ~counter~0 86)} is VALID [2022-04-15 15:17:56,090 INFO L290 TraceCheckUtils]: 16: Hoare triple {123026#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {123026#(< ~counter~0 85)} is VALID [2022-04-15 15:17:56,091 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {122223#true} {123026#(< ~counter~0 85)} #92#return; {123026#(< ~counter~0 85)} is VALID [2022-04-15 15:17:56,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,091 INFO L290 TraceCheckUtils]: 12: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,091 INFO L272 TraceCheckUtils]: 11: Hoare triple {123026#(< ~counter~0 85)} 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)); {122223#true} is VALID [2022-04-15 15:17:56,091 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {122223#true} {123026#(< ~counter~0 85)} #90#return; {123026#(< ~counter~0 85)} is VALID [2022-04-15 15:17:56,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {122223#true} assume true; {122223#true} is VALID [2022-04-15 15:17:56,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {122223#true} assume !(0 == ~cond); {122223#true} is VALID [2022-04-15 15:17:56,092 INFO L290 TraceCheckUtils]: 7: Hoare triple {122223#true} ~cond := #in~cond; {122223#true} is VALID [2022-04-15 15:17:56,092 INFO L272 TraceCheckUtils]: 6: Hoare triple {123026#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {122223#true} is VALID [2022-04-15 15:17:56,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {123026#(< ~counter~0 85)} 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; {123026#(< ~counter~0 85)} is VALID [2022-04-15 15:17:56,092 INFO L272 TraceCheckUtils]: 4: Hoare triple {123026#(< ~counter~0 85)} call #t~ret9 := main(); {123026#(< ~counter~0 85)} is VALID [2022-04-15 15:17:56,093 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {123026#(< ~counter~0 85)} {122223#true} #102#return; {123026#(< ~counter~0 85)} is VALID [2022-04-15 15:17:56,093 INFO L290 TraceCheckUtils]: 2: Hoare triple {123026#(< ~counter~0 85)} assume true; {123026#(< ~counter~0 85)} is VALID [2022-04-15 15:17:56,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {122223#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; {123026#(< ~counter~0 85)} is VALID [2022-04-15 15:17:56,093 INFO L272 TraceCheckUtils]: 0: Hoare triple {122223#true} call ULTIMATE.init(); {122223#true} is VALID [2022-04-15 15:17:56,094 INFO L134 CoverageAnalysis]: Checked inductivity of 530 backedges. 28 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-15 15:17:56,094 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:17:56,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [660274291] [2022-04-15 15:17:56,094 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:17:56,094 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [329415521] [2022-04-15 15:17:56,094 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [329415521] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:17:56,094 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:17:56,094 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-15 15:17:56,094 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:17:56,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [789706426] [2022-04-15 15:17:56,095 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [789706426] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:17:56,095 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:17:56,095 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 15:17:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [173569283] [2022-04-15 15:17:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:17:56,095 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 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 137 [2022-04-15 15:17:56,095 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:17:56,095 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 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-15 15:17:56,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:17:56,216 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 15:17:56,216 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:17:56,216 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 15:17:56,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 15:17:56,217 INFO L87 Difference]: Start difference. First operand 711 states and 953 transitions. Second operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 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-15 15:18:00,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:00,931 INFO L93 Difference]: Finished difference Result 811 states and 1092 transitions. [2022-04-15 15:18:00,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 15:18:00,931 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 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 137 [2022-04-15 15:18:00,931 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:18:00,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 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-15 15:18:00,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-15 15:18:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 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-15 15:18:00,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-15 15:18:00,936 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-15 15:18:01,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:01,288 INFO L225 Difference]: With dead ends: 811 [2022-04-15 15:18:01,288 INFO L226 Difference]: Without dead ends: 806 [2022-04-15 15:18:01,289 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 285 GetRequests, 239 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 112 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=953, Invalid=1303, Unknown=0, NotChecked=0, Total=2256 [2022-04-15 15:18:01,289 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 297 mSDsluCounter, 282 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 211 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 297 SdHoareTripleChecker+Valid, 357 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 15:18:01,289 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [297 Valid, 357 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 15:18:01,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 806 states. [2022-04-15 15:18:04,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 806 to 779. [2022-04-15 15:18:04,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:18:04,015 INFO L82 GeneralOperation]: Start isEquivalent. First operand 806 states. Second operand has 779 states, 582 states have (on average 1.2027491408934707) internal successors, (700), 599 states have internal predecessors, (700), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:04,016 INFO L74 IsIncluded]: Start isIncluded. First operand 806 states. Second operand has 779 states, 582 states have (on average 1.2027491408934707) internal successors, (700), 599 states have internal predecessors, (700), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:04,016 INFO L87 Difference]: Start difference. First operand 806 states. Second operand has 779 states, 582 states have (on average 1.2027491408934707) internal successors, (700), 599 states have internal predecessors, (700), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:04,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:04,037 INFO L93 Difference]: Finished difference Result 806 states and 1081 transitions. [2022-04-15 15:18:04,038 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1081 transitions. [2022-04-15 15:18:04,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:04,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:04,039 INFO L74 IsIncluded]: Start isIncluded. First operand has 779 states, 582 states have (on average 1.2027491408934707) internal successors, (700), 599 states have internal predecessors, (700), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 806 states. [2022-04-15 15:18:04,039 INFO L87 Difference]: Start difference. First operand has 779 states, 582 states have (on average 1.2027491408934707) internal successors, (700), 599 states have internal predecessors, (700), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 806 states. [2022-04-15 15:18:04,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:04,060 INFO L93 Difference]: Finished difference Result 806 states and 1081 transitions. [2022-04-15 15:18:04,060 INFO L276 IsEmpty]: Start isEmpty. Operand 806 states and 1081 transitions. [2022-04-15 15:18:04,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:04,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:04,061 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:18:04,061 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:18:04,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 582 states have (on average 1.2027491408934707) internal successors, (700), 599 states have internal predecessors, (700), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:04,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1050 transitions. [2022-04-15 15:18:04,104 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1050 transitions. Word has length 137 [2022-04-15 15:18:04,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:18:04,105 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 1050 transitions. [2022-04-15 15:18:04,105 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.157894736842105) internal successors, (98), 18 states have internal predecessors, (98), 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-15 15:18:04,105 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 779 states and 1050 transitions. [2022-04-15 15:18:10,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1050 edges. 1049 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:10,565 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1050 transitions. [2022-04-15 15:18:10,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 140 [2022-04-15 15:18:10,566 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:18:10,566 INFO L499 BasicCegarLoop]: trace histogram [15, 14, 14, 8, 7, 7, 7, 5, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:18:10,572 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (49)] Forceful destruction successful, exit code 0 [2022-04-15 15:18:10,767 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 49 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable47 [2022-04-15 15:18:10,767 INFO L403 AbstractCegarLoop]: === Iteration 49 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:18:10,767 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:18:10,767 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 19 times [2022-04-15 15:18:10,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:10,767 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1989768489] [2022-04-15 15:18:10,768 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:18:10,768 INFO L85 PathProgramCache]: Analyzing trace with hash -895861967, now seen corresponding path program 20 times [2022-04-15 15:18:10,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:18:10,768 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1267705999] [2022-04-15 15:18:10,768 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:18:10,768 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:18:10,781 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:18:10,781 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1663916405] [2022-04-15 15:18:10,781 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:18:10,781 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:18:10,781 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:18:10,782 INFO L229 MonitoredProcess]: Starting monitored process 50 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:18:10,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Waiting until timeout for monitored process [2022-04-15 15:18:10,847 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:18:10,848 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:18:10,849 INFO L263 TraceCheckSpWp]: Trace formula consists of 341 conjuncts, 33 conjunts are in the unsatisfiable core [2022-04-15 15:18:10,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:18:10,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:18:11,599 INFO L272 TraceCheckUtils]: 0: Hoare triple {127896#true} call ULTIMATE.init(); {127896#true} is VALID [2022-04-15 15:18:11,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {127896#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; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {127904#(<= ~counter~0 0)} assume true; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,601 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {127904#(<= ~counter~0 0)} {127896#true} #102#return; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,601 INFO L272 TraceCheckUtils]: 4: Hoare triple {127904#(<= ~counter~0 0)} call #t~ret9 := main(); {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {127904#(<= ~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; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,602 INFO L272 TraceCheckUtils]: 6: Hoare triple {127904#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {127904#(<= ~counter~0 0)} ~cond := #in~cond; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {127904#(<= ~counter~0 0)} assume !(0 == ~cond); {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,602 INFO L290 TraceCheckUtils]: 9: Hoare triple {127904#(<= ~counter~0 0)} assume true; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,603 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {127904#(<= ~counter~0 0)} {127904#(<= ~counter~0 0)} #90#return; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,603 INFO L272 TraceCheckUtils]: 11: Hoare triple {127904#(<= ~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)); {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {127904#(<= ~counter~0 0)} ~cond := #in~cond; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {127904#(<= ~counter~0 0)} assume !(0 == ~cond); {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {127904#(<= ~counter~0 0)} assume true; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,604 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {127904#(<= ~counter~0 0)} {127904#(<= ~counter~0 0)} #92#return; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,605 INFO L290 TraceCheckUtils]: 16: Hoare triple {127904#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {127904#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:11,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {127904#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127953#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:11,607 INFO L290 TraceCheckUtils]: 18: Hoare triple {127953#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {127953#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:11,608 INFO L272 TraceCheckUtils]: 19: Hoare triple {127953#(<= ~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)); {127953#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:11,608 INFO L290 TraceCheckUtils]: 20: Hoare triple {127953#(<= ~counter~0 1)} ~cond := #in~cond; {127953#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:11,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {127953#(<= ~counter~0 1)} assume !(0 == ~cond); {127953#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:11,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {127953#(<= ~counter~0 1)} assume true; {127953#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:11,609 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {127953#(<= ~counter~0 1)} {127953#(<= ~counter~0 1)} #94#return; {127953#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:11,610 INFO L290 TraceCheckUtils]: 24: Hoare triple {127953#(<= ~counter~0 1)} assume !!(0 != ~r~0); {127953#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:11,611 INFO L290 TraceCheckUtils]: 25: Hoare triple {127953#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {127978#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:11,611 INFO L290 TraceCheckUtils]: 26: Hoare triple {127978#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {127978#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:11,611 INFO L272 TraceCheckUtils]: 27: Hoare triple {127978#(<= ~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)); {127978#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:11,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {127978#(<= ~counter~0 2)} ~cond := #in~cond; {127978#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:11,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {127978#(<= ~counter~0 2)} assume !(0 == ~cond); {127978#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:11,612 INFO L290 TraceCheckUtils]: 30: Hoare triple {127978#(<= ~counter~0 2)} assume true; {127978#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:11,613 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {127978#(<= ~counter~0 2)} {127978#(<= ~counter~0 2)} #96#return; {127978#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:11,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {127978#(<= ~counter~0 2)} assume !(~r~0 > 0); {127978#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:11,614 INFO L290 TraceCheckUtils]: 33: Hoare triple {127978#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128003#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:11,614 INFO L290 TraceCheckUtils]: 34: Hoare triple {128003#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {128003#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:11,615 INFO L272 TraceCheckUtils]: 35: Hoare triple {128003#(<= ~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)); {128003#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:11,615 INFO L290 TraceCheckUtils]: 36: Hoare triple {128003#(<= ~counter~0 3)} ~cond := #in~cond; {128003#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:11,615 INFO L290 TraceCheckUtils]: 37: Hoare triple {128003#(<= ~counter~0 3)} assume !(0 == ~cond); {128003#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:11,616 INFO L290 TraceCheckUtils]: 38: Hoare triple {128003#(<= ~counter~0 3)} assume true; {128003#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:11,616 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {128003#(<= ~counter~0 3)} {128003#(<= ~counter~0 3)} #98#return; {128003#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:11,616 INFO L290 TraceCheckUtils]: 40: Hoare triple {128003#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128003#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:11,617 INFO L290 TraceCheckUtils]: 41: Hoare triple {128003#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128028#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:11,618 INFO L290 TraceCheckUtils]: 42: Hoare triple {128028#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {128028#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:11,618 INFO L272 TraceCheckUtils]: 43: Hoare triple {128028#(<= ~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)); {128028#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:11,618 INFO L290 TraceCheckUtils]: 44: Hoare triple {128028#(<= ~counter~0 4)} ~cond := #in~cond; {128028#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:11,619 INFO L290 TraceCheckUtils]: 45: Hoare triple {128028#(<= ~counter~0 4)} assume !(0 == ~cond); {128028#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:11,619 INFO L290 TraceCheckUtils]: 46: Hoare triple {128028#(<= ~counter~0 4)} assume true; {128028#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:11,619 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {128028#(<= ~counter~0 4)} {128028#(<= ~counter~0 4)} #98#return; {128028#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:11,620 INFO L290 TraceCheckUtils]: 48: Hoare triple {128028#(<= ~counter~0 4)} assume !(~r~0 < 0); {128028#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:11,621 INFO L290 TraceCheckUtils]: 49: Hoare triple {128028#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128053#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:11,621 INFO L290 TraceCheckUtils]: 50: Hoare triple {128053#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {128053#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:11,621 INFO L272 TraceCheckUtils]: 51: Hoare triple {128053#(<= ~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)); {128053#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:11,622 INFO L290 TraceCheckUtils]: 52: Hoare triple {128053#(<= ~counter~0 5)} ~cond := #in~cond; {128053#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:11,622 INFO L290 TraceCheckUtils]: 53: Hoare triple {128053#(<= ~counter~0 5)} assume !(0 == ~cond); {128053#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:11,622 INFO L290 TraceCheckUtils]: 54: Hoare triple {128053#(<= ~counter~0 5)} assume true; {128053#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:11,623 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {128053#(<= ~counter~0 5)} {128053#(<= ~counter~0 5)} #94#return; {128053#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:11,623 INFO L290 TraceCheckUtils]: 56: Hoare triple {128053#(<= ~counter~0 5)} assume !!(0 != ~r~0); {128053#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:11,624 INFO L290 TraceCheckUtils]: 57: Hoare triple {128053#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128078#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:11,624 INFO L290 TraceCheckUtils]: 58: Hoare triple {128078#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {128078#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:11,625 INFO L272 TraceCheckUtils]: 59: Hoare triple {128078#(<= ~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)); {128078#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:11,625 INFO L290 TraceCheckUtils]: 60: Hoare triple {128078#(<= ~counter~0 6)} ~cond := #in~cond; {128078#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:11,625 INFO L290 TraceCheckUtils]: 61: Hoare triple {128078#(<= ~counter~0 6)} assume !(0 == ~cond); {128078#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:11,626 INFO L290 TraceCheckUtils]: 62: Hoare triple {128078#(<= ~counter~0 6)} assume true; {128078#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:11,626 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {128078#(<= ~counter~0 6)} {128078#(<= ~counter~0 6)} #96#return; {128078#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:11,626 INFO L290 TraceCheckUtils]: 64: Hoare triple {128078#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128078#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:11,627 INFO L290 TraceCheckUtils]: 65: Hoare triple {128078#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128103#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:11,628 INFO L290 TraceCheckUtils]: 66: Hoare triple {128103#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {128103#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:11,628 INFO L272 TraceCheckUtils]: 67: Hoare triple {128103#(<= ~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)); {128103#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:11,629 INFO L290 TraceCheckUtils]: 68: Hoare triple {128103#(<= ~counter~0 7)} ~cond := #in~cond; {128103#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:11,629 INFO L290 TraceCheckUtils]: 69: Hoare triple {128103#(<= ~counter~0 7)} assume !(0 == ~cond); {128103#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:11,629 INFO L290 TraceCheckUtils]: 70: Hoare triple {128103#(<= ~counter~0 7)} assume true; {128103#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:11,630 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {128103#(<= ~counter~0 7)} {128103#(<= ~counter~0 7)} #96#return; {128103#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:11,630 INFO L290 TraceCheckUtils]: 72: Hoare triple {128103#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128103#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:11,631 INFO L290 TraceCheckUtils]: 73: Hoare triple {128103#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128128#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:11,631 INFO L290 TraceCheckUtils]: 74: Hoare triple {128128#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {128128#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:11,632 INFO L272 TraceCheckUtils]: 75: Hoare triple {128128#(<= ~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)); {128128#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:11,632 INFO L290 TraceCheckUtils]: 76: Hoare triple {128128#(<= ~counter~0 8)} ~cond := #in~cond; {128128#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:11,632 INFO L290 TraceCheckUtils]: 77: Hoare triple {128128#(<= ~counter~0 8)} assume !(0 == ~cond); {128128#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:11,632 INFO L290 TraceCheckUtils]: 78: Hoare triple {128128#(<= ~counter~0 8)} assume true; {128128#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:11,633 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {128128#(<= ~counter~0 8)} {128128#(<= ~counter~0 8)} #96#return; {128128#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:11,633 INFO L290 TraceCheckUtils]: 80: Hoare triple {128128#(<= ~counter~0 8)} assume !(~r~0 > 0); {128128#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:11,634 INFO L290 TraceCheckUtils]: 81: Hoare triple {128128#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128153#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:11,635 INFO L290 TraceCheckUtils]: 82: Hoare triple {128153#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {128153#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:11,635 INFO L272 TraceCheckUtils]: 83: Hoare triple {128153#(<= ~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)); {128153#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:11,635 INFO L290 TraceCheckUtils]: 84: Hoare triple {128153#(<= ~counter~0 9)} ~cond := #in~cond; {128153#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:11,636 INFO L290 TraceCheckUtils]: 85: Hoare triple {128153#(<= ~counter~0 9)} assume !(0 == ~cond); {128153#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:11,636 INFO L290 TraceCheckUtils]: 86: Hoare triple {128153#(<= ~counter~0 9)} assume true; {128153#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:11,636 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {128153#(<= ~counter~0 9)} {128153#(<= ~counter~0 9)} #98#return; {128153#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:11,637 INFO L290 TraceCheckUtils]: 88: Hoare triple {128153#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128153#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:11,638 INFO L290 TraceCheckUtils]: 89: Hoare triple {128153#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128178#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:11,638 INFO L290 TraceCheckUtils]: 90: Hoare triple {128178#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {128178#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:11,638 INFO L272 TraceCheckUtils]: 91: Hoare triple {128178#(<= ~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)); {128178#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:11,639 INFO L290 TraceCheckUtils]: 92: Hoare triple {128178#(<= ~counter~0 10)} ~cond := #in~cond; {128178#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:11,639 INFO L290 TraceCheckUtils]: 93: Hoare triple {128178#(<= ~counter~0 10)} assume !(0 == ~cond); {128178#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:11,639 INFO L290 TraceCheckUtils]: 94: Hoare triple {128178#(<= ~counter~0 10)} assume true; {128178#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:11,640 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {128178#(<= ~counter~0 10)} {128178#(<= ~counter~0 10)} #98#return; {128178#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:11,640 INFO L290 TraceCheckUtils]: 96: Hoare triple {128178#(<= ~counter~0 10)} assume !(~r~0 < 0); {128178#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:11,641 INFO L290 TraceCheckUtils]: 97: Hoare triple {128178#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128203#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:11,641 INFO L290 TraceCheckUtils]: 98: Hoare triple {128203#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {128203#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:11,642 INFO L272 TraceCheckUtils]: 99: Hoare triple {128203#(<= ~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)); {128203#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:11,642 INFO L290 TraceCheckUtils]: 100: Hoare triple {128203#(<= ~counter~0 11)} ~cond := #in~cond; {128203#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:11,642 INFO L290 TraceCheckUtils]: 101: Hoare triple {128203#(<= ~counter~0 11)} assume !(0 == ~cond); {128203#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:11,643 INFO L290 TraceCheckUtils]: 102: Hoare triple {128203#(<= ~counter~0 11)} assume true; {128203#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:11,643 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {128203#(<= ~counter~0 11)} {128203#(<= ~counter~0 11)} #94#return; {128203#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:11,643 INFO L290 TraceCheckUtils]: 104: Hoare triple {128203#(<= ~counter~0 11)} assume !!(0 != ~r~0); {128203#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:11,644 INFO L290 TraceCheckUtils]: 105: Hoare triple {128203#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128228#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:11,645 INFO L290 TraceCheckUtils]: 106: Hoare triple {128228#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {128228#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:11,645 INFO L272 TraceCheckUtils]: 107: Hoare triple {128228#(<= ~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)); {128228#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:11,645 INFO L290 TraceCheckUtils]: 108: Hoare triple {128228#(<= ~counter~0 12)} ~cond := #in~cond; {128228#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:11,646 INFO L290 TraceCheckUtils]: 109: Hoare triple {128228#(<= ~counter~0 12)} assume !(0 == ~cond); {128228#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:11,646 INFO L290 TraceCheckUtils]: 110: Hoare triple {128228#(<= ~counter~0 12)} assume true; {128228#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:11,647 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {128228#(<= ~counter~0 12)} {128228#(<= ~counter~0 12)} #96#return; {128228#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:11,647 INFO L290 TraceCheckUtils]: 112: Hoare triple {128228#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128228#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:11,648 INFO L290 TraceCheckUtils]: 113: Hoare triple {128228#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128253#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:11,648 INFO L290 TraceCheckUtils]: 114: Hoare triple {128253#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {128253#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:11,649 INFO L272 TraceCheckUtils]: 115: Hoare triple {128253#(<= ~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)); {128253#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:11,649 INFO L290 TraceCheckUtils]: 116: Hoare triple {128253#(<= ~counter~0 13)} ~cond := #in~cond; {128253#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:11,649 INFO L290 TraceCheckUtils]: 117: Hoare triple {128253#(<= ~counter~0 13)} assume !(0 == ~cond); {128253#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:11,649 INFO L290 TraceCheckUtils]: 118: Hoare triple {128253#(<= ~counter~0 13)} assume true; {128253#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:11,650 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {128253#(<= ~counter~0 13)} {128253#(<= ~counter~0 13)} #96#return; {128253#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:11,650 INFO L290 TraceCheckUtils]: 120: Hoare triple {128253#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128253#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:11,651 INFO L290 TraceCheckUtils]: 121: Hoare triple {128253#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128278#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:11,651 INFO L290 TraceCheckUtils]: 122: Hoare triple {128278#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {128278#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:11,652 INFO L272 TraceCheckUtils]: 123: Hoare triple {128278#(<= ~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)); {128278#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:11,652 INFO L290 TraceCheckUtils]: 124: Hoare triple {128278#(<= ~counter~0 14)} ~cond := #in~cond; {128278#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:11,653 INFO L290 TraceCheckUtils]: 125: Hoare triple {128278#(<= ~counter~0 14)} assume !(0 == ~cond); {128278#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:11,653 INFO L290 TraceCheckUtils]: 126: Hoare triple {128278#(<= ~counter~0 14)} assume true; {128278#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:11,653 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {128278#(<= ~counter~0 14)} {128278#(<= ~counter~0 14)} #96#return; {128278#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:11,654 INFO L290 TraceCheckUtils]: 128: Hoare triple {128278#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128278#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:11,654 INFO L290 TraceCheckUtils]: 129: Hoare triple {128278#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128303#(<= |main_#t~post7| 14)} is VALID [2022-04-15 15:18:11,654 INFO L290 TraceCheckUtils]: 130: Hoare triple {128303#(<= |main_#t~post7| 14)} assume !(#t~post7 < 100);havoc #t~post7; {127897#false} is VALID [2022-04-15 15:18:11,654 INFO L290 TraceCheckUtils]: 131: Hoare triple {127897#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127897#false} is VALID [2022-04-15 15:18:11,654 INFO L290 TraceCheckUtils]: 132: Hoare triple {127897#false} assume !(#t~post8 < 100);havoc #t~post8; {127897#false} is VALID [2022-04-15 15:18:11,654 INFO L290 TraceCheckUtils]: 133: Hoare triple {127897#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127897#false} is VALID [2022-04-15 15:18:11,655 INFO L290 TraceCheckUtils]: 134: Hoare triple {127897#false} assume !(#t~post6 < 100);havoc #t~post6; {127897#false} is VALID [2022-04-15 15:18:11,655 INFO L272 TraceCheckUtils]: 135: Hoare triple {127897#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)); {127897#false} is VALID [2022-04-15 15:18:11,655 INFO L290 TraceCheckUtils]: 136: Hoare triple {127897#false} ~cond := #in~cond; {127897#false} is VALID [2022-04-15 15:18:11,655 INFO L290 TraceCheckUtils]: 137: Hoare triple {127897#false} assume 0 == ~cond; {127897#false} is VALID [2022-04-15 15:18:11,655 INFO L290 TraceCheckUtils]: 138: Hoare triple {127897#false} assume !false; {127897#false} is VALID [2022-04-15 15:18:11,655 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 498 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:18:11,655 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:18:12,494 INFO L290 TraceCheckUtils]: 138: Hoare triple {127897#false} assume !false; {127897#false} is VALID [2022-04-15 15:18:12,494 INFO L290 TraceCheckUtils]: 137: Hoare triple {127897#false} assume 0 == ~cond; {127897#false} is VALID [2022-04-15 15:18:12,494 INFO L290 TraceCheckUtils]: 136: Hoare triple {127897#false} ~cond := #in~cond; {127897#false} is VALID [2022-04-15 15:18:12,494 INFO L272 TraceCheckUtils]: 135: Hoare triple {127897#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)); {127897#false} is VALID [2022-04-15 15:18:12,494 INFO L290 TraceCheckUtils]: 134: Hoare triple {127897#false} assume !(#t~post6 < 100);havoc #t~post6; {127897#false} is VALID [2022-04-15 15:18:12,494 INFO L290 TraceCheckUtils]: 133: Hoare triple {127897#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {127897#false} is VALID [2022-04-15 15:18:12,494 INFO L290 TraceCheckUtils]: 132: Hoare triple {127897#false} assume !(#t~post8 < 100);havoc #t~post8; {127897#false} is VALID [2022-04-15 15:18:12,494 INFO L290 TraceCheckUtils]: 131: Hoare triple {127897#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {127897#false} is VALID [2022-04-15 15:18:12,495 INFO L290 TraceCheckUtils]: 130: Hoare triple {128355#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {127897#false} is VALID [2022-04-15 15:18:12,495 INFO L290 TraceCheckUtils]: 129: Hoare triple {128359#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128355#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:18:12,495 INFO L290 TraceCheckUtils]: 128: Hoare triple {128359#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128359#(< ~counter~0 100)} is VALID [2022-04-15 15:18:12,496 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {127896#true} {128359#(< ~counter~0 100)} #96#return; {128359#(< ~counter~0 100)} is VALID [2022-04-15 15:18:12,496 INFO L290 TraceCheckUtils]: 126: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,496 INFO L290 TraceCheckUtils]: 125: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,496 INFO L290 TraceCheckUtils]: 124: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,496 INFO L272 TraceCheckUtils]: 123: Hoare triple {128359#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,496 INFO L290 TraceCheckUtils]: 122: Hoare triple {128359#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {128359#(< ~counter~0 100)} is VALID [2022-04-15 15:18:12,499 INFO L290 TraceCheckUtils]: 121: Hoare triple {128384#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128359#(< ~counter~0 100)} is VALID [2022-04-15 15:18:12,499 INFO L290 TraceCheckUtils]: 120: Hoare triple {128384#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128384#(< ~counter~0 99)} is VALID [2022-04-15 15:18:12,500 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {127896#true} {128384#(< ~counter~0 99)} #96#return; {128384#(< ~counter~0 99)} is VALID [2022-04-15 15:18:12,500 INFO L290 TraceCheckUtils]: 118: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,500 INFO L290 TraceCheckUtils]: 117: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,500 INFO L290 TraceCheckUtils]: 116: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,500 INFO L272 TraceCheckUtils]: 115: Hoare triple {128384#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,500 INFO L290 TraceCheckUtils]: 114: Hoare triple {128384#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {128384#(< ~counter~0 99)} is VALID [2022-04-15 15:18:12,501 INFO L290 TraceCheckUtils]: 113: Hoare triple {128409#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128384#(< ~counter~0 99)} is VALID [2022-04-15 15:18:12,502 INFO L290 TraceCheckUtils]: 112: Hoare triple {128409#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128409#(< ~counter~0 98)} is VALID [2022-04-15 15:18:12,502 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {127896#true} {128409#(< ~counter~0 98)} #96#return; {128409#(< ~counter~0 98)} is VALID [2022-04-15 15:18:12,502 INFO L290 TraceCheckUtils]: 110: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,502 INFO L290 TraceCheckUtils]: 109: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,502 INFO L290 TraceCheckUtils]: 108: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,502 INFO L272 TraceCheckUtils]: 107: Hoare triple {128409#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,503 INFO L290 TraceCheckUtils]: 106: Hoare triple {128409#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {128409#(< ~counter~0 98)} is VALID [2022-04-15 15:18:12,504 INFO L290 TraceCheckUtils]: 105: Hoare triple {128434#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128409#(< ~counter~0 98)} is VALID [2022-04-15 15:18:12,504 INFO L290 TraceCheckUtils]: 104: Hoare triple {128434#(< ~counter~0 97)} assume !!(0 != ~r~0); {128434#(< ~counter~0 97)} is VALID [2022-04-15 15:18:12,504 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {127896#true} {128434#(< ~counter~0 97)} #94#return; {128434#(< ~counter~0 97)} is VALID [2022-04-15 15:18:12,505 INFO L290 TraceCheckUtils]: 102: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,505 INFO L290 TraceCheckUtils]: 101: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,505 INFO L290 TraceCheckUtils]: 100: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,505 INFO L272 TraceCheckUtils]: 99: Hoare triple {128434#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,505 INFO L290 TraceCheckUtils]: 98: Hoare triple {128434#(< ~counter~0 97)} assume !!(#t~post6 < 100);havoc #t~post6; {128434#(< ~counter~0 97)} is VALID [2022-04-15 15:18:12,506 INFO L290 TraceCheckUtils]: 97: Hoare triple {128459#(< ~counter~0 96)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128434#(< ~counter~0 97)} is VALID [2022-04-15 15:18:12,506 INFO L290 TraceCheckUtils]: 96: Hoare triple {128459#(< ~counter~0 96)} assume !(~r~0 < 0); {128459#(< ~counter~0 96)} is VALID [2022-04-15 15:18:12,507 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {127896#true} {128459#(< ~counter~0 96)} #98#return; {128459#(< ~counter~0 96)} is VALID [2022-04-15 15:18:12,507 INFO L290 TraceCheckUtils]: 94: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,507 INFO L290 TraceCheckUtils]: 93: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,507 INFO L290 TraceCheckUtils]: 92: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,507 INFO L272 TraceCheckUtils]: 91: Hoare triple {128459#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,507 INFO L290 TraceCheckUtils]: 90: Hoare triple {128459#(< ~counter~0 96)} assume !!(#t~post8 < 100);havoc #t~post8; {128459#(< ~counter~0 96)} is VALID [2022-04-15 15:18:12,508 INFO L290 TraceCheckUtils]: 89: Hoare triple {128484#(< ~counter~0 95)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128459#(< ~counter~0 96)} is VALID [2022-04-15 15:18:12,509 INFO L290 TraceCheckUtils]: 88: Hoare triple {128484#(< ~counter~0 95)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128484#(< ~counter~0 95)} is VALID [2022-04-15 15:18:12,509 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {127896#true} {128484#(< ~counter~0 95)} #98#return; {128484#(< ~counter~0 95)} is VALID [2022-04-15 15:18:12,509 INFO L290 TraceCheckUtils]: 86: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,509 INFO L290 TraceCheckUtils]: 85: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,509 INFO L290 TraceCheckUtils]: 84: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,510 INFO L272 TraceCheckUtils]: 83: Hoare triple {128484#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,510 INFO L290 TraceCheckUtils]: 82: Hoare triple {128484#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {128484#(< ~counter~0 95)} is VALID [2022-04-15 15:18:12,511 INFO L290 TraceCheckUtils]: 81: Hoare triple {128509#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128484#(< ~counter~0 95)} is VALID [2022-04-15 15:18:12,511 INFO L290 TraceCheckUtils]: 80: Hoare triple {128509#(< ~counter~0 94)} assume !(~r~0 > 0); {128509#(< ~counter~0 94)} is VALID [2022-04-15 15:18:12,512 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {127896#true} {128509#(< ~counter~0 94)} #96#return; {128509#(< ~counter~0 94)} is VALID [2022-04-15 15:18:12,512 INFO L290 TraceCheckUtils]: 78: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,512 INFO L290 TraceCheckUtils]: 77: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,512 INFO L290 TraceCheckUtils]: 76: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,512 INFO L272 TraceCheckUtils]: 75: Hoare triple {128509#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,512 INFO L290 TraceCheckUtils]: 74: Hoare triple {128509#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {128509#(< ~counter~0 94)} is VALID [2022-04-15 15:18:12,513 INFO L290 TraceCheckUtils]: 73: Hoare triple {128534#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128509#(< ~counter~0 94)} is VALID [2022-04-15 15:18:12,514 INFO L290 TraceCheckUtils]: 72: Hoare triple {128534#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128534#(< ~counter~0 93)} is VALID [2022-04-15 15:18:12,514 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {127896#true} {128534#(< ~counter~0 93)} #96#return; {128534#(< ~counter~0 93)} is VALID [2022-04-15 15:18:12,514 INFO L290 TraceCheckUtils]: 70: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,514 INFO L290 TraceCheckUtils]: 69: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,514 INFO L290 TraceCheckUtils]: 68: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,515 INFO L272 TraceCheckUtils]: 67: Hoare triple {128534#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,515 INFO L290 TraceCheckUtils]: 66: Hoare triple {128534#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {128534#(< ~counter~0 93)} is VALID [2022-04-15 15:18:12,516 INFO L290 TraceCheckUtils]: 65: Hoare triple {128559#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128534#(< ~counter~0 93)} is VALID [2022-04-15 15:18:12,516 INFO L290 TraceCheckUtils]: 64: Hoare triple {128559#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {128559#(< ~counter~0 92)} is VALID [2022-04-15 15:18:12,517 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {127896#true} {128559#(< ~counter~0 92)} #96#return; {128559#(< ~counter~0 92)} is VALID [2022-04-15 15:18:12,517 INFO L290 TraceCheckUtils]: 62: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,517 INFO L290 TraceCheckUtils]: 61: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,517 INFO L290 TraceCheckUtils]: 60: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,517 INFO L272 TraceCheckUtils]: 59: Hoare triple {128559#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,517 INFO L290 TraceCheckUtils]: 58: Hoare triple {128559#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {128559#(< ~counter~0 92)} is VALID [2022-04-15 15:18:12,518 INFO L290 TraceCheckUtils]: 57: Hoare triple {128584#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128559#(< ~counter~0 92)} is VALID [2022-04-15 15:18:12,518 INFO L290 TraceCheckUtils]: 56: Hoare triple {128584#(< ~counter~0 91)} assume !!(0 != ~r~0); {128584#(< ~counter~0 91)} is VALID [2022-04-15 15:18:12,519 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {127896#true} {128584#(< ~counter~0 91)} #94#return; {128584#(< ~counter~0 91)} is VALID [2022-04-15 15:18:12,519 INFO L290 TraceCheckUtils]: 54: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,519 INFO L290 TraceCheckUtils]: 53: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,519 INFO L290 TraceCheckUtils]: 52: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,519 INFO L272 TraceCheckUtils]: 51: Hoare triple {128584#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,520 INFO L290 TraceCheckUtils]: 50: Hoare triple {128584#(< ~counter~0 91)} assume !!(#t~post6 < 100);havoc #t~post6; {128584#(< ~counter~0 91)} is VALID [2022-04-15 15:18:12,521 INFO L290 TraceCheckUtils]: 49: Hoare triple {128609#(< ~counter~0 90)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128584#(< ~counter~0 91)} is VALID [2022-04-15 15:18:12,521 INFO L290 TraceCheckUtils]: 48: Hoare triple {128609#(< ~counter~0 90)} assume !(~r~0 < 0); {128609#(< ~counter~0 90)} is VALID [2022-04-15 15:18:12,521 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {127896#true} {128609#(< ~counter~0 90)} #98#return; {128609#(< ~counter~0 90)} is VALID [2022-04-15 15:18:12,521 INFO L290 TraceCheckUtils]: 46: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,522 INFO L290 TraceCheckUtils]: 45: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,522 INFO L290 TraceCheckUtils]: 44: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,522 INFO L272 TraceCheckUtils]: 43: Hoare triple {128609#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,522 INFO L290 TraceCheckUtils]: 42: Hoare triple {128609#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {128609#(< ~counter~0 90)} is VALID [2022-04-15 15:18:12,523 INFO L290 TraceCheckUtils]: 41: Hoare triple {128634#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128609#(< ~counter~0 90)} is VALID [2022-04-15 15:18:12,523 INFO L290 TraceCheckUtils]: 40: Hoare triple {128634#(< ~counter~0 89)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {128634#(< ~counter~0 89)} is VALID [2022-04-15 15:18:12,524 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {127896#true} {128634#(< ~counter~0 89)} #98#return; {128634#(< ~counter~0 89)} is VALID [2022-04-15 15:18:12,524 INFO L290 TraceCheckUtils]: 38: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,524 INFO L290 TraceCheckUtils]: 37: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,524 INFO L290 TraceCheckUtils]: 36: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,524 INFO L272 TraceCheckUtils]: 35: Hoare triple {128634#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,524 INFO L290 TraceCheckUtils]: 34: Hoare triple {128634#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {128634#(< ~counter~0 89)} is VALID [2022-04-15 15:18:12,525 INFO L290 TraceCheckUtils]: 33: Hoare triple {128659#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {128634#(< ~counter~0 89)} is VALID [2022-04-15 15:18:12,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {128659#(< ~counter~0 88)} assume !(~r~0 > 0); {128659#(< ~counter~0 88)} is VALID [2022-04-15 15:18:12,526 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {127896#true} {128659#(< ~counter~0 88)} #96#return; {128659#(< ~counter~0 88)} is VALID [2022-04-15 15:18:12,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,526 INFO L290 TraceCheckUtils]: 29: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,526 INFO L290 TraceCheckUtils]: 28: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,526 INFO L272 TraceCheckUtils]: 27: Hoare triple {128659#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,527 INFO L290 TraceCheckUtils]: 26: Hoare triple {128659#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {128659#(< ~counter~0 88)} is VALID [2022-04-15 15:18:12,528 INFO L290 TraceCheckUtils]: 25: Hoare triple {128684#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {128659#(< ~counter~0 88)} is VALID [2022-04-15 15:18:12,528 INFO L290 TraceCheckUtils]: 24: Hoare triple {128684#(< ~counter~0 87)} assume !!(0 != ~r~0); {128684#(< ~counter~0 87)} is VALID [2022-04-15 15:18:12,528 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {127896#true} {128684#(< ~counter~0 87)} #94#return; {128684#(< ~counter~0 87)} is VALID [2022-04-15 15:18:12,529 INFO L290 TraceCheckUtils]: 22: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,529 INFO L290 TraceCheckUtils]: 21: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,529 INFO L290 TraceCheckUtils]: 20: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,529 INFO L272 TraceCheckUtils]: 19: Hoare triple {128684#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {128684#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {128684#(< ~counter~0 87)} is VALID [2022-04-15 15:18:12,530 INFO L290 TraceCheckUtils]: 17: Hoare triple {128709#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {128684#(< ~counter~0 87)} is VALID [2022-04-15 15:18:12,530 INFO L290 TraceCheckUtils]: 16: Hoare triple {128709#(< ~counter~0 86)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {128709#(< ~counter~0 86)} is VALID [2022-04-15 15:18:12,531 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {127896#true} {128709#(< ~counter~0 86)} #92#return; {128709#(< ~counter~0 86)} is VALID [2022-04-15 15:18:12,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,531 INFO L290 TraceCheckUtils]: 13: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,531 INFO L272 TraceCheckUtils]: 11: Hoare triple {128709#(< ~counter~0 86)} 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)); {127896#true} is VALID [2022-04-15 15:18:12,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {127896#true} {128709#(< ~counter~0 86)} #90#return; {128709#(< ~counter~0 86)} is VALID [2022-04-15 15:18:12,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {127896#true} assume true; {127896#true} is VALID [2022-04-15 15:18:12,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {127896#true} assume !(0 == ~cond); {127896#true} is VALID [2022-04-15 15:18:12,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {127896#true} ~cond := #in~cond; {127896#true} is VALID [2022-04-15 15:18:12,532 INFO L272 TraceCheckUtils]: 6: Hoare triple {128709#(< ~counter~0 86)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {127896#true} is VALID [2022-04-15 15:18:12,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {128709#(< ~counter~0 86)} 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; {128709#(< ~counter~0 86)} is VALID [2022-04-15 15:18:12,532 INFO L272 TraceCheckUtils]: 4: Hoare triple {128709#(< ~counter~0 86)} call #t~ret9 := main(); {128709#(< ~counter~0 86)} is VALID [2022-04-15 15:18:12,533 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {128709#(< ~counter~0 86)} {127896#true} #102#return; {128709#(< ~counter~0 86)} is VALID [2022-04-15 15:18:12,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {128709#(< ~counter~0 86)} assume true; {128709#(< ~counter~0 86)} is VALID [2022-04-15 15:18:12,533 INFO L290 TraceCheckUtils]: 1: Hoare triple {127896#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; {128709#(< ~counter~0 86)} is VALID [2022-04-15 15:18:12,533 INFO L272 TraceCheckUtils]: 0: Hoare triple {127896#true} call ULTIMATE.init(); {127896#true} is VALID [2022-04-15 15:18:12,534 INFO L134 CoverageAnalysis]: Checked inductivity of 544 backedges. 42 proven. 134 refuted. 0 times theorem prover too weak. 368 trivial. 0 not checked. [2022-04-15 15:18:12,534 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:18:12,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1267705999] [2022-04-15 15:18:12,534 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:18:12,534 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1663916405] [2022-04-15 15:18:12,534 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1663916405] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:18:12,534 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:18:12,534 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18] total 34 [2022-04-15 15:18:12,535 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:18:12,535 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1989768489] [2022-04-15 15:18:12,535 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1989768489] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:18:12,535 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:18:12,535 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-04-15 15:18:12,535 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [184016924] [2022-04-15 15:18:12,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:18:12,535 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 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 139 [2022-04-15 15:18:12,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:18:12,535 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 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-15 15:18:12,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:12,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-04-15 15:18:12,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:12,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-04-15 15:18:12,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=501, Invalid=621, Unknown=0, NotChecked=0, Total=1122 [2022-04-15 15:18:12,672 INFO L87 Difference]: Start difference. First operand 779 states and 1050 transitions. Second operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 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-15 15:18:16,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:16,837 INFO L93 Difference]: Finished difference Result 949 states and 1305 transitions. [2022-04-15 15:18:16,837 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2022-04-15 15:18:16,837 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 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 139 [2022-04-15 15:18:16,837 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:18:16,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 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-15 15:18:16,840 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-15 15:18:16,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 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-15 15:18:16,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 316 transitions. [2022-04-15 15:18:16,849 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 31 states and 316 transitions. [2022-04-15 15:18:17,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:17,223 INFO L225 Difference]: With dead ends: 949 [2022-04-15 15:18:17,223 INFO L226 Difference]: Without dead ends: 779 [2022-04-15 15:18:17,224 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 290 GetRequests, 245 SyntacticMatches, 0 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 121 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=917, Invalid=1245, Unknown=0, NotChecked=0, Total=2162 [2022-04-15 15:18:17,225 INFO L913 BasicCegarLoop]: 72 mSDtfsCounter, 196 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 193 mSolverCounterSat, 172 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 365 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 172 IncrementalHoareTripleChecker+Valid, 193 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-04-15 15:18:17,225 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 326 Invalid, 365 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [172 Valid, 193 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-04-15 15:18:17,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 779 states. [2022-04-15 15:18:20,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 779 to 779. [2022-04-15 15:18:20,033 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:18:20,034 INFO L82 GeneralOperation]: Start isEquivalent. First operand 779 states. Second operand has 779 states, 582 states have (on average 1.1924398625429553) internal successors, (694), 599 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:20,034 INFO L74 IsIncluded]: Start isIncluded. First operand 779 states. Second operand has 779 states, 582 states have (on average 1.1924398625429553) internal successors, (694), 599 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:20,035 INFO L87 Difference]: Start difference. First operand 779 states. Second operand has 779 states, 582 states have (on average 1.1924398625429553) internal successors, (694), 599 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:20,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:20,055 INFO L93 Difference]: Finished difference Result 779 states and 1044 transitions. [2022-04-15 15:18:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1044 transitions. [2022-04-15 15:18:20,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:20,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:20,056 INFO L74 IsIncluded]: Start isIncluded. First operand has 779 states, 582 states have (on average 1.1924398625429553) internal successors, (694), 599 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 779 states. [2022-04-15 15:18:20,057 INFO L87 Difference]: Start difference. First operand has 779 states, 582 states have (on average 1.1924398625429553) internal successors, (694), 599 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) Second operand 779 states. [2022-04-15 15:18:20,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:20,077 INFO L93 Difference]: Finished difference Result 779 states and 1044 transitions. [2022-04-15 15:18:20,077 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1044 transitions. [2022-04-15 15:18:20,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:20,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:20,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:18:20,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:18:20,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 779 states, 582 states have (on average 1.1924398625429553) internal successors, (694), 599 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 157 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:20,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 779 states to 779 states and 1044 transitions. [2022-04-15 15:18:20,106 INFO L78 Accepts]: Start accepts. Automaton has 779 states and 1044 transitions. Word has length 139 [2022-04-15 15:18:20,106 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:18:20,106 INFO L478 AbstractCegarLoop]: Abstraction has 779 states and 1044 transitions. [2022-04-15 15:18:20,106 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.555555555555555) internal successors, (100), 17 states have internal predecessors, (100), 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-15 15:18:20,106 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 779 states and 1044 transitions. [2022-04-15 15:18:29,708 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1044 edges. 1041 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:29,708 INFO L276 IsEmpty]: Start isEmpty. Operand 779 states and 1044 transitions. [2022-04-15 15:18:29,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 146 [2022-04-15 15:18:29,709 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:18:29,710 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 7, 7, 7, 7, 6, 5, 5, 5, 4, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:18:29,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (50)] Forceful destruction successful, exit code 0 [2022-04-15 15:18:29,910 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 50 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable48 [2022-04-15 15:18:29,910 INFO L403 AbstractCegarLoop]: === Iteration 50 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:18:29,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:18:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 25 times [2022-04-15 15:18:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:29,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1512780098] [2022-04-15 15:18:29,911 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:18:29,911 INFO L85 PathProgramCache]: Analyzing trace with hash 1908608861, now seen corresponding path program 26 times [2022-04-15 15:18:29,911 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:18:29,911 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [602402121] [2022-04-15 15:18:29,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:18:29,912 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:18:29,925 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:18:29,925 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [3873840] [2022-04-15 15:18:29,925 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:18:29,925 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:18:29,925 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:18:29,926 INFO L229 MonitoredProcess]: Starting monitored process 51 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:18:29,928 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Waiting until timeout for monitored process [2022-04-15 15:18:30,001 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:18:30,001 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:18:30,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 15:18:30,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:18:30,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:18:30,827 INFO L272 TraceCheckUtils]: 0: Hoare triple {133803#true} call ULTIMATE.init(); {133803#true} is VALID [2022-04-15 15:18:30,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {133803#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; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {133811#(<= ~counter~0 0)} assume true; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,829 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {133811#(<= ~counter~0 0)} {133803#true} #102#return; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,829 INFO L272 TraceCheckUtils]: 4: Hoare triple {133811#(<= ~counter~0 0)} call #t~ret9 := main(); {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {133811#(<= ~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; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,830 INFO L272 TraceCheckUtils]: 6: Hoare triple {133811#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {133811#(<= ~counter~0 0)} ~cond := #in~cond; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {133811#(<= ~counter~0 0)} assume !(0 == ~cond); {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {133811#(<= ~counter~0 0)} assume true; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,831 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {133811#(<= ~counter~0 0)} {133811#(<= ~counter~0 0)} #90#return; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,831 INFO L272 TraceCheckUtils]: 11: Hoare triple {133811#(<= ~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)); {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {133811#(<= ~counter~0 0)} ~cond := #in~cond; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {133811#(<= ~counter~0 0)} assume !(0 == ~cond); {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {133811#(<= ~counter~0 0)} assume true; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,833 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {133811#(<= ~counter~0 0)} {133811#(<= ~counter~0 0)} #92#return; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {133811#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {133811#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:30,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {133811#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133860#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:30,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {133860#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {133860#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:30,836 INFO L272 TraceCheckUtils]: 19: Hoare triple {133860#(<= ~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)); {133860#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:30,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {133860#(<= ~counter~0 1)} ~cond := #in~cond; {133860#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:30,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {133860#(<= ~counter~0 1)} assume !(0 == ~cond); {133860#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:30,837 INFO L290 TraceCheckUtils]: 22: Hoare triple {133860#(<= ~counter~0 1)} assume true; {133860#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:30,837 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {133860#(<= ~counter~0 1)} {133860#(<= ~counter~0 1)} #94#return; {133860#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:30,838 INFO L290 TraceCheckUtils]: 24: Hoare triple {133860#(<= ~counter~0 1)} assume !!(0 != ~r~0); {133860#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:30,839 INFO L290 TraceCheckUtils]: 25: Hoare triple {133860#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133885#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:30,839 INFO L290 TraceCheckUtils]: 26: Hoare triple {133885#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {133885#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:30,840 INFO L272 TraceCheckUtils]: 27: Hoare triple {133885#(<= ~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)); {133885#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:30,840 INFO L290 TraceCheckUtils]: 28: Hoare triple {133885#(<= ~counter~0 2)} ~cond := #in~cond; {133885#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:30,840 INFO L290 TraceCheckUtils]: 29: Hoare triple {133885#(<= ~counter~0 2)} assume !(0 == ~cond); {133885#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:30,840 INFO L290 TraceCheckUtils]: 30: Hoare triple {133885#(<= ~counter~0 2)} assume true; {133885#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:30,841 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {133885#(<= ~counter~0 2)} {133885#(<= ~counter~0 2)} #96#return; {133885#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:30,841 INFO L290 TraceCheckUtils]: 32: Hoare triple {133885#(<= ~counter~0 2)} assume !(~r~0 > 0); {133885#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:30,842 INFO L290 TraceCheckUtils]: 33: Hoare triple {133885#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133910#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:30,843 INFO L290 TraceCheckUtils]: 34: Hoare triple {133910#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {133910#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:30,843 INFO L272 TraceCheckUtils]: 35: Hoare triple {133910#(<= ~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)); {133910#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:30,843 INFO L290 TraceCheckUtils]: 36: Hoare triple {133910#(<= ~counter~0 3)} ~cond := #in~cond; {133910#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:30,844 INFO L290 TraceCheckUtils]: 37: Hoare triple {133910#(<= ~counter~0 3)} assume !(0 == ~cond); {133910#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:30,844 INFO L290 TraceCheckUtils]: 38: Hoare triple {133910#(<= ~counter~0 3)} assume true; {133910#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:30,844 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {133910#(<= ~counter~0 3)} {133910#(<= ~counter~0 3)} #98#return; {133910#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:30,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {133910#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {133910#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:30,846 INFO L290 TraceCheckUtils]: 41: Hoare triple {133910#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {133935#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:30,846 INFO L290 TraceCheckUtils]: 42: Hoare triple {133935#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {133935#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:30,847 INFO L272 TraceCheckUtils]: 43: Hoare triple {133935#(<= ~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)); {133935#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:30,847 INFO L290 TraceCheckUtils]: 44: Hoare triple {133935#(<= ~counter~0 4)} ~cond := #in~cond; {133935#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:30,847 INFO L290 TraceCheckUtils]: 45: Hoare triple {133935#(<= ~counter~0 4)} assume !(0 == ~cond); {133935#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:30,847 INFO L290 TraceCheckUtils]: 46: Hoare triple {133935#(<= ~counter~0 4)} assume true; {133935#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:30,848 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {133935#(<= ~counter~0 4)} {133935#(<= ~counter~0 4)} #98#return; {133935#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:30,848 INFO L290 TraceCheckUtils]: 48: Hoare triple {133935#(<= ~counter~0 4)} assume !(~r~0 < 0); {133935#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:30,849 INFO L290 TraceCheckUtils]: 49: Hoare triple {133935#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133960#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:30,849 INFO L290 TraceCheckUtils]: 50: Hoare triple {133960#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {133960#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:30,850 INFO L272 TraceCheckUtils]: 51: Hoare triple {133960#(<= ~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)); {133960#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:30,850 INFO L290 TraceCheckUtils]: 52: Hoare triple {133960#(<= ~counter~0 5)} ~cond := #in~cond; {133960#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:30,851 INFO L290 TraceCheckUtils]: 53: Hoare triple {133960#(<= ~counter~0 5)} assume !(0 == ~cond); {133960#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:30,851 INFO L290 TraceCheckUtils]: 54: Hoare triple {133960#(<= ~counter~0 5)} assume true; {133960#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:30,851 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {133960#(<= ~counter~0 5)} {133960#(<= ~counter~0 5)} #94#return; {133960#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:30,852 INFO L290 TraceCheckUtils]: 56: Hoare triple {133960#(<= ~counter~0 5)} assume !!(0 != ~r~0); {133960#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:30,853 INFO L290 TraceCheckUtils]: 57: Hoare triple {133960#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {133985#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:30,853 INFO L290 TraceCheckUtils]: 58: Hoare triple {133985#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {133985#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:30,853 INFO L272 TraceCheckUtils]: 59: Hoare triple {133985#(<= ~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)); {133985#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:30,854 INFO L290 TraceCheckUtils]: 60: Hoare triple {133985#(<= ~counter~0 6)} ~cond := #in~cond; {133985#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:30,854 INFO L290 TraceCheckUtils]: 61: Hoare triple {133985#(<= ~counter~0 6)} assume !(0 == ~cond); {133985#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:30,854 INFO L290 TraceCheckUtils]: 62: Hoare triple {133985#(<= ~counter~0 6)} assume true; {133985#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:30,855 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {133985#(<= ~counter~0 6)} {133985#(<= ~counter~0 6)} #96#return; {133985#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:30,855 INFO L290 TraceCheckUtils]: 64: Hoare triple {133985#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {133985#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:30,856 INFO L290 TraceCheckUtils]: 65: Hoare triple {133985#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134010#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:30,856 INFO L290 TraceCheckUtils]: 66: Hoare triple {134010#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {134010#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:30,857 INFO L272 TraceCheckUtils]: 67: Hoare triple {134010#(<= ~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)); {134010#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:30,859 INFO L290 TraceCheckUtils]: 68: Hoare triple {134010#(<= ~counter~0 7)} ~cond := #in~cond; {134010#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:30,859 INFO L290 TraceCheckUtils]: 69: Hoare triple {134010#(<= ~counter~0 7)} assume !(0 == ~cond); {134010#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:30,860 INFO L290 TraceCheckUtils]: 70: Hoare triple {134010#(<= ~counter~0 7)} assume true; {134010#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:30,860 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {134010#(<= ~counter~0 7)} {134010#(<= ~counter~0 7)} #96#return; {134010#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:30,861 INFO L290 TraceCheckUtils]: 72: Hoare triple {134010#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {134010#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:30,862 INFO L290 TraceCheckUtils]: 73: Hoare triple {134010#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134035#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:30,863 INFO L290 TraceCheckUtils]: 74: Hoare triple {134035#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {134035#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:30,863 INFO L272 TraceCheckUtils]: 75: Hoare triple {134035#(<= ~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)); {134035#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:30,864 INFO L290 TraceCheckUtils]: 76: Hoare triple {134035#(<= ~counter~0 8)} ~cond := #in~cond; {134035#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:30,864 INFO L290 TraceCheckUtils]: 77: Hoare triple {134035#(<= ~counter~0 8)} assume !(0 == ~cond); {134035#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:30,864 INFO L290 TraceCheckUtils]: 78: Hoare triple {134035#(<= ~counter~0 8)} assume true; {134035#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:30,865 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {134035#(<= ~counter~0 8)} {134035#(<= ~counter~0 8)} #96#return; {134035#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:30,866 INFO L290 TraceCheckUtils]: 80: Hoare triple {134035#(<= ~counter~0 8)} assume !(~r~0 > 0); {134035#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:30,867 INFO L290 TraceCheckUtils]: 81: Hoare triple {134035#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134060#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:30,867 INFO L290 TraceCheckUtils]: 82: Hoare triple {134060#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {134060#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:30,868 INFO L272 TraceCheckUtils]: 83: Hoare triple {134060#(<= ~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)); {134060#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:30,868 INFO L290 TraceCheckUtils]: 84: Hoare triple {134060#(<= ~counter~0 9)} ~cond := #in~cond; {134060#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:30,869 INFO L290 TraceCheckUtils]: 85: Hoare triple {134060#(<= ~counter~0 9)} assume !(0 == ~cond); {134060#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:30,869 INFO L290 TraceCheckUtils]: 86: Hoare triple {134060#(<= ~counter~0 9)} assume true; {134060#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:30,870 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {134060#(<= ~counter~0 9)} {134060#(<= ~counter~0 9)} #98#return; {134060#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:30,870 INFO L290 TraceCheckUtils]: 88: Hoare triple {134060#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {134060#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:30,872 INFO L290 TraceCheckUtils]: 89: Hoare triple {134060#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134085#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:30,872 INFO L290 TraceCheckUtils]: 90: Hoare triple {134085#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {134085#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:30,872 INFO L272 TraceCheckUtils]: 91: Hoare triple {134085#(<= ~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)); {134085#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:30,873 INFO L290 TraceCheckUtils]: 92: Hoare triple {134085#(<= ~counter~0 10)} ~cond := #in~cond; {134085#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:30,873 INFO L290 TraceCheckUtils]: 93: Hoare triple {134085#(<= ~counter~0 10)} assume !(0 == ~cond); {134085#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:30,874 INFO L290 TraceCheckUtils]: 94: Hoare triple {134085#(<= ~counter~0 10)} assume true; {134085#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:30,874 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {134085#(<= ~counter~0 10)} {134085#(<= ~counter~0 10)} #98#return; {134085#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:30,875 INFO L290 TraceCheckUtils]: 96: Hoare triple {134085#(<= ~counter~0 10)} assume !(~r~0 < 0); {134085#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:30,876 INFO L290 TraceCheckUtils]: 97: Hoare triple {134085#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {134110#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:30,876 INFO L290 TraceCheckUtils]: 98: Hoare triple {134110#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {134110#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:30,877 INFO L272 TraceCheckUtils]: 99: Hoare triple {134110#(<= ~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)); {134110#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:30,877 INFO L290 TraceCheckUtils]: 100: Hoare triple {134110#(<= ~counter~0 11)} ~cond := #in~cond; {134110#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:30,878 INFO L290 TraceCheckUtils]: 101: Hoare triple {134110#(<= ~counter~0 11)} assume !(0 == ~cond); {134110#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:30,878 INFO L290 TraceCheckUtils]: 102: Hoare triple {134110#(<= ~counter~0 11)} assume true; {134110#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:30,879 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {134110#(<= ~counter~0 11)} {134110#(<= ~counter~0 11)} #94#return; {134110#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:30,879 INFO L290 TraceCheckUtils]: 104: Hoare triple {134110#(<= ~counter~0 11)} assume !!(0 != ~r~0); {134110#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:30,881 INFO L290 TraceCheckUtils]: 105: Hoare triple {134110#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134135#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:30,881 INFO L290 TraceCheckUtils]: 106: Hoare triple {134135#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {134135#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:30,882 INFO L272 TraceCheckUtils]: 107: Hoare triple {134135#(<= ~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)); {134135#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:30,882 INFO L290 TraceCheckUtils]: 108: Hoare triple {134135#(<= ~counter~0 12)} ~cond := #in~cond; {134135#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:30,883 INFO L290 TraceCheckUtils]: 109: Hoare triple {134135#(<= ~counter~0 12)} assume !(0 == ~cond); {134135#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:30,883 INFO L290 TraceCheckUtils]: 110: Hoare triple {134135#(<= ~counter~0 12)} assume true; {134135#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:30,884 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {134135#(<= ~counter~0 12)} {134135#(<= ~counter~0 12)} #96#return; {134135#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:30,884 INFO L290 TraceCheckUtils]: 112: Hoare triple {134135#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {134135#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:30,885 INFO L290 TraceCheckUtils]: 113: Hoare triple {134135#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134160#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:30,886 INFO L290 TraceCheckUtils]: 114: Hoare triple {134160#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {134160#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:30,887 INFO L272 TraceCheckUtils]: 115: Hoare triple {134160#(<= ~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)); {134160#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:30,887 INFO L290 TraceCheckUtils]: 116: Hoare triple {134160#(<= ~counter~0 13)} ~cond := #in~cond; {134160#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:30,887 INFO L290 TraceCheckUtils]: 117: Hoare triple {134160#(<= ~counter~0 13)} assume !(0 == ~cond); {134160#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:30,888 INFO L290 TraceCheckUtils]: 118: Hoare triple {134160#(<= ~counter~0 13)} assume true; {134160#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:30,888 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {134160#(<= ~counter~0 13)} {134160#(<= ~counter~0 13)} #96#return; {134160#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:30,888 INFO L290 TraceCheckUtils]: 120: Hoare triple {134160#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {134160#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:30,890 INFO L290 TraceCheckUtils]: 121: Hoare triple {134160#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134185#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:30,890 INFO L290 TraceCheckUtils]: 122: Hoare triple {134185#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {134185#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:30,890 INFO L272 TraceCheckUtils]: 123: Hoare triple {134185#(<= ~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)); {134185#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:30,891 INFO L290 TraceCheckUtils]: 124: Hoare triple {134185#(<= ~counter~0 14)} ~cond := #in~cond; {134185#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:30,891 INFO L290 TraceCheckUtils]: 125: Hoare triple {134185#(<= ~counter~0 14)} assume !(0 == ~cond); {134185#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:30,891 INFO L290 TraceCheckUtils]: 126: Hoare triple {134185#(<= ~counter~0 14)} assume true; {134185#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:30,892 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {134185#(<= ~counter~0 14)} {134185#(<= ~counter~0 14)} #96#return; {134185#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:30,892 INFO L290 TraceCheckUtils]: 128: Hoare triple {134185#(<= ~counter~0 14)} assume !(~r~0 > 0); {134185#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:30,893 INFO L290 TraceCheckUtils]: 129: Hoare triple {134185#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134210#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:30,893 INFO L290 TraceCheckUtils]: 130: Hoare triple {134210#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {134210#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:30,894 INFO L272 TraceCheckUtils]: 131: Hoare triple {134210#(<= ~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)); {134210#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:30,894 INFO L290 TraceCheckUtils]: 132: Hoare triple {134210#(<= ~counter~0 15)} ~cond := #in~cond; {134210#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:30,894 INFO L290 TraceCheckUtils]: 133: Hoare triple {134210#(<= ~counter~0 15)} assume !(0 == ~cond); {134210#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:30,895 INFO L290 TraceCheckUtils]: 134: Hoare triple {134210#(<= ~counter~0 15)} assume true; {134210#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:30,895 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {134210#(<= ~counter~0 15)} {134210#(<= ~counter~0 15)} #98#return; {134210#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:30,895 INFO L290 TraceCheckUtils]: 136: Hoare triple {134210#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {134210#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:30,896 INFO L290 TraceCheckUtils]: 137: Hoare triple {134210#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134235#(<= |main_#t~post8| 15)} is VALID [2022-04-15 15:18:30,896 INFO L290 TraceCheckUtils]: 138: Hoare triple {134235#(<= |main_#t~post8| 15)} assume !(#t~post8 < 100);havoc #t~post8; {133804#false} is VALID [2022-04-15 15:18:30,896 INFO L290 TraceCheckUtils]: 139: Hoare triple {133804#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133804#false} is VALID [2022-04-15 15:18:30,896 INFO L290 TraceCheckUtils]: 140: Hoare triple {133804#false} assume !(#t~post6 < 100);havoc #t~post6; {133804#false} is VALID [2022-04-15 15:18:30,896 INFO L272 TraceCheckUtils]: 141: Hoare triple {133804#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)); {133804#false} is VALID [2022-04-15 15:18:30,896 INFO L290 TraceCheckUtils]: 142: Hoare triple {133804#false} ~cond := #in~cond; {133804#false} is VALID [2022-04-15 15:18:30,896 INFO L290 TraceCheckUtils]: 143: Hoare triple {133804#false} assume 0 == ~cond; {133804#false} is VALID [2022-04-15 15:18:30,897 INFO L290 TraceCheckUtils]: 144: Hoare triple {133804#false} assume !false; {133804#false} is VALID [2022-04-15 15:18:30,897 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 566 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:18:30,897 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:18:31,813 INFO L290 TraceCheckUtils]: 144: Hoare triple {133804#false} assume !false; {133804#false} is VALID [2022-04-15 15:18:31,813 INFO L290 TraceCheckUtils]: 143: Hoare triple {133804#false} assume 0 == ~cond; {133804#false} is VALID [2022-04-15 15:18:31,814 INFO L290 TraceCheckUtils]: 142: Hoare triple {133804#false} ~cond := #in~cond; {133804#false} is VALID [2022-04-15 15:18:31,814 INFO L272 TraceCheckUtils]: 141: Hoare triple {133804#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)); {133804#false} is VALID [2022-04-15 15:18:31,814 INFO L290 TraceCheckUtils]: 140: Hoare triple {133804#false} assume !(#t~post6 < 100);havoc #t~post6; {133804#false} is VALID [2022-04-15 15:18:31,814 INFO L290 TraceCheckUtils]: 139: Hoare triple {133804#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {133804#false} is VALID [2022-04-15 15:18:31,814 INFO L290 TraceCheckUtils]: 138: Hoare triple {134275#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {133804#false} is VALID [2022-04-15 15:18:31,815 INFO L290 TraceCheckUtils]: 137: Hoare triple {134279#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134275#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:18:31,815 INFO L290 TraceCheckUtils]: 136: Hoare triple {134279#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {134279#(< ~counter~0 100)} is VALID [2022-04-15 15:18:31,815 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {133803#true} {134279#(< ~counter~0 100)} #98#return; {134279#(< ~counter~0 100)} is VALID [2022-04-15 15:18:31,815 INFO L290 TraceCheckUtils]: 134: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,815 INFO L290 TraceCheckUtils]: 133: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,816 INFO L290 TraceCheckUtils]: 132: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,816 INFO L272 TraceCheckUtils]: 131: Hoare triple {134279#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,816 INFO L290 TraceCheckUtils]: 130: Hoare triple {134279#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {134279#(< ~counter~0 100)} is VALID [2022-04-15 15:18:31,818 INFO L290 TraceCheckUtils]: 129: Hoare triple {134304#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134279#(< ~counter~0 100)} is VALID [2022-04-15 15:18:31,819 INFO L290 TraceCheckUtils]: 128: Hoare triple {134304#(< ~counter~0 99)} assume !(~r~0 > 0); {134304#(< ~counter~0 99)} is VALID [2022-04-15 15:18:31,819 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {133803#true} {134304#(< ~counter~0 99)} #96#return; {134304#(< ~counter~0 99)} is VALID [2022-04-15 15:18:31,819 INFO L290 TraceCheckUtils]: 126: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,819 INFO L290 TraceCheckUtils]: 125: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,819 INFO L290 TraceCheckUtils]: 124: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,819 INFO L272 TraceCheckUtils]: 123: Hoare triple {134304#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,820 INFO L290 TraceCheckUtils]: 122: Hoare triple {134304#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {134304#(< ~counter~0 99)} is VALID [2022-04-15 15:18:31,821 INFO L290 TraceCheckUtils]: 121: Hoare triple {134329#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134304#(< ~counter~0 99)} is VALID [2022-04-15 15:18:31,821 INFO L290 TraceCheckUtils]: 120: Hoare triple {134329#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {134329#(< ~counter~0 98)} is VALID [2022-04-15 15:18:31,822 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {133803#true} {134329#(< ~counter~0 98)} #96#return; {134329#(< ~counter~0 98)} is VALID [2022-04-15 15:18:31,822 INFO L290 TraceCheckUtils]: 118: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,822 INFO L290 TraceCheckUtils]: 117: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,822 INFO L290 TraceCheckUtils]: 116: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,822 INFO L272 TraceCheckUtils]: 115: Hoare triple {134329#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,822 INFO L290 TraceCheckUtils]: 114: Hoare triple {134329#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {134329#(< ~counter~0 98)} is VALID [2022-04-15 15:18:31,823 INFO L290 TraceCheckUtils]: 113: Hoare triple {134354#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134329#(< ~counter~0 98)} is VALID [2022-04-15 15:18:31,823 INFO L290 TraceCheckUtils]: 112: Hoare triple {134354#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {134354#(< ~counter~0 97)} is VALID [2022-04-15 15:18:31,824 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {133803#true} {134354#(< ~counter~0 97)} #96#return; {134354#(< ~counter~0 97)} is VALID [2022-04-15 15:18:31,824 INFO L290 TraceCheckUtils]: 110: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,824 INFO L290 TraceCheckUtils]: 109: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,824 INFO L290 TraceCheckUtils]: 108: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,824 INFO L272 TraceCheckUtils]: 107: Hoare triple {134354#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,824 INFO L290 TraceCheckUtils]: 106: Hoare triple {134354#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {134354#(< ~counter~0 97)} is VALID [2022-04-15 15:18:31,826 INFO L290 TraceCheckUtils]: 105: Hoare triple {134379#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134354#(< ~counter~0 97)} is VALID [2022-04-15 15:18:31,826 INFO L290 TraceCheckUtils]: 104: Hoare triple {134379#(< ~counter~0 96)} assume !!(0 != ~r~0); {134379#(< ~counter~0 96)} is VALID [2022-04-15 15:18:31,826 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {133803#true} {134379#(< ~counter~0 96)} #94#return; {134379#(< ~counter~0 96)} is VALID [2022-04-15 15:18:31,826 INFO L290 TraceCheckUtils]: 102: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,826 INFO L290 TraceCheckUtils]: 101: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,827 INFO L290 TraceCheckUtils]: 100: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,827 INFO L272 TraceCheckUtils]: 99: Hoare triple {134379#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,827 INFO L290 TraceCheckUtils]: 98: Hoare triple {134379#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {134379#(< ~counter~0 96)} is VALID [2022-04-15 15:18:31,828 INFO L290 TraceCheckUtils]: 97: Hoare triple {134404#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {134379#(< ~counter~0 96)} is VALID [2022-04-15 15:18:31,828 INFO L290 TraceCheckUtils]: 96: Hoare triple {134404#(< ~counter~0 95)} assume !(~r~0 < 0); {134404#(< ~counter~0 95)} is VALID [2022-04-15 15:18:31,829 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {133803#true} {134404#(< ~counter~0 95)} #98#return; {134404#(< ~counter~0 95)} is VALID [2022-04-15 15:18:31,829 INFO L290 TraceCheckUtils]: 94: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,829 INFO L290 TraceCheckUtils]: 93: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,829 INFO L290 TraceCheckUtils]: 92: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,829 INFO L272 TraceCheckUtils]: 91: Hoare triple {134404#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,829 INFO L290 TraceCheckUtils]: 90: Hoare triple {134404#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {134404#(< ~counter~0 95)} is VALID [2022-04-15 15:18:31,830 INFO L290 TraceCheckUtils]: 89: Hoare triple {134429#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134404#(< ~counter~0 95)} is VALID [2022-04-15 15:18:31,831 INFO L290 TraceCheckUtils]: 88: Hoare triple {134429#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {134429#(< ~counter~0 94)} is VALID [2022-04-15 15:18:31,831 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {133803#true} {134429#(< ~counter~0 94)} #98#return; {134429#(< ~counter~0 94)} is VALID [2022-04-15 15:18:31,831 INFO L290 TraceCheckUtils]: 86: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,831 INFO L290 TraceCheckUtils]: 85: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,831 INFO L290 TraceCheckUtils]: 84: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,832 INFO L272 TraceCheckUtils]: 83: Hoare triple {134429#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,832 INFO L290 TraceCheckUtils]: 82: Hoare triple {134429#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {134429#(< ~counter~0 94)} is VALID [2022-04-15 15:18:31,833 INFO L290 TraceCheckUtils]: 81: Hoare triple {134454#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134429#(< ~counter~0 94)} is VALID [2022-04-15 15:18:31,833 INFO L290 TraceCheckUtils]: 80: Hoare triple {134454#(< ~counter~0 93)} assume !(~r~0 > 0); {134454#(< ~counter~0 93)} is VALID [2022-04-15 15:18:31,834 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {133803#true} {134454#(< ~counter~0 93)} #96#return; {134454#(< ~counter~0 93)} is VALID [2022-04-15 15:18:31,834 INFO L290 TraceCheckUtils]: 78: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,834 INFO L290 TraceCheckUtils]: 77: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,834 INFO L290 TraceCheckUtils]: 76: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,834 INFO L272 TraceCheckUtils]: 75: Hoare triple {134454#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,834 INFO L290 TraceCheckUtils]: 74: Hoare triple {134454#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {134454#(< ~counter~0 93)} is VALID [2022-04-15 15:18:31,835 INFO L290 TraceCheckUtils]: 73: Hoare triple {134479#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134454#(< ~counter~0 93)} is VALID [2022-04-15 15:18:31,836 INFO L290 TraceCheckUtils]: 72: Hoare triple {134479#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {134479#(< ~counter~0 92)} is VALID [2022-04-15 15:18:31,836 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {133803#true} {134479#(< ~counter~0 92)} #96#return; {134479#(< ~counter~0 92)} is VALID [2022-04-15 15:18:31,836 INFO L290 TraceCheckUtils]: 70: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,836 INFO L290 TraceCheckUtils]: 69: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,836 INFO L290 TraceCheckUtils]: 68: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,836 INFO L272 TraceCheckUtils]: 67: Hoare triple {134479#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,837 INFO L290 TraceCheckUtils]: 66: Hoare triple {134479#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {134479#(< ~counter~0 92)} is VALID [2022-04-15 15:18:31,838 INFO L290 TraceCheckUtils]: 65: Hoare triple {134504#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134479#(< ~counter~0 92)} is VALID [2022-04-15 15:18:31,838 INFO L290 TraceCheckUtils]: 64: Hoare triple {134504#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {134504#(< ~counter~0 91)} is VALID [2022-04-15 15:18:31,838 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {133803#true} {134504#(< ~counter~0 91)} #96#return; {134504#(< ~counter~0 91)} is VALID [2022-04-15 15:18:31,838 INFO L290 TraceCheckUtils]: 62: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,839 INFO L290 TraceCheckUtils]: 61: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,839 INFO L290 TraceCheckUtils]: 60: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,839 INFO L272 TraceCheckUtils]: 59: Hoare triple {134504#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,839 INFO L290 TraceCheckUtils]: 58: Hoare triple {134504#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {134504#(< ~counter~0 91)} is VALID [2022-04-15 15:18:31,840 INFO L290 TraceCheckUtils]: 57: Hoare triple {134529#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134504#(< ~counter~0 91)} is VALID [2022-04-15 15:18:31,840 INFO L290 TraceCheckUtils]: 56: Hoare triple {134529#(< ~counter~0 90)} assume !!(0 != ~r~0); {134529#(< ~counter~0 90)} is VALID [2022-04-15 15:18:31,841 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {133803#true} {134529#(< ~counter~0 90)} #94#return; {134529#(< ~counter~0 90)} is VALID [2022-04-15 15:18:31,841 INFO L290 TraceCheckUtils]: 54: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,841 INFO L290 TraceCheckUtils]: 53: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,841 INFO L290 TraceCheckUtils]: 52: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,841 INFO L272 TraceCheckUtils]: 51: Hoare triple {134529#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,841 INFO L290 TraceCheckUtils]: 50: Hoare triple {134529#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {134529#(< ~counter~0 90)} is VALID [2022-04-15 15:18:31,842 INFO L290 TraceCheckUtils]: 49: Hoare triple {134554#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {134529#(< ~counter~0 90)} is VALID [2022-04-15 15:18:31,843 INFO L290 TraceCheckUtils]: 48: Hoare triple {134554#(< ~counter~0 89)} assume !(~r~0 < 0); {134554#(< ~counter~0 89)} is VALID [2022-04-15 15:18:31,843 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {133803#true} {134554#(< ~counter~0 89)} #98#return; {134554#(< ~counter~0 89)} is VALID [2022-04-15 15:18:31,843 INFO L290 TraceCheckUtils]: 46: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,843 INFO L290 TraceCheckUtils]: 45: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,843 INFO L290 TraceCheckUtils]: 44: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,843 INFO L272 TraceCheckUtils]: 43: Hoare triple {134554#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,844 INFO L290 TraceCheckUtils]: 42: Hoare triple {134554#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {134554#(< ~counter~0 89)} is VALID [2022-04-15 15:18:31,845 INFO L290 TraceCheckUtils]: 41: Hoare triple {134579#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134554#(< ~counter~0 89)} is VALID [2022-04-15 15:18:31,845 INFO L290 TraceCheckUtils]: 40: Hoare triple {134579#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {134579#(< ~counter~0 88)} is VALID [2022-04-15 15:18:31,846 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {133803#true} {134579#(< ~counter~0 88)} #98#return; {134579#(< ~counter~0 88)} is VALID [2022-04-15 15:18:31,846 INFO L290 TraceCheckUtils]: 38: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,846 INFO L290 TraceCheckUtils]: 37: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,846 INFO L290 TraceCheckUtils]: 36: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,846 INFO L272 TraceCheckUtils]: 35: Hoare triple {134579#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,846 INFO L290 TraceCheckUtils]: 34: Hoare triple {134579#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {134579#(< ~counter~0 88)} is VALID [2022-04-15 15:18:31,847 INFO L290 TraceCheckUtils]: 33: Hoare triple {134604#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {134579#(< ~counter~0 88)} is VALID [2022-04-15 15:18:31,848 INFO L290 TraceCheckUtils]: 32: Hoare triple {134604#(< ~counter~0 87)} assume !(~r~0 > 0); {134604#(< ~counter~0 87)} is VALID [2022-04-15 15:18:31,848 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {133803#true} {134604#(< ~counter~0 87)} #96#return; {134604#(< ~counter~0 87)} is VALID [2022-04-15 15:18:31,848 INFO L290 TraceCheckUtils]: 30: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,848 INFO L290 TraceCheckUtils]: 29: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,848 INFO L290 TraceCheckUtils]: 28: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,848 INFO L272 TraceCheckUtils]: 27: Hoare triple {134604#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,849 INFO L290 TraceCheckUtils]: 26: Hoare triple {134604#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {134604#(< ~counter~0 87)} is VALID [2022-04-15 15:18:31,850 INFO L290 TraceCheckUtils]: 25: Hoare triple {134629#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {134604#(< ~counter~0 87)} is VALID [2022-04-15 15:18:31,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {134629#(< ~counter~0 86)} assume !!(0 != ~r~0); {134629#(< ~counter~0 86)} is VALID [2022-04-15 15:18:31,850 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {133803#true} {134629#(< ~counter~0 86)} #94#return; {134629#(< ~counter~0 86)} is VALID [2022-04-15 15:18:31,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,851 INFO L272 TraceCheckUtils]: 19: Hoare triple {134629#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {134629#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {134629#(< ~counter~0 86)} is VALID [2022-04-15 15:18:31,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {134654#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {134629#(< ~counter~0 86)} is VALID [2022-04-15 15:18:31,852 INFO L290 TraceCheckUtils]: 16: Hoare triple {134654#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {134654#(< ~counter~0 85)} is VALID [2022-04-15 15:18:31,853 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {133803#true} {134654#(< ~counter~0 85)} #92#return; {134654#(< ~counter~0 85)} is VALID [2022-04-15 15:18:31,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,853 INFO L290 TraceCheckUtils]: 13: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,853 INFO L290 TraceCheckUtils]: 12: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,853 INFO L272 TraceCheckUtils]: 11: Hoare triple {134654#(< ~counter~0 85)} 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)); {133803#true} is VALID [2022-04-15 15:18:31,853 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {133803#true} {134654#(< ~counter~0 85)} #90#return; {134654#(< ~counter~0 85)} is VALID [2022-04-15 15:18:31,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {133803#true} assume true; {133803#true} is VALID [2022-04-15 15:18:31,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {133803#true} assume !(0 == ~cond); {133803#true} is VALID [2022-04-15 15:18:31,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {133803#true} ~cond := #in~cond; {133803#true} is VALID [2022-04-15 15:18:31,854 INFO L272 TraceCheckUtils]: 6: Hoare triple {134654#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {133803#true} is VALID [2022-04-15 15:18:31,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {134654#(< ~counter~0 85)} 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; {134654#(< ~counter~0 85)} is VALID [2022-04-15 15:18:31,854 INFO L272 TraceCheckUtils]: 4: Hoare triple {134654#(< ~counter~0 85)} call #t~ret9 := main(); {134654#(< ~counter~0 85)} is VALID [2022-04-15 15:18:31,855 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {134654#(< ~counter~0 85)} {133803#true} #102#return; {134654#(< ~counter~0 85)} is VALID [2022-04-15 15:18:31,855 INFO L290 TraceCheckUtils]: 2: Hoare triple {134654#(< ~counter~0 85)} assume true; {134654#(< ~counter~0 85)} is VALID [2022-04-15 15:18:31,855 INFO L290 TraceCheckUtils]: 1: Hoare triple {133803#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; {134654#(< ~counter~0 85)} is VALID [2022-04-15 15:18:31,855 INFO L272 TraceCheckUtils]: 0: Hoare triple {133803#true} call ULTIMATE.init(); {133803#true} is VALID [2022-04-15 15:18:31,856 INFO L134 CoverageAnalysis]: Checked inductivity of 606 backedges. 36 proven. 146 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-15 15:18:31,856 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:18:31,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [602402121] [2022-04-15 15:18:31,856 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:18:31,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [3873840] [2022-04-15 15:18:31,856 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [3873840] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:18:31,856 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:18:31,856 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-15 15:18:31,856 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:18:31,856 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1512780098] [2022-04-15 15:18:31,857 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1512780098] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:18:31,857 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:18:31,857 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 15:18:31,857 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888174024] [2022-04-15 15:18:31,857 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:18:31,857 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 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 145 [2022-04-15 15:18:31,857 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:18:31,857 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 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-15 15:18:32,001 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:32,002 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 15:18:32,002 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:32,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 15:18:32,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 15:18:32,003 INFO L87 Difference]: Start difference. First operand 779 states and 1044 transitions. Second operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 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-15 15:18:36,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:36,831 INFO L93 Difference]: Finished difference Result 985 states and 1348 transitions. [2022-04-15 15:18:36,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-04-15 15:18:36,831 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 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 145 [2022-04-15 15:18:36,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:18:36,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 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-15 15:18:36,833 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-15 15:18:36,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 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-15 15:18:36,835 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 337 transitions. [2022-04-15 15:18:36,836 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 32 states and 337 transitions. [2022-04-15 15:18:37,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:37,255 INFO L225 Difference]: With dead ends: 985 [2022-04-15 15:18:37,255 INFO L226 Difference]: Without dead ends: 793 [2022-04-15 15:18:37,256 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 302 GetRequests, 255 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=995, Invalid=1357, Unknown=0, NotChecked=0, Total=2352 [2022-04-15 15:18:37,256 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 241 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 220 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 241 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 220 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 15:18:37,256 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [241 Valid, 356 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [220 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 15:18:37,257 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 793 states. [2022-04-15 15:18:40,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 793 to 782. [2022-04-15 15:18:40,090 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:18:40,091 INFO L82 GeneralOperation]: Start isEquivalent. First operand 793 states. Second operand has 782 states, 585 states have (on average 1.1863247863247863) internal successors, (694), 597 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:40,092 INFO L74 IsIncluded]: Start isIncluded. First operand 793 states. Second operand has 782 states, 585 states have (on average 1.1863247863247863) internal successors, (694), 597 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:40,092 INFO L87 Difference]: Start difference. First operand 793 states. Second operand has 782 states, 585 states have (on average 1.1863247863247863) internal successors, (694), 597 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:40,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:40,113 INFO L93 Difference]: Finished difference Result 793 states and 1055 transitions. [2022-04-15 15:18:40,113 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1055 transitions. [2022-04-15 15:18:40,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:40,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:40,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 782 states, 585 states have (on average 1.1863247863247863) internal successors, (694), 597 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 793 states. [2022-04-15 15:18:40,115 INFO L87 Difference]: Start difference. First operand has 782 states, 585 states have (on average 1.1863247863247863) internal successors, (694), 597 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) Second operand 793 states. [2022-04-15 15:18:40,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:40,136 INFO L93 Difference]: Finished difference Result 793 states and 1055 transitions. [2022-04-15 15:18:40,136 INFO L276 IsEmpty]: Start isEmpty. Operand 793 states and 1055 transitions. [2022-04-15 15:18:40,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:40,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:40,136 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:18:40,136 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:18:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 782 states, 585 states have (on average 1.1863247863247863) internal successors, (694), 597 states have internal predecessors, (694), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 162 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:40,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 782 states to 782 states and 1044 transitions. [2022-04-15 15:18:40,169 INFO L78 Accepts]: Start accepts. Automaton has 782 states and 1044 transitions. Word has length 145 [2022-04-15 15:18:40,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:18:40,169 INFO L478 AbstractCegarLoop]: Abstraction has 782 states and 1044 transitions. [2022-04-15 15:18:40,169 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.473684210526316) internal successors, (104), 18 states have internal predecessors, (104), 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-15 15:18:40,169 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 782 states and 1044 transitions. [2022-04-15 15:18:47,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1044 edges. 1043 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:47,767 INFO L276 IsEmpty]: Start isEmpty. Operand 782 states and 1044 transitions. [2022-04-15 15:18:47,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 148 [2022-04-15 15:18:47,769 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:18:47,769 INFO L499 BasicCegarLoop]: trace histogram [16, 15, 15, 9, 8, 8, 8, 6, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:18:47,796 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (51)] Forceful destruction successful, exit code 0 [2022-04-15 15:18:47,991 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 51 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable49 [2022-04-15 15:18:47,992 INFO L403 AbstractCegarLoop]: === Iteration 51 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:18:47,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:18:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 21 times [2022-04-15 15:18:47,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:47,992 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1408185613] [2022-04-15 15:18:47,992 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:18:47,992 INFO L85 PathProgramCache]: Analyzing trace with hash -1963931820, now seen corresponding path program 22 times [2022-04-15 15:18:47,993 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:18:47,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759151816] [2022-04-15 15:18:47,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:18:47,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:18:48,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:18:48,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1744640773] [2022-04-15 15:18:48,007 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:18:48,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:18:48,007 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:18:48,008 INFO L229 MonitoredProcess]: Starting monitored process 52 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:18:48,008 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Waiting until timeout for monitored process [2022-04-15 15:18:48,177 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:18:48,177 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:18:48,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 360 conjuncts, 35 conjunts are in the unsatisfiable core [2022-04-15 15:18:48,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:18:48,210 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:18:48,988 INFO L272 TraceCheckUtils]: 0: Hoare triple {139854#true} call ULTIMATE.init(); {139854#true} is VALID [2022-04-15 15:18:48,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {139854#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; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {139862#(<= ~counter~0 0)} assume true; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,989 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {139862#(<= ~counter~0 0)} {139854#true} #102#return; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,990 INFO L272 TraceCheckUtils]: 4: Hoare triple {139862#(<= ~counter~0 0)} call #t~ret9 := main(); {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,990 INFO L290 TraceCheckUtils]: 5: Hoare triple {139862#(<= ~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; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,990 INFO L272 TraceCheckUtils]: 6: Hoare triple {139862#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,991 INFO L290 TraceCheckUtils]: 7: Hoare triple {139862#(<= ~counter~0 0)} ~cond := #in~cond; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,991 INFO L290 TraceCheckUtils]: 8: Hoare triple {139862#(<= ~counter~0 0)} assume !(0 == ~cond); {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,991 INFO L290 TraceCheckUtils]: 9: Hoare triple {139862#(<= ~counter~0 0)} assume true; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {139862#(<= ~counter~0 0)} {139862#(<= ~counter~0 0)} #90#return; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,992 INFO L272 TraceCheckUtils]: 11: Hoare triple {139862#(<= ~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)); {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {139862#(<= ~counter~0 0)} ~cond := #in~cond; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,993 INFO L290 TraceCheckUtils]: 13: Hoare triple {139862#(<= ~counter~0 0)} assume !(0 == ~cond); {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,993 INFO L290 TraceCheckUtils]: 14: Hoare triple {139862#(<= ~counter~0 0)} assume true; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,993 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {139862#(<= ~counter~0 0)} {139862#(<= ~counter~0 0)} #92#return; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,994 INFO L290 TraceCheckUtils]: 16: Hoare triple {139862#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {139862#(<= ~counter~0 0)} is VALID [2022-04-15 15:18:48,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {139862#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139911#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,997 INFO L290 TraceCheckUtils]: 18: Hoare triple {139911#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {139911#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,997 INFO L272 TraceCheckUtils]: 19: Hoare triple {139911#(<= ~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)); {139911#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {139911#(<= ~counter~0 1)} ~cond := #in~cond; {139911#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,998 INFO L290 TraceCheckUtils]: 21: Hoare triple {139911#(<= ~counter~0 1)} assume !(0 == ~cond); {139911#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,998 INFO L290 TraceCheckUtils]: 22: Hoare triple {139911#(<= ~counter~0 1)} assume true; {139911#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,998 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {139911#(<= ~counter~0 1)} {139911#(<= ~counter~0 1)} #94#return; {139911#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:48,999 INFO L290 TraceCheckUtils]: 24: Hoare triple {139911#(<= ~counter~0 1)} assume !!(0 != ~r~0); {139911#(<= ~counter~0 1)} is VALID [2022-04-15 15:18:49,000 INFO L290 TraceCheckUtils]: 25: Hoare triple {139911#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {139936#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:49,000 INFO L290 TraceCheckUtils]: 26: Hoare triple {139936#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {139936#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:49,001 INFO L272 TraceCheckUtils]: 27: Hoare triple {139936#(<= ~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)); {139936#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:49,001 INFO L290 TraceCheckUtils]: 28: Hoare triple {139936#(<= ~counter~0 2)} ~cond := #in~cond; {139936#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:49,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {139936#(<= ~counter~0 2)} assume !(0 == ~cond); {139936#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:49,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {139936#(<= ~counter~0 2)} assume true; {139936#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:49,002 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {139936#(<= ~counter~0 2)} {139936#(<= ~counter~0 2)} #96#return; {139936#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:49,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {139936#(<= ~counter~0 2)} assume !(~r~0 > 0); {139936#(<= ~counter~0 2)} is VALID [2022-04-15 15:18:49,004 INFO L290 TraceCheckUtils]: 33: Hoare triple {139936#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139961#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:49,004 INFO L290 TraceCheckUtils]: 34: Hoare triple {139961#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {139961#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:49,004 INFO L272 TraceCheckUtils]: 35: Hoare triple {139961#(<= ~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)); {139961#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:49,005 INFO L290 TraceCheckUtils]: 36: Hoare triple {139961#(<= ~counter~0 3)} ~cond := #in~cond; {139961#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:49,005 INFO L290 TraceCheckUtils]: 37: Hoare triple {139961#(<= ~counter~0 3)} assume !(0 == ~cond); {139961#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:49,005 INFO L290 TraceCheckUtils]: 38: Hoare triple {139961#(<= ~counter~0 3)} assume true; {139961#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:49,006 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {139961#(<= ~counter~0 3)} {139961#(<= ~counter~0 3)} #98#return; {139961#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:49,006 INFO L290 TraceCheckUtils]: 40: Hoare triple {139961#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {139961#(<= ~counter~0 3)} is VALID [2022-04-15 15:18:49,007 INFO L290 TraceCheckUtils]: 41: Hoare triple {139961#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139986#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:49,008 INFO L290 TraceCheckUtils]: 42: Hoare triple {139986#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {139986#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:49,008 INFO L272 TraceCheckUtils]: 43: Hoare triple {139986#(<= ~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)); {139986#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:49,008 INFO L290 TraceCheckUtils]: 44: Hoare triple {139986#(<= ~counter~0 4)} ~cond := #in~cond; {139986#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:49,009 INFO L290 TraceCheckUtils]: 45: Hoare triple {139986#(<= ~counter~0 4)} assume !(0 == ~cond); {139986#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:49,009 INFO L290 TraceCheckUtils]: 46: Hoare triple {139986#(<= ~counter~0 4)} assume true; {139986#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:49,009 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {139986#(<= ~counter~0 4)} {139986#(<= ~counter~0 4)} #98#return; {139986#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:49,010 INFO L290 TraceCheckUtils]: 48: Hoare triple {139986#(<= ~counter~0 4)} assume !(~r~0 < 0); {139986#(<= ~counter~0 4)} is VALID [2022-04-15 15:18:49,011 INFO L290 TraceCheckUtils]: 49: Hoare triple {139986#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {140011#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:49,011 INFO L290 TraceCheckUtils]: 50: Hoare triple {140011#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {140011#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:49,012 INFO L272 TraceCheckUtils]: 51: Hoare triple {140011#(<= ~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)); {140011#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:49,012 INFO L290 TraceCheckUtils]: 52: Hoare triple {140011#(<= ~counter~0 5)} ~cond := #in~cond; {140011#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:49,012 INFO L290 TraceCheckUtils]: 53: Hoare triple {140011#(<= ~counter~0 5)} assume !(0 == ~cond); {140011#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:49,012 INFO L290 TraceCheckUtils]: 54: Hoare triple {140011#(<= ~counter~0 5)} assume true; {140011#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:49,013 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {140011#(<= ~counter~0 5)} {140011#(<= ~counter~0 5)} #94#return; {140011#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:49,013 INFO L290 TraceCheckUtils]: 56: Hoare triple {140011#(<= ~counter~0 5)} assume !!(0 != ~r~0); {140011#(<= ~counter~0 5)} is VALID [2022-04-15 15:18:49,014 INFO L290 TraceCheckUtils]: 57: Hoare triple {140011#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140036#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:49,015 INFO L290 TraceCheckUtils]: 58: Hoare triple {140036#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {140036#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:49,015 INFO L272 TraceCheckUtils]: 59: Hoare triple {140036#(<= ~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)); {140036#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:49,015 INFO L290 TraceCheckUtils]: 60: Hoare triple {140036#(<= ~counter~0 6)} ~cond := #in~cond; {140036#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:49,016 INFO L290 TraceCheckUtils]: 61: Hoare triple {140036#(<= ~counter~0 6)} assume !(0 == ~cond); {140036#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:49,016 INFO L290 TraceCheckUtils]: 62: Hoare triple {140036#(<= ~counter~0 6)} assume true; {140036#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:49,017 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {140036#(<= ~counter~0 6)} {140036#(<= ~counter~0 6)} #96#return; {140036#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:49,017 INFO L290 TraceCheckUtils]: 64: Hoare triple {140036#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140036#(<= ~counter~0 6)} is VALID [2022-04-15 15:18:49,018 INFO L290 TraceCheckUtils]: 65: Hoare triple {140036#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140061#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:49,018 INFO L290 TraceCheckUtils]: 66: Hoare triple {140061#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {140061#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:49,019 INFO L272 TraceCheckUtils]: 67: Hoare triple {140061#(<= ~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)); {140061#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:49,019 INFO L290 TraceCheckUtils]: 68: Hoare triple {140061#(<= ~counter~0 7)} ~cond := #in~cond; {140061#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:49,019 INFO L290 TraceCheckUtils]: 69: Hoare triple {140061#(<= ~counter~0 7)} assume !(0 == ~cond); {140061#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:49,020 INFO L290 TraceCheckUtils]: 70: Hoare triple {140061#(<= ~counter~0 7)} assume true; {140061#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:49,020 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {140061#(<= ~counter~0 7)} {140061#(<= ~counter~0 7)} #96#return; {140061#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:49,020 INFO L290 TraceCheckUtils]: 72: Hoare triple {140061#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140061#(<= ~counter~0 7)} is VALID [2022-04-15 15:18:49,021 INFO L290 TraceCheckUtils]: 73: Hoare triple {140061#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140086#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,022 INFO L290 TraceCheckUtils]: 74: Hoare triple {140086#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {140086#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,022 INFO L272 TraceCheckUtils]: 75: Hoare triple {140086#(<= ~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)); {140086#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,023 INFO L290 TraceCheckUtils]: 76: Hoare triple {140086#(<= ~counter~0 8)} ~cond := #in~cond; {140086#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,023 INFO L290 TraceCheckUtils]: 77: Hoare triple {140086#(<= ~counter~0 8)} assume !(0 == ~cond); {140086#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,023 INFO L290 TraceCheckUtils]: 78: Hoare triple {140086#(<= ~counter~0 8)} assume true; {140086#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,024 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {140086#(<= ~counter~0 8)} {140086#(<= ~counter~0 8)} #96#return; {140086#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,024 INFO L290 TraceCheckUtils]: 80: Hoare triple {140086#(<= ~counter~0 8)} assume !(~r~0 > 0); {140086#(<= ~counter~0 8)} is VALID [2022-04-15 15:18:49,025 INFO L290 TraceCheckUtils]: 81: Hoare triple {140086#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {140111#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,025 INFO L290 TraceCheckUtils]: 82: Hoare triple {140111#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {140111#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,026 INFO L272 TraceCheckUtils]: 83: Hoare triple {140111#(<= ~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)); {140111#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,026 INFO L290 TraceCheckUtils]: 84: Hoare triple {140111#(<= ~counter~0 9)} ~cond := #in~cond; {140111#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,026 INFO L290 TraceCheckUtils]: 85: Hoare triple {140111#(<= ~counter~0 9)} assume !(0 == ~cond); {140111#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,027 INFO L290 TraceCheckUtils]: 86: Hoare triple {140111#(<= ~counter~0 9)} assume true; {140111#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,027 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {140111#(<= ~counter~0 9)} {140111#(<= ~counter~0 9)} #98#return; {140111#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,027 INFO L290 TraceCheckUtils]: 88: Hoare triple {140111#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {140111#(<= ~counter~0 9)} is VALID [2022-04-15 15:18:49,029 INFO L290 TraceCheckUtils]: 89: Hoare triple {140111#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {140136#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,029 INFO L290 TraceCheckUtils]: 90: Hoare triple {140136#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {140136#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,029 INFO L272 TraceCheckUtils]: 91: Hoare triple {140136#(<= ~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)); {140136#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,030 INFO L290 TraceCheckUtils]: 92: Hoare triple {140136#(<= ~counter~0 10)} ~cond := #in~cond; {140136#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,030 INFO L290 TraceCheckUtils]: 93: Hoare triple {140136#(<= ~counter~0 10)} assume !(0 == ~cond); {140136#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,030 INFO L290 TraceCheckUtils]: 94: Hoare triple {140136#(<= ~counter~0 10)} assume true; {140136#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,031 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {140136#(<= ~counter~0 10)} {140136#(<= ~counter~0 10)} #98#return; {140136#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,031 INFO L290 TraceCheckUtils]: 96: Hoare triple {140136#(<= ~counter~0 10)} assume !(~r~0 < 0); {140136#(<= ~counter~0 10)} is VALID [2022-04-15 15:18:49,032 INFO L290 TraceCheckUtils]: 97: Hoare triple {140136#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {140161#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,033 INFO L290 TraceCheckUtils]: 98: Hoare triple {140161#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {140161#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,033 INFO L272 TraceCheckUtils]: 99: Hoare triple {140161#(<= ~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)); {140161#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,033 INFO L290 TraceCheckUtils]: 100: Hoare triple {140161#(<= ~counter~0 11)} ~cond := #in~cond; {140161#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,034 INFO L290 TraceCheckUtils]: 101: Hoare triple {140161#(<= ~counter~0 11)} assume !(0 == ~cond); {140161#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,034 INFO L290 TraceCheckUtils]: 102: Hoare triple {140161#(<= ~counter~0 11)} assume true; {140161#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,034 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {140161#(<= ~counter~0 11)} {140161#(<= ~counter~0 11)} #94#return; {140161#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,035 INFO L290 TraceCheckUtils]: 104: Hoare triple {140161#(<= ~counter~0 11)} assume !!(0 != ~r~0); {140161#(<= ~counter~0 11)} is VALID [2022-04-15 15:18:49,036 INFO L290 TraceCheckUtils]: 105: Hoare triple {140161#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140186#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:49,036 INFO L290 TraceCheckUtils]: 106: Hoare triple {140186#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {140186#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:49,037 INFO L272 TraceCheckUtils]: 107: Hoare triple {140186#(<= ~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)); {140186#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:49,037 INFO L290 TraceCheckUtils]: 108: Hoare triple {140186#(<= ~counter~0 12)} ~cond := #in~cond; {140186#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:49,037 INFO L290 TraceCheckUtils]: 109: Hoare triple {140186#(<= ~counter~0 12)} assume !(0 == ~cond); {140186#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:49,037 INFO L290 TraceCheckUtils]: 110: Hoare triple {140186#(<= ~counter~0 12)} assume true; {140186#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:49,038 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {140186#(<= ~counter~0 12)} {140186#(<= ~counter~0 12)} #96#return; {140186#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:49,038 INFO L290 TraceCheckUtils]: 112: Hoare triple {140186#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140186#(<= ~counter~0 12)} is VALID [2022-04-15 15:18:49,039 INFO L290 TraceCheckUtils]: 113: Hoare triple {140186#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140211#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:49,040 INFO L290 TraceCheckUtils]: 114: Hoare triple {140211#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {140211#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:49,040 INFO L272 TraceCheckUtils]: 115: Hoare triple {140211#(<= ~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)); {140211#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:49,040 INFO L290 TraceCheckUtils]: 116: Hoare triple {140211#(<= ~counter~0 13)} ~cond := #in~cond; {140211#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:49,041 INFO L290 TraceCheckUtils]: 117: Hoare triple {140211#(<= ~counter~0 13)} assume !(0 == ~cond); {140211#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:49,041 INFO L290 TraceCheckUtils]: 118: Hoare triple {140211#(<= ~counter~0 13)} assume true; {140211#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:49,041 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {140211#(<= ~counter~0 13)} {140211#(<= ~counter~0 13)} #96#return; {140211#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:49,042 INFO L290 TraceCheckUtils]: 120: Hoare triple {140211#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140211#(<= ~counter~0 13)} is VALID [2022-04-15 15:18:49,043 INFO L290 TraceCheckUtils]: 121: Hoare triple {140211#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140236#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:49,043 INFO L290 TraceCheckUtils]: 122: Hoare triple {140236#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {140236#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:49,044 INFO L272 TraceCheckUtils]: 123: Hoare triple {140236#(<= ~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)); {140236#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:49,044 INFO L290 TraceCheckUtils]: 124: Hoare triple {140236#(<= ~counter~0 14)} ~cond := #in~cond; {140236#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:49,044 INFO L290 TraceCheckUtils]: 125: Hoare triple {140236#(<= ~counter~0 14)} assume !(0 == ~cond); {140236#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:49,045 INFO L290 TraceCheckUtils]: 126: Hoare triple {140236#(<= ~counter~0 14)} assume true; {140236#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:49,045 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {140236#(<= ~counter~0 14)} {140236#(<= ~counter~0 14)} #96#return; {140236#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:49,045 INFO L290 TraceCheckUtils]: 128: Hoare triple {140236#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140236#(<= ~counter~0 14)} is VALID [2022-04-15 15:18:49,047 INFO L290 TraceCheckUtils]: 129: Hoare triple {140236#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140261#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:49,047 INFO L290 TraceCheckUtils]: 130: Hoare triple {140261#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {140261#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:49,048 INFO L272 TraceCheckUtils]: 131: Hoare triple {140261#(<= ~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)); {140261#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:49,048 INFO L290 TraceCheckUtils]: 132: Hoare triple {140261#(<= ~counter~0 15)} ~cond := #in~cond; {140261#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:49,048 INFO L290 TraceCheckUtils]: 133: Hoare triple {140261#(<= ~counter~0 15)} assume !(0 == ~cond); {140261#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:49,048 INFO L290 TraceCheckUtils]: 134: Hoare triple {140261#(<= ~counter~0 15)} assume true; {140261#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:49,049 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {140261#(<= ~counter~0 15)} {140261#(<= ~counter~0 15)} #96#return; {140261#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:49,049 INFO L290 TraceCheckUtils]: 136: Hoare triple {140261#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140261#(<= ~counter~0 15)} is VALID [2022-04-15 15:18:49,050 INFO L290 TraceCheckUtils]: 137: Hoare triple {140261#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140286#(<= |main_#t~post7| 15)} is VALID [2022-04-15 15:18:49,050 INFO L290 TraceCheckUtils]: 138: Hoare triple {140286#(<= |main_#t~post7| 15)} assume !(#t~post7 < 100);havoc #t~post7; {139855#false} is VALID [2022-04-15 15:18:49,050 INFO L290 TraceCheckUtils]: 139: Hoare triple {139855#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139855#false} is VALID [2022-04-15 15:18:49,050 INFO L290 TraceCheckUtils]: 140: Hoare triple {139855#false} assume !(#t~post8 < 100);havoc #t~post8; {139855#false} is VALID [2022-04-15 15:18:49,050 INFO L290 TraceCheckUtils]: 141: Hoare triple {139855#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139855#false} is VALID [2022-04-15 15:18:49,050 INFO L290 TraceCheckUtils]: 142: Hoare triple {139855#false} assume !(#t~post6 < 100);havoc #t~post6; {139855#false} is VALID [2022-04-15 15:18:49,050 INFO L272 TraceCheckUtils]: 143: Hoare triple {139855#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)); {139855#false} is VALID [2022-04-15 15:18:49,050 INFO L290 TraceCheckUtils]: 144: Hoare triple {139855#false} ~cond := #in~cond; {139855#false} is VALID [2022-04-15 15:18:49,050 INFO L290 TraceCheckUtils]: 145: Hoare triple {139855#false} assume 0 == ~cond; {139855#false} is VALID [2022-04-15 15:18:49,050 INFO L290 TraceCheckUtils]: 146: Hoare triple {139855#false} assume !false; {139855#false} is VALID [2022-04-15 15:18:49,051 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 584 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:18:49,051 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:18:50,010 INFO L290 TraceCheckUtils]: 146: Hoare triple {139855#false} assume !false; {139855#false} is VALID [2022-04-15 15:18:50,010 INFO L290 TraceCheckUtils]: 145: Hoare triple {139855#false} assume 0 == ~cond; {139855#false} is VALID [2022-04-15 15:18:50,010 INFO L290 TraceCheckUtils]: 144: Hoare triple {139855#false} ~cond := #in~cond; {139855#false} is VALID [2022-04-15 15:18:50,010 INFO L272 TraceCheckUtils]: 143: Hoare triple {139855#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)); {139855#false} is VALID [2022-04-15 15:18:50,010 INFO L290 TraceCheckUtils]: 142: Hoare triple {139855#false} assume !(#t~post6 < 100);havoc #t~post6; {139855#false} is VALID [2022-04-15 15:18:50,010 INFO L290 TraceCheckUtils]: 141: Hoare triple {139855#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {139855#false} is VALID [2022-04-15 15:18:50,010 INFO L290 TraceCheckUtils]: 140: Hoare triple {139855#false} assume !(#t~post8 < 100);havoc #t~post8; {139855#false} is VALID [2022-04-15 15:18:50,010 INFO L290 TraceCheckUtils]: 139: Hoare triple {139855#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {139855#false} is VALID [2022-04-15 15:18:50,011 INFO L290 TraceCheckUtils]: 138: Hoare triple {140338#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {139855#false} is VALID [2022-04-15 15:18:50,011 INFO L290 TraceCheckUtils]: 137: Hoare triple {140342#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140338#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:18:50,011 INFO L290 TraceCheckUtils]: 136: Hoare triple {140342#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140342#(< ~counter~0 100)} is VALID [2022-04-15 15:18:50,012 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {139854#true} {140342#(< ~counter~0 100)} #96#return; {140342#(< ~counter~0 100)} is VALID [2022-04-15 15:18:50,012 INFO L290 TraceCheckUtils]: 134: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,012 INFO L290 TraceCheckUtils]: 133: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,012 INFO L290 TraceCheckUtils]: 132: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,012 INFO L272 TraceCheckUtils]: 131: Hoare triple {140342#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,012 INFO L290 TraceCheckUtils]: 130: Hoare triple {140342#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {140342#(< ~counter~0 100)} is VALID [2022-04-15 15:18:50,015 INFO L290 TraceCheckUtils]: 129: Hoare triple {140367#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140342#(< ~counter~0 100)} is VALID [2022-04-15 15:18:50,015 INFO L290 TraceCheckUtils]: 128: Hoare triple {140367#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140367#(< ~counter~0 99)} is VALID [2022-04-15 15:18:50,016 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {139854#true} {140367#(< ~counter~0 99)} #96#return; {140367#(< ~counter~0 99)} is VALID [2022-04-15 15:18:50,016 INFO L290 TraceCheckUtils]: 126: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,016 INFO L290 TraceCheckUtils]: 125: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,016 INFO L290 TraceCheckUtils]: 124: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,016 INFO L272 TraceCheckUtils]: 123: Hoare triple {140367#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,023 INFO L290 TraceCheckUtils]: 122: Hoare triple {140367#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {140367#(< ~counter~0 99)} is VALID [2022-04-15 15:18:50,025 INFO L290 TraceCheckUtils]: 121: Hoare triple {140392#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140367#(< ~counter~0 99)} is VALID [2022-04-15 15:18:50,026 INFO L290 TraceCheckUtils]: 120: Hoare triple {140392#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140392#(< ~counter~0 98)} is VALID [2022-04-15 15:18:50,026 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {139854#true} {140392#(< ~counter~0 98)} #96#return; {140392#(< ~counter~0 98)} is VALID [2022-04-15 15:18:50,027 INFO L290 TraceCheckUtils]: 118: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,027 INFO L290 TraceCheckUtils]: 117: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,027 INFO L290 TraceCheckUtils]: 116: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,027 INFO L272 TraceCheckUtils]: 115: Hoare triple {140392#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,027 INFO L290 TraceCheckUtils]: 114: Hoare triple {140392#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {140392#(< ~counter~0 98)} is VALID [2022-04-15 15:18:50,029 INFO L290 TraceCheckUtils]: 113: Hoare triple {140417#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140392#(< ~counter~0 98)} is VALID [2022-04-15 15:18:50,030 INFO L290 TraceCheckUtils]: 112: Hoare triple {140417#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140417#(< ~counter~0 97)} is VALID [2022-04-15 15:18:50,030 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {139854#true} {140417#(< ~counter~0 97)} #96#return; {140417#(< ~counter~0 97)} is VALID [2022-04-15 15:18:50,030 INFO L290 TraceCheckUtils]: 110: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,030 INFO L290 TraceCheckUtils]: 109: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,031 INFO L290 TraceCheckUtils]: 108: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,031 INFO L272 TraceCheckUtils]: 107: Hoare triple {140417#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,031 INFO L290 TraceCheckUtils]: 106: Hoare triple {140417#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {140417#(< ~counter~0 97)} is VALID [2022-04-15 15:18:50,033 INFO L290 TraceCheckUtils]: 105: Hoare triple {140442#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140417#(< ~counter~0 97)} is VALID [2022-04-15 15:18:50,033 INFO L290 TraceCheckUtils]: 104: Hoare triple {140442#(< ~counter~0 96)} assume !!(0 != ~r~0); {140442#(< ~counter~0 96)} is VALID [2022-04-15 15:18:50,034 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {139854#true} {140442#(< ~counter~0 96)} #94#return; {140442#(< ~counter~0 96)} is VALID [2022-04-15 15:18:50,034 INFO L290 TraceCheckUtils]: 102: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,034 INFO L290 TraceCheckUtils]: 101: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,034 INFO L290 TraceCheckUtils]: 100: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,034 INFO L272 TraceCheckUtils]: 99: Hoare triple {140442#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,034 INFO L290 TraceCheckUtils]: 98: Hoare triple {140442#(< ~counter~0 96)} assume !!(#t~post6 < 100);havoc #t~post6; {140442#(< ~counter~0 96)} is VALID [2022-04-15 15:18:50,036 INFO L290 TraceCheckUtils]: 97: Hoare triple {140467#(< ~counter~0 95)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {140442#(< ~counter~0 96)} is VALID [2022-04-15 15:18:50,037 INFO L290 TraceCheckUtils]: 96: Hoare triple {140467#(< ~counter~0 95)} assume !(~r~0 < 0); {140467#(< ~counter~0 95)} is VALID [2022-04-15 15:18:50,037 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {139854#true} {140467#(< ~counter~0 95)} #98#return; {140467#(< ~counter~0 95)} is VALID [2022-04-15 15:18:50,037 INFO L290 TraceCheckUtils]: 94: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,037 INFO L290 TraceCheckUtils]: 93: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,038 INFO L290 TraceCheckUtils]: 92: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,038 INFO L272 TraceCheckUtils]: 91: Hoare triple {140467#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,038 INFO L290 TraceCheckUtils]: 90: Hoare triple {140467#(< ~counter~0 95)} assume !!(#t~post8 < 100);havoc #t~post8; {140467#(< ~counter~0 95)} is VALID [2022-04-15 15:18:50,040 INFO L290 TraceCheckUtils]: 89: Hoare triple {140492#(< ~counter~0 94)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {140467#(< ~counter~0 95)} is VALID [2022-04-15 15:18:50,040 INFO L290 TraceCheckUtils]: 88: Hoare triple {140492#(< ~counter~0 94)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {140492#(< ~counter~0 94)} is VALID [2022-04-15 15:18:50,041 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {139854#true} {140492#(< ~counter~0 94)} #98#return; {140492#(< ~counter~0 94)} is VALID [2022-04-15 15:18:50,041 INFO L290 TraceCheckUtils]: 86: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,041 INFO L290 TraceCheckUtils]: 85: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,041 INFO L290 TraceCheckUtils]: 84: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,041 INFO L272 TraceCheckUtils]: 83: Hoare triple {140492#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,041 INFO L290 TraceCheckUtils]: 82: Hoare triple {140492#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {140492#(< ~counter~0 94)} is VALID [2022-04-15 15:18:50,043 INFO L290 TraceCheckUtils]: 81: Hoare triple {140517#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {140492#(< ~counter~0 94)} is VALID [2022-04-15 15:18:50,044 INFO L290 TraceCheckUtils]: 80: Hoare triple {140517#(< ~counter~0 93)} assume !(~r~0 > 0); {140517#(< ~counter~0 93)} is VALID [2022-04-15 15:18:50,044 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {139854#true} {140517#(< ~counter~0 93)} #96#return; {140517#(< ~counter~0 93)} is VALID [2022-04-15 15:18:50,044 INFO L290 TraceCheckUtils]: 78: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,044 INFO L290 TraceCheckUtils]: 77: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,045 INFO L290 TraceCheckUtils]: 76: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,045 INFO L272 TraceCheckUtils]: 75: Hoare triple {140517#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,045 INFO L290 TraceCheckUtils]: 74: Hoare triple {140517#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {140517#(< ~counter~0 93)} is VALID [2022-04-15 15:18:50,046 INFO L290 TraceCheckUtils]: 73: Hoare triple {140542#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140517#(< ~counter~0 93)} is VALID [2022-04-15 15:18:50,047 INFO L290 TraceCheckUtils]: 72: Hoare triple {140542#(< ~counter~0 92)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140542#(< ~counter~0 92)} is VALID [2022-04-15 15:18:50,047 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {139854#true} {140542#(< ~counter~0 92)} #96#return; {140542#(< ~counter~0 92)} is VALID [2022-04-15 15:18:50,048 INFO L290 TraceCheckUtils]: 70: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,048 INFO L290 TraceCheckUtils]: 69: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,048 INFO L290 TraceCheckUtils]: 68: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,048 INFO L272 TraceCheckUtils]: 67: Hoare triple {140542#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,048 INFO L290 TraceCheckUtils]: 66: Hoare triple {140542#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {140542#(< ~counter~0 92)} is VALID [2022-04-15 15:18:50,050 INFO L290 TraceCheckUtils]: 65: Hoare triple {140567#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140542#(< ~counter~0 92)} is VALID [2022-04-15 15:18:50,050 INFO L290 TraceCheckUtils]: 64: Hoare triple {140567#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {140567#(< ~counter~0 91)} is VALID [2022-04-15 15:18:50,051 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {139854#true} {140567#(< ~counter~0 91)} #96#return; {140567#(< ~counter~0 91)} is VALID [2022-04-15 15:18:50,051 INFO L290 TraceCheckUtils]: 62: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,051 INFO L290 TraceCheckUtils]: 61: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,051 INFO L290 TraceCheckUtils]: 60: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,051 INFO L272 TraceCheckUtils]: 59: Hoare triple {140567#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,052 INFO L290 TraceCheckUtils]: 58: Hoare triple {140567#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {140567#(< ~counter~0 91)} is VALID [2022-04-15 15:18:50,053 INFO L290 TraceCheckUtils]: 57: Hoare triple {140592#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140567#(< ~counter~0 91)} is VALID [2022-04-15 15:18:50,054 INFO L290 TraceCheckUtils]: 56: Hoare triple {140592#(< ~counter~0 90)} assume !!(0 != ~r~0); {140592#(< ~counter~0 90)} is VALID [2022-04-15 15:18:50,054 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {139854#true} {140592#(< ~counter~0 90)} #94#return; {140592#(< ~counter~0 90)} is VALID [2022-04-15 15:18:50,054 INFO L290 TraceCheckUtils]: 54: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,054 INFO L290 TraceCheckUtils]: 53: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,054 INFO L290 TraceCheckUtils]: 52: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,054 INFO L272 TraceCheckUtils]: 51: Hoare triple {140592#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,055 INFO L290 TraceCheckUtils]: 50: Hoare triple {140592#(< ~counter~0 90)} assume !!(#t~post6 < 100);havoc #t~post6; {140592#(< ~counter~0 90)} is VALID [2022-04-15 15:18:50,056 INFO L290 TraceCheckUtils]: 49: Hoare triple {140617#(< ~counter~0 89)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {140592#(< ~counter~0 90)} is VALID [2022-04-15 15:18:50,056 INFO L290 TraceCheckUtils]: 48: Hoare triple {140617#(< ~counter~0 89)} assume !(~r~0 < 0); {140617#(< ~counter~0 89)} is VALID [2022-04-15 15:18:50,057 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {139854#true} {140617#(< ~counter~0 89)} #98#return; {140617#(< ~counter~0 89)} is VALID [2022-04-15 15:18:50,057 INFO L290 TraceCheckUtils]: 46: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,057 INFO L290 TraceCheckUtils]: 45: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,057 INFO L290 TraceCheckUtils]: 44: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,057 INFO L272 TraceCheckUtils]: 43: Hoare triple {140617#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,057 INFO L290 TraceCheckUtils]: 42: Hoare triple {140617#(< ~counter~0 89)} assume !!(#t~post8 < 100);havoc #t~post8; {140617#(< ~counter~0 89)} is VALID [2022-04-15 15:18:50,059 INFO L290 TraceCheckUtils]: 41: Hoare triple {140642#(< ~counter~0 88)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {140617#(< ~counter~0 89)} is VALID [2022-04-15 15:18:50,059 INFO L290 TraceCheckUtils]: 40: Hoare triple {140642#(< ~counter~0 88)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {140642#(< ~counter~0 88)} is VALID [2022-04-15 15:18:50,059 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {139854#true} {140642#(< ~counter~0 88)} #98#return; {140642#(< ~counter~0 88)} is VALID [2022-04-15 15:18:50,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,060 INFO L290 TraceCheckUtils]: 37: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,060 INFO L290 TraceCheckUtils]: 36: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,060 INFO L272 TraceCheckUtils]: 35: Hoare triple {140642#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,060 INFO L290 TraceCheckUtils]: 34: Hoare triple {140642#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {140642#(< ~counter~0 88)} is VALID [2022-04-15 15:18:50,061 INFO L290 TraceCheckUtils]: 33: Hoare triple {140667#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {140642#(< ~counter~0 88)} is VALID [2022-04-15 15:18:50,062 INFO L290 TraceCheckUtils]: 32: Hoare triple {140667#(< ~counter~0 87)} assume !(~r~0 > 0); {140667#(< ~counter~0 87)} is VALID [2022-04-15 15:18:50,062 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {139854#true} {140667#(< ~counter~0 87)} #96#return; {140667#(< ~counter~0 87)} is VALID [2022-04-15 15:18:50,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,062 INFO L272 TraceCheckUtils]: 27: Hoare triple {140667#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,063 INFO L290 TraceCheckUtils]: 26: Hoare triple {140667#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {140667#(< ~counter~0 87)} is VALID [2022-04-15 15:18:50,064 INFO L290 TraceCheckUtils]: 25: Hoare triple {140692#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {140667#(< ~counter~0 87)} is VALID [2022-04-15 15:18:50,064 INFO L290 TraceCheckUtils]: 24: Hoare triple {140692#(< ~counter~0 86)} assume !!(0 != ~r~0); {140692#(< ~counter~0 86)} is VALID [2022-04-15 15:18:50,065 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {139854#true} {140692#(< ~counter~0 86)} #94#return; {140692#(< ~counter~0 86)} is VALID [2022-04-15 15:18:50,065 INFO L290 TraceCheckUtils]: 22: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,065 INFO L272 TraceCheckUtils]: 19: Hoare triple {140692#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {140692#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {140692#(< ~counter~0 86)} is VALID [2022-04-15 15:18:50,067 INFO L290 TraceCheckUtils]: 17: Hoare triple {140717#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {140692#(< ~counter~0 86)} is VALID [2022-04-15 15:18:50,067 INFO L290 TraceCheckUtils]: 16: Hoare triple {140717#(< ~counter~0 85)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {140717#(< ~counter~0 85)} is VALID [2022-04-15 15:18:50,067 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {139854#true} {140717#(< ~counter~0 85)} #92#return; {140717#(< ~counter~0 85)} is VALID [2022-04-15 15:18:50,067 INFO L290 TraceCheckUtils]: 14: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,067 INFO L290 TraceCheckUtils]: 13: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,068 INFO L272 TraceCheckUtils]: 11: Hoare triple {140717#(< ~counter~0 85)} 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)); {139854#true} is VALID [2022-04-15 15:18:50,068 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {139854#true} {140717#(< ~counter~0 85)} #90#return; {140717#(< ~counter~0 85)} is VALID [2022-04-15 15:18:50,068 INFO L290 TraceCheckUtils]: 9: Hoare triple {139854#true} assume true; {139854#true} is VALID [2022-04-15 15:18:50,068 INFO L290 TraceCheckUtils]: 8: Hoare triple {139854#true} assume !(0 == ~cond); {139854#true} is VALID [2022-04-15 15:18:50,068 INFO L290 TraceCheckUtils]: 7: Hoare triple {139854#true} ~cond := #in~cond; {139854#true} is VALID [2022-04-15 15:18:50,068 INFO L272 TraceCheckUtils]: 6: Hoare triple {140717#(< ~counter~0 85)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {139854#true} is VALID [2022-04-15 15:18:50,069 INFO L290 TraceCheckUtils]: 5: Hoare triple {140717#(< ~counter~0 85)} 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; {140717#(< ~counter~0 85)} is VALID [2022-04-15 15:18:50,069 INFO L272 TraceCheckUtils]: 4: Hoare triple {140717#(< ~counter~0 85)} call #t~ret9 := main(); {140717#(< ~counter~0 85)} is VALID [2022-04-15 15:18:50,069 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {140717#(< ~counter~0 85)} {139854#true} #102#return; {140717#(< ~counter~0 85)} is VALID [2022-04-15 15:18:50,069 INFO L290 TraceCheckUtils]: 2: Hoare triple {140717#(< ~counter~0 85)} assume true; {140717#(< ~counter~0 85)} is VALID [2022-04-15 15:18:50,070 INFO L290 TraceCheckUtils]: 1: Hoare triple {139854#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; {140717#(< ~counter~0 85)} is VALID [2022-04-15 15:18:50,070 INFO L272 TraceCheckUtils]: 0: Hoare triple {139854#true} call ULTIMATE.init(); {139854#true} is VALID [2022-04-15 15:18:50,070 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 44 proven. 164 refuted. 0 times theorem prover too weak. 424 trivial. 0 not checked. [2022-04-15 15:18:50,071 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:18:50,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759151816] [2022-04-15 15:18:50,071 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:18:50,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1744640773] [2022-04-15 15:18:50,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1744640773] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:18:50,071 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:18:50,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 36 [2022-04-15 15:18:50,071 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:18:50,071 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1408185613] [2022-04-15 15:18:50,071 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1408185613] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:18:50,071 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:18:50,071 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [19] imperfect sequences [] total 19 [2022-04-15 15:18:50,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1656629195] [2022-04-15 15:18:50,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:18:50,072 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 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 147 [2022-04-15 15:18:50,072 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:18:50,072 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 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-15 15:18:50,225 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:50,225 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-04-15 15:18:50,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:18:50,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-04-15 15:18:50,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=566, Invalid=694, Unknown=0, NotChecked=0, Total=1260 [2022-04-15 15:18:50,226 INFO L87 Difference]: Start difference. First operand 782 states and 1044 transitions. Second operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 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-15 15:18:55,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:55,395 INFO L93 Difference]: Finished difference Result 969 states and 1322 transitions. [2022-04-15 15:18:55,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 15:18:55,396 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 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 147 [2022-04-15 15:18:55,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:18:55,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 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-15 15:18:55,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-15 15:18:55,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 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-15 15:18:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 336 transitions. [2022-04-15 15:18:55,402 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 336 transitions. [2022-04-15 15:18:55,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 336 edges. 336 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:18:55,810 INFO L225 Difference]: With dead ends: 969 [2022-04-15 15:18:55,810 INFO L226 Difference]: Without dead ends: 799 [2022-04-15 15:18:55,811 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 307 GetRequests, 259 SyntacticMatches, 0 SemanticMatches, 48 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 137 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=1042, Invalid=1408, Unknown=0, NotChecked=0, Total=2450 [2022-04-15 15:18:55,811 INFO L913 BasicCegarLoop]: 75 mSDtfsCounter, 310 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 241 mSolverCounterSat, 273 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 310 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 514 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 273 IncrementalHoareTripleChecker+Valid, 241 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 15:18:55,812 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [310 Valid, 313 Invalid, 514 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [273 Valid, 241 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 15:18:55,812 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-04-15 15:18:58,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 799. [2022-04-15 15:18:58,824 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:18:58,825 INFO L82 GeneralOperation]: Start isEquivalent. First operand 799 states. Second operand has 799 states, 602 states have (on average 1.181063122923588) internal successors, (711), 609 states have internal predecessors, (711), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:58,826 INFO L74 IsIncluded]: Start isIncluded. First operand 799 states. Second operand has 799 states, 602 states have (on average 1.181063122923588) internal successors, (711), 609 states have internal predecessors, (711), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:58,826 INFO L87 Difference]: Start difference. First operand 799 states. Second operand has 799 states, 602 states have (on average 1.181063122923588) internal successors, (711), 609 states have internal predecessors, (711), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:58,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:58,847 INFO L93 Difference]: Finished difference Result 799 states and 1061 transitions. [2022-04-15 15:18:58,847 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1061 transitions. [2022-04-15 15:18:58,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:58,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:58,849 INFO L74 IsIncluded]: Start isIncluded. First operand has 799 states, 602 states have (on average 1.181063122923588) internal successors, (711), 609 states have internal predecessors, (711), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 799 states. [2022-04-15 15:18:58,850 INFO L87 Difference]: Start difference. First operand has 799 states, 602 states have (on average 1.181063122923588) internal successors, (711), 609 states have internal predecessors, (711), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) Second operand 799 states. [2022-04-15 15:18:58,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:18:58,882 INFO L93 Difference]: Finished difference Result 799 states and 1061 transitions. [2022-04-15 15:18:58,882 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1061 transitions. [2022-04-15 15:18:58,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:18:58,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:18:58,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:18:58,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:18:58,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 799 states, 602 states have (on average 1.181063122923588) internal successors, (711), 609 states have internal predecessors, (711), 176 states have call successors, (176), 22 states have call predecessors, (176), 20 states have return successors, (174), 167 states have call predecessors, (174), 174 states have call successors, (174) [2022-04-15 15:18:58,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 799 states to 799 states and 1061 transitions. [2022-04-15 15:18:58,931 INFO L78 Accepts]: Start accepts. Automaton has 799 states and 1061 transitions. Word has length 147 [2022-04-15 15:18:58,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:18:58,931 INFO L478 AbstractCegarLoop]: Abstraction has 799 states and 1061 transitions. [2022-04-15 15:18:58,931 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 5.578947368421052) internal successors, (106), 18 states have internal predecessors, (106), 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-15 15:18:58,931 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 799 states and 1061 transitions. [2022-04-15 15:19:06,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1061 edges. 1060 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:06,994 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 1061 transitions. [2022-04-15 15:19:06,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 152 [2022-04-15 15:19:06,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:19:06,996 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 7, 7, 7, 7, 6, 6, 6, 6, 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-15 15:19:07,019 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (52)] Ended with exit code 0 [2022-04-15 15:19:07,196 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable50,52 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:07,197 INFO L403 AbstractCegarLoop]: === Iteration 52 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:19:07,197 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:19:07,197 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 15 times [2022-04-15 15:19:07,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:07,197 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [710037878] [2022-04-15 15:19:07,198 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:19:07,198 INFO L85 PathProgramCache]: Analyzing trace with hash -913503479, now seen corresponding path program 16 times [2022-04-15 15:19:07,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:19:07,198 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829933348] [2022-04-15 15:19:07,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:19:07,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:19:07,214 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:19:07,215 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [496465862] [2022-04-15 15:19:07,215 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:19:07,215 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:07,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:19:07,216 INFO L229 MonitoredProcess]: Starting monitored process 53 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:19:07,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Waiting until timeout for monitored process [2022-04-15 15:19:07,338 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:19:07,338 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:19:07,340 INFO L263 TraceCheckSpWp]: Trace formula consists of 361 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 15:19:07,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:19:07,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:19:08,199 INFO L272 TraceCheckUtils]: 0: Hoare triple {145933#true} call ULTIMATE.init(); {145933#true} is VALID [2022-04-15 15:19:08,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {145933#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; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {145941#(<= ~counter~0 0)} assume true; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,200 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {145941#(<= ~counter~0 0)} {145933#true} #102#return; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,200 INFO L272 TraceCheckUtils]: 4: Hoare triple {145941#(<= ~counter~0 0)} call #t~ret9 := main(); {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,200 INFO L290 TraceCheckUtils]: 5: Hoare triple {145941#(<= ~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; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,201 INFO L272 TraceCheckUtils]: 6: Hoare triple {145941#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,201 INFO L290 TraceCheckUtils]: 7: Hoare triple {145941#(<= ~counter~0 0)} ~cond := #in~cond; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {145941#(<= ~counter~0 0)} assume !(0 == ~cond); {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,202 INFO L290 TraceCheckUtils]: 9: Hoare triple {145941#(<= ~counter~0 0)} assume true; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,202 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {145941#(<= ~counter~0 0)} {145941#(<= ~counter~0 0)} #90#return; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,203 INFO L272 TraceCheckUtils]: 11: Hoare triple {145941#(<= ~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)); {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,203 INFO L290 TraceCheckUtils]: 12: Hoare triple {145941#(<= ~counter~0 0)} ~cond := #in~cond; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,203 INFO L290 TraceCheckUtils]: 13: Hoare triple {145941#(<= ~counter~0 0)} assume !(0 == ~cond); {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,203 INFO L290 TraceCheckUtils]: 14: Hoare triple {145941#(<= ~counter~0 0)} assume true; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,204 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {145941#(<= ~counter~0 0)} {145941#(<= ~counter~0 0)} #92#return; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {145941#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {145941#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:08,207 INFO L290 TraceCheckUtils]: 17: Hoare triple {145941#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {145990#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,207 INFO L290 TraceCheckUtils]: 18: Hoare triple {145990#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {145990#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,208 INFO L272 TraceCheckUtils]: 19: Hoare triple {145990#(<= ~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)); {145990#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {145990#(<= ~counter~0 1)} ~cond := #in~cond; {145990#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,208 INFO L290 TraceCheckUtils]: 21: Hoare triple {145990#(<= ~counter~0 1)} assume !(0 == ~cond); {145990#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,209 INFO L290 TraceCheckUtils]: 22: Hoare triple {145990#(<= ~counter~0 1)} assume true; {145990#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,209 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {145990#(<= ~counter~0 1)} {145990#(<= ~counter~0 1)} #94#return; {145990#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,209 INFO L290 TraceCheckUtils]: 24: Hoare triple {145990#(<= ~counter~0 1)} assume !!(0 != ~r~0); {145990#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:08,211 INFO L290 TraceCheckUtils]: 25: Hoare triple {145990#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146015#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,211 INFO L290 TraceCheckUtils]: 26: Hoare triple {146015#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {146015#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,211 INFO L272 TraceCheckUtils]: 27: Hoare triple {146015#(<= ~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)); {146015#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,212 INFO L290 TraceCheckUtils]: 28: Hoare triple {146015#(<= ~counter~0 2)} ~cond := #in~cond; {146015#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,212 INFO L290 TraceCheckUtils]: 29: Hoare triple {146015#(<= ~counter~0 2)} assume !(0 == ~cond); {146015#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,212 INFO L290 TraceCheckUtils]: 30: Hoare triple {146015#(<= ~counter~0 2)} assume true; {146015#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,213 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {146015#(<= ~counter~0 2)} {146015#(<= ~counter~0 2)} #96#return; {146015#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,213 INFO L290 TraceCheckUtils]: 32: Hoare triple {146015#(<= ~counter~0 2)} assume !(~r~0 > 0); {146015#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:08,214 INFO L290 TraceCheckUtils]: 33: Hoare triple {146015#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146040#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,215 INFO L290 TraceCheckUtils]: 34: Hoare triple {146040#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {146040#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,215 INFO L272 TraceCheckUtils]: 35: Hoare triple {146040#(<= ~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)); {146040#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,215 INFO L290 TraceCheckUtils]: 36: Hoare triple {146040#(<= ~counter~0 3)} ~cond := #in~cond; {146040#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,216 INFO L290 TraceCheckUtils]: 37: Hoare triple {146040#(<= ~counter~0 3)} assume !(0 == ~cond); {146040#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,216 INFO L290 TraceCheckUtils]: 38: Hoare triple {146040#(<= ~counter~0 3)} assume true; {146040#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,216 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {146040#(<= ~counter~0 3)} {146040#(<= ~counter~0 3)} #98#return; {146040#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,217 INFO L290 TraceCheckUtils]: 40: Hoare triple {146040#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {146040#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:08,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {146040#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146065#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {146065#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {146065#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,219 INFO L272 TraceCheckUtils]: 43: Hoare triple {146065#(<= ~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)); {146065#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,219 INFO L290 TraceCheckUtils]: 44: Hoare triple {146065#(<= ~counter~0 4)} ~cond := #in~cond; {146065#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,219 INFO L290 TraceCheckUtils]: 45: Hoare triple {146065#(<= ~counter~0 4)} assume !(0 == ~cond); {146065#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,220 INFO L290 TraceCheckUtils]: 46: Hoare triple {146065#(<= ~counter~0 4)} assume true; {146065#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,220 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {146065#(<= ~counter~0 4)} {146065#(<= ~counter~0 4)} #98#return; {146065#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,220 INFO L290 TraceCheckUtils]: 48: Hoare triple {146065#(<= ~counter~0 4)} assume !(~r~0 < 0); {146065#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:08,222 INFO L290 TraceCheckUtils]: 49: Hoare triple {146065#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {146090#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,222 INFO L290 TraceCheckUtils]: 50: Hoare triple {146090#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {146090#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,223 INFO L272 TraceCheckUtils]: 51: Hoare triple {146090#(<= ~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)); {146090#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,223 INFO L290 TraceCheckUtils]: 52: Hoare triple {146090#(<= ~counter~0 5)} ~cond := #in~cond; {146090#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,223 INFO L290 TraceCheckUtils]: 53: Hoare triple {146090#(<= ~counter~0 5)} assume !(0 == ~cond); {146090#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,223 INFO L290 TraceCheckUtils]: 54: Hoare triple {146090#(<= ~counter~0 5)} assume true; {146090#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,233 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {146090#(<= ~counter~0 5)} {146090#(<= ~counter~0 5)} #94#return; {146090#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,233 INFO L290 TraceCheckUtils]: 56: Hoare triple {146090#(<= ~counter~0 5)} assume !!(0 != ~r~0); {146090#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:08,236 INFO L290 TraceCheckUtils]: 57: Hoare triple {146090#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146115#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,236 INFO L290 TraceCheckUtils]: 58: Hoare triple {146115#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {146115#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,237 INFO L272 TraceCheckUtils]: 59: Hoare triple {146115#(<= ~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)); {146115#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,237 INFO L290 TraceCheckUtils]: 60: Hoare triple {146115#(<= ~counter~0 6)} ~cond := #in~cond; {146115#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,237 INFO L290 TraceCheckUtils]: 61: Hoare triple {146115#(<= ~counter~0 6)} assume !(0 == ~cond); {146115#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,238 INFO L290 TraceCheckUtils]: 62: Hoare triple {146115#(<= ~counter~0 6)} assume true; {146115#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,238 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {146115#(<= ~counter~0 6)} {146115#(<= ~counter~0 6)} #96#return; {146115#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,239 INFO L290 TraceCheckUtils]: 64: Hoare triple {146115#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {146115#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:08,240 INFO L290 TraceCheckUtils]: 65: Hoare triple {146115#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146140#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,240 INFO L290 TraceCheckUtils]: 66: Hoare triple {146140#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {146140#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,241 INFO L272 TraceCheckUtils]: 67: Hoare triple {146140#(<= ~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)); {146140#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,241 INFO L290 TraceCheckUtils]: 68: Hoare triple {146140#(<= ~counter~0 7)} ~cond := #in~cond; {146140#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,241 INFO L290 TraceCheckUtils]: 69: Hoare triple {146140#(<= ~counter~0 7)} assume !(0 == ~cond); {146140#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,241 INFO L290 TraceCheckUtils]: 70: Hoare triple {146140#(<= ~counter~0 7)} assume true; {146140#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,242 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {146140#(<= ~counter~0 7)} {146140#(<= ~counter~0 7)} #96#return; {146140#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,242 INFO L290 TraceCheckUtils]: 72: Hoare triple {146140#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {146140#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:08,243 INFO L290 TraceCheckUtils]: 73: Hoare triple {146140#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146165#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,244 INFO L290 TraceCheckUtils]: 74: Hoare triple {146165#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {146165#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,244 INFO L272 TraceCheckUtils]: 75: Hoare triple {146165#(<= ~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)); {146165#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,244 INFO L290 TraceCheckUtils]: 76: Hoare triple {146165#(<= ~counter~0 8)} ~cond := #in~cond; {146165#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,245 INFO L290 TraceCheckUtils]: 77: Hoare triple {146165#(<= ~counter~0 8)} assume !(0 == ~cond); {146165#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,245 INFO L290 TraceCheckUtils]: 78: Hoare triple {146165#(<= ~counter~0 8)} assume true; {146165#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,245 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {146165#(<= ~counter~0 8)} {146165#(<= ~counter~0 8)} #96#return; {146165#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,246 INFO L290 TraceCheckUtils]: 80: Hoare triple {146165#(<= ~counter~0 8)} assume !(~r~0 > 0); {146165#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:08,247 INFO L290 TraceCheckUtils]: 81: Hoare triple {146165#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146190#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,247 INFO L290 TraceCheckUtils]: 82: Hoare triple {146190#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {146190#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,248 INFO L272 TraceCheckUtils]: 83: Hoare triple {146190#(<= ~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)); {146190#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,248 INFO L290 TraceCheckUtils]: 84: Hoare triple {146190#(<= ~counter~0 9)} ~cond := #in~cond; {146190#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,248 INFO L290 TraceCheckUtils]: 85: Hoare triple {146190#(<= ~counter~0 9)} assume !(0 == ~cond); {146190#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,249 INFO L290 TraceCheckUtils]: 86: Hoare triple {146190#(<= ~counter~0 9)} assume true; {146190#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,249 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {146190#(<= ~counter~0 9)} {146190#(<= ~counter~0 9)} #98#return; {146190#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,249 INFO L290 TraceCheckUtils]: 88: Hoare triple {146190#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {146190#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:08,251 INFO L290 TraceCheckUtils]: 89: Hoare triple {146190#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146215#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,251 INFO L290 TraceCheckUtils]: 90: Hoare triple {146215#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {146215#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,251 INFO L272 TraceCheckUtils]: 91: Hoare triple {146215#(<= ~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)); {146215#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,252 INFO L290 TraceCheckUtils]: 92: Hoare triple {146215#(<= ~counter~0 10)} ~cond := #in~cond; {146215#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,252 INFO L290 TraceCheckUtils]: 93: Hoare triple {146215#(<= ~counter~0 10)} assume !(0 == ~cond); {146215#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,252 INFO L290 TraceCheckUtils]: 94: Hoare triple {146215#(<= ~counter~0 10)} assume true; {146215#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,253 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {146215#(<= ~counter~0 10)} {146215#(<= ~counter~0 10)} #98#return; {146215#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,253 INFO L290 TraceCheckUtils]: 96: Hoare triple {146215#(<= ~counter~0 10)} assume !(~r~0 < 0); {146215#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:08,254 INFO L290 TraceCheckUtils]: 97: Hoare triple {146215#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {146240#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,254 INFO L290 TraceCheckUtils]: 98: Hoare triple {146240#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {146240#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,255 INFO L272 TraceCheckUtils]: 99: Hoare triple {146240#(<= ~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)); {146240#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,255 INFO L290 TraceCheckUtils]: 100: Hoare triple {146240#(<= ~counter~0 11)} ~cond := #in~cond; {146240#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,256 INFO L290 TraceCheckUtils]: 101: Hoare triple {146240#(<= ~counter~0 11)} assume !(0 == ~cond); {146240#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,256 INFO L290 TraceCheckUtils]: 102: Hoare triple {146240#(<= ~counter~0 11)} assume true; {146240#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,256 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {146240#(<= ~counter~0 11)} {146240#(<= ~counter~0 11)} #94#return; {146240#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,257 INFO L290 TraceCheckUtils]: 104: Hoare triple {146240#(<= ~counter~0 11)} assume !!(0 != ~r~0); {146240#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:08,258 INFO L290 TraceCheckUtils]: 105: Hoare triple {146240#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146265#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,258 INFO L290 TraceCheckUtils]: 106: Hoare triple {146265#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {146265#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,259 INFO L272 TraceCheckUtils]: 107: Hoare triple {146265#(<= ~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)); {146265#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,259 INFO L290 TraceCheckUtils]: 108: Hoare triple {146265#(<= ~counter~0 12)} ~cond := #in~cond; {146265#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,259 INFO L290 TraceCheckUtils]: 109: Hoare triple {146265#(<= ~counter~0 12)} assume !(0 == ~cond); {146265#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,259 INFO L290 TraceCheckUtils]: 110: Hoare triple {146265#(<= ~counter~0 12)} assume true; {146265#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,260 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {146265#(<= ~counter~0 12)} {146265#(<= ~counter~0 12)} #96#return; {146265#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,260 INFO L290 TraceCheckUtils]: 112: Hoare triple {146265#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {146265#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:08,262 INFO L290 TraceCheckUtils]: 113: Hoare triple {146265#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146290#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,262 INFO L290 TraceCheckUtils]: 114: Hoare triple {146290#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {146290#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,262 INFO L272 TraceCheckUtils]: 115: Hoare triple {146290#(<= ~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)); {146290#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,263 INFO L290 TraceCheckUtils]: 116: Hoare triple {146290#(<= ~counter~0 13)} ~cond := #in~cond; {146290#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,263 INFO L290 TraceCheckUtils]: 117: Hoare triple {146290#(<= ~counter~0 13)} assume !(0 == ~cond); {146290#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,263 INFO L290 TraceCheckUtils]: 118: Hoare triple {146290#(<= ~counter~0 13)} assume true; {146290#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,264 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {146290#(<= ~counter~0 13)} {146290#(<= ~counter~0 13)} #96#return; {146290#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,264 INFO L290 TraceCheckUtils]: 120: Hoare triple {146290#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {146290#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:08,265 INFO L290 TraceCheckUtils]: 121: Hoare triple {146290#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146315#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,265 INFO L290 TraceCheckUtils]: 122: Hoare triple {146315#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {146315#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,266 INFO L272 TraceCheckUtils]: 123: Hoare triple {146315#(<= ~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)); {146315#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,266 INFO L290 TraceCheckUtils]: 124: Hoare triple {146315#(<= ~counter~0 14)} ~cond := #in~cond; {146315#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,266 INFO L290 TraceCheckUtils]: 125: Hoare triple {146315#(<= ~counter~0 14)} assume !(0 == ~cond); {146315#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,267 INFO L290 TraceCheckUtils]: 126: Hoare triple {146315#(<= ~counter~0 14)} assume true; {146315#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,267 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {146315#(<= ~counter~0 14)} {146315#(<= ~counter~0 14)} #96#return; {146315#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,267 INFO L290 TraceCheckUtils]: 128: Hoare triple {146315#(<= ~counter~0 14)} assume !(~r~0 > 0); {146315#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:08,269 INFO L290 TraceCheckUtils]: 129: Hoare triple {146315#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146340#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:08,269 INFO L290 TraceCheckUtils]: 130: Hoare triple {146340#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {146340#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:08,270 INFO L272 TraceCheckUtils]: 131: Hoare triple {146340#(<= ~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)); {146340#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:08,270 INFO L290 TraceCheckUtils]: 132: Hoare triple {146340#(<= ~counter~0 15)} ~cond := #in~cond; {146340#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:08,270 INFO L290 TraceCheckUtils]: 133: Hoare triple {146340#(<= ~counter~0 15)} assume !(0 == ~cond); {146340#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:08,270 INFO L290 TraceCheckUtils]: 134: Hoare triple {146340#(<= ~counter~0 15)} assume true; {146340#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:08,271 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {146340#(<= ~counter~0 15)} {146340#(<= ~counter~0 15)} #98#return; {146340#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:08,271 INFO L290 TraceCheckUtils]: 136: Hoare triple {146340#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {146340#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:08,272 INFO L290 TraceCheckUtils]: 137: Hoare triple {146340#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146365#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:08,273 INFO L290 TraceCheckUtils]: 138: Hoare triple {146365#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {146365#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:08,273 INFO L272 TraceCheckUtils]: 139: Hoare triple {146365#(<= ~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)); {146365#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:08,273 INFO L290 TraceCheckUtils]: 140: Hoare triple {146365#(<= ~counter~0 16)} ~cond := #in~cond; {146365#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:08,274 INFO L290 TraceCheckUtils]: 141: Hoare triple {146365#(<= ~counter~0 16)} assume !(0 == ~cond); {146365#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:08,274 INFO L290 TraceCheckUtils]: 142: Hoare triple {146365#(<= ~counter~0 16)} assume true; {146365#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:08,274 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {146365#(<= ~counter~0 16)} {146365#(<= ~counter~0 16)} #98#return; {146365#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:08,275 INFO L290 TraceCheckUtils]: 144: Hoare triple {146365#(<= ~counter~0 16)} assume !(~r~0 < 0); {146365#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:08,275 INFO L290 TraceCheckUtils]: 145: Hoare triple {146365#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {146390#(<= |main_#t~post6| 16)} is VALID [2022-04-15 15:19:08,275 INFO L290 TraceCheckUtils]: 146: Hoare triple {146390#(<= |main_#t~post6| 16)} assume !(#t~post6 < 100);havoc #t~post6; {145934#false} is VALID [2022-04-15 15:19:08,275 INFO L272 TraceCheckUtils]: 147: Hoare triple {145934#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)); {145934#false} is VALID [2022-04-15 15:19:08,276 INFO L290 TraceCheckUtils]: 148: Hoare triple {145934#false} ~cond := #in~cond; {145934#false} is VALID [2022-04-15 15:19:08,276 INFO L290 TraceCheckUtils]: 149: Hoare triple {145934#false} assume 0 == ~cond; {145934#false} is VALID [2022-04-15 15:19:08,276 INFO L290 TraceCheckUtils]: 150: Hoare triple {145934#false} assume !false; {145934#false} is VALID [2022-04-15 15:19:08,276 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 642 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:19:08,276 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:19:09,422 INFO L290 TraceCheckUtils]: 150: Hoare triple {145934#false} assume !false; {145934#false} is VALID [2022-04-15 15:19:09,422 INFO L290 TraceCheckUtils]: 149: Hoare triple {145934#false} assume 0 == ~cond; {145934#false} is VALID [2022-04-15 15:19:09,422 INFO L290 TraceCheckUtils]: 148: Hoare triple {145934#false} ~cond := #in~cond; {145934#false} is VALID [2022-04-15 15:19:09,422 INFO L272 TraceCheckUtils]: 147: Hoare triple {145934#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)); {145934#false} is VALID [2022-04-15 15:19:09,423 INFO L290 TraceCheckUtils]: 146: Hoare triple {146418#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {145934#false} is VALID [2022-04-15 15:19:09,423 INFO L290 TraceCheckUtils]: 145: Hoare triple {146422#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {146418#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:19:09,423 INFO L290 TraceCheckUtils]: 144: Hoare triple {146422#(< ~counter~0 100)} assume !(~r~0 < 0); {146422#(< ~counter~0 100)} is VALID [2022-04-15 15:19:09,424 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {145933#true} {146422#(< ~counter~0 100)} #98#return; {146422#(< ~counter~0 100)} is VALID [2022-04-15 15:19:09,424 INFO L290 TraceCheckUtils]: 142: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,424 INFO L290 TraceCheckUtils]: 141: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,424 INFO L290 TraceCheckUtils]: 140: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,424 INFO L272 TraceCheckUtils]: 139: Hoare triple {146422#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,424 INFO L290 TraceCheckUtils]: 138: Hoare triple {146422#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {146422#(< ~counter~0 100)} is VALID [2022-04-15 15:19:09,427 INFO L290 TraceCheckUtils]: 137: Hoare triple {146447#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146422#(< ~counter~0 100)} is VALID [2022-04-15 15:19:09,428 INFO L290 TraceCheckUtils]: 136: Hoare triple {146447#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {146447#(< ~counter~0 99)} is VALID [2022-04-15 15:19:09,428 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {145933#true} {146447#(< ~counter~0 99)} #98#return; {146447#(< ~counter~0 99)} is VALID [2022-04-15 15:19:09,428 INFO L290 TraceCheckUtils]: 134: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,428 INFO L290 TraceCheckUtils]: 133: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,428 INFO L290 TraceCheckUtils]: 132: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,428 INFO L272 TraceCheckUtils]: 131: Hoare triple {146447#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,429 INFO L290 TraceCheckUtils]: 130: Hoare triple {146447#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {146447#(< ~counter~0 99)} is VALID [2022-04-15 15:19:09,430 INFO L290 TraceCheckUtils]: 129: Hoare triple {146472#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146447#(< ~counter~0 99)} is VALID [2022-04-15 15:19:09,430 INFO L290 TraceCheckUtils]: 128: Hoare triple {146472#(< ~counter~0 98)} assume !(~r~0 > 0); {146472#(< ~counter~0 98)} is VALID [2022-04-15 15:19:09,431 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {145933#true} {146472#(< ~counter~0 98)} #96#return; {146472#(< ~counter~0 98)} is VALID [2022-04-15 15:19:09,431 INFO L290 TraceCheckUtils]: 126: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,431 INFO L290 TraceCheckUtils]: 125: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,431 INFO L290 TraceCheckUtils]: 124: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,431 INFO L272 TraceCheckUtils]: 123: Hoare triple {146472#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,431 INFO L290 TraceCheckUtils]: 122: Hoare triple {146472#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {146472#(< ~counter~0 98)} is VALID [2022-04-15 15:19:09,432 INFO L290 TraceCheckUtils]: 121: Hoare triple {146497#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146472#(< ~counter~0 98)} is VALID [2022-04-15 15:19:09,433 INFO L290 TraceCheckUtils]: 120: Hoare triple {146497#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {146497#(< ~counter~0 97)} is VALID [2022-04-15 15:19:09,433 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {145933#true} {146497#(< ~counter~0 97)} #96#return; {146497#(< ~counter~0 97)} is VALID [2022-04-15 15:19:09,433 INFO L290 TraceCheckUtils]: 118: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,433 INFO L290 TraceCheckUtils]: 117: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,434 INFO L290 TraceCheckUtils]: 116: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,434 INFO L272 TraceCheckUtils]: 115: Hoare triple {146497#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,434 INFO L290 TraceCheckUtils]: 114: Hoare triple {146497#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {146497#(< ~counter~0 97)} is VALID [2022-04-15 15:19:09,435 INFO L290 TraceCheckUtils]: 113: Hoare triple {146522#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146497#(< ~counter~0 97)} is VALID [2022-04-15 15:19:09,435 INFO L290 TraceCheckUtils]: 112: Hoare triple {146522#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {146522#(< ~counter~0 96)} is VALID [2022-04-15 15:19:09,436 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {145933#true} {146522#(< ~counter~0 96)} #96#return; {146522#(< ~counter~0 96)} is VALID [2022-04-15 15:19:09,436 INFO L290 TraceCheckUtils]: 110: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,436 INFO L290 TraceCheckUtils]: 109: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,436 INFO L290 TraceCheckUtils]: 108: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,436 INFO L272 TraceCheckUtils]: 107: Hoare triple {146522#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,443 INFO L290 TraceCheckUtils]: 106: Hoare triple {146522#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {146522#(< ~counter~0 96)} is VALID [2022-04-15 15:19:09,446 INFO L290 TraceCheckUtils]: 105: Hoare triple {146547#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146522#(< ~counter~0 96)} is VALID [2022-04-15 15:19:09,446 INFO L290 TraceCheckUtils]: 104: Hoare triple {146547#(< ~counter~0 95)} assume !!(0 != ~r~0); {146547#(< ~counter~0 95)} is VALID [2022-04-15 15:19:09,447 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {145933#true} {146547#(< ~counter~0 95)} #94#return; {146547#(< ~counter~0 95)} is VALID [2022-04-15 15:19:09,447 INFO L290 TraceCheckUtils]: 102: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,447 INFO L290 TraceCheckUtils]: 101: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,447 INFO L290 TraceCheckUtils]: 100: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,447 INFO L272 TraceCheckUtils]: 99: Hoare triple {146547#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,447 INFO L290 TraceCheckUtils]: 98: Hoare triple {146547#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {146547#(< ~counter~0 95)} is VALID [2022-04-15 15:19:09,448 INFO L290 TraceCheckUtils]: 97: Hoare triple {146572#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {146547#(< ~counter~0 95)} is VALID [2022-04-15 15:19:09,449 INFO L290 TraceCheckUtils]: 96: Hoare triple {146572#(< ~counter~0 94)} assume !(~r~0 < 0); {146572#(< ~counter~0 94)} is VALID [2022-04-15 15:19:09,449 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {145933#true} {146572#(< ~counter~0 94)} #98#return; {146572#(< ~counter~0 94)} is VALID [2022-04-15 15:19:09,449 INFO L290 TraceCheckUtils]: 94: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,449 INFO L290 TraceCheckUtils]: 93: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,449 INFO L290 TraceCheckUtils]: 92: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,450 INFO L272 TraceCheckUtils]: 91: Hoare triple {146572#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,450 INFO L290 TraceCheckUtils]: 90: Hoare triple {146572#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {146572#(< ~counter~0 94)} is VALID [2022-04-15 15:19:09,451 INFO L290 TraceCheckUtils]: 89: Hoare triple {146597#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146572#(< ~counter~0 94)} is VALID [2022-04-15 15:19:09,451 INFO L290 TraceCheckUtils]: 88: Hoare triple {146597#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {146597#(< ~counter~0 93)} is VALID [2022-04-15 15:19:09,452 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {145933#true} {146597#(< ~counter~0 93)} #98#return; {146597#(< ~counter~0 93)} is VALID [2022-04-15 15:19:09,452 INFO L290 TraceCheckUtils]: 86: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,452 INFO L290 TraceCheckUtils]: 85: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,452 INFO L290 TraceCheckUtils]: 84: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,452 INFO L272 TraceCheckUtils]: 83: Hoare triple {146597#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,452 INFO L290 TraceCheckUtils]: 82: Hoare triple {146597#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {146597#(< ~counter~0 93)} is VALID [2022-04-15 15:19:09,454 INFO L290 TraceCheckUtils]: 81: Hoare triple {146622#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146597#(< ~counter~0 93)} is VALID [2022-04-15 15:19:09,454 INFO L290 TraceCheckUtils]: 80: Hoare triple {146622#(< ~counter~0 92)} assume !(~r~0 > 0); {146622#(< ~counter~0 92)} is VALID [2022-04-15 15:19:09,454 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {145933#true} {146622#(< ~counter~0 92)} #96#return; {146622#(< ~counter~0 92)} is VALID [2022-04-15 15:19:09,454 INFO L290 TraceCheckUtils]: 78: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,454 INFO L290 TraceCheckUtils]: 77: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,455 INFO L290 TraceCheckUtils]: 76: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,455 INFO L272 TraceCheckUtils]: 75: Hoare triple {146622#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,455 INFO L290 TraceCheckUtils]: 74: Hoare triple {146622#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {146622#(< ~counter~0 92)} is VALID [2022-04-15 15:19:09,456 INFO L290 TraceCheckUtils]: 73: Hoare triple {146647#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146622#(< ~counter~0 92)} is VALID [2022-04-15 15:19:09,456 INFO L290 TraceCheckUtils]: 72: Hoare triple {146647#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {146647#(< ~counter~0 91)} is VALID [2022-04-15 15:19:09,457 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {145933#true} {146647#(< ~counter~0 91)} #96#return; {146647#(< ~counter~0 91)} is VALID [2022-04-15 15:19:09,457 INFO L290 TraceCheckUtils]: 70: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,457 INFO L290 TraceCheckUtils]: 69: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,457 INFO L290 TraceCheckUtils]: 68: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,457 INFO L272 TraceCheckUtils]: 67: Hoare triple {146647#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,457 INFO L290 TraceCheckUtils]: 66: Hoare triple {146647#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {146647#(< ~counter~0 91)} is VALID [2022-04-15 15:19:09,459 INFO L290 TraceCheckUtils]: 65: Hoare triple {146672#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146647#(< ~counter~0 91)} is VALID [2022-04-15 15:19:09,459 INFO L290 TraceCheckUtils]: 64: Hoare triple {146672#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {146672#(< ~counter~0 90)} is VALID [2022-04-15 15:19:09,460 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {145933#true} {146672#(< ~counter~0 90)} #96#return; {146672#(< ~counter~0 90)} is VALID [2022-04-15 15:19:09,460 INFO L290 TraceCheckUtils]: 62: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,460 INFO L290 TraceCheckUtils]: 61: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,460 INFO L290 TraceCheckUtils]: 60: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,460 INFO L272 TraceCheckUtils]: 59: Hoare triple {146672#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,460 INFO L290 TraceCheckUtils]: 58: Hoare triple {146672#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {146672#(< ~counter~0 90)} is VALID [2022-04-15 15:19:09,462 INFO L290 TraceCheckUtils]: 57: Hoare triple {146697#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146672#(< ~counter~0 90)} is VALID [2022-04-15 15:19:09,462 INFO L290 TraceCheckUtils]: 56: Hoare triple {146697#(< ~counter~0 89)} assume !!(0 != ~r~0); {146697#(< ~counter~0 89)} is VALID [2022-04-15 15:19:09,462 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {145933#true} {146697#(< ~counter~0 89)} #94#return; {146697#(< ~counter~0 89)} is VALID [2022-04-15 15:19:09,462 INFO L290 TraceCheckUtils]: 54: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,462 INFO L290 TraceCheckUtils]: 53: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,463 INFO L290 TraceCheckUtils]: 52: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,463 INFO L272 TraceCheckUtils]: 51: Hoare triple {146697#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,463 INFO L290 TraceCheckUtils]: 50: Hoare triple {146697#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {146697#(< ~counter~0 89)} is VALID [2022-04-15 15:19:09,464 INFO L290 TraceCheckUtils]: 49: Hoare triple {146722#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {146697#(< ~counter~0 89)} is VALID [2022-04-15 15:19:09,464 INFO L290 TraceCheckUtils]: 48: Hoare triple {146722#(< ~counter~0 88)} assume !(~r~0 < 0); {146722#(< ~counter~0 88)} is VALID [2022-04-15 15:19:09,465 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {145933#true} {146722#(< ~counter~0 88)} #98#return; {146722#(< ~counter~0 88)} is VALID [2022-04-15 15:19:09,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,465 INFO L290 TraceCheckUtils]: 44: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,465 INFO L272 TraceCheckUtils]: 43: Hoare triple {146722#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,466 INFO L290 TraceCheckUtils]: 42: Hoare triple {146722#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {146722#(< ~counter~0 88)} is VALID [2022-04-15 15:19:09,467 INFO L290 TraceCheckUtils]: 41: Hoare triple {146747#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146722#(< ~counter~0 88)} is VALID [2022-04-15 15:19:09,467 INFO L290 TraceCheckUtils]: 40: Hoare triple {146747#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {146747#(< ~counter~0 87)} is VALID [2022-04-15 15:19:09,468 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {145933#true} {146747#(< ~counter~0 87)} #98#return; {146747#(< ~counter~0 87)} is VALID [2022-04-15 15:19:09,468 INFO L290 TraceCheckUtils]: 38: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,468 INFO L290 TraceCheckUtils]: 37: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,468 INFO L290 TraceCheckUtils]: 36: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,468 INFO L272 TraceCheckUtils]: 35: Hoare triple {146747#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,468 INFO L290 TraceCheckUtils]: 34: Hoare triple {146747#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {146747#(< ~counter~0 87)} is VALID [2022-04-15 15:19:09,469 INFO L290 TraceCheckUtils]: 33: Hoare triple {146772#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {146747#(< ~counter~0 87)} is VALID [2022-04-15 15:19:09,470 INFO L290 TraceCheckUtils]: 32: Hoare triple {146772#(< ~counter~0 86)} assume !(~r~0 > 0); {146772#(< ~counter~0 86)} is VALID [2022-04-15 15:19:09,470 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {145933#true} {146772#(< ~counter~0 86)} #96#return; {146772#(< ~counter~0 86)} is VALID [2022-04-15 15:19:09,470 INFO L290 TraceCheckUtils]: 30: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,470 INFO L290 TraceCheckUtils]: 29: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,470 INFO L290 TraceCheckUtils]: 28: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,470 INFO L272 TraceCheckUtils]: 27: Hoare triple {146772#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {146772#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {146772#(< ~counter~0 86)} is VALID [2022-04-15 15:19:09,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {146797#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {146772#(< ~counter~0 86)} is VALID [2022-04-15 15:19:09,472 INFO L290 TraceCheckUtils]: 24: Hoare triple {146797#(< ~counter~0 85)} assume !!(0 != ~r~0); {146797#(< ~counter~0 85)} is VALID [2022-04-15 15:19:09,473 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {145933#true} {146797#(< ~counter~0 85)} #94#return; {146797#(< ~counter~0 85)} is VALID [2022-04-15 15:19:09,473 INFO L290 TraceCheckUtils]: 22: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,473 INFO L272 TraceCheckUtils]: 19: Hoare triple {146797#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {146797#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {146797#(< ~counter~0 85)} is VALID [2022-04-15 15:19:09,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {146822#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {146797#(< ~counter~0 85)} is VALID [2022-04-15 15:19:09,475 INFO L290 TraceCheckUtils]: 16: Hoare triple {146822#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {146822#(< ~counter~0 84)} is VALID [2022-04-15 15:19:09,475 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {145933#true} {146822#(< ~counter~0 84)} #92#return; {146822#(< ~counter~0 84)} is VALID [2022-04-15 15:19:09,476 INFO L290 TraceCheckUtils]: 14: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,476 INFO L290 TraceCheckUtils]: 13: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,476 INFO L290 TraceCheckUtils]: 12: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,476 INFO L272 TraceCheckUtils]: 11: Hoare triple {146822#(< ~counter~0 84)} 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)); {145933#true} is VALID [2022-04-15 15:19:09,476 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {145933#true} {146822#(< ~counter~0 84)} #90#return; {146822#(< ~counter~0 84)} is VALID [2022-04-15 15:19:09,476 INFO L290 TraceCheckUtils]: 9: Hoare triple {145933#true} assume true; {145933#true} is VALID [2022-04-15 15:19:09,476 INFO L290 TraceCheckUtils]: 8: Hoare triple {145933#true} assume !(0 == ~cond); {145933#true} is VALID [2022-04-15 15:19:09,476 INFO L290 TraceCheckUtils]: 7: Hoare triple {145933#true} ~cond := #in~cond; {145933#true} is VALID [2022-04-15 15:19:09,476 INFO L272 TraceCheckUtils]: 6: Hoare triple {146822#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {145933#true} is VALID [2022-04-15 15:19:09,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {146822#(< ~counter~0 84)} 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; {146822#(< ~counter~0 84)} is VALID [2022-04-15 15:19:09,477 INFO L272 TraceCheckUtils]: 4: Hoare triple {146822#(< ~counter~0 84)} call #t~ret9 := main(); {146822#(< ~counter~0 84)} is VALID [2022-04-15 15:19:09,477 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {146822#(< ~counter~0 84)} {145933#true} #102#return; {146822#(< ~counter~0 84)} is VALID [2022-04-15 15:19:09,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {146822#(< ~counter~0 84)} assume true; {146822#(< ~counter~0 84)} is VALID [2022-04-15 15:19:09,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {145933#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; {146822#(< ~counter~0 84)} is VALID [2022-04-15 15:19:09,478 INFO L272 TraceCheckUtils]: 0: Hoare triple {145933#true} call ULTIMATE.init(); {145933#true} is VALID [2022-04-15 15:19:09,479 INFO L134 CoverageAnalysis]: Checked inductivity of 678 backedges. 32 proven. 162 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-15 15:19:09,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:19:09,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829933348] [2022-04-15 15:19:09,479 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:19:09,479 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [496465862] [2022-04-15 15:19:09,479 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [496465862] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:19:09,479 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:19:09,479 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-15 15:19:09,479 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:19:09,480 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [710037878] [2022-04-15 15:19:09,480 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [710037878] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:19:09,480 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:19:09,480 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 15:19:09,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1435618586] [2022-04-15 15:19:09,480 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:19:09,480 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 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 151 [2022-04-15 15:19:09,481 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:19:09,481 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 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-15 15:19:09,671 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:09,671 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 15:19:09,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:09,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 15:19:09,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 15:19:09,672 INFO L87 Difference]: Start difference. First operand 799 states and 1061 transitions. Second operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 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-15 15:19:14,993 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:14,994 INFO L93 Difference]: Finished difference Result 850 states and 1131 transitions. [2022-04-15 15:19:14,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2022-04-15 15:19:14,994 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 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 151 [2022-04-15 15:19:14,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:19:14,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 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-15 15:19:14,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-15 15:19:14,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 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-15 15:19:14,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 334 transitions. [2022-04-15 15:19:14,999 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 33 states and 334 transitions. [2022-04-15 15:19:15,409 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:15,439 INFO L225 Difference]: With dead ends: 850 [2022-04-15 15:19:15,439 INFO L226 Difference]: Without dead ends: 845 [2022-04-15 15:19:15,439 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 314 GetRequests, 265 SyntacticMatches, 0 SemanticMatches, 49 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1080, Invalid=1470, Unknown=0, NotChecked=0, Total=2550 [2022-04-15 15:19:15,440 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 284 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 247 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 284 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 445 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 247 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-04-15 15:19:15,440 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [284 Valid, 347 Invalid, 445 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [247 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-04-15 15:19:15,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2022-04-15 15:19:18,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 823. [2022-04-15 15:19:18,528 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:19:18,529 INFO L82 GeneralOperation]: Start isEquivalent. First operand 845 states. Second operand has 823 states, 612 states have (on average 1.1813725490196079) internal successors, (723), 629 states have internal predecessors, (723), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:19:18,530 INFO L74 IsIncluded]: Start isIncluded. First operand 845 states. Second operand has 823 states, 612 states have (on average 1.1813725490196079) internal successors, (723), 629 states have internal predecessors, (723), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:19:18,530 INFO L87 Difference]: Start difference. First operand 845 states. Second operand has 823 states, 612 states have (on average 1.1813725490196079) internal successors, (723), 629 states have internal predecessors, (723), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:19:18,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:18,555 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-15 15:19:18,555 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-15 15:19:18,556 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:18,556 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:18,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 823 states, 612 states have (on average 1.1813725490196079) internal successors, (723), 629 states have internal predecessors, (723), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-15 15:19:18,558 INFO L87 Difference]: Start difference. First operand has 823 states, 612 states have (on average 1.1813725490196079) internal successors, (723), 629 states have internal predecessors, (723), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) Second operand 845 states. [2022-04-15 15:19:18,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:18,581 INFO L93 Difference]: Finished difference Result 845 states and 1125 transitions. [2022-04-15 15:19:18,581 INFO L276 IsEmpty]: Start isEmpty. Operand 845 states and 1125 transitions. [2022-04-15 15:19:18,582 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:18,582 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:18,582 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:19:18,582 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:19:18,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 823 states, 612 states have (on average 1.1813725490196079) internal successors, (723), 629 states have internal predecessors, (723), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 170 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:19:18,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 823 states to 823 states and 1099 transitions. [2022-04-15 15:19:18,614 INFO L78 Accepts]: Start accepts. Automaton has 823 states and 1099 transitions. Word has length 151 [2022-04-15 15:19:18,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:19:18,614 INFO L478 AbstractCegarLoop]: Abstraction has 823 states and 1099 transitions. [2022-04-15 15:19:18,614 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.4) internal successors, (108), 19 states have internal predecessors, (108), 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-15 15:19:18,614 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 823 states and 1099 transitions. [2022-04-15 15:19:31,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1099 edges. 1096 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:31,914 INFO L276 IsEmpty]: Start isEmpty. Operand 823 states and 1099 transitions. [2022-04-15 15:19:31,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 154 [2022-04-15 15:19:31,916 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:19:31,916 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 8, 8, 8, 8, 6, 5, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:19:31,932 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (53)] Forceful destruction successful, exit code 0 [2022-04-15 15:19:32,116 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 53 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable51 [2022-04-15 15:19:32,116 INFO L403 AbstractCegarLoop]: === Iteration 53 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:19:32,116 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:19:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 27 times [2022-04-15 15:19:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:32,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1305711200] [2022-04-15 15:19:32,117 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:19:32,117 INFO L85 PathProgramCache]: Analyzing trace with hash 1031451968, now seen corresponding path program 28 times [2022-04-15 15:19:32,117 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:19:32,117 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [688036202] [2022-04-15 15:19:32,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:19:32,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:19:32,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:19:32,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [109354071] [2022-04-15 15:19:32,134 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:19:32,134 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:32,134 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:19:32,135 INFO L229 MonitoredProcess]: Starting monitored process 54 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:19:32,139 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Waiting until timeout for monitored process [2022-04-15 15:19:32,215 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:19:32,215 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:19:32,216 INFO L263 TraceCheckSpWp]: Trace formula consists of 370 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 15:19:32,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:19:32,250 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:19:33,042 INFO L272 TraceCheckUtils]: 0: Hoare triple {151938#true} call ULTIMATE.init(); {151938#true} is VALID [2022-04-15 15:19:33,042 INFO L290 TraceCheckUtils]: 1: Hoare triple {151938#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; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,042 INFO L290 TraceCheckUtils]: 2: Hoare triple {151946#(<= ~counter~0 0)} assume true; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,043 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {151946#(<= ~counter~0 0)} {151938#true} #102#return; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,043 INFO L272 TraceCheckUtils]: 4: Hoare triple {151946#(<= ~counter~0 0)} call #t~ret9 := main(); {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,043 INFO L290 TraceCheckUtils]: 5: Hoare triple {151946#(<= ~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; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,044 INFO L272 TraceCheckUtils]: 6: Hoare triple {151946#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,044 INFO L290 TraceCheckUtils]: 7: Hoare triple {151946#(<= ~counter~0 0)} ~cond := #in~cond; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,044 INFO L290 TraceCheckUtils]: 8: Hoare triple {151946#(<= ~counter~0 0)} assume !(0 == ~cond); {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,045 INFO L290 TraceCheckUtils]: 9: Hoare triple {151946#(<= ~counter~0 0)} assume true; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,045 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {151946#(<= ~counter~0 0)} {151946#(<= ~counter~0 0)} #90#return; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,046 INFO L272 TraceCheckUtils]: 11: Hoare triple {151946#(<= ~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)); {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,046 INFO L290 TraceCheckUtils]: 12: Hoare triple {151946#(<= ~counter~0 0)} ~cond := #in~cond; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,046 INFO L290 TraceCheckUtils]: 13: Hoare triple {151946#(<= ~counter~0 0)} assume !(0 == ~cond); {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,046 INFO L290 TraceCheckUtils]: 14: Hoare triple {151946#(<= ~counter~0 0)} assume true; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,047 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {151946#(<= ~counter~0 0)} {151946#(<= ~counter~0 0)} #92#return; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,047 INFO L290 TraceCheckUtils]: 16: Hoare triple {151946#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {151946#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:33,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {151946#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151995#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:33,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {151995#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {151995#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:33,051 INFO L272 TraceCheckUtils]: 19: Hoare triple {151995#(<= ~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)); {151995#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:33,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {151995#(<= ~counter~0 1)} ~cond := #in~cond; {151995#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:33,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {151995#(<= ~counter~0 1)} assume !(0 == ~cond); {151995#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:33,052 INFO L290 TraceCheckUtils]: 22: Hoare triple {151995#(<= ~counter~0 1)} assume true; {151995#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:33,052 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {151995#(<= ~counter~0 1)} {151995#(<= ~counter~0 1)} #94#return; {151995#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:33,052 INFO L290 TraceCheckUtils]: 24: Hoare triple {151995#(<= ~counter~0 1)} assume !!(0 != ~r~0); {151995#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:33,054 INFO L290 TraceCheckUtils]: 25: Hoare triple {151995#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152020#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:33,054 INFO L290 TraceCheckUtils]: 26: Hoare triple {152020#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {152020#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:33,054 INFO L272 TraceCheckUtils]: 27: Hoare triple {152020#(<= ~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)); {152020#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:33,055 INFO L290 TraceCheckUtils]: 28: Hoare triple {152020#(<= ~counter~0 2)} ~cond := #in~cond; {152020#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:33,055 INFO L290 TraceCheckUtils]: 29: Hoare triple {152020#(<= ~counter~0 2)} assume !(0 == ~cond); {152020#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:33,055 INFO L290 TraceCheckUtils]: 30: Hoare triple {152020#(<= ~counter~0 2)} assume true; {152020#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:33,056 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {152020#(<= ~counter~0 2)} {152020#(<= ~counter~0 2)} #96#return; {152020#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:33,056 INFO L290 TraceCheckUtils]: 32: Hoare triple {152020#(<= ~counter~0 2)} assume !(~r~0 > 0); {152020#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:33,057 INFO L290 TraceCheckUtils]: 33: Hoare triple {152020#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152045#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:33,058 INFO L290 TraceCheckUtils]: 34: Hoare triple {152045#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {152045#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:33,058 INFO L272 TraceCheckUtils]: 35: Hoare triple {152045#(<= ~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)); {152045#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:33,059 INFO L290 TraceCheckUtils]: 36: Hoare triple {152045#(<= ~counter~0 3)} ~cond := #in~cond; {152045#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:33,059 INFO L290 TraceCheckUtils]: 37: Hoare triple {152045#(<= ~counter~0 3)} assume !(0 == ~cond); {152045#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:33,059 INFO L290 TraceCheckUtils]: 38: Hoare triple {152045#(<= ~counter~0 3)} assume true; {152045#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:33,060 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {152045#(<= ~counter~0 3)} {152045#(<= ~counter~0 3)} #98#return; {152045#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:33,060 INFO L290 TraceCheckUtils]: 40: Hoare triple {152045#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {152045#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:33,061 INFO L290 TraceCheckUtils]: 41: Hoare triple {152045#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152070#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:33,061 INFO L290 TraceCheckUtils]: 42: Hoare triple {152070#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {152070#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:33,062 INFO L272 TraceCheckUtils]: 43: Hoare triple {152070#(<= ~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)); {152070#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:33,062 INFO L290 TraceCheckUtils]: 44: Hoare triple {152070#(<= ~counter~0 4)} ~cond := #in~cond; {152070#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:33,063 INFO L290 TraceCheckUtils]: 45: Hoare triple {152070#(<= ~counter~0 4)} assume !(0 == ~cond); {152070#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:33,063 INFO L290 TraceCheckUtils]: 46: Hoare triple {152070#(<= ~counter~0 4)} assume true; {152070#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:33,063 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {152070#(<= ~counter~0 4)} {152070#(<= ~counter~0 4)} #98#return; {152070#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:33,064 INFO L290 TraceCheckUtils]: 48: Hoare triple {152070#(<= ~counter~0 4)} assume !(~r~0 < 0); {152070#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:33,065 INFO L290 TraceCheckUtils]: 49: Hoare triple {152070#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {152095#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:33,065 INFO L290 TraceCheckUtils]: 50: Hoare triple {152095#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {152095#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:33,066 INFO L272 TraceCheckUtils]: 51: Hoare triple {152095#(<= ~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)); {152095#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:33,066 INFO L290 TraceCheckUtils]: 52: Hoare triple {152095#(<= ~counter~0 5)} ~cond := #in~cond; {152095#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:33,066 INFO L290 TraceCheckUtils]: 53: Hoare triple {152095#(<= ~counter~0 5)} assume !(0 == ~cond); {152095#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:33,067 INFO L290 TraceCheckUtils]: 54: Hoare triple {152095#(<= ~counter~0 5)} assume true; {152095#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:33,067 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {152095#(<= ~counter~0 5)} {152095#(<= ~counter~0 5)} #94#return; {152095#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:33,067 INFO L290 TraceCheckUtils]: 56: Hoare triple {152095#(<= ~counter~0 5)} assume !!(0 != ~r~0); {152095#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:33,069 INFO L290 TraceCheckUtils]: 57: Hoare triple {152095#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152120#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:33,069 INFO L290 TraceCheckUtils]: 58: Hoare triple {152120#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {152120#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:33,069 INFO L272 TraceCheckUtils]: 59: Hoare triple {152120#(<= ~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)); {152120#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:33,070 INFO L290 TraceCheckUtils]: 60: Hoare triple {152120#(<= ~counter~0 6)} ~cond := #in~cond; {152120#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:33,070 INFO L290 TraceCheckUtils]: 61: Hoare triple {152120#(<= ~counter~0 6)} assume !(0 == ~cond); {152120#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:33,070 INFO L290 TraceCheckUtils]: 62: Hoare triple {152120#(<= ~counter~0 6)} assume true; {152120#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:33,071 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {152120#(<= ~counter~0 6)} {152120#(<= ~counter~0 6)} #96#return; {152120#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:33,071 INFO L290 TraceCheckUtils]: 64: Hoare triple {152120#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152120#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:33,072 INFO L290 TraceCheckUtils]: 65: Hoare triple {152120#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152145#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:33,073 INFO L290 TraceCheckUtils]: 66: Hoare triple {152145#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {152145#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:33,073 INFO L272 TraceCheckUtils]: 67: Hoare triple {152145#(<= ~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)); {152145#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:33,073 INFO L290 TraceCheckUtils]: 68: Hoare triple {152145#(<= ~counter~0 7)} ~cond := #in~cond; {152145#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:33,074 INFO L290 TraceCheckUtils]: 69: Hoare triple {152145#(<= ~counter~0 7)} assume !(0 == ~cond); {152145#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:33,074 INFO L290 TraceCheckUtils]: 70: Hoare triple {152145#(<= ~counter~0 7)} assume true; {152145#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:33,075 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {152145#(<= ~counter~0 7)} {152145#(<= ~counter~0 7)} #96#return; {152145#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:33,075 INFO L290 TraceCheckUtils]: 72: Hoare triple {152145#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152145#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:33,076 INFO L290 TraceCheckUtils]: 73: Hoare triple {152145#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152170#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:33,077 INFO L290 TraceCheckUtils]: 74: Hoare triple {152170#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {152170#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:33,077 INFO L272 TraceCheckUtils]: 75: Hoare triple {152170#(<= ~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)); {152170#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:33,078 INFO L290 TraceCheckUtils]: 76: Hoare triple {152170#(<= ~counter~0 8)} ~cond := #in~cond; {152170#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:33,078 INFO L290 TraceCheckUtils]: 77: Hoare triple {152170#(<= ~counter~0 8)} assume !(0 == ~cond); {152170#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:33,078 INFO L290 TraceCheckUtils]: 78: Hoare triple {152170#(<= ~counter~0 8)} assume true; {152170#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:33,079 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {152170#(<= ~counter~0 8)} {152170#(<= ~counter~0 8)} #96#return; {152170#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:33,079 INFO L290 TraceCheckUtils]: 80: Hoare triple {152170#(<= ~counter~0 8)} assume !(~r~0 > 0); {152170#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:33,080 INFO L290 TraceCheckUtils]: 81: Hoare triple {152170#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152195#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:33,080 INFO L290 TraceCheckUtils]: 82: Hoare triple {152195#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {152195#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:33,081 INFO L272 TraceCheckUtils]: 83: Hoare triple {152195#(<= ~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)); {152195#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:33,081 INFO L290 TraceCheckUtils]: 84: Hoare triple {152195#(<= ~counter~0 9)} ~cond := #in~cond; {152195#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:33,081 INFO L290 TraceCheckUtils]: 85: Hoare triple {152195#(<= ~counter~0 9)} assume !(0 == ~cond); {152195#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:33,082 INFO L290 TraceCheckUtils]: 86: Hoare triple {152195#(<= ~counter~0 9)} assume true; {152195#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:33,082 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {152195#(<= ~counter~0 9)} {152195#(<= ~counter~0 9)} #98#return; {152195#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:33,082 INFO L290 TraceCheckUtils]: 88: Hoare triple {152195#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {152195#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:33,084 INFO L290 TraceCheckUtils]: 89: Hoare triple {152195#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152220#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:33,084 INFO L290 TraceCheckUtils]: 90: Hoare triple {152220#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {152220#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:33,085 INFO L272 TraceCheckUtils]: 91: Hoare triple {152220#(<= ~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)); {152220#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:33,085 INFO L290 TraceCheckUtils]: 92: Hoare triple {152220#(<= ~counter~0 10)} ~cond := #in~cond; {152220#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:33,085 INFO L290 TraceCheckUtils]: 93: Hoare triple {152220#(<= ~counter~0 10)} assume !(0 == ~cond); {152220#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:33,085 INFO L290 TraceCheckUtils]: 94: Hoare triple {152220#(<= ~counter~0 10)} assume true; {152220#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:33,086 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {152220#(<= ~counter~0 10)} {152220#(<= ~counter~0 10)} #98#return; {152220#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:33,086 INFO L290 TraceCheckUtils]: 96: Hoare triple {152220#(<= ~counter~0 10)} assume !(~r~0 < 0); {152220#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:33,088 INFO L290 TraceCheckUtils]: 97: Hoare triple {152220#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {152245#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:33,088 INFO L290 TraceCheckUtils]: 98: Hoare triple {152245#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {152245#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:33,088 INFO L272 TraceCheckUtils]: 99: Hoare triple {152245#(<= ~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)); {152245#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:33,089 INFO L290 TraceCheckUtils]: 100: Hoare triple {152245#(<= ~counter~0 11)} ~cond := #in~cond; {152245#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:33,089 INFO L290 TraceCheckUtils]: 101: Hoare triple {152245#(<= ~counter~0 11)} assume !(0 == ~cond); {152245#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:33,089 INFO L290 TraceCheckUtils]: 102: Hoare triple {152245#(<= ~counter~0 11)} assume true; {152245#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:33,090 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {152245#(<= ~counter~0 11)} {152245#(<= ~counter~0 11)} #94#return; {152245#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:33,090 INFO L290 TraceCheckUtils]: 104: Hoare triple {152245#(<= ~counter~0 11)} assume !!(0 != ~r~0); {152245#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:33,091 INFO L290 TraceCheckUtils]: 105: Hoare triple {152245#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152270#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:33,091 INFO L290 TraceCheckUtils]: 106: Hoare triple {152270#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {152270#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:33,092 INFO L272 TraceCheckUtils]: 107: Hoare triple {152270#(<= ~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)); {152270#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:33,092 INFO L290 TraceCheckUtils]: 108: Hoare triple {152270#(<= ~counter~0 12)} ~cond := #in~cond; {152270#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:33,093 INFO L290 TraceCheckUtils]: 109: Hoare triple {152270#(<= ~counter~0 12)} assume !(0 == ~cond); {152270#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:33,093 INFO L290 TraceCheckUtils]: 110: Hoare triple {152270#(<= ~counter~0 12)} assume true; {152270#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:33,093 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {152270#(<= ~counter~0 12)} {152270#(<= ~counter~0 12)} #96#return; {152270#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:33,094 INFO L290 TraceCheckUtils]: 112: Hoare triple {152270#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152270#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:33,095 INFO L290 TraceCheckUtils]: 113: Hoare triple {152270#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152295#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:33,095 INFO L290 TraceCheckUtils]: 114: Hoare triple {152295#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {152295#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:33,096 INFO L272 TraceCheckUtils]: 115: Hoare triple {152295#(<= ~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)); {152295#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:33,096 INFO L290 TraceCheckUtils]: 116: Hoare triple {152295#(<= ~counter~0 13)} ~cond := #in~cond; {152295#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:33,096 INFO L290 TraceCheckUtils]: 117: Hoare triple {152295#(<= ~counter~0 13)} assume !(0 == ~cond); {152295#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:33,096 INFO L290 TraceCheckUtils]: 118: Hoare triple {152295#(<= ~counter~0 13)} assume true; {152295#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:33,097 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {152295#(<= ~counter~0 13)} {152295#(<= ~counter~0 13)} #96#return; {152295#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:33,097 INFO L290 TraceCheckUtils]: 120: Hoare triple {152295#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152295#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:33,098 INFO L290 TraceCheckUtils]: 121: Hoare triple {152295#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152320#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:33,099 INFO L290 TraceCheckUtils]: 122: Hoare triple {152320#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {152320#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:33,099 INFO L272 TraceCheckUtils]: 123: Hoare triple {152320#(<= ~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)); {152320#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:33,099 INFO L290 TraceCheckUtils]: 124: Hoare triple {152320#(<= ~counter~0 14)} ~cond := #in~cond; {152320#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:33,100 INFO L290 TraceCheckUtils]: 125: Hoare triple {152320#(<= ~counter~0 14)} assume !(0 == ~cond); {152320#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:33,100 INFO L290 TraceCheckUtils]: 126: Hoare triple {152320#(<= ~counter~0 14)} assume true; {152320#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:33,100 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {152320#(<= ~counter~0 14)} {152320#(<= ~counter~0 14)} #96#return; {152320#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:33,101 INFO L290 TraceCheckUtils]: 128: Hoare triple {152320#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152320#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:33,102 INFO L290 TraceCheckUtils]: 129: Hoare triple {152320#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152345#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:33,102 INFO L290 TraceCheckUtils]: 130: Hoare triple {152345#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {152345#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:33,103 INFO L272 TraceCheckUtils]: 131: Hoare triple {152345#(<= ~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)); {152345#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:33,103 INFO L290 TraceCheckUtils]: 132: Hoare triple {152345#(<= ~counter~0 15)} ~cond := #in~cond; {152345#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:33,103 INFO L290 TraceCheckUtils]: 133: Hoare triple {152345#(<= ~counter~0 15)} assume !(0 == ~cond); {152345#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:33,104 INFO L290 TraceCheckUtils]: 134: Hoare triple {152345#(<= ~counter~0 15)} assume true; {152345#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:33,104 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {152345#(<= ~counter~0 15)} {152345#(<= ~counter~0 15)} #96#return; {152345#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:33,104 INFO L290 TraceCheckUtils]: 136: Hoare triple {152345#(<= ~counter~0 15)} assume !(~r~0 > 0); {152345#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:33,106 INFO L290 TraceCheckUtils]: 137: Hoare triple {152345#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152370#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:33,106 INFO L290 TraceCheckUtils]: 138: Hoare triple {152370#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {152370#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:33,107 INFO L272 TraceCheckUtils]: 139: Hoare triple {152370#(<= ~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)); {152370#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:33,107 INFO L290 TraceCheckUtils]: 140: Hoare triple {152370#(<= ~counter~0 16)} ~cond := #in~cond; {152370#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:33,107 INFO L290 TraceCheckUtils]: 141: Hoare triple {152370#(<= ~counter~0 16)} assume !(0 == ~cond); {152370#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:33,107 INFO L290 TraceCheckUtils]: 142: Hoare triple {152370#(<= ~counter~0 16)} assume true; {152370#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:33,108 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {152370#(<= ~counter~0 16)} {152370#(<= ~counter~0 16)} #98#return; {152370#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:33,108 INFO L290 TraceCheckUtils]: 144: Hoare triple {152370#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {152370#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:33,109 INFO L290 TraceCheckUtils]: 145: Hoare triple {152370#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152395#(<= |main_#t~post8| 16)} is VALID [2022-04-15 15:19:33,109 INFO L290 TraceCheckUtils]: 146: Hoare triple {152395#(<= |main_#t~post8| 16)} assume !(#t~post8 < 100);havoc #t~post8; {151939#false} is VALID [2022-04-15 15:19:33,109 INFO L290 TraceCheckUtils]: 147: Hoare triple {151939#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151939#false} is VALID [2022-04-15 15:19:33,109 INFO L290 TraceCheckUtils]: 148: Hoare triple {151939#false} assume !(#t~post6 < 100);havoc #t~post6; {151939#false} is VALID [2022-04-15 15:19:33,109 INFO L272 TraceCheckUtils]: 149: Hoare triple {151939#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)); {151939#false} is VALID [2022-04-15 15:19:33,109 INFO L290 TraceCheckUtils]: 150: Hoare triple {151939#false} ~cond := #in~cond; {151939#false} is VALID [2022-04-15 15:19:33,109 INFO L290 TraceCheckUtils]: 151: Hoare triple {151939#false} assume 0 == ~cond; {151939#false} is VALID [2022-04-15 15:19:33,109 INFO L290 TraceCheckUtils]: 152: Hoare triple {151939#false} assume !false; {151939#false} is VALID [2022-04-15 15:19:33,110 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 654 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:19:33,110 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:19:34,160 INFO L290 TraceCheckUtils]: 152: Hoare triple {151939#false} assume !false; {151939#false} is VALID [2022-04-15 15:19:34,161 INFO L290 TraceCheckUtils]: 151: Hoare triple {151939#false} assume 0 == ~cond; {151939#false} is VALID [2022-04-15 15:19:34,161 INFO L290 TraceCheckUtils]: 150: Hoare triple {151939#false} ~cond := #in~cond; {151939#false} is VALID [2022-04-15 15:19:34,161 INFO L272 TraceCheckUtils]: 149: Hoare triple {151939#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)); {151939#false} is VALID [2022-04-15 15:19:34,161 INFO L290 TraceCheckUtils]: 148: Hoare triple {151939#false} assume !(#t~post6 < 100);havoc #t~post6; {151939#false} is VALID [2022-04-15 15:19:34,161 INFO L290 TraceCheckUtils]: 147: Hoare triple {151939#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {151939#false} is VALID [2022-04-15 15:19:34,161 INFO L290 TraceCheckUtils]: 146: Hoare triple {152435#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {151939#false} is VALID [2022-04-15 15:19:34,162 INFO L290 TraceCheckUtils]: 145: Hoare triple {152439#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152435#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:19:34,163 INFO L290 TraceCheckUtils]: 144: Hoare triple {152439#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {152439#(< ~counter~0 100)} is VALID [2022-04-15 15:19:34,163 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {151938#true} {152439#(< ~counter~0 100)} #98#return; {152439#(< ~counter~0 100)} is VALID [2022-04-15 15:19:34,163 INFO L290 TraceCheckUtils]: 142: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,163 INFO L290 TraceCheckUtils]: 141: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,163 INFO L290 TraceCheckUtils]: 140: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,163 INFO L272 TraceCheckUtils]: 139: Hoare triple {152439#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,164 INFO L290 TraceCheckUtils]: 138: Hoare triple {152439#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {152439#(< ~counter~0 100)} is VALID [2022-04-15 15:19:34,167 INFO L290 TraceCheckUtils]: 137: Hoare triple {152464#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152439#(< ~counter~0 100)} is VALID [2022-04-15 15:19:34,168 INFO L290 TraceCheckUtils]: 136: Hoare triple {152464#(< ~counter~0 99)} assume !(~r~0 > 0); {152464#(< ~counter~0 99)} is VALID [2022-04-15 15:19:34,168 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {151938#true} {152464#(< ~counter~0 99)} #96#return; {152464#(< ~counter~0 99)} is VALID [2022-04-15 15:19:34,168 INFO L290 TraceCheckUtils]: 134: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,169 INFO L290 TraceCheckUtils]: 133: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,169 INFO L290 TraceCheckUtils]: 132: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,169 INFO L272 TraceCheckUtils]: 131: Hoare triple {152464#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,169 INFO L290 TraceCheckUtils]: 130: Hoare triple {152464#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {152464#(< ~counter~0 99)} is VALID [2022-04-15 15:19:34,171 INFO L290 TraceCheckUtils]: 129: Hoare triple {152489#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152464#(< ~counter~0 99)} is VALID [2022-04-15 15:19:34,172 INFO L290 TraceCheckUtils]: 128: Hoare triple {152489#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152489#(< ~counter~0 98)} is VALID [2022-04-15 15:19:34,172 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {151938#true} {152489#(< ~counter~0 98)} #96#return; {152489#(< ~counter~0 98)} is VALID [2022-04-15 15:19:34,173 INFO L290 TraceCheckUtils]: 126: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,173 INFO L290 TraceCheckUtils]: 125: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,173 INFO L290 TraceCheckUtils]: 124: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,173 INFO L272 TraceCheckUtils]: 123: Hoare triple {152489#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,173 INFO L290 TraceCheckUtils]: 122: Hoare triple {152489#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {152489#(< ~counter~0 98)} is VALID [2022-04-15 15:19:34,175 INFO L290 TraceCheckUtils]: 121: Hoare triple {152514#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152489#(< ~counter~0 98)} is VALID [2022-04-15 15:19:34,175 INFO L290 TraceCheckUtils]: 120: Hoare triple {152514#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152514#(< ~counter~0 97)} is VALID [2022-04-15 15:19:34,176 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {151938#true} {152514#(< ~counter~0 97)} #96#return; {152514#(< ~counter~0 97)} is VALID [2022-04-15 15:19:34,176 INFO L290 TraceCheckUtils]: 118: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,176 INFO L290 TraceCheckUtils]: 117: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,176 INFO L290 TraceCheckUtils]: 116: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,176 INFO L272 TraceCheckUtils]: 115: Hoare triple {152514#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,176 INFO L290 TraceCheckUtils]: 114: Hoare triple {152514#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {152514#(< ~counter~0 97)} is VALID [2022-04-15 15:19:34,177 INFO L290 TraceCheckUtils]: 113: Hoare triple {152539#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152514#(< ~counter~0 97)} is VALID [2022-04-15 15:19:34,178 INFO L290 TraceCheckUtils]: 112: Hoare triple {152539#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152539#(< ~counter~0 96)} is VALID [2022-04-15 15:19:34,178 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {151938#true} {152539#(< ~counter~0 96)} #96#return; {152539#(< ~counter~0 96)} is VALID [2022-04-15 15:19:34,178 INFO L290 TraceCheckUtils]: 110: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,178 INFO L290 TraceCheckUtils]: 109: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,178 INFO L290 TraceCheckUtils]: 108: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,179 INFO L272 TraceCheckUtils]: 107: Hoare triple {152539#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,179 INFO L290 TraceCheckUtils]: 106: Hoare triple {152539#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {152539#(< ~counter~0 96)} is VALID [2022-04-15 15:19:34,180 INFO L290 TraceCheckUtils]: 105: Hoare triple {152564#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152539#(< ~counter~0 96)} is VALID [2022-04-15 15:19:34,180 INFO L290 TraceCheckUtils]: 104: Hoare triple {152564#(< ~counter~0 95)} assume !!(0 != ~r~0); {152564#(< ~counter~0 95)} is VALID [2022-04-15 15:19:34,181 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {151938#true} {152564#(< ~counter~0 95)} #94#return; {152564#(< ~counter~0 95)} is VALID [2022-04-15 15:19:34,181 INFO L290 TraceCheckUtils]: 102: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,181 INFO L290 TraceCheckUtils]: 101: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,181 INFO L290 TraceCheckUtils]: 100: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,181 INFO L272 TraceCheckUtils]: 99: Hoare triple {152564#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,181 INFO L290 TraceCheckUtils]: 98: Hoare triple {152564#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {152564#(< ~counter~0 95)} is VALID [2022-04-15 15:19:34,183 INFO L290 TraceCheckUtils]: 97: Hoare triple {152589#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {152564#(< ~counter~0 95)} is VALID [2022-04-15 15:19:34,183 INFO L290 TraceCheckUtils]: 96: Hoare triple {152589#(< ~counter~0 94)} assume !(~r~0 < 0); {152589#(< ~counter~0 94)} is VALID [2022-04-15 15:19:34,183 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {151938#true} {152589#(< ~counter~0 94)} #98#return; {152589#(< ~counter~0 94)} is VALID [2022-04-15 15:19:34,184 INFO L290 TraceCheckUtils]: 94: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,184 INFO L290 TraceCheckUtils]: 93: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,184 INFO L290 TraceCheckUtils]: 92: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,184 INFO L272 TraceCheckUtils]: 91: Hoare triple {152589#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,184 INFO L290 TraceCheckUtils]: 90: Hoare triple {152589#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {152589#(< ~counter~0 94)} is VALID [2022-04-15 15:19:34,185 INFO L290 TraceCheckUtils]: 89: Hoare triple {152614#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152589#(< ~counter~0 94)} is VALID [2022-04-15 15:19:34,186 INFO L290 TraceCheckUtils]: 88: Hoare triple {152614#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {152614#(< ~counter~0 93)} is VALID [2022-04-15 15:19:34,186 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {151938#true} {152614#(< ~counter~0 93)} #98#return; {152614#(< ~counter~0 93)} is VALID [2022-04-15 15:19:34,186 INFO L290 TraceCheckUtils]: 86: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,186 INFO L290 TraceCheckUtils]: 85: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,186 INFO L290 TraceCheckUtils]: 84: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,187 INFO L272 TraceCheckUtils]: 83: Hoare triple {152614#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,187 INFO L290 TraceCheckUtils]: 82: Hoare triple {152614#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {152614#(< ~counter~0 93)} is VALID [2022-04-15 15:19:34,188 INFO L290 TraceCheckUtils]: 81: Hoare triple {152639#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152614#(< ~counter~0 93)} is VALID [2022-04-15 15:19:34,189 INFO L290 TraceCheckUtils]: 80: Hoare triple {152639#(< ~counter~0 92)} assume !(~r~0 > 0); {152639#(< ~counter~0 92)} is VALID [2022-04-15 15:19:34,189 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {151938#true} {152639#(< ~counter~0 92)} #96#return; {152639#(< ~counter~0 92)} is VALID [2022-04-15 15:19:34,189 INFO L290 TraceCheckUtils]: 78: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,189 INFO L290 TraceCheckUtils]: 77: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,189 INFO L290 TraceCheckUtils]: 76: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,189 INFO L272 TraceCheckUtils]: 75: Hoare triple {152639#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,190 INFO L290 TraceCheckUtils]: 74: Hoare triple {152639#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {152639#(< ~counter~0 92)} is VALID [2022-04-15 15:19:34,191 INFO L290 TraceCheckUtils]: 73: Hoare triple {152664#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152639#(< ~counter~0 92)} is VALID [2022-04-15 15:19:34,191 INFO L290 TraceCheckUtils]: 72: Hoare triple {152664#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152664#(< ~counter~0 91)} is VALID [2022-04-15 15:19:34,192 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {151938#true} {152664#(< ~counter~0 91)} #96#return; {152664#(< ~counter~0 91)} is VALID [2022-04-15 15:19:34,192 INFO L290 TraceCheckUtils]: 70: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,192 INFO L290 TraceCheckUtils]: 69: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,192 INFO L290 TraceCheckUtils]: 68: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,192 INFO L272 TraceCheckUtils]: 67: Hoare triple {152664#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,192 INFO L290 TraceCheckUtils]: 66: Hoare triple {152664#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {152664#(< ~counter~0 91)} is VALID [2022-04-15 15:19:34,194 INFO L290 TraceCheckUtils]: 65: Hoare triple {152689#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152664#(< ~counter~0 91)} is VALID [2022-04-15 15:19:34,194 INFO L290 TraceCheckUtils]: 64: Hoare triple {152689#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {152689#(< ~counter~0 90)} is VALID [2022-04-15 15:19:34,195 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {151938#true} {152689#(< ~counter~0 90)} #96#return; {152689#(< ~counter~0 90)} is VALID [2022-04-15 15:19:34,195 INFO L290 TraceCheckUtils]: 62: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,195 INFO L290 TraceCheckUtils]: 61: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,195 INFO L290 TraceCheckUtils]: 60: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,195 INFO L272 TraceCheckUtils]: 59: Hoare triple {152689#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,195 INFO L290 TraceCheckUtils]: 58: Hoare triple {152689#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {152689#(< ~counter~0 90)} is VALID [2022-04-15 15:19:34,196 INFO L290 TraceCheckUtils]: 57: Hoare triple {152714#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152689#(< ~counter~0 90)} is VALID [2022-04-15 15:19:34,197 INFO L290 TraceCheckUtils]: 56: Hoare triple {152714#(< ~counter~0 89)} assume !!(0 != ~r~0); {152714#(< ~counter~0 89)} is VALID [2022-04-15 15:19:34,197 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {151938#true} {152714#(< ~counter~0 89)} #94#return; {152714#(< ~counter~0 89)} is VALID [2022-04-15 15:19:34,197 INFO L290 TraceCheckUtils]: 54: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,197 INFO L290 TraceCheckUtils]: 53: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,197 INFO L290 TraceCheckUtils]: 52: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,197 INFO L272 TraceCheckUtils]: 51: Hoare triple {152714#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,198 INFO L290 TraceCheckUtils]: 50: Hoare triple {152714#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {152714#(< ~counter~0 89)} is VALID [2022-04-15 15:19:34,199 INFO L290 TraceCheckUtils]: 49: Hoare triple {152739#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {152714#(< ~counter~0 89)} is VALID [2022-04-15 15:19:34,199 INFO L290 TraceCheckUtils]: 48: Hoare triple {152739#(< ~counter~0 88)} assume !(~r~0 < 0); {152739#(< ~counter~0 88)} is VALID [2022-04-15 15:19:34,200 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {151938#true} {152739#(< ~counter~0 88)} #98#return; {152739#(< ~counter~0 88)} is VALID [2022-04-15 15:19:34,200 INFO L290 TraceCheckUtils]: 46: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,200 INFO L290 TraceCheckUtils]: 45: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,200 INFO L272 TraceCheckUtils]: 43: Hoare triple {152739#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,200 INFO L290 TraceCheckUtils]: 42: Hoare triple {152739#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {152739#(< ~counter~0 88)} is VALID [2022-04-15 15:19:34,201 INFO L290 TraceCheckUtils]: 41: Hoare triple {152764#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152739#(< ~counter~0 88)} is VALID [2022-04-15 15:19:34,202 INFO L290 TraceCheckUtils]: 40: Hoare triple {152764#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {152764#(< ~counter~0 87)} is VALID [2022-04-15 15:19:34,202 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {151938#true} {152764#(< ~counter~0 87)} #98#return; {152764#(< ~counter~0 87)} is VALID [2022-04-15 15:19:34,202 INFO L290 TraceCheckUtils]: 38: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,202 INFO L290 TraceCheckUtils]: 37: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,202 INFO L290 TraceCheckUtils]: 36: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,202 INFO L272 TraceCheckUtils]: 35: Hoare triple {152764#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {152764#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {152764#(< ~counter~0 87)} is VALID [2022-04-15 15:19:34,204 INFO L290 TraceCheckUtils]: 33: Hoare triple {152789#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {152764#(< ~counter~0 87)} is VALID [2022-04-15 15:19:34,204 INFO L290 TraceCheckUtils]: 32: Hoare triple {152789#(< ~counter~0 86)} assume !(~r~0 > 0); {152789#(< ~counter~0 86)} is VALID [2022-04-15 15:19:34,205 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {151938#true} {152789#(< ~counter~0 86)} #96#return; {152789#(< ~counter~0 86)} is VALID [2022-04-15 15:19:34,205 INFO L290 TraceCheckUtils]: 30: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,205 INFO L290 TraceCheckUtils]: 29: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,205 INFO L290 TraceCheckUtils]: 28: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,205 INFO L272 TraceCheckUtils]: 27: Hoare triple {152789#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,205 INFO L290 TraceCheckUtils]: 26: Hoare triple {152789#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {152789#(< ~counter~0 86)} is VALID [2022-04-15 15:19:34,207 INFO L290 TraceCheckUtils]: 25: Hoare triple {152814#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {152789#(< ~counter~0 86)} is VALID [2022-04-15 15:19:34,207 INFO L290 TraceCheckUtils]: 24: Hoare triple {152814#(< ~counter~0 85)} assume !!(0 != ~r~0); {152814#(< ~counter~0 85)} is VALID [2022-04-15 15:19:34,207 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {151938#true} {152814#(< ~counter~0 85)} #94#return; {152814#(< ~counter~0 85)} is VALID [2022-04-15 15:19:34,207 INFO L290 TraceCheckUtils]: 22: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,207 INFO L290 TraceCheckUtils]: 21: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,208 INFO L290 TraceCheckUtils]: 20: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,208 INFO L272 TraceCheckUtils]: 19: Hoare triple {152814#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,208 INFO L290 TraceCheckUtils]: 18: Hoare triple {152814#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {152814#(< ~counter~0 85)} is VALID [2022-04-15 15:19:34,209 INFO L290 TraceCheckUtils]: 17: Hoare triple {152839#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {152814#(< ~counter~0 85)} is VALID [2022-04-15 15:19:34,209 INFO L290 TraceCheckUtils]: 16: Hoare triple {152839#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {152839#(< ~counter~0 84)} is VALID [2022-04-15 15:19:34,210 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {151938#true} {152839#(< ~counter~0 84)} #92#return; {152839#(< ~counter~0 84)} is VALID [2022-04-15 15:19:34,210 INFO L290 TraceCheckUtils]: 14: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,210 INFO L290 TraceCheckUtils]: 13: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,210 INFO L272 TraceCheckUtils]: 11: Hoare triple {152839#(< ~counter~0 84)} 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)); {151938#true} is VALID [2022-04-15 15:19:34,210 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {151938#true} {152839#(< ~counter~0 84)} #90#return; {152839#(< ~counter~0 84)} is VALID [2022-04-15 15:19:34,210 INFO L290 TraceCheckUtils]: 9: Hoare triple {151938#true} assume true; {151938#true} is VALID [2022-04-15 15:19:34,211 INFO L290 TraceCheckUtils]: 8: Hoare triple {151938#true} assume !(0 == ~cond); {151938#true} is VALID [2022-04-15 15:19:34,211 INFO L290 TraceCheckUtils]: 7: Hoare triple {151938#true} ~cond := #in~cond; {151938#true} is VALID [2022-04-15 15:19:34,211 INFO L272 TraceCheckUtils]: 6: Hoare triple {152839#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {151938#true} is VALID [2022-04-15 15:19:34,211 INFO L290 TraceCheckUtils]: 5: Hoare triple {152839#(< ~counter~0 84)} 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; {152839#(< ~counter~0 84)} is VALID [2022-04-15 15:19:34,211 INFO L272 TraceCheckUtils]: 4: Hoare triple {152839#(< ~counter~0 84)} call #t~ret9 := main(); {152839#(< ~counter~0 84)} is VALID [2022-04-15 15:19:34,212 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {152839#(< ~counter~0 84)} {151938#true} #102#return; {152839#(< ~counter~0 84)} is VALID [2022-04-15 15:19:34,212 INFO L290 TraceCheckUtils]: 2: Hoare triple {152839#(< ~counter~0 84)} assume true; {152839#(< ~counter~0 84)} is VALID [2022-04-15 15:19:34,212 INFO L290 TraceCheckUtils]: 1: Hoare triple {151938#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; {152839#(< ~counter~0 84)} is VALID [2022-04-15 15:19:34,212 INFO L272 TraceCheckUtils]: 0: Hoare triple {151938#true} call ULTIMATE.init(); {151938#true} is VALID [2022-04-15 15:19:34,213 INFO L134 CoverageAnalysis]: Checked inductivity of 696 backedges. 38 proven. 174 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-15 15:19:34,213 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:19:34,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [688036202] [2022-04-15 15:19:34,213 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:19:34,213 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [109354071] [2022-04-15 15:19:34,213 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [109354071] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:19:34,213 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:19:34,213 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-15 15:19:34,214 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:19:34,214 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1305711200] [2022-04-15 15:19:34,214 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1305711200] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:19:34,214 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:19:34,214 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 15:19:34,214 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1292005850] [2022-04-15 15:19:34,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:19:34,214 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 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 153 [2022-04-15 15:19:34,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:19:34,215 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 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-15 15:19:34,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:34,402 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 15:19:34,402 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:34,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 15:19:34,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 15:19:34,403 INFO L87 Difference]: Start difference. First operand 823 states and 1099 transitions. Second operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 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-15 15:19:39,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:39,810 INFO L93 Difference]: Finished difference Result 1027 states and 1401 transitions. [2022-04-15 15:19:39,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2022-04-15 15:19:39,810 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 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 153 [2022-04-15 15:19:39,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:19:39,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 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-15 15:19:39,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-15 15:19:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 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-15 15:19:39,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 356 transitions. [2022-04-15 15:19:39,815 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 34 states and 356 transitions. [2022-04-15 15:19:40,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:40,292 INFO L225 Difference]: With dead ends: 1027 [2022-04-15 15:19:40,293 INFO L226 Difference]: Without dead ends: 849 [2022-04-15 15:19:40,293 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 319 GetRequests, 269 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 140 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1125, Invalid=1527, Unknown=0, NotChecked=0, Total=2652 [2022-04-15 15:19:40,293 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 275 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 227 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 275 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 488 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 227 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 15:19:40,294 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [275 Valid, 327 Invalid, 488 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [227 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 15:19:40,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 849 states. [2022-04-15 15:19:43,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 849 to 838. [2022-04-15 15:19:43,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:19:43,525 INFO L82 GeneralOperation]: Start isEquivalent. First operand 849 states. Second operand has 838 states, 627 states have (on average 1.1818181818181819) internal successors, (741), 639 states have internal predecessors, (741), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:19:43,525 INFO L74 IsIncluded]: Start isIncluded. First operand 849 states. Second operand has 838 states, 627 states have (on average 1.1818181818181819) internal successors, (741), 639 states have internal predecessors, (741), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:19:43,526 INFO L87 Difference]: Start difference. First operand 849 states. Second operand has 838 states, 627 states have (on average 1.1818181818181819) internal successors, (741), 639 states have internal predecessors, (741), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:19:43,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:43,548 INFO L93 Difference]: Finished difference Result 849 states and 1128 transitions. [2022-04-15 15:19:43,548 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1128 transitions. [2022-04-15 15:19:43,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:43,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:43,550 INFO L74 IsIncluded]: Start isIncluded. First operand has 838 states, 627 states have (on average 1.1818181818181819) internal successors, (741), 639 states have internal predecessors, (741), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 849 states. [2022-04-15 15:19:43,550 INFO L87 Difference]: Start difference. First operand has 838 states, 627 states have (on average 1.1818181818181819) internal successors, (741), 639 states have internal predecessors, (741), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) Second operand 849 states. [2022-04-15 15:19:43,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:19:43,573 INFO L93 Difference]: Finished difference Result 849 states and 1128 transitions. [2022-04-15 15:19:43,573 INFO L276 IsEmpty]: Start isEmpty. Operand 849 states and 1128 transitions. [2022-04-15 15:19:43,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:19:43,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:19:43,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:19:43,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:19:43,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 838 states, 627 states have (on average 1.1818181818181819) internal successors, (741), 639 states have internal predecessors, (741), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 175 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:19:43,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 838 states to 838 states and 1117 transitions. [2022-04-15 15:19:43,604 INFO L78 Accepts]: Start accepts. Automaton has 838 states and 1117 transitions. Word has length 153 [2022-04-15 15:19:43,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:19:43,604 INFO L478 AbstractCegarLoop]: Abstraction has 838 states and 1117 transitions. [2022-04-15 15:19:43,605 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.5) internal successors, (110), 19 states have internal predecessors, (110), 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-15 15:19:43,605 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 838 states and 1117 transitions. [2022-04-15 15:19:54,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1117 edges. 1115 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 838 states and 1117 transitions. [2022-04-15 15:19:54,718 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 156 [2022-04-15 15:19:54,718 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:19:54,718 INFO L499 BasicCegarLoop]: trace histogram [17, 16, 16, 10, 9, 9, 9, 7, 5, 4, 4, 4, 4, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:19:54,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (54)] Ended with exit code 0 [2022-04-15 15:19:54,919 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable52,54 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:54,919 INFO L403 AbstractCegarLoop]: === Iteration 54 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:19:54,919 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:19:54,919 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 23 times [2022-04-15 15:19:54,919 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:54,919 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [268516521] [2022-04-15 15:19:54,920 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:19:54,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1196851319, now seen corresponding path program 24 times [2022-04-15 15:19:54,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:19:54,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716115081] [2022-04-15 15:19:54,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:19:54,920 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:19:54,934 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:19:54,934 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1629071708] [2022-04-15 15:19:54,934 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:19:54,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:19:54,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:19:54,936 INFO L229 MonitoredProcess]: Starting monitored process 55 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:19:54,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Waiting until timeout for monitored process [2022-04-15 15:19:55,183 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:19:55,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:19:55,186 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 37 conjunts are in the unsatisfiable core [2022-04-15 15:19:55,229 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:19:55,233 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:19:56,048 INFO L272 TraceCheckUtils]: 0: Hoare triple {158349#true} call ULTIMATE.init(); {158349#true} is VALID [2022-04-15 15:19:56,049 INFO L290 TraceCheckUtils]: 1: Hoare triple {158349#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; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,049 INFO L290 TraceCheckUtils]: 2: Hoare triple {158357#(<= ~counter~0 0)} assume true; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,049 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {158357#(<= ~counter~0 0)} {158349#true} #102#return; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,050 INFO L272 TraceCheckUtils]: 4: Hoare triple {158357#(<= ~counter~0 0)} call #t~ret9 := main(); {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,050 INFO L290 TraceCheckUtils]: 5: Hoare triple {158357#(<= ~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; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,050 INFO L272 TraceCheckUtils]: 6: Hoare triple {158357#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,051 INFO L290 TraceCheckUtils]: 7: Hoare triple {158357#(<= ~counter~0 0)} ~cond := #in~cond; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,051 INFO L290 TraceCheckUtils]: 8: Hoare triple {158357#(<= ~counter~0 0)} assume !(0 == ~cond); {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {158357#(<= ~counter~0 0)} assume true; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,052 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {158357#(<= ~counter~0 0)} {158357#(<= ~counter~0 0)} #90#return; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,052 INFO L272 TraceCheckUtils]: 11: Hoare triple {158357#(<= ~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)); {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,052 INFO L290 TraceCheckUtils]: 12: Hoare triple {158357#(<= ~counter~0 0)} ~cond := #in~cond; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,053 INFO L290 TraceCheckUtils]: 13: Hoare triple {158357#(<= ~counter~0 0)} assume !(0 == ~cond); {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,053 INFO L290 TraceCheckUtils]: 14: Hoare triple {158357#(<= ~counter~0 0)} assume true; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,053 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {158357#(<= ~counter~0 0)} {158357#(<= ~counter~0 0)} #92#return; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,053 INFO L290 TraceCheckUtils]: 16: Hoare triple {158357#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {158357#(<= ~counter~0 0)} is VALID [2022-04-15 15:19:56,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {158357#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158406#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:56,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {158406#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {158406#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:56,057 INFO L272 TraceCheckUtils]: 19: Hoare triple {158406#(<= ~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)); {158406#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:56,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {158406#(<= ~counter~0 1)} ~cond := #in~cond; {158406#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:56,058 INFO L290 TraceCheckUtils]: 21: Hoare triple {158406#(<= ~counter~0 1)} assume !(0 == ~cond); {158406#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:56,058 INFO L290 TraceCheckUtils]: 22: Hoare triple {158406#(<= ~counter~0 1)} assume true; {158406#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:56,059 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {158406#(<= ~counter~0 1)} {158406#(<= ~counter~0 1)} #94#return; {158406#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:56,059 INFO L290 TraceCheckUtils]: 24: Hoare triple {158406#(<= ~counter~0 1)} assume !!(0 != ~r~0); {158406#(<= ~counter~0 1)} is VALID [2022-04-15 15:19:56,060 INFO L290 TraceCheckUtils]: 25: Hoare triple {158406#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158431#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:56,061 INFO L290 TraceCheckUtils]: 26: Hoare triple {158431#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {158431#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:56,061 INFO L272 TraceCheckUtils]: 27: Hoare triple {158431#(<= ~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)); {158431#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:56,062 INFO L290 TraceCheckUtils]: 28: Hoare triple {158431#(<= ~counter~0 2)} ~cond := #in~cond; {158431#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:56,062 INFO L290 TraceCheckUtils]: 29: Hoare triple {158431#(<= ~counter~0 2)} assume !(0 == ~cond); {158431#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:56,062 INFO L290 TraceCheckUtils]: 30: Hoare triple {158431#(<= ~counter~0 2)} assume true; {158431#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:56,063 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {158431#(<= ~counter~0 2)} {158431#(<= ~counter~0 2)} #96#return; {158431#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:56,063 INFO L290 TraceCheckUtils]: 32: Hoare triple {158431#(<= ~counter~0 2)} assume !(~r~0 > 0); {158431#(<= ~counter~0 2)} is VALID [2022-04-15 15:19:56,064 INFO L290 TraceCheckUtils]: 33: Hoare triple {158431#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158456#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:56,065 INFO L290 TraceCheckUtils]: 34: Hoare triple {158456#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {158456#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:56,065 INFO L272 TraceCheckUtils]: 35: Hoare triple {158456#(<= ~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)); {158456#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:56,065 INFO L290 TraceCheckUtils]: 36: Hoare triple {158456#(<= ~counter~0 3)} ~cond := #in~cond; {158456#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:56,066 INFO L290 TraceCheckUtils]: 37: Hoare triple {158456#(<= ~counter~0 3)} assume !(0 == ~cond); {158456#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:56,066 INFO L290 TraceCheckUtils]: 38: Hoare triple {158456#(<= ~counter~0 3)} assume true; {158456#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:56,066 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {158456#(<= ~counter~0 3)} {158456#(<= ~counter~0 3)} #98#return; {158456#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:56,067 INFO L290 TraceCheckUtils]: 40: Hoare triple {158456#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {158456#(<= ~counter~0 3)} is VALID [2022-04-15 15:19:56,068 INFO L290 TraceCheckUtils]: 41: Hoare triple {158456#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158481#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:56,068 INFO L290 TraceCheckUtils]: 42: Hoare triple {158481#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {158481#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:56,069 INFO L272 TraceCheckUtils]: 43: Hoare triple {158481#(<= ~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)); {158481#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:56,069 INFO L290 TraceCheckUtils]: 44: Hoare triple {158481#(<= ~counter~0 4)} ~cond := #in~cond; {158481#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:56,069 INFO L290 TraceCheckUtils]: 45: Hoare triple {158481#(<= ~counter~0 4)} assume !(0 == ~cond); {158481#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:56,070 INFO L290 TraceCheckUtils]: 46: Hoare triple {158481#(<= ~counter~0 4)} assume true; {158481#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:56,070 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {158481#(<= ~counter~0 4)} {158481#(<= ~counter~0 4)} #98#return; {158481#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:56,071 INFO L290 TraceCheckUtils]: 48: Hoare triple {158481#(<= ~counter~0 4)} assume !(~r~0 < 0); {158481#(<= ~counter~0 4)} is VALID [2022-04-15 15:19:56,072 INFO L290 TraceCheckUtils]: 49: Hoare triple {158481#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158506#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:56,072 INFO L290 TraceCheckUtils]: 50: Hoare triple {158506#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {158506#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:56,073 INFO L272 TraceCheckUtils]: 51: Hoare triple {158506#(<= ~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)); {158506#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:56,073 INFO L290 TraceCheckUtils]: 52: Hoare triple {158506#(<= ~counter~0 5)} ~cond := #in~cond; {158506#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:56,073 INFO L290 TraceCheckUtils]: 53: Hoare triple {158506#(<= ~counter~0 5)} assume !(0 == ~cond); {158506#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:56,074 INFO L290 TraceCheckUtils]: 54: Hoare triple {158506#(<= ~counter~0 5)} assume true; {158506#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:56,083 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {158506#(<= ~counter~0 5)} {158506#(<= ~counter~0 5)} #94#return; {158506#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:56,083 INFO L290 TraceCheckUtils]: 56: Hoare triple {158506#(<= ~counter~0 5)} assume !!(0 != ~r~0); {158506#(<= ~counter~0 5)} is VALID [2022-04-15 15:19:56,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {158506#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158531#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:56,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {158531#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {158531#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:56,087 INFO L272 TraceCheckUtils]: 59: Hoare triple {158531#(<= ~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)); {158531#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:56,087 INFO L290 TraceCheckUtils]: 60: Hoare triple {158531#(<= ~counter~0 6)} ~cond := #in~cond; {158531#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:56,087 INFO L290 TraceCheckUtils]: 61: Hoare triple {158531#(<= ~counter~0 6)} assume !(0 == ~cond); {158531#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:56,088 INFO L290 TraceCheckUtils]: 62: Hoare triple {158531#(<= ~counter~0 6)} assume true; {158531#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:56,088 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {158531#(<= ~counter~0 6)} {158531#(<= ~counter~0 6)} #96#return; {158531#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:56,088 INFO L290 TraceCheckUtils]: 64: Hoare triple {158531#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158531#(<= ~counter~0 6)} is VALID [2022-04-15 15:19:56,090 INFO L290 TraceCheckUtils]: 65: Hoare triple {158531#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158556#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:56,090 INFO L290 TraceCheckUtils]: 66: Hoare triple {158556#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {158556#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:56,091 INFO L272 TraceCheckUtils]: 67: Hoare triple {158556#(<= ~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)); {158556#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:56,091 INFO L290 TraceCheckUtils]: 68: Hoare triple {158556#(<= ~counter~0 7)} ~cond := #in~cond; {158556#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:56,091 INFO L290 TraceCheckUtils]: 69: Hoare triple {158556#(<= ~counter~0 7)} assume !(0 == ~cond); {158556#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:56,091 INFO L290 TraceCheckUtils]: 70: Hoare triple {158556#(<= ~counter~0 7)} assume true; {158556#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:56,092 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {158556#(<= ~counter~0 7)} {158556#(<= ~counter~0 7)} #96#return; {158556#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:56,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {158556#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158556#(<= ~counter~0 7)} is VALID [2022-04-15 15:19:56,094 INFO L290 TraceCheckUtils]: 73: Hoare triple {158556#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158581#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:56,094 INFO L290 TraceCheckUtils]: 74: Hoare triple {158581#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {158581#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:56,094 INFO L272 TraceCheckUtils]: 75: Hoare triple {158581#(<= ~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)); {158581#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:56,095 INFO L290 TraceCheckUtils]: 76: Hoare triple {158581#(<= ~counter~0 8)} ~cond := #in~cond; {158581#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:56,095 INFO L290 TraceCheckUtils]: 77: Hoare triple {158581#(<= ~counter~0 8)} assume !(0 == ~cond); {158581#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:56,095 INFO L290 TraceCheckUtils]: 78: Hoare triple {158581#(<= ~counter~0 8)} assume true; {158581#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:56,096 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {158581#(<= ~counter~0 8)} {158581#(<= ~counter~0 8)} #96#return; {158581#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:56,096 INFO L290 TraceCheckUtils]: 80: Hoare triple {158581#(<= ~counter~0 8)} assume !(~r~0 > 0); {158581#(<= ~counter~0 8)} is VALID [2022-04-15 15:19:56,097 INFO L290 TraceCheckUtils]: 81: Hoare triple {158581#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158606#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:56,098 INFO L290 TraceCheckUtils]: 82: Hoare triple {158606#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {158606#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:56,098 INFO L272 TraceCheckUtils]: 83: Hoare triple {158606#(<= ~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)); {158606#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:56,098 INFO L290 TraceCheckUtils]: 84: Hoare triple {158606#(<= ~counter~0 9)} ~cond := #in~cond; {158606#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:56,099 INFO L290 TraceCheckUtils]: 85: Hoare triple {158606#(<= ~counter~0 9)} assume !(0 == ~cond); {158606#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:56,099 INFO L290 TraceCheckUtils]: 86: Hoare triple {158606#(<= ~counter~0 9)} assume true; {158606#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:56,099 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {158606#(<= ~counter~0 9)} {158606#(<= ~counter~0 9)} #98#return; {158606#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:56,100 INFO L290 TraceCheckUtils]: 88: Hoare triple {158606#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {158606#(<= ~counter~0 9)} is VALID [2022-04-15 15:19:56,101 INFO L290 TraceCheckUtils]: 89: Hoare triple {158606#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158631#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:56,101 INFO L290 TraceCheckUtils]: 90: Hoare triple {158631#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {158631#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:56,102 INFO L272 TraceCheckUtils]: 91: Hoare triple {158631#(<= ~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)); {158631#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:56,102 INFO L290 TraceCheckUtils]: 92: Hoare triple {158631#(<= ~counter~0 10)} ~cond := #in~cond; {158631#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:56,102 INFO L290 TraceCheckUtils]: 93: Hoare triple {158631#(<= ~counter~0 10)} assume !(0 == ~cond); {158631#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:56,103 INFO L290 TraceCheckUtils]: 94: Hoare triple {158631#(<= ~counter~0 10)} assume true; {158631#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:56,103 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {158631#(<= ~counter~0 10)} {158631#(<= ~counter~0 10)} #98#return; {158631#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:56,103 INFO L290 TraceCheckUtils]: 96: Hoare triple {158631#(<= ~counter~0 10)} assume !(~r~0 < 0); {158631#(<= ~counter~0 10)} is VALID [2022-04-15 15:19:56,105 INFO L290 TraceCheckUtils]: 97: Hoare triple {158631#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158656#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:56,105 INFO L290 TraceCheckUtils]: 98: Hoare triple {158656#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {158656#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:56,106 INFO L272 TraceCheckUtils]: 99: Hoare triple {158656#(<= ~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)); {158656#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:56,106 INFO L290 TraceCheckUtils]: 100: Hoare triple {158656#(<= ~counter~0 11)} ~cond := #in~cond; {158656#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:56,106 INFO L290 TraceCheckUtils]: 101: Hoare triple {158656#(<= ~counter~0 11)} assume !(0 == ~cond); {158656#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:56,107 INFO L290 TraceCheckUtils]: 102: Hoare triple {158656#(<= ~counter~0 11)} assume true; {158656#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:56,107 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {158656#(<= ~counter~0 11)} {158656#(<= ~counter~0 11)} #94#return; {158656#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:56,107 INFO L290 TraceCheckUtils]: 104: Hoare triple {158656#(<= ~counter~0 11)} assume !!(0 != ~r~0); {158656#(<= ~counter~0 11)} is VALID [2022-04-15 15:19:56,109 INFO L290 TraceCheckUtils]: 105: Hoare triple {158656#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158681#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:56,109 INFO L290 TraceCheckUtils]: 106: Hoare triple {158681#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {158681#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:56,110 INFO L272 TraceCheckUtils]: 107: Hoare triple {158681#(<= ~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)); {158681#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:56,110 INFO L290 TraceCheckUtils]: 108: Hoare triple {158681#(<= ~counter~0 12)} ~cond := #in~cond; {158681#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:56,110 INFO L290 TraceCheckUtils]: 109: Hoare triple {158681#(<= ~counter~0 12)} assume !(0 == ~cond); {158681#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:56,110 INFO L290 TraceCheckUtils]: 110: Hoare triple {158681#(<= ~counter~0 12)} assume true; {158681#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:56,111 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {158681#(<= ~counter~0 12)} {158681#(<= ~counter~0 12)} #96#return; {158681#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:56,111 INFO L290 TraceCheckUtils]: 112: Hoare triple {158681#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158681#(<= ~counter~0 12)} is VALID [2022-04-15 15:19:56,112 INFO L290 TraceCheckUtils]: 113: Hoare triple {158681#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158706#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:56,113 INFO L290 TraceCheckUtils]: 114: Hoare triple {158706#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {158706#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:56,113 INFO L272 TraceCheckUtils]: 115: Hoare triple {158706#(<= ~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)); {158706#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:56,113 INFO L290 TraceCheckUtils]: 116: Hoare triple {158706#(<= ~counter~0 13)} ~cond := #in~cond; {158706#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:56,114 INFO L290 TraceCheckUtils]: 117: Hoare triple {158706#(<= ~counter~0 13)} assume !(0 == ~cond); {158706#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:56,114 INFO L290 TraceCheckUtils]: 118: Hoare triple {158706#(<= ~counter~0 13)} assume true; {158706#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:56,114 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {158706#(<= ~counter~0 13)} {158706#(<= ~counter~0 13)} #96#return; {158706#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:56,115 INFO L290 TraceCheckUtils]: 120: Hoare triple {158706#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158706#(<= ~counter~0 13)} is VALID [2022-04-15 15:19:56,116 INFO L290 TraceCheckUtils]: 121: Hoare triple {158706#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158731#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:56,116 INFO L290 TraceCheckUtils]: 122: Hoare triple {158731#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {158731#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:56,117 INFO L272 TraceCheckUtils]: 123: Hoare triple {158731#(<= ~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)); {158731#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:56,117 INFO L290 TraceCheckUtils]: 124: Hoare triple {158731#(<= ~counter~0 14)} ~cond := #in~cond; {158731#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:56,117 INFO L290 TraceCheckUtils]: 125: Hoare triple {158731#(<= ~counter~0 14)} assume !(0 == ~cond); {158731#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:56,118 INFO L290 TraceCheckUtils]: 126: Hoare triple {158731#(<= ~counter~0 14)} assume true; {158731#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:56,118 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {158731#(<= ~counter~0 14)} {158731#(<= ~counter~0 14)} #96#return; {158731#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:56,118 INFO L290 TraceCheckUtils]: 128: Hoare triple {158731#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158731#(<= ~counter~0 14)} is VALID [2022-04-15 15:19:56,120 INFO L290 TraceCheckUtils]: 129: Hoare triple {158731#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158756#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:56,120 INFO L290 TraceCheckUtils]: 130: Hoare triple {158756#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {158756#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:56,120 INFO L272 TraceCheckUtils]: 131: Hoare triple {158756#(<= ~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)); {158756#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:56,121 INFO L290 TraceCheckUtils]: 132: Hoare triple {158756#(<= ~counter~0 15)} ~cond := #in~cond; {158756#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:56,121 INFO L290 TraceCheckUtils]: 133: Hoare triple {158756#(<= ~counter~0 15)} assume !(0 == ~cond); {158756#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:56,121 INFO L290 TraceCheckUtils]: 134: Hoare triple {158756#(<= ~counter~0 15)} assume true; {158756#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:56,122 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {158756#(<= ~counter~0 15)} {158756#(<= ~counter~0 15)} #96#return; {158756#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:56,122 INFO L290 TraceCheckUtils]: 136: Hoare triple {158756#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158756#(<= ~counter~0 15)} is VALID [2022-04-15 15:19:56,123 INFO L290 TraceCheckUtils]: 137: Hoare triple {158756#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158781#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:56,124 INFO L290 TraceCheckUtils]: 138: Hoare triple {158781#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {158781#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:56,124 INFO L272 TraceCheckUtils]: 139: Hoare triple {158781#(<= ~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)); {158781#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:56,124 INFO L290 TraceCheckUtils]: 140: Hoare triple {158781#(<= ~counter~0 16)} ~cond := #in~cond; {158781#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:56,125 INFO L290 TraceCheckUtils]: 141: Hoare triple {158781#(<= ~counter~0 16)} assume !(0 == ~cond); {158781#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:56,125 INFO L290 TraceCheckUtils]: 142: Hoare triple {158781#(<= ~counter~0 16)} assume true; {158781#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:56,125 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {158781#(<= ~counter~0 16)} {158781#(<= ~counter~0 16)} #96#return; {158781#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:56,126 INFO L290 TraceCheckUtils]: 144: Hoare triple {158781#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158781#(<= ~counter~0 16)} is VALID [2022-04-15 15:19:56,126 INFO L290 TraceCheckUtils]: 145: Hoare triple {158781#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158806#(<= |main_#t~post7| 16)} is VALID [2022-04-15 15:19:56,126 INFO L290 TraceCheckUtils]: 146: Hoare triple {158806#(<= |main_#t~post7| 16)} assume !(#t~post7 < 100);havoc #t~post7; {158350#false} is VALID [2022-04-15 15:19:56,126 INFO L290 TraceCheckUtils]: 147: Hoare triple {158350#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158350#false} is VALID [2022-04-15 15:19:56,126 INFO L290 TraceCheckUtils]: 148: Hoare triple {158350#false} assume !(#t~post8 < 100);havoc #t~post8; {158350#false} is VALID [2022-04-15 15:19:56,127 INFO L290 TraceCheckUtils]: 149: Hoare triple {158350#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158350#false} is VALID [2022-04-15 15:19:56,127 INFO L290 TraceCheckUtils]: 150: Hoare triple {158350#false} assume !(#t~post6 < 100);havoc #t~post6; {158350#false} is VALID [2022-04-15 15:19:56,127 INFO L272 TraceCheckUtils]: 151: Hoare triple {158350#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)); {158350#false} is VALID [2022-04-15 15:19:56,127 INFO L290 TraceCheckUtils]: 152: Hoare triple {158350#false} ~cond := #in~cond; {158350#false} is VALID [2022-04-15 15:19:56,127 INFO L290 TraceCheckUtils]: 153: Hoare triple {158350#false} assume 0 == ~cond; {158350#false} is VALID [2022-04-15 15:19:56,127 INFO L290 TraceCheckUtils]: 154: Hoare triple {158350#false} assume !false; {158350#false} is VALID [2022-04-15 15:19:56,127 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 678 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:19:56,127 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:19:57,113 INFO L290 TraceCheckUtils]: 154: Hoare triple {158350#false} assume !false; {158350#false} is VALID [2022-04-15 15:19:57,114 INFO L290 TraceCheckUtils]: 153: Hoare triple {158350#false} assume 0 == ~cond; {158350#false} is VALID [2022-04-15 15:19:57,114 INFO L290 TraceCheckUtils]: 152: Hoare triple {158350#false} ~cond := #in~cond; {158350#false} is VALID [2022-04-15 15:19:57,114 INFO L272 TraceCheckUtils]: 151: Hoare triple {158350#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)); {158350#false} is VALID [2022-04-15 15:19:57,114 INFO L290 TraceCheckUtils]: 150: Hoare triple {158350#false} assume !(#t~post6 < 100);havoc #t~post6; {158350#false} is VALID [2022-04-15 15:19:57,114 INFO L290 TraceCheckUtils]: 149: Hoare triple {158350#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158350#false} is VALID [2022-04-15 15:19:57,114 INFO L290 TraceCheckUtils]: 148: Hoare triple {158350#false} assume !(#t~post8 < 100);havoc #t~post8; {158350#false} is VALID [2022-04-15 15:19:57,114 INFO L290 TraceCheckUtils]: 147: Hoare triple {158350#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {158350#false} is VALID [2022-04-15 15:19:57,114 INFO L290 TraceCheckUtils]: 146: Hoare triple {158858#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {158350#false} is VALID [2022-04-15 15:19:57,115 INFO L290 TraceCheckUtils]: 145: Hoare triple {158862#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158858#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:19:57,115 INFO L290 TraceCheckUtils]: 144: Hoare triple {158862#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158862#(< ~counter~0 100)} is VALID [2022-04-15 15:19:57,115 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {158349#true} {158862#(< ~counter~0 100)} #96#return; {158862#(< ~counter~0 100)} is VALID [2022-04-15 15:19:57,116 INFO L290 TraceCheckUtils]: 142: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,116 INFO L290 TraceCheckUtils]: 141: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,116 INFO L290 TraceCheckUtils]: 140: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,116 INFO L272 TraceCheckUtils]: 139: Hoare triple {158862#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,116 INFO L290 TraceCheckUtils]: 138: Hoare triple {158862#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {158862#(< ~counter~0 100)} is VALID [2022-04-15 15:19:57,119 INFO L290 TraceCheckUtils]: 137: Hoare triple {158887#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158862#(< ~counter~0 100)} is VALID [2022-04-15 15:19:57,119 INFO L290 TraceCheckUtils]: 136: Hoare triple {158887#(< ~counter~0 99)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158887#(< ~counter~0 99)} is VALID [2022-04-15 15:19:57,120 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {158349#true} {158887#(< ~counter~0 99)} #96#return; {158887#(< ~counter~0 99)} is VALID [2022-04-15 15:19:57,120 INFO L290 TraceCheckUtils]: 134: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,120 INFO L290 TraceCheckUtils]: 133: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,120 INFO L290 TraceCheckUtils]: 132: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,120 INFO L272 TraceCheckUtils]: 131: Hoare triple {158887#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,121 INFO L290 TraceCheckUtils]: 130: Hoare triple {158887#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {158887#(< ~counter~0 99)} is VALID [2022-04-15 15:19:57,122 INFO L290 TraceCheckUtils]: 129: Hoare triple {158912#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158887#(< ~counter~0 99)} is VALID [2022-04-15 15:19:57,122 INFO L290 TraceCheckUtils]: 128: Hoare triple {158912#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158912#(< ~counter~0 98)} is VALID [2022-04-15 15:19:57,123 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {158349#true} {158912#(< ~counter~0 98)} #96#return; {158912#(< ~counter~0 98)} is VALID [2022-04-15 15:19:57,123 INFO L290 TraceCheckUtils]: 126: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,123 INFO L290 TraceCheckUtils]: 125: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,123 INFO L290 TraceCheckUtils]: 124: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,123 INFO L272 TraceCheckUtils]: 123: Hoare triple {158912#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,123 INFO L290 TraceCheckUtils]: 122: Hoare triple {158912#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {158912#(< ~counter~0 98)} is VALID [2022-04-15 15:19:57,125 INFO L290 TraceCheckUtils]: 121: Hoare triple {158937#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158912#(< ~counter~0 98)} is VALID [2022-04-15 15:19:57,125 INFO L290 TraceCheckUtils]: 120: Hoare triple {158937#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158937#(< ~counter~0 97)} is VALID [2022-04-15 15:19:57,125 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {158349#true} {158937#(< ~counter~0 97)} #96#return; {158937#(< ~counter~0 97)} is VALID [2022-04-15 15:19:57,126 INFO L290 TraceCheckUtils]: 118: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,126 INFO L290 TraceCheckUtils]: 117: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,126 INFO L290 TraceCheckUtils]: 116: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,126 INFO L272 TraceCheckUtils]: 115: Hoare triple {158937#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,126 INFO L290 TraceCheckUtils]: 114: Hoare triple {158937#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {158937#(< ~counter~0 97)} is VALID [2022-04-15 15:19:57,128 INFO L290 TraceCheckUtils]: 113: Hoare triple {158962#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158937#(< ~counter~0 97)} is VALID [2022-04-15 15:19:57,128 INFO L290 TraceCheckUtils]: 112: Hoare triple {158962#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {158962#(< ~counter~0 96)} is VALID [2022-04-15 15:19:57,128 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {158349#true} {158962#(< ~counter~0 96)} #96#return; {158962#(< ~counter~0 96)} is VALID [2022-04-15 15:19:57,129 INFO L290 TraceCheckUtils]: 110: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,129 INFO L290 TraceCheckUtils]: 109: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,129 INFO L290 TraceCheckUtils]: 108: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,129 INFO L272 TraceCheckUtils]: 107: Hoare triple {158962#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,129 INFO L290 TraceCheckUtils]: 106: Hoare triple {158962#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {158962#(< ~counter~0 96)} is VALID [2022-04-15 15:19:57,131 INFO L290 TraceCheckUtils]: 105: Hoare triple {158987#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {158962#(< ~counter~0 96)} is VALID [2022-04-15 15:19:57,131 INFO L290 TraceCheckUtils]: 104: Hoare triple {158987#(< ~counter~0 95)} assume !!(0 != ~r~0); {158987#(< ~counter~0 95)} is VALID [2022-04-15 15:19:57,131 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {158349#true} {158987#(< ~counter~0 95)} #94#return; {158987#(< ~counter~0 95)} is VALID [2022-04-15 15:19:57,132 INFO L290 TraceCheckUtils]: 102: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,132 INFO L290 TraceCheckUtils]: 101: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,132 INFO L290 TraceCheckUtils]: 100: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,132 INFO L272 TraceCheckUtils]: 99: Hoare triple {158987#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,132 INFO L290 TraceCheckUtils]: 98: Hoare triple {158987#(< ~counter~0 95)} assume !!(#t~post6 < 100);havoc #t~post6; {158987#(< ~counter~0 95)} is VALID [2022-04-15 15:19:57,133 INFO L290 TraceCheckUtils]: 97: Hoare triple {159012#(< ~counter~0 94)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {158987#(< ~counter~0 95)} is VALID [2022-04-15 15:19:57,133 INFO L290 TraceCheckUtils]: 96: Hoare triple {159012#(< ~counter~0 94)} assume !(~r~0 < 0); {159012#(< ~counter~0 94)} is VALID [2022-04-15 15:19:57,134 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {158349#true} {159012#(< ~counter~0 94)} #98#return; {159012#(< ~counter~0 94)} is VALID [2022-04-15 15:19:57,134 INFO L290 TraceCheckUtils]: 94: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,134 INFO L290 TraceCheckUtils]: 93: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,134 INFO L290 TraceCheckUtils]: 92: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,134 INFO L272 TraceCheckUtils]: 91: Hoare triple {159012#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,135 INFO L290 TraceCheckUtils]: 90: Hoare triple {159012#(< ~counter~0 94)} assume !!(#t~post8 < 100);havoc #t~post8; {159012#(< ~counter~0 94)} is VALID [2022-04-15 15:19:57,136 INFO L290 TraceCheckUtils]: 89: Hoare triple {159037#(< ~counter~0 93)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {159012#(< ~counter~0 94)} is VALID [2022-04-15 15:19:57,136 INFO L290 TraceCheckUtils]: 88: Hoare triple {159037#(< ~counter~0 93)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {159037#(< ~counter~0 93)} is VALID [2022-04-15 15:19:57,137 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {158349#true} {159037#(< ~counter~0 93)} #98#return; {159037#(< ~counter~0 93)} is VALID [2022-04-15 15:19:57,137 INFO L290 TraceCheckUtils]: 86: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,137 INFO L290 TraceCheckUtils]: 85: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,137 INFO L290 TraceCheckUtils]: 84: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,137 INFO L272 TraceCheckUtils]: 83: Hoare triple {159037#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,137 INFO L290 TraceCheckUtils]: 82: Hoare triple {159037#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {159037#(< ~counter~0 93)} is VALID [2022-04-15 15:19:57,138 INFO L290 TraceCheckUtils]: 81: Hoare triple {159062#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {159037#(< ~counter~0 93)} is VALID [2022-04-15 15:19:57,139 INFO L290 TraceCheckUtils]: 80: Hoare triple {159062#(< ~counter~0 92)} assume !(~r~0 > 0); {159062#(< ~counter~0 92)} is VALID [2022-04-15 15:19:57,139 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {158349#true} {159062#(< ~counter~0 92)} #96#return; {159062#(< ~counter~0 92)} is VALID [2022-04-15 15:19:57,139 INFO L290 TraceCheckUtils]: 78: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,139 INFO L290 TraceCheckUtils]: 77: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,139 INFO L290 TraceCheckUtils]: 76: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,139 INFO L272 TraceCheckUtils]: 75: Hoare triple {159062#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,140 INFO L290 TraceCheckUtils]: 74: Hoare triple {159062#(< ~counter~0 92)} assume !!(#t~post7 < 100);havoc #t~post7; {159062#(< ~counter~0 92)} is VALID [2022-04-15 15:19:57,141 INFO L290 TraceCheckUtils]: 73: Hoare triple {159087#(< ~counter~0 91)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {159062#(< ~counter~0 92)} is VALID [2022-04-15 15:19:57,141 INFO L290 TraceCheckUtils]: 72: Hoare triple {159087#(< ~counter~0 91)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {159087#(< ~counter~0 91)} is VALID [2022-04-15 15:19:57,142 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {158349#true} {159087#(< ~counter~0 91)} #96#return; {159087#(< ~counter~0 91)} is VALID [2022-04-15 15:19:57,142 INFO L290 TraceCheckUtils]: 70: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,142 INFO L290 TraceCheckUtils]: 69: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,142 INFO L290 TraceCheckUtils]: 68: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,142 INFO L272 TraceCheckUtils]: 67: Hoare triple {159087#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,142 INFO L290 TraceCheckUtils]: 66: Hoare triple {159087#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {159087#(< ~counter~0 91)} is VALID [2022-04-15 15:19:57,144 INFO L290 TraceCheckUtils]: 65: Hoare triple {159112#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {159087#(< ~counter~0 91)} is VALID [2022-04-15 15:19:57,144 INFO L290 TraceCheckUtils]: 64: Hoare triple {159112#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {159112#(< ~counter~0 90)} is VALID [2022-04-15 15:19:57,144 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {158349#true} {159112#(< ~counter~0 90)} #96#return; {159112#(< ~counter~0 90)} is VALID [2022-04-15 15:19:57,144 INFO L290 TraceCheckUtils]: 62: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,144 INFO L290 TraceCheckUtils]: 61: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,145 INFO L290 TraceCheckUtils]: 60: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,145 INFO L272 TraceCheckUtils]: 59: Hoare triple {159112#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,145 INFO L290 TraceCheckUtils]: 58: Hoare triple {159112#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {159112#(< ~counter~0 90)} is VALID [2022-04-15 15:19:57,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {159137#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {159112#(< ~counter~0 90)} is VALID [2022-04-15 15:19:57,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {159137#(< ~counter~0 89)} assume !!(0 != ~r~0); {159137#(< ~counter~0 89)} is VALID [2022-04-15 15:19:57,147 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {158349#true} {159137#(< ~counter~0 89)} #94#return; {159137#(< ~counter~0 89)} is VALID [2022-04-15 15:19:57,147 INFO L290 TraceCheckUtils]: 54: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,147 INFO L290 TraceCheckUtils]: 53: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,147 INFO L290 TraceCheckUtils]: 52: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,147 INFO L272 TraceCheckUtils]: 51: Hoare triple {159137#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,148 INFO L290 TraceCheckUtils]: 50: Hoare triple {159137#(< ~counter~0 89)} assume !!(#t~post6 < 100);havoc #t~post6; {159137#(< ~counter~0 89)} is VALID [2022-04-15 15:19:57,149 INFO L290 TraceCheckUtils]: 49: Hoare triple {159162#(< ~counter~0 88)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {159137#(< ~counter~0 89)} is VALID [2022-04-15 15:19:57,149 INFO L290 TraceCheckUtils]: 48: Hoare triple {159162#(< ~counter~0 88)} assume !(~r~0 < 0); {159162#(< ~counter~0 88)} is VALID [2022-04-15 15:19:57,150 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {158349#true} {159162#(< ~counter~0 88)} #98#return; {159162#(< ~counter~0 88)} is VALID [2022-04-15 15:19:57,150 INFO L290 TraceCheckUtils]: 46: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,150 INFO L290 TraceCheckUtils]: 45: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,150 INFO L290 TraceCheckUtils]: 44: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,150 INFO L272 TraceCheckUtils]: 43: Hoare triple {159162#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,150 INFO L290 TraceCheckUtils]: 42: Hoare triple {159162#(< ~counter~0 88)} assume !!(#t~post8 < 100);havoc #t~post8; {159162#(< ~counter~0 88)} is VALID [2022-04-15 15:19:57,151 INFO L290 TraceCheckUtils]: 41: Hoare triple {159187#(< ~counter~0 87)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {159162#(< ~counter~0 88)} is VALID [2022-04-15 15:19:57,152 INFO L290 TraceCheckUtils]: 40: Hoare triple {159187#(< ~counter~0 87)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {159187#(< ~counter~0 87)} is VALID [2022-04-15 15:19:57,152 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {158349#true} {159187#(< ~counter~0 87)} #98#return; {159187#(< ~counter~0 87)} is VALID [2022-04-15 15:19:57,152 INFO L290 TraceCheckUtils]: 38: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,152 INFO L290 TraceCheckUtils]: 37: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,152 INFO L290 TraceCheckUtils]: 36: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,152 INFO L272 TraceCheckUtils]: 35: Hoare triple {159187#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,153 INFO L290 TraceCheckUtils]: 34: Hoare triple {159187#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {159187#(< ~counter~0 87)} is VALID [2022-04-15 15:19:57,154 INFO L290 TraceCheckUtils]: 33: Hoare triple {159212#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {159187#(< ~counter~0 87)} is VALID [2022-04-15 15:19:57,154 INFO L290 TraceCheckUtils]: 32: Hoare triple {159212#(< ~counter~0 86)} assume !(~r~0 > 0); {159212#(< ~counter~0 86)} is VALID [2022-04-15 15:19:57,155 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {158349#true} {159212#(< ~counter~0 86)} #96#return; {159212#(< ~counter~0 86)} is VALID [2022-04-15 15:19:57,155 INFO L290 TraceCheckUtils]: 30: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,155 INFO L290 TraceCheckUtils]: 29: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,155 INFO L290 TraceCheckUtils]: 28: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,155 INFO L272 TraceCheckUtils]: 27: Hoare triple {159212#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,155 INFO L290 TraceCheckUtils]: 26: Hoare triple {159212#(< ~counter~0 86)} assume !!(#t~post7 < 100);havoc #t~post7; {159212#(< ~counter~0 86)} is VALID [2022-04-15 15:19:57,157 INFO L290 TraceCheckUtils]: 25: Hoare triple {159237#(< ~counter~0 85)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {159212#(< ~counter~0 86)} is VALID [2022-04-15 15:19:57,157 INFO L290 TraceCheckUtils]: 24: Hoare triple {159237#(< ~counter~0 85)} assume !!(0 != ~r~0); {159237#(< ~counter~0 85)} is VALID [2022-04-15 15:19:57,157 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {158349#true} {159237#(< ~counter~0 85)} #94#return; {159237#(< ~counter~0 85)} is VALID [2022-04-15 15:19:57,157 INFO L290 TraceCheckUtils]: 22: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,158 INFO L272 TraceCheckUtils]: 19: Hoare triple {159237#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {159237#(< ~counter~0 85)} assume !!(#t~post6 < 100);havoc #t~post6; {159237#(< ~counter~0 85)} is VALID [2022-04-15 15:19:57,159 INFO L290 TraceCheckUtils]: 17: Hoare triple {159262#(< ~counter~0 84)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {159237#(< ~counter~0 85)} is VALID [2022-04-15 15:19:57,159 INFO L290 TraceCheckUtils]: 16: Hoare triple {159262#(< ~counter~0 84)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {159262#(< ~counter~0 84)} is VALID [2022-04-15 15:19:57,160 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {158349#true} {159262#(< ~counter~0 84)} #92#return; {159262#(< ~counter~0 84)} is VALID [2022-04-15 15:19:57,160 INFO L290 TraceCheckUtils]: 14: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,160 INFO L290 TraceCheckUtils]: 13: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,160 INFO L290 TraceCheckUtils]: 12: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,160 INFO L272 TraceCheckUtils]: 11: Hoare triple {159262#(< ~counter~0 84)} 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)); {158349#true} is VALID [2022-04-15 15:19:57,161 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {158349#true} {159262#(< ~counter~0 84)} #90#return; {159262#(< ~counter~0 84)} is VALID [2022-04-15 15:19:57,161 INFO L290 TraceCheckUtils]: 9: Hoare triple {158349#true} assume true; {158349#true} is VALID [2022-04-15 15:19:57,161 INFO L290 TraceCheckUtils]: 8: Hoare triple {158349#true} assume !(0 == ~cond); {158349#true} is VALID [2022-04-15 15:19:57,161 INFO L290 TraceCheckUtils]: 7: Hoare triple {158349#true} ~cond := #in~cond; {158349#true} is VALID [2022-04-15 15:19:57,161 INFO L272 TraceCheckUtils]: 6: Hoare triple {159262#(< ~counter~0 84)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {158349#true} is VALID [2022-04-15 15:19:57,161 INFO L290 TraceCheckUtils]: 5: Hoare triple {159262#(< ~counter~0 84)} 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; {159262#(< ~counter~0 84)} is VALID [2022-04-15 15:19:57,161 INFO L272 TraceCheckUtils]: 4: Hoare triple {159262#(< ~counter~0 84)} call #t~ret9 := main(); {159262#(< ~counter~0 84)} is VALID [2022-04-15 15:19:57,162 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {159262#(< ~counter~0 84)} {158349#true} #102#return; {159262#(< ~counter~0 84)} is VALID [2022-04-15 15:19:57,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {159262#(< ~counter~0 84)} assume true; {159262#(< ~counter~0 84)} is VALID [2022-04-15 15:19:57,162 INFO L290 TraceCheckUtils]: 1: Hoare triple {158349#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; {159262#(< ~counter~0 84)} is VALID [2022-04-15 15:19:57,163 INFO L272 TraceCheckUtils]: 0: Hoare triple {158349#true} call ULTIMATE.init(); {158349#true} is VALID [2022-04-15 15:19:57,163 INFO L134 CoverageAnalysis]: Checked inductivity of 728 backedges. 46 proven. 198 refuted. 0 times theorem prover too weak. 484 trivial. 0 not checked. [2022-04-15 15:19:57,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:19:57,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716115081] [2022-04-15 15:19:57,163 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:19:57,163 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1629071708] [2022-04-15 15:19:57,163 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1629071708] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:19:57,163 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:19:57,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 38 [2022-04-15 15:19:57,164 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:19:57,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [268516521] [2022-04-15 15:19:57,164 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [268516521] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:19:57,164 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:19:57,164 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2022-04-15 15:19:57,164 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527626900] [2022-04-15 15:19:57,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:19:57,164 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 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 155 [2022-04-15 15:19:57,165 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:19:57,165 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 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-15 15:19:57,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:19:57,345 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-04-15 15:19:57,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:19:57,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-04-15 15:19:57,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=635, Invalid=771, Unknown=0, NotChecked=0, Total=1406 [2022-04-15 15:19:57,345 INFO L87 Difference]: Start difference. First operand 838 states and 1117 transitions. Second operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 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-15 15:20:02,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:02,746 INFO L93 Difference]: Finished difference Result 1025 states and 1395 transitions. [2022-04-15 15:20:02,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 15:20:02,746 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 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 155 [2022-04-15 15:20:02,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:20:02,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 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-15 15:20:02,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-15 15:20:02,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 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-15 15:20:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 356 transitions. [2022-04-15 15:20:02,753 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 356 transitions. [2022-04-15 15:20:03,198 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 356 edges. 356 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:03,231 INFO L225 Difference]: With dead ends: 1025 [2022-04-15 15:20:03,231 INFO L226 Difference]: Without dead ends: 855 [2022-04-15 15:20:03,232 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 324 GetRequests, 273 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=1175, Invalid=1581, Unknown=0, NotChecked=0, Total=2756 [2022-04-15 15:20:03,232 INFO L913 BasicCegarLoop]: 78 mSDtfsCounter, 303 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 248 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 348 SdHoareTripleChecker+Invalid, 462 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 248 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-04-15 15:20:03,233 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 348 Invalid, 462 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [248 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-04-15 15:20:03,233 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-04-15 15:20:06,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 855. [2022-04-15 15:20:06,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:20:06,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 855 states. Second operand has 855 states, 644 states have (on average 1.1770186335403727) internal successors, (758), 651 states have internal predecessors, (758), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:20:06,653 INFO L74 IsIncluded]: Start isIncluded. First operand 855 states. Second operand has 855 states, 644 states have (on average 1.1770186335403727) internal successors, (758), 651 states have internal predecessors, (758), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:20:06,653 INFO L87 Difference]: Start difference. First operand 855 states. Second operand has 855 states, 644 states have (on average 1.1770186335403727) internal successors, (758), 651 states have internal predecessors, (758), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:20:06,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:06,687 INFO L93 Difference]: Finished difference Result 855 states and 1134 transitions. [2022-04-15 15:20:06,687 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1134 transitions. [2022-04-15 15:20:06,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:06,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:06,689 INFO L74 IsIncluded]: Start isIncluded. First operand has 855 states, 644 states have (on average 1.1770186335403727) internal successors, (758), 651 states have internal predecessors, (758), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 855 states. [2022-04-15 15:20:06,690 INFO L87 Difference]: Start difference. First operand has 855 states, 644 states have (on average 1.1770186335403727) internal successors, (758), 651 states have internal predecessors, (758), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) Second operand 855 states. [2022-04-15 15:20:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:06,715 INFO L93 Difference]: Finished difference Result 855 states and 1134 transitions. [2022-04-15 15:20:06,715 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1134 transitions. [2022-04-15 15:20:06,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:06,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:06,716 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:20:06,716 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:20:06,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 855 states, 644 states have (on average 1.1770186335403727) internal successors, (758), 651 states have internal predecessors, (758), 189 states have call successors, (189), 23 states have call predecessors, (189), 21 states have return successors, (187), 180 states have call predecessors, (187), 187 states have call successors, (187) [2022-04-15 15:20:06,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 855 states to 855 states and 1134 transitions. [2022-04-15 15:20:06,748 INFO L78 Accepts]: Start accepts. Automaton has 855 states and 1134 transitions. Word has length 155 [2022-04-15 15:20:06,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:20:06,748 INFO L478 AbstractCegarLoop]: Abstraction has 855 states and 1134 transitions. [2022-04-15 15:20:06,748 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 20 states have (on average 5.6) internal successors, (112), 19 states have internal predecessors, (112), 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-15 15:20:06,748 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 855 states and 1134 transitions. [2022-04-15 15:20:12,580 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1134 edges. 1134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:12,580 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1134 transitions. [2022-04-15 15:20:12,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 160 [2022-04-15 15:20:12,582 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:20:12,582 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 8, 8, 8, 6, 6, 6, 6, 5, 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-15 15:20:12,587 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (55)] Forceful destruction successful, exit code 0 [2022-04-15 15:20:12,787 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable53,55 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:12,787 INFO L403 AbstractCegarLoop]: === Iteration 55 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:20:12,787 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:20:12,787 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 17 times [2022-04-15 15:20:12,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:12,787 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [2077947859] [2022-04-15 15:20:12,788 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:20:12,788 INFO L85 PathProgramCache]: Analyzing trace with hash -61113684, now seen corresponding path program 18 times [2022-04-15 15:20:12,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:20:12,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [153133941] [2022-04-15 15:20:12,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:20:12,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:20:12,802 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:20:12,802 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1258540310] [2022-04-15 15:20:12,802 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:20:12,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:12,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:20:12,809 INFO L229 MonitoredProcess]: Starting monitored process 56 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:20:12,809 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Waiting until timeout for monitored process [2022-04-15 15:20:13,544 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:20:13,544 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:20:13,548 INFO L263 TraceCheckSpWp]: Trace formula consists of 380 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 15:20:13,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:20:13,581 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:20:14,460 INFO L272 TraceCheckUtils]: 0: Hoare triple {164816#true} call ULTIMATE.init(); {164816#true} is VALID [2022-04-15 15:20:14,460 INFO L290 TraceCheckUtils]: 1: Hoare triple {164816#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; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {164824#(<= ~counter~0 0)} assume true; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,461 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {164824#(<= ~counter~0 0)} {164816#true} #102#return; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,461 INFO L272 TraceCheckUtils]: 4: Hoare triple {164824#(<= ~counter~0 0)} call #t~ret9 := main(); {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,462 INFO L290 TraceCheckUtils]: 5: Hoare triple {164824#(<= ~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; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,462 INFO L272 TraceCheckUtils]: 6: Hoare triple {164824#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {164824#(<= ~counter~0 0)} ~cond := #in~cond; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {164824#(<= ~counter~0 0)} assume !(0 == ~cond); {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,463 INFO L290 TraceCheckUtils]: 9: Hoare triple {164824#(<= ~counter~0 0)} assume true; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,463 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {164824#(<= ~counter~0 0)} {164824#(<= ~counter~0 0)} #90#return; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,464 INFO L272 TraceCheckUtils]: 11: Hoare triple {164824#(<= ~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)); {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,464 INFO L290 TraceCheckUtils]: 12: Hoare triple {164824#(<= ~counter~0 0)} ~cond := #in~cond; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,464 INFO L290 TraceCheckUtils]: 13: Hoare triple {164824#(<= ~counter~0 0)} assume !(0 == ~cond); {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {164824#(<= ~counter~0 0)} assume true; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,465 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {164824#(<= ~counter~0 0)} {164824#(<= ~counter~0 0)} #92#return; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,465 INFO L290 TraceCheckUtils]: 16: Hoare triple {164824#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {164824#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:14,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {164824#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164873#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:14,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {164873#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {164873#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:14,469 INFO L272 TraceCheckUtils]: 19: Hoare triple {164873#(<= ~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)); {164873#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:14,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {164873#(<= ~counter~0 1)} ~cond := #in~cond; {164873#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:14,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {164873#(<= ~counter~0 1)} assume !(0 == ~cond); {164873#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:14,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {164873#(<= ~counter~0 1)} assume true; {164873#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:14,470 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {164873#(<= ~counter~0 1)} {164873#(<= ~counter~0 1)} #94#return; {164873#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:14,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {164873#(<= ~counter~0 1)} assume !!(0 != ~r~0); {164873#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:14,472 INFO L290 TraceCheckUtils]: 25: Hoare triple {164873#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164898#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:14,472 INFO L290 TraceCheckUtils]: 26: Hoare triple {164898#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {164898#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:14,473 INFO L272 TraceCheckUtils]: 27: Hoare triple {164898#(<= ~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)); {164898#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:14,473 INFO L290 TraceCheckUtils]: 28: Hoare triple {164898#(<= ~counter~0 2)} ~cond := #in~cond; {164898#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:14,473 INFO L290 TraceCheckUtils]: 29: Hoare triple {164898#(<= ~counter~0 2)} assume !(0 == ~cond); {164898#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:14,473 INFO L290 TraceCheckUtils]: 30: Hoare triple {164898#(<= ~counter~0 2)} assume true; {164898#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:14,474 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {164898#(<= ~counter~0 2)} {164898#(<= ~counter~0 2)} #96#return; {164898#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:14,474 INFO L290 TraceCheckUtils]: 32: Hoare triple {164898#(<= ~counter~0 2)} assume !(~r~0 > 0); {164898#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:14,476 INFO L290 TraceCheckUtils]: 33: Hoare triple {164898#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164923#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:14,476 INFO L290 TraceCheckUtils]: 34: Hoare triple {164923#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {164923#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:14,476 INFO L272 TraceCheckUtils]: 35: Hoare triple {164923#(<= ~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)); {164923#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:14,477 INFO L290 TraceCheckUtils]: 36: Hoare triple {164923#(<= ~counter~0 3)} ~cond := #in~cond; {164923#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:14,477 INFO L290 TraceCheckUtils]: 37: Hoare triple {164923#(<= ~counter~0 3)} assume !(0 == ~cond); {164923#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:14,477 INFO L290 TraceCheckUtils]: 38: Hoare triple {164923#(<= ~counter~0 3)} assume true; {164923#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:14,478 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {164923#(<= ~counter~0 3)} {164923#(<= ~counter~0 3)} #98#return; {164923#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:14,478 INFO L290 TraceCheckUtils]: 40: Hoare triple {164923#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {164923#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:14,479 INFO L290 TraceCheckUtils]: 41: Hoare triple {164923#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {164948#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:14,480 INFO L290 TraceCheckUtils]: 42: Hoare triple {164948#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {164948#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:14,480 INFO L272 TraceCheckUtils]: 43: Hoare triple {164948#(<= ~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)); {164948#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:14,480 INFO L290 TraceCheckUtils]: 44: Hoare triple {164948#(<= ~counter~0 4)} ~cond := #in~cond; {164948#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:14,481 INFO L290 TraceCheckUtils]: 45: Hoare triple {164948#(<= ~counter~0 4)} assume !(0 == ~cond); {164948#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:14,481 INFO L290 TraceCheckUtils]: 46: Hoare triple {164948#(<= ~counter~0 4)} assume true; {164948#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:14,481 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {164948#(<= ~counter~0 4)} {164948#(<= ~counter~0 4)} #98#return; {164948#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:14,482 INFO L290 TraceCheckUtils]: 48: Hoare triple {164948#(<= ~counter~0 4)} assume !(~r~0 < 0); {164948#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:14,483 INFO L290 TraceCheckUtils]: 49: Hoare triple {164948#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {164973#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:14,483 INFO L290 TraceCheckUtils]: 50: Hoare triple {164973#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {164973#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:14,484 INFO L272 TraceCheckUtils]: 51: Hoare triple {164973#(<= ~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)); {164973#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:14,484 INFO L290 TraceCheckUtils]: 52: Hoare triple {164973#(<= ~counter~0 5)} ~cond := #in~cond; {164973#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:14,484 INFO L290 TraceCheckUtils]: 53: Hoare triple {164973#(<= ~counter~0 5)} assume !(0 == ~cond); {164973#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:14,484 INFO L290 TraceCheckUtils]: 54: Hoare triple {164973#(<= ~counter~0 5)} assume true; {164973#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:14,485 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {164973#(<= ~counter~0 5)} {164973#(<= ~counter~0 5)} #94#return; {164973#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:14,485 INFO L290 TraceCheckUtils]: 56: Hoare triple {164973#(<= ~counter~0 5)} assume !!(0 != ~r~0); {164973#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:14,495 INFO L290 TraceCheckUtils]: 57: Hoare triple {164973#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {164998#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:14,496 INFO L290 TraceCheckUtils]: 58: Hoare triple {164998#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {164998#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:14,496 INFO L272 TraceCheckUtils]: 59: Hoare triple {164998#(<= ~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)); {164998#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:14,497 INFO L290 TraceCheckUtils]: 60: Hoare triple {164998#(<= ~counter~0 6)} ~cond := #in~cond; {164998#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:14,497 INFO L290 TraceCheckUtils]: 61: Hoare triple {164998#(<= ~counter~0 6)} assume !(0 == ~cond); {164998#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:14,497 INFO L290 TraceCheckUtils]: 62: Hoare triple {164998#(<= ~counter~0 6)} assume true; {164998#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:14,498 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {164998#(<= ~counter~0 6)} {164998#(<= ~counter~0 6)} #96#return; {164998#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:14,498 INFO L290 TraceCheckUtils]: 64: Hoare triple {164998#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {164998#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:14,499 INFO L290 TraceCheckUtils]: 65: Hoare triple {164998#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165023#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:14,500 INFO L290 TraceCheckUtils]: 66: Hoare triple {165023#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {165023#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:14,500 INFO L272 TraceCheckUtils]: 67: Hoare triple {165023#(<= ~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)); {165023#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:14,500 INFO L290 TraceCheckUtils]: 68: Hoare triple {165023#(<= ~counter~0 7)} ~cond := #in~cond; {165023#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:14,501 INFO L290 TraceCheckUtils]: 69: Hoare triple {165023#(<= ~counter~0 7)} assume !(0 == ~cond); {165023#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:14,501 INFO L290 TraceCheckUtils]: 70: Hoare triple {165023#(<= ~counter~0 7)} assume true; {165023#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:14,502 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {165023#(<= ~counter~0 7)} {165023#(<= ~counter~0 7)} #96#return; {165023#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:14,502 INFO L290 TraceCheckUtils]: 72: Hoare triple {165023#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {165023#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:14,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {165023#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165048#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:14,503 INFO L290 TraceCheckUtils]: 74: Hoare triple {165048#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {165048#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:14,504 INFO L272 TraceCheckUtils]: 75: Hoare triple {165048#(<= ~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)); {165048#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:14,504 INFO L290 TraceCheckUtils]: 76: Hoare triple {165048#(<= ~counter~0 8)} ~cond := #in~cond; {165048#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:14,504 INFO L290 TraceCheckUtils]: 77: Hoare triple {165048#(<= ~counter~0 8)} assume !(0 == ~cond); {165048#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:14,505 INFO L290 TraceCheckUtils]: 78: Hoare triple {165048#(<= ~counter~0 8)} assume true; {165048#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:14,505 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {165048#(<= ~counter~0 8)} {165048#(<= ~counter~0 8)} #96#return; {165048#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:14,505 INFO L290 TraceCheckUtils]: 80: Hoare triple {165048#(<= ~counter~0 8)} assume !(~r~0 > 0); {165048#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:14,507 INFO L290 TraceCheckUtils]: 81: Hoare triple {165048#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165073#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:14,507 INFO L290 TraceCheckUtils]: 82: Hoare triple {165073#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {165073#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:14,507 INFO L272 TraceCheckUtils]: 83: Hoare triple {165073#(<= ~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)); {165073#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:14,508 INFO L290 TraceCheckUtils]: 84: Hoare triple {165073#(<= ~counter~0 9)} ~cond := #in~cond; {165073#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:14,508 INFO L290 TraceCheckUtils]: 85: Hoare triple {165073#(<= ~counter~0 9)} assume !(0 == ~cond); {165073#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:14,508 INFO L290 TraceCheckUtils]: 86: Hoare triple {165073#(<= ~counter~0 9)} assume true; {165073#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:14,509 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {165073#(<= ~counter~0 9)} {165073#(<= ~counter~0 9)} #98#return; {165073#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:14,509 INFO L290 TraceCheckUtils]: 88: Hoare triple {165073#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {165073#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:14,510 INFO L290 TraceCheckUtils]: 89: Hoare triple {165073#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165098#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:14,511 INFO L290 TraceCheckUtils]: 90: Hoare triple {165098#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {165098#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:14,511 INFO L272 TraceCheckUtils]: 91: Hoare triple {165098#(<= ~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)); {165098#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:14,511 INFO L290 TraceCheckUtils]: 92: Hoare triple {165098#(<= ~counter~0 10)} ~cond := #in~cond; {165098#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:14,512 INFO L290 TraceCheckUtils]: 93: Hoare triple {165098#(<= ~counter~0 10)} assume !(0 == ~cond); {165098#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:14,512 INFO L290 TraceCheckUtils]: 94: Hoare triple {165098#(<= ~counter~0 10)} assume true; {165098#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:14,512 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {165098#(<= ~counter~0 10)} {165098#(<= ~counter~0 10)} #98#return; {165098#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:14,513 INFO L290 TraceCheckUtils]: 96: Hoare triple {165098#(<= ~counter~0 10)} assume !(~r~0 < 0); {165098#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:14,514 INFO L290 TraceCheckUtils]: 97: Hoare triple {165098#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {165123#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:14,514 INFO L290 TraceCheckUtils]: 98: Hoare triple {165123#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {165123#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:14,515 INFO L272 TraceCheckUtils]: 99: Hoare triple {165123#(<= ~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)); {165123#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:14,515 INFO L290 TraceCheckUtils]: 100: Hoare triple {165123#(<= ~counter~0 11)} ~cond := #in~cond; {165123#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:14,515 INFO L290 TraceCheckUtils]: 101: Hoare triple {165123#(<= ~counter~0 11)} assume !(0 == ~cond); {165123#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:14,515 INFO L290 TraceCheckUtils]: 102: Hoare triple {165123#(<= ~counter~0 11)} assume true; {165123#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:14,516 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {165123#(<= ~counter~0 11)} {165123#(<= ~counter~0 11)} #94#return; {165123#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:14,516 INFO L290 TraceCheckUtils]: 104: Hoare triple {165123#(<= ~counter~0 11)} assume !!(0 != ~r~0); {165123#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:14,517 INFO L290 TraceCheckUtils]: 105: Hoare triple {165123#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165148#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:14,518 INFO L290 TraceCheckUtils]: 106: Hoare triple {165148#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {165148#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:14,518 INFO L272 TraceCheckUtils]: 107: Hoare triple {165148#(<= ~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)); {165148#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:14,519 INFO L290 TraceCheckUtils]: 108: Hoare triple {165148#(<= ~counter~0 12)} ~cond := #in~cond; {165148#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:14,519 INFO L290 TraceCheckUtils]: 109: Hoare triple {165148#(<= ~counter~0 12)} assume !(0 == ~cond); {165148#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:14,519 INFO L290 TraceCheckUtils]: 110: Hoare triple {165148#(<= ~counter~0 12)} assume true; {165148#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:14,520 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {165148#(<= ~counter~0 12)} {165148#(<= ~counter~0 12)} #96#return; {165148#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:14,520 INFO L290 TraceCheckUtils]: 112: Hoare triple {165148#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {165148#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:14,521 INFO L290 TraceCheckUtils]: 113: Hoare triple {165148#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165173#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:14,521 INFO L290 TraceCheckUtils]: 114: Hoare triple {165173#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {165173#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:14,522 INFO L272 TraceCheckUtils]: 115: Hoare triple {165173#(<= ~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)); {165173#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:14,522 INFO L290 TraceCheckUtils]: 116: Hoare triple {165173#(<= ~counter~0 13)} ~cond := #in~cond; {165173#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:14,522 INFO L290 TraceCheckUtils]: 117: Hoare triple {165173#(<= ~counter~0 13)} assume !(0 == ~cond); {165173#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:14,523 INFO L290 TraceCheckUtils]: 118: Hoare triple {165173#(<= ~counter~0 13)} assume true; {165173#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:14,523 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {165173#(<= ~counter~0 13)} {165173#(<= ~counter~0 13)} #96#return; {165173#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:14,523 INFO L290 TraceCheckUtils]: 120: Hoare triple {165173#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {165173#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:14,525 INFO L290 TraceCheckUtils]: 121: Hoare triple {165173#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165198#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:14,525 INFO L290 TraceCheckUtils]: 122: Hoare triple {165198#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {165198#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:14,525 INFO L272 TraceCheckUtils]: 123: Hoare triple {165198#(<= ~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)); {165198#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:14,526 INFO L290 TraceCheckUtils]: 124: Hoare triple {165198#(<= ~counter~0 14)} ~cond := #in~cond; {165198#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:14,526 INFO L290 TraceCheckUtils]: 125: Hoare triple {165198#(<= ~counter~0 14)} assume !(0 == ~cond); {165198#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:14,526 INFO L290 TraceCheckUtils]: 126: Hoare triple {165198#(<= ~counter~0 14)} assume true; {165198#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:14,527 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {165198#(<= ~counter~0 14)} {165198#(<= ~counter~0 14)} #96#return; {165198#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:14,527 INFO L290 TraceCheckUtils]: 128: Hoare triple {165198#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {165198#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:14,528 INFO L290 TraceCheckUtils]: 129: Hoare triple {165198#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165223#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:14,529 INFO L290 TraceCheckUtils]: 130: Hoare triple {165223#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {165223#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:14,529 INFO L272 TraceCheckUtils]: 131: Hoare triple {165223#(<= ~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)); {165223#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:14,529 INFO L290 TraceCheckUtils]: 132: Hoare triple {165223#(<= ~counter~0 15)} ~cond := #in~cond; {165223#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:14,530 INFO L290 TraceCheckUtils]: 133: Hoare triple {165223#(<= ~counter~0 15)} assume !(0 == ~cond); {165223#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:14,530 INFO L290 TraceCheckUtils]: 134: Hoare triple {165223#(<= ~counter~0 15)} assume true; {165223#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:14,531 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {165223#(<= ~counter~0 15)} {165223#(<= ~counter~0 15)} #96#return; {165223#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:14,531 INFO L290 TraceCheckUtils]: 136: Hoare triple {165223#(<= ~counter~0 15)} assume !(~r~0 > 0); {165223#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:14,532 INFO L290 TraceCheckUtils]: 137: Hoare triple {165223#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165248#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:14,533 INFO L290 TraceCheckUtils]: 138: Hoare triple {165248#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {165248#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:14,533 INFO L272 TraceCheckUtils]: 139: Hoare triple {165248#(<= ~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)); {165248#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:14,533 INFO L290 TraceCheckUtils]: 140: Hoare triple {165248#(<= ~counter~0 16)} ~cond := #in~cond; {165248#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:14,534 INFO L290 TraceCheckUtils]: 141: Hoare triple {165248#(<= ~counter~0 16)} assume !(0 == ~cond); {165248#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:14,534 INFO L290 TraceCheckUtils]: 142: Hoare triple {165248#(<= ~counter~0 16)} assume true; {165248#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:14,534 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {165248#(<= ~counter~0 16)} {165248#(<= ~counter~0 16)} #98#return; {165248#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:14,535 INFO L290 TraceCheckUtils]: 144: Hoare triple {165248#(<= ~counter~0 16)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {165248#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:14,536 INFO L290 TraceCheckUtils]: 145: Hoare triple {165248#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165273#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:14,537 INFO L290 TraceCheckUtils]: 146: Hoare triple {165273#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {165273#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:14,537 INFO L272 TraceCheckUtils]: 147: Hoare triple {165273#(<= ~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)); {165273#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:14,538 INFO L290 TraceCheckUtils]: 148: Hoare triple {165273#(<= ~counter~0 17)} ~cond := #in~cond; {165273#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:14,538 INFO L290 TraceCheckUtils]: 149: Hoare triple {165273#(<= ~counter~0 17)} assume !(0 == ~cond); {165273#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:14,538 INFO L290 TraceCheckUtils]: 150: Hoare triple {165273#(<= ~counter~0 17)} assume true; {165273#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:14,539 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {165273#(<= ~counter~0 17)} {165273#(<= ~counter~0 17)} #98#return; {165273#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:14,539 INFO L290 TraceCheckUtils]: 152: Hoare triple {165273#(<= ~counter~0 17)} assume !(~r~0 < 0); {165273#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:14,539 INFO L290 TraceCheckUtils]: 153: Hoare triple {165273#(<= ~counter~0 17)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {165298#(<= |main_#t~post6| 17)} is VALID [2022-04-15 15:20:14,540 INFO L290 TraceCheckUtils]: 154: Hoare triple {165298#(<= |main_#t~post6| 17)} assume !(#t~post6 < 100);havoc #t~post6; {164817#false} is VALID [2022-04-15 15:20:14,540 INFO L272 TraceCheckUtils]: 155: Hoare triple {164817#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)); {164817#false} is VALID [2022-04-15 15:20:14,540 INFO L290 TraceCheckUtils]: 156: Hoare triple {164817#false} ~cond := #in~cond; {164817#false} is VALID [2022-04-15 15:20:14,540 INFO L290 TraceCheckUtils]: 157: Hoare triple {164817#false} assume 0 == ~cond; {164817#false} is VALID [2022-04-15 15:20:14,540 INFO L290 TraceCheckUtils]: 158: Hoare triple {164817#false} assume !false; {164817#false} is VALID [2022-04-15 15:20:14,541 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 734 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:20:14,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:20:15,672 INFO L290 TraceCheckUtils]: 158: Hoare triple {164817#false} assume !false; {164817#false} is VALID [2022-04-15 15:20:15,672 INFO L290 TraceCheckUtils]: 157: Hoare triple {164817#false} assume 0 == ~cond; {164817#false} is VALID [2022-04-15 15:20:15,672 INFO L290 TraceCheckUtils]: 156: Hoare triple {164817#false} ~cond := #in~cond; {164817#false} is VALID [2022-04-15 15:20:15,672 INFO L272 TraceCheckUtils]: 155: Hoare triple {164817#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)); {164817#false} is VALID [2022-04-15 15:20:15,673 INFO L290 TraceCheckUtils]: 154: Hoare triple {165326#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {164817#false} is VALID [2022-04-15 15:20:15,673 INFO L290 TraceCheckUtils]: 153: Hoare triple {165330#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {165326#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:20:15,673 INFO L290 TraceCheckUtils]: 152: Hoare triple {165330#(< ~counter~0 100)} assume !(~r~0 < 0); {165330#(< ~counter~0 100)} is VALID [2022-04-15 15:20:15,674 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {164816#true} {165330#(< ~counter~0 100)} #98#return; {165330#(< ~counter~0 100)} is VALID [2022-04-15 15:20:15,674 INFO L290 TraceCheckUtils]: 150: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,674 INFO L290 TraceCheckUtils]: 149: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,674 INFO L290 TraceCheckUtils]: 148: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,674 INFO L272 TraceCheckUtils]: 147: Hoare triple {165330#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,674 INFO L290 TraceCheckUtils]: 146: Hoare triple {165330#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {165330#(< ~counter~0 100)} is VALID [2022-04-15 15:20:15,678 INFO L290 TraceCheckUtils]: 145: Hoare triple {165355#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165330#(< ~counter~0 100)} is VALID [2022-04-15 15:20:15,678 INFO L290 TraceCheckUtils]: 144: Hoare triple {165355#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {165355#(< ~counter~0 99)} is VALID [2022-04-15 15:20:15,679 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {164816#true} {165355#(< ~counter~0 99)} #98#return; {165355#(< ~counter~0 99)} is VALID [2022-04-15 15:20:15,679 INFO L290 TraceCheckUtils]: 142: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,679 INFO L290 TraceCheckUtils]: 141: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,679 INFO L290 TraceCheckUtils]: 140: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,679 INFO L272 TraceCheckUtils]: 139: Hoare triple {165355#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,679 INFO L290 TraceCheckUtils]: 138: Hoare triple {165355#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {165355#(< ~counter~0 99)} is VALID [2022-04-15 15:20:15,681 INFO L290 TraceCheckUtils]: 137: Hoare triple {165380#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165355#(< ~counter~0 99)} is VALID [2022-04-15 15:20:15,681 INFO L290 TraceCheckUtils]: 136: Hoare triple {165380#(< ~counter~0 98)} assume !(~r~0 > 0); {165380#(< ~counter~0 98)} is VALID [2022-04-15 15:20:15,681 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {164816#true} {165380#(< ~counter~0 98)} #96#return; {165380#(< ~counter~0 98)} is VALID [2022-04-15 15:20:15,681 INFO L290 TraceCheckUtils]: 134: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,681 INFO L290 TraceCheckUtils]: 133: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,682 INFO L290 TraceCheckUtils]: 132: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,682 INFO L272 TraceCheckUtils]: 131: Hoare triple {165380#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,682 INFO L290 TraceCheckUtils]: 130: Hoare triple {165380#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {165380#(< ~counter~0 98)} is VALID [2022-04-15 15:20:15,683 INFO L290 TraceCheckUtils]: 129: Hoare triple {165405#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165380#(< ~counter~0 98)} is VALID [2022-04-15 15:20:15,684 INFO L290 TraceCheckUtils]: 128: Hoare triple {165405#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {165405#(< ~counter~0 97)} is VALID [2022-04-15 15:20:15,684 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {164816#true} {165405#(< ~counter~0 97)} #96#return; {165405#(< ~counter~0 97)} is VALID [2022-04-15 15:20:15,684 INFO L290 TraceCheckUtils]: 126: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,684 INFO L290 TraceCheckUtils]: 125: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,684 INFO L290 TraceCheckUtils]: 124: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,684 INFO L272 TraceCheckUtils]: 123: Hoare triple {165405#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,685 INFO L290 TraceCheckUtils]: 122: Hoare triple {165405#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {165405#(< ~counter~0 97)} is VALID [2022-04-15 15:20:15,686 INFO L290 TraceCheckUtils]: 121: Hoare triple {165430#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165405#(< ~counter~0 97)} is VALID [2022-04-15 15:20:15,686 INFO L290 TraceCheckUtils]: 120: Hoare triple {165430#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {165430#(< ~counter~0 96)} is VALID [2022-04-15 15:20:15,687 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {164816#true} {165430#(< ~counter~0 96)} #96#return; {165430#(< ~counter~0 96)} is VALID [2022-04-15 15:20:15,687 INFO L290 TraceCheckUtils]: 118: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,687 INFO L290 TraceCheckUtils]: 117: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,687 INFO L290 TraceCheckUtils]: 116: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,687 INFO L272 TraceCheckUtils]: 115: Hoare triple {165430#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,687 INFO L290 TraceCheckUtils]: 114: Hoare triple {165430#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {165430#(< ~counter~0 96)} is VALID [2022-04-15 15:20:15,689 INFO L290 TraceCheckUtils]: 113: Hoare triple {165455#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165430#(< ~counter~0 96)} is VALID [2022-04-15 15:20:15,689 INFO L290 TraceCheckUtils]: 112: Hoare triple {165455#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {165455#(< ~counter~0 95)} is VALID [2022-04-15 15:20:15,689 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {164816#true} {165455#(< ~counter~0 95)} #96#return; {165455#(< ~counter~0 95)} is VALID [2022-04-15 15:20:15,690 INFO L290 TraceCheckUtils]: 110: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,690 INFO L290 TraceCheckUtils]: 109: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,690 INFO L290 TraceCheckUtils]: 108: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,690 INFO L272 TraceCheckUtils]: 107: Hoare triple {165455#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,690 INFO L290 TraceCheckUtils]: 106: Hoare triple {165455#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {165455#(< ~counter~0 95)} is VALID [2022-04-15 15:20:15,691 INFO L290 TraceCheckUtils]: 105: Hoare triple {165480#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165455#(< ~counter~0 95)} is VALID [2022-04-15 15:20:15,692 INFO L290 TraceCheckUtils]: 104: Hoare triple {165480#(< ~counter~0 94)} assume !!(0 != ~r~0); {165480#(< ~counter~0 94)} is VALID [2022-04-15 15:20:15,692 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {164816#true} {165480#(< ~counter~0 94)} #94#return; {165480#(< ~counter~0 94)} is VALID [2022-04-15 15:20:15,692 INFO L290 TraceCheckUtils]: 102: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,692 INFO L290 TraceCheckUtils]: 101: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,692 INFO L290 TraceCheckUtils]: 100: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,692 INFO L272 TraceCheckUtils]: 99: Hoare triple {165480#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,693 INFO L290 TraceCheckUtils]: 98: Hoare triple {165480#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {165480#(< ~counter~0 94)} is VALID [2022-04-15 15:20:15,694 INFO L290 TraceCheckUtils]: 97: Hoare triple {165505#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {165480#(< ~counter~0 94)} is VALID [2022-04-15 15:20:15,694 INFO L290 TraceCheckUtils]: 96: Hoare triple {165505#(< ~counter~0 93)} assume !(~r~0 < 0); {165505#(< ~counter~0 93)} is VALID [2022-04-15 15:20:15,695 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {164816#true} {165505#(< ~counter~0 93)} #98#return; {165505#(< ~counter~0 93)} is VALID [2022-04-15 15:20:15,695 INFO L290 TraceCheckUtils]: 94: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,695 INFO L290 TraceCheckUtils]: 93: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,695 INFO L290 TraceCheckUtils]: 92: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,695 INFO L272 TraceCheckUtils]: 91: Hoare triple {165505#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,696 INFO L290 TraceCheckUtils]: 90: Hoare triple {165505#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {165505#(< ~counter~0 93)} is VALID [2022-04-15 15:20:15,697 INFO L290 TraceCheckUtils]: 89: Hoare triple {165530#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165505#(< ~counter~0 93)} is VALID [2022-04-15 15:20:15,697 INFO L290 TraceCheckUtils]: 88: Hoare triple {165530#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {165530#(< ~counter~0 92)} is VALID [2022-04-15 15:20:15,698 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {164816#true} {165530#(< ~counter~0 92)} #98#return; {165530#(< ~counter~0 92)} is VALID [2022-04-15 15:20:15,698 INFO L290 TraceCheckUtils]: 86: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,698 INFO L290 TraceCheckUtils]: 85: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,698 INFO L290 TraceCheckUtils]: 84: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,698 INFO L272 TraceCheckUtils]: 83: Hoare triple {165530#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,698 INFO L290 TraceCheckUtils]: 82: Hoare triple {165530#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {165530#(< ~counter~0 92)} is VALID [2022-04-15 15:20:15,700 INFO L290 TraceCheckUtils]: 81: Hoare triple {165555#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165530#(< ~counter~0 92)} is VALID [2022-04-15 15:20:15,700 INFO L290 TraceCheckUtils]: 80: Hoare triple {165555#(< ~counter~0 91)} assume !(~r~0 > 0); {165555#(< ~counter~0 91)} is VALID [2022-04-15 15:20:15,701 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {164816#true} {165555#(< ~counter~0 91)} #96#return; {165555#(< ~counter~0 91)} is VALID [2022-04-15 15:20:15,701 INFO L290 TraceCheckUtils]: 78: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,701 INFO L290 TraceCheckUtils]: 77: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,701 INFO L290 TraceCheckUtils]: 76: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,701 INFO L272 TraceCheckUtils]: 75: Hoare triple {165555#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,701 INFO L290 TraceCheckUtils]: 74: Hoare triple {165555#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {165555#(< ~counter~0 91)} is VALID [2022-04-15 15:20:15,703 INFO L290 TraceCheckUtils]: 73: Hoare triple {165580#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165555#(< ~counter~0 91)} is VALID [2022-04-15 15:20:15,703 INFO L290 TraceCheckUtils]: 72: Hoare triple {165580#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {165580#(< ~counter~0 90)} is VALID [2022-04-15 15:20:15,704 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {164816#true} {165580#(< ~counter~0 90)} #96#return; {165580#(< ~counter~0 90)} is VALID [2022-04-15 15:20:15,704 INFO L290 TraceCheckUtils]: 70: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,704 INFO L290 TraceCheckUtils]: 69: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,704 INFO L290 TraceCheckUtils]: 68: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,704 INFO L272 TraceCheckUtils]: 67: Hoare triple {165580#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,704 INFO L290 TraceCheckUtils]: 66: Hoare triple {165580#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {165580#(< ~counter~0 90)} is VALID [2022-04-15 15:20:15,705 INFO L290 TraceCheckUtils]: 65: Hoare triple {165605#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165580#(< ~counter~0 90)} is VALID [2022-04-15 15:20:15,706 INFO L290 TraceCheckUtils]: 64: Hoare triple {165605#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {165605#(< ~counter~0 89)} is VALID [2022-04-15 15:20:15,706 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {164816#true} {165605#(< ~counter~0 89)} #96#return; {165605#(< ~counter~0 89)} is VALID [2022-04-15 15:20:15,706 INFO L290 TraceCheckUtils]: 62: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,706 INFO L290 TraceCheckUtils]: 61: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,706 INFO L290 TraceCheckUtils]: 60: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,707 INFO L272 TraceCheckUtils]: 59: Hoare triple {165605#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,707 INFO L290 TraceCheckUtils]: 58: Hoare triple {165605#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {165605#(< ~counter~0 89)} is VALID [2022-04-15 15:20:15,708 INFO L290 TraceCheckUtils]: 57: Hoare triple {165630#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165605#(< ~counter~0 89)} is VALID [2022-04-15 15:20:15,708 INFO L290 TraceCheckUtils]: 56: Hoare triple {165630#(< ~counter~0 88)} assume !!(0 != ~r~0); {165630#(< ~counter~0 88)} is VALID [2022-04-15 15:20:15,709 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {164816#true} {165630#(< ~counter~0 88)} #94#return; {165630#(< ~counter~0 88)} is VALID [2022-04-15 15:20:15,709 INFO L290 TraceCheckUtils]: 54: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,709 INFO L290 TraceCheckUtils]: 53: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,709 INFO L290 TraceCheckUtils]: 52: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,709 INFO L272 TraceCheckUtils]: 51: Hoare triple {165630#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,709 INFO L290 TraceCheckUtils]: 50: Hoare triple {165630#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {165630#(< ~counter~0 88)} is VALID [2022-04-15 15:20:15,711 INFO L290 TraceCheckUtils]: 49: Hoare triple {165655#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {165630#(< ~counter~0 88)} is VALID [2022-04-15 15:20:15,711 INFO L290 TraceCheckUtils]: 48: Hoare triple {165655#(< ~counter~0 87)} assume !(~r~0 < 0); {165655#(< ~counter~0 87)} is VALID [2022-04-15 15:20:15,712 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {164816#true} {165655#(< ~counter~0 87)} #98#return; {165655#(< ~counter~0 87)} is VALID [2022-04-15 15:20:15,712 INFO L290 TraceCheckUtils]: 46: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,712 INFO L290 TraceCheckUtils]: 45: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,712 INFO L290 TraceCheckUtils]: 44: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,712 INFO L272 TraceCheckUtils]: 43: Hoare triple {165655#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,712 INFO L290 TraceCheckUtils]: 42: Hoare triple {165655#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {165655#(< ~counter~0 87)} is VALID [2022-04-15 15:20:15,713 INFO L290 TraceCheckUtils]: 41: Hoare triple {165680#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165655#(< ~counter~0 87)} is VALID [2022-04-15 15:20:15,714 INFO L290 TraceCheckUtils]: 40: Hoare triple {165680#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {165680#(< ~counter~0 86)} is VALID [2022-04-15 15:20:15,714 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {164816#true} {165680#(< ~counter~0 86)} #98#return; {165680#(< ~counter~0 86)} is VALID [2022-04-15 15:20:15,714 INFO L290 TraceCheckUtils]: 38: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,714 INFO L290 TraceCheckUtils]: 37: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,714 INFO L272 TraceCheckUtils]: 35: Hoare triple {165680#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,715 INFO L290 TraceCheckUtils]: 34: Hoare triple {165680#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {165680#(< ~counter~0 86)} is VALID [2022-04-15 15:20:15,716 INFO L290 TraceCheckUtils]: 33: Hoare triple {165705#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {165680#(< ~counter~0 86)} is VALID [2022-04-15 15:20:15,716 INFO L290 TraceCheckUtils]: 32: Hoare triple {165705#(< ~counter~0 85)} assume !(~r~0 > 0); {165705#(< ~counter~0 85)} is VALID [2022-04-15 15:20:15,717 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {164816#true} {165705#(< ~counter~0 85)} #96#return; {165705#(< ~counter~0 85)} is VALID [2022-04-15 15:20:15,717 INFO L290 TraceCheckUtils]: 30: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,717 INFO L290 TraceCheckUtils]: 29: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,717 INFO L290 TraceCheckUtils]: 28: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,717 INFO L272 TraceCheckUtils]: 27: Hoare triple {165705#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,717 INFO L290 TraceCheckUtils]: 26: Hoare triple {165705#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {165705#(< ~counter~0 85)} is VALID [2022-04-15 15:20:15,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {165730#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {165705#(< ~counter~0 85)} is VALID [2022-04-15 15:20:15,719 INFO L290 TraceCheckUtils]: 24: Hoare triple {165730#(< ~counter~0 84)} assume !!(0 != ~r~0); {165730#(< ~counter~0 84)} is VALID [2022-04-15 15:20:15,720 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {164816#true} {165730#(< ~counter~0 84)} #94#return; {165730#(< ~counter~0 84)} is VALID [2022-04-15 15:20:15,720 INFO L290 TraceCheckUtils]: 22: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,720 INFO L290 TraceCheckUtils]: 21: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,720 INFO L290 TraceCheckUtils]: 20: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,720 INFO L272 TraceCheckUtils]: 19: Hoare triple {165730#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,720 INFO L290 TraceCheckUtils]: 18: Hoare triple {165730#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {165730#(< ~counter~0 84)} is VALID [2022-04-15 15:20:15,721 INFO L290 TraceCheckUtils]: 17: Hoare triple {165755#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {165730#(< ~counter~0 84)} is VALID [2022-04-15 15:20:15,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {165755#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {165755#(< ~counter~0 83)} is VALID [2022-04-15 15:20:15,722 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {164816#true} {165755#(< ~counter~0 83)} #92#return; {165755#(< ~counter~0 83)} is VALID [2022-04-15 15:20:15,722 INFO L290 TraceCheckUtils]: 14: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,722 INFO L290 TraceCheckUtils]: 13: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,722 INFO L290 TraceCheckUtils]: 12: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,722 INFO L272 TraceCheckUtils]: 11: Hoare triple {165755#(< ~counter~0 83)} 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)); {164816#true} is VALID [2022-04-15 15:20:15,723 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {164816#true} {165755#(< ~counter~0 83)} #90#return; {165755#(< ~counter~0 83)} is VALID [2022-04-15 15:20:15,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {164816#true} assume true; {164816#true} is VALID [2022-04-15 15:20:15,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {164816#true} assume !(0 == ~cond); {164816#true} is VALID [2022-04-15 15:20:15,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {164816#true} ~cond := #in~cond; {164816#true} is VALID [2022-04-15 15:20:15,723 INFO L272 TraceCheckUtils]: 6: Hoare triple {165755#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {164816#true} is VALID [2022-04-15 15:20:15,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {165755#(< ~counter~0 83)} 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; {165755#(< ~counter~0 83)} is VALID [2022-04-15 15:20:15,724 INFO L272 TraceCheckUtils]: 4: Hoare triple {165755#(< ~counter~0 83)} call #t~ret9 := main(); {165755#(< ~counter~0 83)} is VALID [2022-04-15 15:20:15,724 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {165755#(< ~counter~0 83)} {164816#true} #102#return; {165755#(< ~counter~0 83)} is VALID [2022-04-15 15:20:15,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {165755#(< ~counter~0 83)} assume true; {165755#(< ~counter~0 83)} is VALID [2022-04-15 15:20:15,725 INFO L290 TraceCheckUtils]: 1: Hoare triple {164816#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; {165755#(< ~counter~0 83)} is VALID [2022-04-15 15:20:15,725 INFO L272 TraceCheckUtils]: 0: Hoare triple {164816#true} call ULTIMATE.init(); {164816#true} is VALID [2022-04-15 15:20:15,725 INFO L134 CoverageAnalysis]: Checked inductivity of 772 backedges. 34 proven. 190 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-15 15:20:15,725 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:20:15,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [153133941] [2022-04-15 15:20:15,726 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:20:15,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1258540310] [2022-04-15 15:20:15,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1258540310] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:20:15,726 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:20:15,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-15 15:20:15,726 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:20:15,726 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [2077947859] [2022-04-15 15:20:15,726 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [2077947859] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:20:15,726 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:20:15,726 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 15:20:15,726 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [121791937] [2022-04-15 15:20:15,726 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:20:15,727 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 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 159 [2022-04-15 15:20:15,727 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:20:15,727 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 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-15 15:20:15,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:15,929 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 15:20:15,929 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:15,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 15:20:15,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 15:20:15,930 INFO L87 Difference]: Start difference. First operand 855 states and 1134 transitions. Second operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 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-15 15:20:22,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:22,124 INFO L93 Difference]: Finished difference Result 906 states and 1204 transitions. [2022-04-15 15:20:22,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 35 states. [2022-04-15 15:20:22,124 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 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 159 [2022-04-15 15:20:22,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:20:22,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 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-15 15:20:22,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-15 15:20:22,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 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-15 15:20:22,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 354 transitions. [2022-04-15 15:20:22,129 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 35 states and 354 transitions. [2022-04-15 15:20:22,593 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 354 edges. 354 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:22,624 INFO L225 Difference]: With dead ends: 906 [2022-04-15 15:20:22,624 INFO L226 Difference]: Without dead ends: 901 [2022-04-15 15:20:22,624 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 331 GetRequests, 279 SyntacticMatches, 0 SemanticMatches, 52 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1215, Invalid=1647, Unknown=0, NotChecked=0, Total=2862 [2022-04-15 15:20:22,625 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 366 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 276 mSolverCounterSat, 364 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 366 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 640 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 364 IncrementalHoareTripleChecker+Valid, 276 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 15:20:22,625 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [366 Valid, 345 Invalid, 640 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [364 Valid, 276 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 15:20:22,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 901 states. [2022-04-15 15:20:26,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 901 to 879. [2022-04-15 15:20:26,024 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:20:26,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 901 states. Second operand has 879 states, 654 states have (on average 1.1773700305810397) internal successors, (770), 671 states have internal predecessors, (770), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:20:26,025 INFO L74 IsIncluded]: Start isIncluded. First operand 901 states. Second operand has 879 states, 654 states have (on average 1.1773700305810397) internal successors, (770), 671 states have internal predecessors, (770), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:20:26,026 INFO L87 Difference]: Start difference. First operand 901 states. Second operand has 879 states, 654 states have (on average 1.1773700305810397) internal successors, (770), 671 states have internal predecessors, (770), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:20:26,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:26,051 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-15 15:20:26,052 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-15 15:20:26,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:26,053 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:26,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 879 states, 654 states have (on average 1.1773700305810397) internal successors, (770), 671 states have internal predecessors, (770), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-15 15:20:26,054 INFO L87 Difference]: Start difference. First operand has 879 states, 654 states have (on average 1.1773700305810397) internal successors, (770), 671 states have internal predecessors, (770), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) Second operand 901 states. [2022-04-15 15:20:26,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:26,080 INFO L93 Difference]: Finished difference Result 901 states and 1198 transitions. [2022-04-15 15:20:26,080 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1198 transitions. [2022-04-15 15:20:26,081 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:26,082 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:26,082 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:20:26,082 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:20:26,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 879 states, 654 states have (on average 1.1773700305810397) internal successors, (770), 671 states have internal predecessors, (770), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 183 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:20:26,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 879 states to 879 states and 1172 transitions. [2022-04-15 15:20:26,119 INFO L78 Accepts]: Start accepts. Automaton has 879 states and 1172 transitions. Word has length 159 [2022-04-15 15:20:26,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:20:26,119 INFO L478 AbstractCegarLoop]: Abstraction has 879 states and 1172 transitions. [2022-04-15 15:20:26,119 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.428571428571429) internal successors, (114), 20 states have internal predecessors, (114), 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-15 15:20:26,119 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 879 states and 1172 transitions. [2022-04-15 15:20:37,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1172 edges. 1169 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:37,022 INFO L276 IsEmpty]: Start isEmpty. Operand 879 states and 1172 transitions. [2022-04-15 15:20:37,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 162 [2022-04-15 15:20:37,024 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:20:37,024 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 9, 9, 9, 9, 6, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:20:37,029 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (56)] Forceful destruction successful, exit code 0 [2022-04-15 15:20:37,224 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable54,56 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:37,224 INFO L403 AbstractCegarLoop]: === Iteration 56 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:20:37,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:20:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 29 times [2022-04-15 15:20:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:37,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1144810915] [2022-04-15 15:20:37,225 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:20:37,225 INFO L85 PathProgramCache]: Analyzing trace with hash -160708573, now seen corresponding path program 30 times [2022-04-15 15:20:37,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:20:37,225 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878997552] [2022-04-15 15:20:37,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:20:37,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:20:37,239 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:20:37,240 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1889193519] [2022-04-15 15:20:37,240 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-04-15 15:20:37,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:20:37,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:20:37,241 INFO L229 MonitoredProcess]: Starting monitored process 57 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:20:37,242 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Waiting until timeout for monitored process [2022-04-15 15:20:38,295 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 8 check-sat command(s) [2022-04-15 15:20:38,295 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:20:38,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 389 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 15:20:38,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:20:38,343 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:20:39,274 INFO L272 TraceCheckUtils]: 0: Hoare triple {171209#true} call ULTIMATE.init(); {171209#true} is VALID [2022-04-15 15:20:39,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {171209#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; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {171217#(<= ~counter~0 0)} assume true; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,276 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {171217#(<= ~counter~0 0)} {171209#true} #102#return; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,276 INFO L272 TraceCheckUtils]: 4: Hoare triple {171217#(<= ~counter~0 0)} call #t~ret9 := main(); {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {171217#(<= ~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; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,277 INFO L272 TraceCheckUtils]: 6: Hoare triple {171217#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {171217#(<= ~counter~0 0)} ~cond := #in~cond; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,277 INFO L290 TraceCheckUtils]: 8: Hoare triple {171217#(<= ~counter~0 0)} assume !(0 == ~cond); {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,277 INFO L290 TraceCheckUtils]: 9: Hoare triple {171217#(<= ~counter~0 0)} assume true; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,278 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {171217#(<= ~counter~0 0)} {171217#(<= ~counter~0 0)} #90#return; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,278 INFO L272 TraceCheckUtils]: 11: Hoare triple {171217#(<= ~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)); {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,279 INFO L290 TraceCheckUtils]: 12: Hoare triple {171217#(<= ~counter~0 0)} ~cond := #in~cond; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,279 INFO L290 TraceCheckUtils]: 13: Hoare triple {171217#(<= ~counter~0 0)} assume !(0 == ~cond); {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,279 INFO L290 TraceCheckUtils]: 14: Hoare triple {171217#(<= ~counter~0 0)} assume true; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,280 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {171217#(<= ~counter~0 0)} {171217#(<= ~counter~0 0)} #92#return; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,280 INFO L290 TraceCheckUtils]: 16: Hoare triple {171217#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {171217#(<= ~counter~0 0)} is VALID [2022-04-15 15:20:39,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {171217#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {171266#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:39,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {171266#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {171266#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:39,284 INFO L272 TraceCheckUtils]: 19: Hoare triple {171266#(<= ~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)); {171266#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:39,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {171266#(<= ~counter~0 1)} ~cond := #in~cond; {171266#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:39,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {171266#(<= ~counter~0 1)} assume !(0 == ~cond); {171266#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:39,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {171266#(<= ~counter~0 1)} assume true; {171266#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:39,285 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {171266#(<= ~counter~0 1)} {171266#(<= ~counter~0 1)} #94#return; {171266#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:39,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {171266#(<= ~counter~0 1)} assume !!(0 != ~r~0); {171266#(<= ~counter~0 1)} is VALID [2022-04-15 15:20:39,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {171266#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171291#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:39,287 INFO L290 TraceCheckUtils]: 26: Hoare triple {171291#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {171291#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:39,288 INFO L272 TraceCheckUtils]: 27: Hoare triple {171291#(<= ~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)); {171291#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:39,288 INFO L290 TraceCheckUtils]: 28: Hoare triple {171291#(<= ~counter~0 2)} ~cond := #in~cond; {171291#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:39,288 INFO L290 TraceCheckUtils]: 29: Hoare triple {171291#(<= ~counter~0 2)} assume !(0 == ~cond); {171291#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:39,289 INFO L290 TraceCheckUtils]: 30: Hoare triple {171291#(<= ~counter~0 2)} assume true; {171291#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:39,289 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {171291#(<= ~counter~0 2)} {171291#(<= ~counter~0 2)} #96#return; {171291#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:39,289 INFO L290 TraceCheckUtils]: 32: Hoare triple {171291#(<= ~counter~0 2)} assume !(~r~0 > 0); {171291#(<= ~counter~0 2)} is VALID [2022-04-15 15:20:39,291 INFO L290 TraceCheckUtils]: 33: Hoare triple {171291#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171316#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:39,291 INFO L290 TraceCheckUtils]: 34: Hoare triple {171316#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {171316#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:39,292 INFO L272 TraceCheckUtils]: 35: Hoare triple {171316#(<= ~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)); {171316#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:39,292 INFO L290 TraceCheckUtils]: 36: Hoare triple {171316#(<= ~counter~0 3)} ~cond := #in~cond; {171316#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:39,292 INFO L290 TraceCheckUtils]: 37: Hoare triple {171316#(<= ~counter~0 3)} assume !(0 == ~cond); {171316#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:39,292 INFO L290 TraceCheckUtils]: 38: Hoare triple {171316#(<= ~counter~0 3)} assume true; {171316#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:39,293 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {171316#(<= ~counter~0 3)} {171316#(<= ~counter~0 3)} #98#return; {171316#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:39,293 INFO L290 TraceCheckUtils]: 40: Hoare triple {171316#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {171316#(<= ~counter~0 3)} is VALID [2022-04-15 15:20:39,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {171316#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171341#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:39,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {171341#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {171341#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:39,295 INFO L272 TraceCheckUtils]: 43: Hoare triple {171341#(<= ~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)); {171341#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:39,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {171341#(<= ~counter~0 4)} ~cond := #in~cond; {171341#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:39,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {171341#(<= ~counter~0 4)} assume !(0 == ~cond); {171341#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:39,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {171341#(<= ~counter~0 4)} assume true; {171341#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:39,297 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {171341#(<= ~counter~0 4)} {171341#(<= ~counter~0 4)} #98#return; {171341#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:39,297 INFO L290 TraceCheckUtils]: 48: Hoare triple {171341#(<= ~counter~0 4)} assume !(~r~0 < 0); {171341#(<= ~counter~0 4)} is VALID [2022-04-15 15:20:39,298 INFO L290 TraceCheckUtils]: 49: Hoare triple {171341#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {171366#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:39,299 INFO L290 TraceCheckUtils]: 50: Hoare triple {171366#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {171366#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:39,299 INFO L272 TraceCheckUtils]: 51: Hoare triple {171366#(<= ~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)); {171366#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:39,299 INFO L290 TraceCheckUtils]: 52: Hoare triple {171366#(<= ~counter~0 5)} ~cond := #in~cond; {171366#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:39,300 INFO L290 TraceCheckUtils]: 53: Hoare triple {171366#(<= ~counter~0 5)} assume !(0 == ~cond); {171366#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:39,300 INFO L290 TraceCheckUtils]: 54: Hoare triple {171366#(<= ~counter~0 5)} assume true; {171366#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:39,300 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {171366#(<= ~counter~0 5)} {171366#(<= ~counter~0 5)} #94#return; {171366#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:39,301 INFO L290 TraceCheckUtils]: 56: Hoare triple {171366#(<= ~counter~0 5)} assume !!(0 != ~r~0); {171366#(<= ~counter~0 5)} is VALID [2022-04-15 15:20:39,302 INFO L290 TraceCheckUtils]: 57: Hoare triple {171366#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171391#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:39,302 INFO L290 TraceCheckUtils]: 58: Hoare triple {171391#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {171391#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:39,303 INFO L272 TraceCheckUtils]: 59: Hoare triple {171391#(<= ~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)); {171391#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:39,303 INFO L290 TraceCheckUtils]: 60: Hoare triple {171391#(<= ~counter~0 6)} ~cond := #in~cond; {171391#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:39,303 INFO L290 TraceCheckUtils]: 61: Hoare triple {171391#(<= ~counter~0 6)} assume !(0 == ~cond); {171391#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:39,304 INFO L290 TraceCheckUtils]: 62: Hoare triple {171391#(<= ~counter~0 6)} assume true; {171391#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:39,304 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {171391#(<= ~counter~0 6)} {171391#(<= ~counter~0 6)} #96#return; {171391#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:39,304 INFO L290 TraceCheckUtils]: 64: Hoare triple {171391#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171391#(<= ~counter~0 6)} is VALID [2022-04-15 15:20:39,306 INFO L290 TraceCheckUtils]: 65: Hoare triple {171391#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171416#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:39,307 INFO L290 TraceCheckUtils]: 66: Hoare triple {171416#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {171416#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:39,307 INFO L272 TraceCheckUtils]: 67: Hoare triple {171416#(<= ~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)); {171416#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:39,308 INFO L290 TraceCheckUtils]: 68: Hoare triple {171416#(<= ~counter~0 7)} ~cond := #in~cond; {171416#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:39,308 INFO L290 TraceCheckUtils]: 69: Hoare triple {171416#(<= ~counter~0 7)} assume !(0 == ~cond); {171416#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:39,309 INFO L290 TraceCheckUtils]: 70: Hoare triple {171416#(<= ~counter~0 7)} assume true; {171416#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:39,309 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {171416#(<= ~counter~0 7)} {171416#(<= ~counter~0 7)} #96#return; {171416#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:39,310 INFO L290 TraceCheckUtils]: 72: Hoare triple {171416#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171416#(<= ~counter~0 7)} is VALID [2022-04-15 15:20:39,312 INFO L290 TraceCheckUtils]: 73: Hoare triple {171416#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171441#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:39,313 INFO L290 TraceCheckUtils]: 74: Hoare triple {171441#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {171441#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:39,313 INFO L272 TraceCheckUtils]: 75: Hoare triple {171441#(<= ~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)); {171441#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:39,313 INFO L290 TraceCheckUtils]: 76: Hoare triple {171441#(<= ~counter~0 8)} ~cond := #in~cond; {171441#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:39,314 INFO L290 TraceCheckUtils]: 77: Hoare triple {171441#(<= ~counter~0 8)} assume !(0 == ~cond); {171441#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:39,314 INFO L290 TraceCheckUtils]: 78: Hoare triple {171441#(<= ~counter~0 8)} assume true; {171441#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:39,315 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {171441#(<= ~counter~0 8)} {171441#(<= ~counter~0 8)} #96#return; {171441#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:39,315 INFO L290 TraceCheckUtils]: 80: Hoare triple {171441#(<= ~counter~0 8)} assume !(~r~0 > 0); {171441#(<= ~counter~0 8)} is VALID [2022-04-15 15:20:39,318 INFO L290 TraceCheckUtils]: 81: Hoare triple {171441#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171466#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:39,318 INFO L290 TraceCheckUtils]: 82: Hoare triple {171466#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {171466#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:39,319 INFO L272 TraceCheckUtils]: 83: Hoare triple {171466#(<= ~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)); {171466#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:39,319 INFO L290 TraceCheckUtils]: 84: Hoare triple {171466#(<= ~counter~0 9)} ~cond := #in~cond; {171466#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:39,319 INFO L290 TraceCheckUtils]: 85: Hoare triple {171466#(<= ~counter~0 9)} assume !(0 == ~cond); {171466#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:39,320 INFO L290 TraceCheckUtils]: 86: Hoare triple {171466#(<= ~counter~0 9)} assume true; {171466#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:39,320 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {171466#(<= ~counter~0 9)} {171466#(<= ~counter~0 9)} #98#return; {171466#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:39,320 INFO L290 TraceCheckUtils]: 88: Hoare triple {171466#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {171466#(<= ~counter~0 9)} is VALID [2022-04-15 15:20:39,322 INFO L290 TraceCheckUtils]: 89: Hoare triple {171466#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171491#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:39,322 INFO L290 TraceCheckUtils]: 90: Hoare triple {171491#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {171491#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:39,323 INFO L272 TraceCheckUtils]: 91: Hoare triple {171491#(<= ~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)); {171491#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:39,323 INFO L290 TraceCheckUtils]: 92: Hoare triple {171491#(<= ~counter~0 10)} ~cond := #in~cond; {171491#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:39,323 INFO L290 TraceCheckUtils]: 93: Hoare triple {171491#(<= ~counter~0 10)} assume !(0 == ~cond); {171491#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:39,323 INFO L290 TraceCheckUtils]: 94: Hoare triple {171491#(<= ~counter~0 10)} assume true; {171491#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:39,324 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {171491#(<= ~counter~0 10)} {171491#(<= ~counter~0 10)} #98#return; {171491#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:39,324 INFO L290 TraceCheckUtils]: 96: Hoare triple {171491#(<= ~counter~0 10)} assume !(~r~0 < 0); {171491#(<= ~counter~0 10)} is VALID [2022-04-15 15:20:39,325 INFO L290 TraceCheckUtils]: 97: Hoare triple {171491#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {171516#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:39,326 INFO L290 TraceCheckUtils]: 98: Hoare triple {171516#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {171516#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:39,326 INFO L272 TraceCheckUtils]: 99: Hoare triple {171516#(<= ~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)); {171516#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:39,327 INFO L290 TraceCheckUtils]: 100: Hoare triple {171516#(<= ~counter~0 11)} ~cond := #in~cond; {171516#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:39,327 INFO L290 TraceCheckUtils]: 101: Hoare triple {171516#(<= ~counter~0 11)} assume !(0 == ~cond); {171516#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:39,327 INFO L290 TraceCheckUtils]: 102: Hoare triple {171516#(<= ~counter~0 11)} assume true; {171516#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:39,328 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {171516#(<= ~counter~0 11)} {171516#(<= ~counter~0 11)} #94#return; {171516#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:39,328 INFO L290 TraceCheckUtils]: 104: Hoare triple {171516#(<= ~counter~0 11)} assume !!(0 != ~r~0); {171516#(<= ~counter~0 11)} is VALID [2022-04-15 15:20:39,329 INFO L290 TraceCheckUtils]: 105: Hoare triple {171516#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171541#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:39,330 INFO L290 TraceCheckUtils]: 106: Hoare triple {171541#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {171541#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:39,330 INFO L272 TraceCheckUtils]: 107: Hoare triple {171541#(<= ~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)); {171541#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:39,331 INFO L290 TraceCheckUtils]: 108: Hoare triple {171541#(<= ~counter~0 12)} ~cond := #in~cond; {171541#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:39,331 INFO L290 TraceCheckUtils]: 109: Hoare triple {171541#(<= ~counter~0 12)} assume !(0 == ~cond); {171541#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:39,331 INFO L290 TraceCheckUtils]: 110: Hoare triple {171541#(<= ~counter~0 12)} assume true; {171541#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:39,332 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {171541#(<= ~counter~0 12)} {171541#(<= ~counter~0 12)} #96#return; {171541#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:39,332 INFO L290 TraceCheckUtils]: 112: Hoare triple {171541#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171541#(<= ~counter~0 12)} is VALID [2022-04-15 15:20:39,334 INFO L290 TraceCheckUtils]: 113: Hoare triple {171541#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171566#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:39,334 INFO L290 TraceCheckUtils]: 114: Hoare triple {171566#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {171566#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:39,334 INFO L272 TraceCheckUtils]: 115: Hoare triple {171566#(<= ~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)); {171566#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:39,335 INFO L290 TraceCheckUtils]: 116: Hoare triple {171566#(<= ~counter~0 13)} ~cond := #in~cond; {171566#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:39,335 INFO L290 TraceCheckUtils]: 117: Hoare triple {171566#(<= ~counter~0 13)} assume !(0 == ~cond); {171566#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:39,335 INFO L290 TraceCheckUtils]: 118: Hoare triple {171566#(<= ~counter~0 13)} assume true; {171566#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:39,336 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {171566#(<= ~counter~0 13)} {171566#(<= ~counter~0 13)} #96#return; {171566#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:39,336 INFO L290 TraceCheckUtils]: 120: Hoare triple {171566#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171566#(<= ~counter~0 13)} is VALID [2022-04-15 15:20:39,337 INFO L290 TraceCheckUtils]: 121: Hoare triple {171566#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171591#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:39,338 INFO L290 TraceCheckUtils]: 122: Hoare triple {171591#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {171591#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:39,338 INFO L272 TraceCheckUtils]: 123: Hoare triple {171591#(<= ~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)); {171591#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:39,339 INFO L290 TraceCheckUtils]: 124: Hoare triple {171591#(<= ~counter~0 14)} ~cond := #in~cond; {171591#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:39,339 INFO L290 TraceCheckUtils]: 125: Hoare triple {171591#(<= ~counter~0 14)} assume !(0 == ~cond); {171591#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:39,339 INFO L290 TraceCheckUtils]: 126: Hoare triple {171591#(<= ~counter~0 14)} assume true; {171591#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:39,340 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {171591#(<= ~counter~0 14)} {171591#(<= ~counter~0 14)} #96#return; {171591#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:39,340 INFO L290 TraceCheckUtils]: 128: Hoare triple {171591#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171591#(<= ~counter~0 14)} is VALID [2022-04-15 15:20:39,341 INFO L290 TraceCheckUtils]: 129: Hoare triple {171591#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171616#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:39,341 INFO L290 TraceCheckUtils]: 130: Hoare triple {171616#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {171616#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:39,342 INFO L272 TraceCheckUtils]: 131: Hoare triple {171616#(<= ~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)); {171616#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:39,342 INFO L290 TraceCheckUtils]: 132: Hoare triple {171616#(<= ~counter~0 15)} ~cond := #in~cond; {171616#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:39,343 INFO L290 TraceCheckUtils]: 133: Hoare triple {171616#(<= ~counter~0 15)} assume !(0 == ~cond); {171616#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:39,343 INFO L290 TraceCheckUtils]: 134: Hoare triple {171616#(<= ~counter~0 15)} assume true; {171616#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:39,343 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {171616#(<= ~counter~0 15)} {171616#(<= ~counter~0 15)} #96#return; {171616#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:39,344 INFO L290 TraceCheckUtils]: 136: Hoare triple {171616#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171616#(<= ~counter~0 15)} is VALID [2022-04-15 15:20:39,345 INFO L290 TraceCheckUtils]: 137: Hoare triple {171616#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171641#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:39,345 INFO L290 TraceCheckUtils]: 138: Hoare triple {171641#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {171641#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:39,346 INFO L272 TraceCheckUtils]: 139: Hoare triple {171641#(<= ~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)); {171641#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:39,346 INFO L290 TraceCheckUtils]: 140: Hoare triple {171641#(<= ~counter~0 16)} ~cond := #in~cond; {171641#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:39,347 INFO L290 TraceCheckUtils]: 141: Hoare triple {171641#(<= ~counter~0 16)} assume !(0 == ~cond); {171641#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:39,347 INFO L290 TraceCheckUtils]: 142: Hoare triple {171641#(<= ~counter~0 16)} assume true; {171641#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:39,347 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {171641#(<= ~counter~0 16)} {171641#(<= ~counter~0 16)} #96#return; {171641#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:39,348 INFO L290 TraceCheckUtils]: 144: Hoare triple {171641#(<= ~counter~0 16)} assume !(~r~0 > 0); {171641#(<= ~counter~0 16)} is VALID [2022-04-15 15:20:39,349 INFO L290 TraceCheckUtils]: 145: Hoare triple {171641#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171666#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:39,350 INFO L290 TraceCheckUtils]: 146: Hoare triple {171666#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {171666#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:39,350 INFO L272 TraceCheckUtils]: 147: Hoare triple {171666#(<= ~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)); {171666#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:39,350 INFO L290 TraceCheckUtils]: 148: Hoare triple {171666#(<= ~counter~0 17)} ~cond := #in~cond; {171666#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:39,351 INFO L290 TraceCheckUtils]: 149: Hoare triple {171666#(<= ~counter~0 17)} assume !(0 == ~cond); {171666#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:39,351 INFO L290 TraceCheckUtils]: 150: Hoare triple {171666#(<= ~counter~0 17)} assume true; {171666#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:39,351 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {171666#(<= ~counter~0 17)} {171666#(<= ~counter~0 17)} #98#return; {171666#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:39,352 INFO L290 TraceCheckUtils]: 152: Hoare triple {171666#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {171666#(<= ~counter~0 17)} is VALID [2022-04-15 15:20:39,352 INFO L290 TraceCheckUtils]: 153: Hoare triple {171666#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171691#(<= |main_#t~post8| 17)} is VALID [2022-04-15 15:20:39,352 INFO L290 TraceCheckUtils]: 154: Hoare triple {171691#(<= |main_#t~post8| 17)} assume !(#t~post8 < 100);havoc #t~post8; {171210#false} is VALID [2022-04-15 15:20:39,352 INFO L290 TraceCheckUtils]: 155: Hoare triple {171210#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {171210#false} is VALID [2022-04-15 15:20:39,353 INFO L290 TraceCheckUtils]: 156: Hoare triple {171210#false} assume !(#t~post6 < 100);havoc #t~post6; {171210#false} is VALID [2022-04-15 15:20:39,353 INFO L272 TraceCheckUtils]: 157: Hoare triple {171210#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)); {171210#false} is VALID [2022-04-15 15:20:39,353 INFO L290 TraceCheckUtils]: 158: Hoare triple {171210#false} ~cond := #in~cond; {171210#false} is VALID [2022-04-15 15:20:39,353 INFO L290 TraceCheckUtils]: 159: Hoare triple {171210#false} assume 0 == ~cond; {171210#false} is VALID [2022-04-15 15:20:39,353 INFO L290 TraceCheckUtils]: 160: Hoare triple {171210#false} assume !false; {171210#false} is VALID [2022-04-15 15:20:39,353 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 750 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:20:39,353 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:20:40,423 INFO L290 TraceCheckUtils]: 160: Hoare triple {171210#false} assume !false; {171210#false} is VALID [2022-04-15 15:20:40,423 INFO L290 TraceCheckUtils]: 159: Hoare triple {171210#false} assume 0 == ~cond; {171210#false} is VALID [2022-04-15 15:20:40,423 INFO L290 TraceCheckUtils]: 158: Hoare triple {171210#false} ~cond := #in~cond; {171210#false} is VALID [2022-04-15 15:20:40,424 INFO L272 TraceCheckUtils]: 157: Hoare triple {171210#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)); {171210#false} is VALID [2022-04-15 15:20:40,424 INFO L290 TraceCheckUtils]: 156: Hoare triple {171210#false} assume !(#t~post6 < 100);havoc #t~post6; {171210#false} is VALID [2022-04-15 15:20:40,424 INFO L290 TraceCheckUtils]: 155: Hoare triple {171210#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {171210#false} is VALID [2022-04-15 15:20:40,424 INFO L290 TraceCheckUtils]: 154: Hoare triple {171731#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {171210#false} is VALID [2022-04-15 15:20:40,424 INFO L290 TraceCheckUtils]: 153: Hoare triple {171735#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171731#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:20:40,425 INFO L290 TraceCheckUtils]: 152: Hoare triple {171735#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {171735#(< ~counter~0 100)} is VALID [2022-04-15 15:20:40,425 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {171209#true} {171735#(< ~counter~0 100)} #98#return; {171735#(< ~counter~0 100)} is VALID [2022-04-15 15:20:40,425 INFO L290 TraceCheckUtils]: 150: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,425 INFO L290 TraceCheckUtils]: 149: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,425 INFO L290 TraceCheckUtils]: 148: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,425 INFO L272 TraceCheckUtils]: 147: Hoare triple {171735#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,426 INFO L290 TraceCheckUtils]: 146: Hoare triple {171735#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {171735#(< ~counter~0 100)} is VALID [2022-04-15 15:20:40,429 INFO L290 TraceCheckUtils]: 145: Hoare triple {171760#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171735#(< ~counter~0 100)} is VALID [2022-04-15 15:20:40,429 INFO L290 TraceCheckUtils]: 144: Hoare triple {171760#(< ~counter~0 99)} assume !(~r~0 > 0); {171760#(< ~counter~0 99)} is VALID [2022-04-15 15:20:40,430 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {171209#true} {171760#(< ~counter~0 99)} #96#return; {171760#(< ~counter~0 99)} is VALID [2022-04-15 15:20:40,430 INFO L290 TraceCheckUtils]: 142: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,430 INFO L290 TraceCheckUtils]: 141: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,430 INFO L290 TraceCheckUtils]: 140: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,430 INFO L272 TraceCheckUtils]: 139: Hoare triple {171760#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,430 INFO L290 TraceCheckUtils]: 138: Hoare triple {171760#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {171760#(< ~counter~0 99)} is VALID [2022-04-15 15:20:40,432 INFO L290 TraceCheckUtils]: 137: Hoare triple {171785#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171760#(< ~counter~0 99)} is VALID [2022-04-15 15:20:40,432 INFO L290 TraceCheckUtils]: 136: Hoare triple {171785#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171785#(< ~counter~0 98)} is VALID [2022-04-15 15:20:40,433 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {171209#true} {171785#(< ~counter~0 98)} #96#return; {171785#(< ~counter~0 98)} is VALID [2022-04-15 15:20:40,433 INFO L290 TraceCheckUtils]: 134: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,433 INFO L290 TraceCheckUtils]: 133: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,433 INFO L290 TraceCheckUtils]: 132: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,433 INFO L272 TraceCheckUtils]: 131: Hoare triple {171785#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,433 INFO L290 TraceCheckUtils]: 130: Hoare triple {171785#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {171785#(< ~counter~0 98)} is VALID [2022-04-15 15:20:40,434 INFO L290 TraceCheckUtils]: 129: Hoare triple {171810#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171785#(< ~counter~0 98)} is VALID [2022-04-15 15:20:40,435 INFO L290 TraceCheckUtils]: 128: Hoare triple {171810#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171810#(< ~counter~0 97)} is VALID [2022-04-15 15:20:40,435 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {171209#true} {171810#(< ~counter~0 97)} #96#return; {171810#(< ~counter~0 97)} is VALID [2022-04-15 15:20:40,435 INFO L290 TraceCheckUtils]: 126: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,435 INFO L290 TraceCheckUtils]: 125: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,435 INFO L290 TraceCheckUtils]: 124: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,435 INFO L272 TraceCheckUtils]: 123: Hoare triple {171810#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,436 INFO L290 TraceCheckUtils]: 122: Hoare triple {171810#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {171810#(< ~counter~0 97)} is VALID [2022-04-15 15:20:40,437 INFO L290 TraceCheckUtils]: 121: Hoare triple {171835#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171810#(< ~counter~0 97)} is VALID [2022-04-15 15:20:40,437 INFO L290 TraceCheckUtils]: 120: Hoare triple {171835#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171835#(< ~counter~0 96)} is VALID [2022-04-15 15:20:40,438 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {171209#true} {171835#(< ~counter~0 96)} #96#return; {171835#(< ~counter~0 96)} is VALID [2022-04-15 15:20:40,438 INFO L290 TraceCheckUtils]: 118: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,438 INFO L290 TraceCheckUtils]: 117: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,438 INFO L290 TraceCheckUtils]: 116: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,438 INFO L272 TraceCheckUtils]: 115: Hoare triple {171835#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,438 INFO L290 TraceCheckUtils]: 114: Hoare triple {171835#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {171835#(< ~counter~0 96)} is VALID [2022-04-15 15:20:40,440 INFO L290 TraceCheckUtils]: 113: Hoare triple {171860#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171835#(< ~counter~0 96)} is VALID [2022-04-15 15:20:40,440 INFO L290 TraceCheckUtils]: 112: Hoare triple {171860#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171860#(< ~counter~0 95)} is VALID [2022-04-15 15:20:40,441 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {171209#true} {171860#(< ~counter~0 95)} #96#return; {171860#(< ~counter~0 95)} is VALID [2022-04-15 15:20:40,441 INFO L290 TraceCheckUtils]: 110: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,441 INFO L290 TraceCheckUtils]: 109: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,441 INFO L290 TraceCheckUtils]: 108: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,441 INFO L272 TraceCheckUtils]: 107: Hoare triple {171860#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,441 INFO L290 TraceCheckUtils]: 106: Hoare triple {171860#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {171860#(< ~counter~0 95)} is VALID [2022-04-15 15:20:40,443 INFO L290 TraceCheckUtils]: 105: Hoare triple {171885#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171860#(< ~counter~0 95)} is VALID [2022-04-15 15:20:40,443 INFO L290 TraceCheckUtils]: 104: Hoare triple {171885#(< ~counter~0 94)} assume !!(0 != ~r~0); {171885#(< ~counter~0 94)} is VALID [2022-04-15 15:20:40,444 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {171209#true} {171885#(< ~counter~0 94)} #94#return; {171885#(< ~counter~0 94)} is VALID [2022-04-15 15:20:40,444 INFO L290 TraceCheckUtils]: 102: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,444 INFO L290 TraceCheckUtils]: 101: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,444 INFO L290 TraceCheckUtils]: 100: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,444 INFO L272 TraceCheckUtils]: 99: Hoare triple {171885#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,444 INFO L290 TraceCheckUtils]: 98: Hoare triple {171885#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {171885#(< ~counter~0 94)} is VALID [2022-04-15 15:20:40,446 INFO L290 TraceCheckUtils]: 97: Hoare triple {171910#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {171885#(< ~counter~0 94)} is VALID [2022-04-15 15:20:40,446 INFO L290 TraceCheckUtils]: 96: Hoare triple {171910#(< ~counter~0 93)} assume !(~r~0 < 0); {171910#(< ~counter~0 93)} is VALID [2022-04-15 15:20:40,446 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {171209#true} {171910#(< ~counter~0 93)} #98#return; {171910#(< ~counter~0 93)} is VALID [2022-04-15 15:20:40,446 INFO L290 TraceCheckUtils]: 94: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,446 INFO L290 TraceCheckUtils]: 93: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,447 INFO L290 TraceCheckUtils]: 92: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,447 INFO L272 TraceCheckUtils]: 91: Hoare triple {171910#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,447 INFO L290 TraceCheckUtils]: 90: Hoare triple {171910#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {171910#(< ~counter~0 93)} is VALID [2022-04-15 15:20:40,448 INFO L290 TraceCheckUtils]: 89: Hoare triple {171935#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171910#(< ~counter~0 93)} is VALID [2022-04-15 15:20:40,449 INFO L290 TraceCheckUtils]: 88: Hoare triple {171935#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {171935#(< ~counter~0 92)} is VALID [2022-04-15 15:20:40,449 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {171209#true} {171935#(< ~counter~0 92)} #98#return; {171935#(< ~counter~0 92)} is VALID [2022-04-15 15:20:40,449 INFO L290 TraceCheckUtils]: 86: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,449 INFO L290 TraceCheckUtils]: 85: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,449 INFO L290 TraceCheckUtils]: 84: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,449 INFO L272 TraceCheckUtils]: 83: Hoare triple {171935#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,450 INFO L290 TraceCheckUtils]: 82: Hoare triple {171935#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {171935#(< ~counter~0 92)} is VALID [2022-04-15 15:20:40,451 INFO L290 TraceCheckUtils]: 81: Hoare triple {171960#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {171935#(< ~counter~0 92)} is VALID [2022-04-15 15:20:40,451 INFO L290 TraceCheckUtils]: 80: Hoare triple {171960#(< ~counter~0 91)} assume !(~r~0 > 0); {171960#(< ~counter~0 91)} is VALID [2022-04-15 15:20:40,452 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {171209#true} {171960#(< ~counter~0 91)} #96#return; {171960#(< ~counter~0 91)} is VALID [2022-04-15 15:20:40,452 INFO L290 TraceCheckUtils]: 78: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,452 INFO L290 TraceCheckUtils]: 77: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,452 INFO L290 TraceCheckUtils]: 76: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,452 INFO L272 TraceCheckUtils]: 75: Hoare triple {171960#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,452 INFO L290 TraceCheckUtils]: 74: Hoare triple {171960#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {171960#(< ~counter~0 91)} is VALID [2022-04-15 15:20:40,454 INFO L290 TraceCheckUtils]: 73: Hoare triple {171985#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171960#(< ~counter~0 91)} is VALID [2022-04-15 15:20:40,454 INFO L290 TraceCheckUtils]: 72: Hoare triple {171985#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {171985#(< ~counter~0 90)} is VALID [2022-04-15 15:20:40,454 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {171209#true} {171985#(< ~counter~0 90)} #96#return; {171985#(< ~counter~0 90)} is VALID [2022-04-15 15:20:40,454 INFO L290 TraceCheckUtils]: 70: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,455 INFO L290 TraceCheckUtils]: 69: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,455 INFO L290 TraceCheckUtils]: 68: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,455 INFO L272 TraceCheckUtils]: 67: Hoare triple {171985#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,455 INFO L290 TraceCheckUtils]: 66: Hoare triple {171985#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {171985#(< ~counter~0 90)} is VALID [2022-04-15 15:20:40,457 INFO L290 TraceCheckUtils]: 65: Hoare triple {172010#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {171985#(< ~counter~0 90)} is VALID [2022-04-15 15:20:40,457 INFO L290 TraceCheckUtils]: 64: Hoare triple {172010#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {172010#(< ~counter~0 89)} is VALID [2022-04-15 15:20:40,458 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {171209#true} {172010#(< ~counter~0 89)} #96#return; {172010#(< ~counter~0 89)} is VALID [2022-04-15 15:20:40,458 INFO L290 TraceCheckUtils]: 62: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,458 INFO L290 TraceCheckUtils]: 61: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,458 INFO L290 TraceCheckUtils]: 60: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,458 INFO L272 TraceCheckUtils]: 59: Hoare triple {172010#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,458 INFO L290 TraceCheckUtils]: 58: Hoare triple {172010#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {172010#(< ~counter~0 89)} is VALID [2022-04-15 15:20:40,460 INFO L290 TraceCheckUtils]: 57: Hoare triple {172035#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {172010#(< ~counter~0 89)} is VALID [2022-04-15 15:20:40,460 INFO L290 TraceCheckUtils]: 56: Hoare triple {172035#(< ~counter~0 88)} assume !!(0 != ~r~0); {172035#(< ~counter~0 88)} is VALID [2022-04-15 15:20:40,460 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {171209#true} {172035#(< ~counter~0 88)} #94#return; {172035#(< ~counter~0 88)} is VALID [2022-04-15 15:20:40,460 INFO L290 TraceCheckUtils]: 54: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,461 INFO L290 TraceCheckUtils]: 53: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,461 INFO L290 TraceCheckUtils]: 52: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,461 INFO L272 TraceCheckUtils]: 51: Hoare triple {172035#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,461 INFO L290 TraceCheckUtils]: 50: Hoare triple {172035#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {172035#(< ~counter~0 88)} is VALID [2022-04-15 15:20:40,462 INFO L290 TraceCheckUtils]: 49: Hoare triple {172060#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {172035#(< ~counter~0 88)} is VALID [2022-04-15 15:20:40,463 INFO L290 TraceCheckUtils]: 48: Hoare triple {172060#(< ~counter~0 87)} assume !(~r~0 < 0); {172060#(< ~counter~0 87)} is VALID [2022-04-15 15:20:40,463 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {171209#true} {172060#(< ~counter~0 87)} #98#return; {172060#(< ~counter~0 87)} is VALID [2022-04-15 15:20:40,463 INFO L290 TraceCheckUtils]: 46: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,463 INFO L290 TraceCheckUtils]: 45: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,463 INFO L290 TraceCheckUtils]: 44: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,463 INFO L272 TraceCheckUtils]: 43: Hoare triple {172060#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {172060#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {172060#(< ~counter~0 87)} is VALID [2022-04-15 15:20:40,465 INFO L290 TraceCheckUtils]: 41: Hoare triple {172085#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {172060#(< ~counter~0 87)} is VALID [2022-04-15 15:20:40,465 INFO L290 TraceCheckUtils]: 40: Hoare triple {172085#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {172085#(< ~counter~0 86)} is VALID [2022-04-15 15:20:40,466 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {171209#true} {172085#(< ~counter~0 86)} #98#return; {172085#(< ~counter~0 86)} is VALID [2022-04-15 15:20:40,466 INFO L290 TraceCheckUtils]: 38: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,466 INFO L290 TraceCheckUtils]: 37: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,466 INFO L290 TraceCheckUtils]: 36: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,466 INFO L272 TraceCheckUtils]: 35: Hoare triple {172085#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,467 INFO L290 TraceCheckUtils]: 34: Hoare triple {172085#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {172085#(< ~counter~0 86)} is VALID [2022-04-15 15:20:40,468 INFO L290 TraceCheckUtils]: 33: Hoare triple {172110#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {172085#(< ~counter~0 86)} is VALID [2022-04-15 15:20:40,468 INFO L290 TraceCheckUtils]: 32: Hoare triple {172110#(< ~counter~0 85)} assume !(~r~0 > 0); {172110#(< ~counter~0 85)} is VALID [2022-04-15 15:20:40,469 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {171209#true} {172110#(< ~counter~0 85)} #96#return; {172110#(< ~counter~0 85)} is VALID [2022-04-15 15:20:40,469 INFO L290 TraceCheckUtils]: 30: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,469 INFO L290 TraceCheckUtils]: 29: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,469 INFO L290 TraceCheckUtils]: 28: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,469 INFO L272 TraceCheckUtils]: 27: Hoare triple {172110#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,469 INFO L290 TraceCheckUtils]: 26: Hoare triple {172110#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {172110#(< ~counter~0 85)} is VALID [2022-04-15 15:20:40,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {172135#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {172110#(< ~counter~0 85)} is VALID [2022-04-15 15:20:40,471 INFO L290 TraceCheckUtils]: 24: Hoare triple {172135#(< ~counter~0 84)} assume !!(0 != ~r~0); {172135#(< ~counter~0 84)} is VALID [2022-04-15 15:20:40,471 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {171209#true} {172135#(< ~counter~0 84)} #94#return; {172135#(< ~counter~0 84)} is VALID [2022-04-15 15:20:40,471 INFO L290 TraceCheckUtils]: 22: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,471 INFO L290 TraceCheckUtils]: 21: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,472 INFO L290 TraceCheckUtils]: 20: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,472 INFO L272 TraceCheckUtils]: 19: Hoare triple {172135#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,472 INFO L290 TraceCheckUtils]: 18: Hoare triple {172135#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {172135#(< ~counter~0 84)} is VALID [2022-04-15 15:20:40,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {172160#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {172135#(< ~counter~0 84)} is VALID [2022-04-15 15:20:40,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {172160#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {172160#(< ~counter~0 83)} is VALID [2022-04-15 15:20:40,474 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {171209#true} {172160#(< ~counter~0 83)} #92#return; {172160#(< ~counter~0 83)} is VALID [2022-04-15 15:20:40,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,474 INFO L290 TraceCheckUtils]: 13: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,474 INFO L290 TraceCheckUtils]: 12: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,474 INFO L272 TraceCheckUtils]: 11: Hoare triple {172160#(< ~counter~0 83)} 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)); {171209#true} is VALID [2022-04-15 15:20:40,475 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {171209#true} {172160#(< ~counter~0 83)} #90#return; {172160#(< ~counter~0 83)} is VALID [2022-04-15 15:20:40,475 INFO L290 TraceCheckUtils]: 9: Hoare triple {171209#true} assume true; {171209#true} is VALID [2022-04-15 15:20:40,475 INFO L290 TraceCheckUtils]: 8: Hoare triple {171209#true} assume !(0 == ~cond); {171209#true} is VALID [2022-04-15 15:20:40,475 INFO L290 TraceCheckUtils]: 7: Hoare triple {171209#true} ~cond := #in~cond; {171209#true} is VALID [2022-04-15 15:20:40,475 INFO L272 TraceCheckUtils]: 6: Hoare triple {172160#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {171209#true} is VALID [2022-04-15 15:20:40,475 INFO L290 TraceCheckUtils]: 5: Hoare triple {172160#(< ~counter~0 83)} 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; {172160#(< ~counter~0 83)} is VALID [2022-04-15 15:20:40,476 INFO L272 TraceCheckUtils]: 4: Hoare triple {172160#(< ~counter~0 83)} call #t~ret9 := main(); {172160#(< ~counter~0 83)} is VALID [2022-04-15 15:20:40,476 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {172160#(< ~counter~0 83)} {171209#true} #102#return; {172160#(< ~counter~0 83)} is VALID [2022-04-15 15:20:40,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {172160#(< ~counter~0 83)} assume true; {172160#(< ~counter~0 83)} is VALID [2022-04-15 15:20:40,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {171209#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; {172160#(< ~counter~0 83)} is VALID [2022-04-15 15:20:40,477 INFO L272 TraceCheckUtils]: 0: Hoare triple {171209#true} call ULTIMATE.init(); {171209#true} is VALID [2022-04-15 15:20:40,477 INFO L134 CoverageAnalysis]: Checked inductivity of 794 backedges. 40 proven. 206 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-15 15:20:40,477 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:20:40,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878997552] [2022-04-15 15:20:40,477 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:20:40,477 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1889193519] [2022-04-15 15:20:40,477 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1889193519] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:20:40,478 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:20:40,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-15 15:20:40,478 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:20:40,478 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1144810915] [2022-04-15 15:20:40,478 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1144810915] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:20:40,478 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:20:40,478 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 15:20:40,478 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247224576] [2022-04-15 15:20:40,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:20:40,479 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 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 161 [2022-04-15 15:20:40,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:20:40,479 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 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-15 15:20:40,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:40,686 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 15:20:40,686 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:20:40,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 15:20:40,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 15:20:40,687 INFO L87 Difference]: Start difference. First operand 879 states and 1172 transitions. Second operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 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-15 15:20:46,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:46,698 INFO L93 Difference]: Finished difference Result 1083 states and 1474 transitions. [2022-04-15 15:20:46,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2022-04-15 15:20:46,699 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 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 161 [2022-04-15 15:20:46,699 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:20:46,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 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-15 15:20:46,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-15 15:20:46,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 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-15 15:20:46,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 376 transitions. [2022-04-15 15:20:46,704 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 36 states and 376 transitions. [2022-04-15 15:20:47,177 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:20:47,208 INFO L225 Difference]: With dead ends: 1083 [2022-04-15 15:20:47,208 INFO L226 Difference]: Without dead ends: 905 [2022-04-15 15:20:47,209 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 336 GetRequests, 283 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1263, Invalid=1707, Unknown=0, NotChecked=0, Total=2970 [2022-04-15 15:20:47,209 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 271 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 240 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 271 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 510 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 240 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-04-15 15:20:47,209 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [271 Valid, 387 Invalid, 510 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [240 Valid, 270 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-04-15 15:20:47,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 905 states. [2022-04-15 15:20:50,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 905 to 894. [2022-04-15 15:20:50,745 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:20:50,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 905 states. Second operand has 894 states, 669 states have (on average 1.1778774289985052) internal successors, (788), 681 states have internal predecessors, (788), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:20:50,747 INFO L74 IsIncluded]: Start isIncluded. First operand 905 states. Second operand has 894 states, 669 states have (on average 1.1778774289985052) internal successors, (788), 681 states have internal predecessors, (788), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:20:50,748 INFO L87 Difference]: Start difference. First operand 905 states. Second operand has 894 states, 669 states have (on average 1.1778774289985052) internal successors, (788), 681 states have internal predecessors, (788), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:20:50,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:50,774 INFO L93 Difference]: Finished difference Result 905 states and 1201 transitions. [2022-04-15 15:20:50,774 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1201 transitions. [2022-04-15 15:20:50,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:50,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:50,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 894 states, 669 states have (on average 1.1778774289985052) internal successors, (788), 681 states have internal predecessors, (788), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 905 states. [2022-04-15 15:20:50,776 INFO L87 Difference]: Start difference. First operand has 894 states, 669 states have (on average 1.1778774289985052) internal successors, (788), 681 states have internal predecessors, (788), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) Second operand 905 states. [2022-04-15 15:20:50,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:20:50,805 INFO L93 Difference]: Finished difference Result 905 states and 1201 transitions. [2022-04-15 15:20:50,805 INFO L276 IsEmpty]: Start isEmpty. Operand 905 states and 1201 transitions. [2022-04-15 15:20:50,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:20:50,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:20:50,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:20:50,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:20:50,807 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 894 states, 669 states have (on average 1.1778774289985052) internal successors, (788), 681 states have internal predecessors, (788), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 188 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:20:50,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 894 states to 894 states and 1190 transitions. [2022-04-15 15:20:50,845 INFO L78 Accepts]: Start accepts. Automaton has 894 states and 1190 transitions. Word has length 161 [2022-04-15 15:20:50,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:20:50,845 INFO L478 AbstractCegarLoop]: Abstraction has 894 states and 1190 transitions. [2022-04-15 15:20:50,846 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.523809523809524) internal successors, (116), 20 states have internal predecessors, (116), 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-15 15:20:50,846 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 894 states and 1190 transitions. [2022-04-15 15:21:07,167 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1190 edges. 1185 inductive. 0 not inductive. 5 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:07,167 INFO L276 IsEmpty]: Start isEmpty. Operand 894 states and 1190 transitions. [2022-04-15 15:21:07,169 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 164 [2022-04-15 15:21:07,169 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:21:07,169 INFO L499 BasicCegarLoop]: trace histogram [18, 17, 17, 8, 7, 7, 7, 7, 6, 6, 6, 5, 4, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:21:07,183 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (57)] Forceful destruction successful, exit code 0 [2022-04-15 15:21:07,376 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable55,57 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:07,376 INFO L403 AbstractCegarLoop]: === Iteration 57 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:21:07,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:21:07,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 25 times [2022-04-15 15:21:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:07,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [938204938] [2022-04-15 15:21:07,377 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:21:07,377 INFO L85 PathProgramCache]: Analyzing trace with hash 1942329766, now seen corresponding path program 26 times [2022-04-15 15:21:07,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:21:07,377 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1534780969] [2022-04-15 15:21:07,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:21:07,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:21:07,391 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:21:07,391 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1207269008] [2022-04-15 15:21:07,391 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:21:07,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:07,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:21:07,392 INFO L229 MonitoredProcess]: Starting monitored process 58 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:21:07,392 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Waiting until timeout for monitored process [2022-04-15 15:21:07,461 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:21:07,461 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:21:07,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 386 conjuncts, 39 conjunts are in the unsatisfiable core [2022-04-15 15:21:07,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:21:07,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:21:08,443 INFO L272 TraceCheckUtils]: 0: Hoare triple {178008#true} call ULTIMATE.init(); {178008#true} is VALID [2022-04-15 15:21:08,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {178008#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; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {178016#(<= ~counter~0 0)} assume true; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,445 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178016#(<= ~counter~0 0)} {178008#true} #102#return; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,445 INFO L272 TraceCheckUtils]: 4: Hoare triple {178016#(<= ~counter~0 0)} call #t~ret9 := main(); {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,445 INFO L290 TraceCheckUtils]: 5: Hoare triple {178016#(<= ~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; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,446 INFO L272 TraceCheckUtils]: 6: Hoare triple {178016#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,446 INFO L290 TraceCheckUtils]: 7: Hoare triple {178016#(<= ~counter~0 0)} ~cond := #in~cond; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,446 INFO L290 TraceCheckUtils]: 8: Hoare triple {178016#(<= ~counter~0 0)} assume !(0 == ~cond); {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,446 INFO L290 TraceCheckUtils]: 9: Hoare triple {178016#(<= ~counter~0 0)} assume true; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,447 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {178016#(<= ~counter~0 0)} {178016#(<= ~counter~0 0)} #90#return; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,447 INFO L272 TraceCheckUtils]: 11: Hoare triple {178016#(<= ~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)); {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {178016#(<= ~counter~0 0)} ~cond := #in~cond; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,448 INFO L290 TraceCheckUtils]: 13: Hoare triple {178016#(<= ~counter~0 0)} assume !(0 == ~cond); {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {178016#(<= ~counter~0 0)} assume true; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,448 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {178016#(<= ~counter~0 0)} {178016#(<= ~counter~0 0)} #92#return; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {178016#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {178016#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:08,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {178016#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178065#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:08,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {178065#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {178065#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:08,453 INFO L272 TraceCheckUtils]: 19: Hoare triple {178065#(<= ~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)); {178065#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:08,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {178065#(<= ~counter~0 1)} ~cond := #in~cond; {178065#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:08,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {178065#(<= ~counter~0 1)} assume !(0 == ~cond); {178065#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:08,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {178065#(<= ~counter~0 1)} assume true; {178065#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:08,454 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {178065#(<= ~counter~0 1)} {178065#(<= ~counter~0 1)} #94#return; {178065#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:08,454 INFO L290 TraceCheckUtils]: 24: Hoare triple {178065#(<= ~counter~0 1)} assume !!(0 != ~r~0); {178065#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:08,456 INFO L290 TraceCheckUtils]: 25: Hoare triple {178065#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178090#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:08,456 INFO L290 TraceCheckUtils]: 26: Hoare triple {178090#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {178090#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:08,457 INFO L272 TraceCheckUtils]: 27: Hoare triple {178090#(<= ~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)); {178090#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:08,457 INFO L290 TraceCheckUtils]: 28: Hoare triple {178090#(<= ~counter~0 2)} ~cond := #in~cond; {178090#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:08,457 INFO L290 TraceCheckUtils]: 29: Hoare triple {178090#(<= ~counter~0 2)} assume !(0 == ~cond); {178090#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:08,457 INFO L290 TraceCheckUtils]: 30: Hoare triple {178090#(<= ~counter~0 2)} assume true; {178090#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:08,458 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {178090#(<= ~counter~0 2)} {178090#(<= ~counter~0 2)} #96#return; {178090#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:08,458 INFO L290 TraceCheckUtils]: 32: Hoare triple {178090#(<= ~counter~0 2)} assume !(~r~0 > 0); {178090#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:08,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {178090#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178115#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:08,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {178115#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {178115#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:08,460 INFO L272 TraceCheckUtils]: 35: Hoare triple {178115#(<= ~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)); {178115#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:08,461 INFO L290 TraceCheckUtils]: 36: Hoare triple {178115#(<= ~counter~0 3)} ~cond := #in~cond; {178115#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:08,461 INFO L290 TraceCheckUtils]: 37: Hoare triple {178115#(<= ~counter~0 3)} assume !(0 == ~cond); {178115#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:08,461 INFO L290 TraceCheckUtils]: 38: Hoare triple {178115#(<= ~counter~0 3)} assume true; {178115#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:08,462 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {178115#(<= ~counter~0 3)} {178115#(<= ~counter~0 3)} #98#return; {178115#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:08,462 INFO L290 TraceCheckUtils]: 40: Hoare triple {178115#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {178115#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:08,463 INFO L290 TraceCheckUtils]: 41: Hoare triple {178115#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178140#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:08,464 INFO L290 TraceCheckUtils]: 42: Hoare triple {178140#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {178140#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:08,464 INFO L272 TraceCheckUtils]: 43: Hoare triple {178140#(<= ~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)); {178140#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:08,464 INFO L290 TraceCheckUtils]: 44: Hoare triple {178140#(<= ~counter~0 4)} ~cond := #in~cond; {178140#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:08,465 INFO L290 TraceCheckUtils]: 45: Hoare triple {178140#(<= ~counter~0 4)} assume !(0 == ~cond); {178140#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:08,465 INFO L290 TraceCheckUtils]: 46: Hoare triple {178140#(<= ~counter~0 4)} assume true; {178140#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:08,465 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {178140#(<= ~counter~0 4)} {178140#(<= ~counter~0 4)} #98#return; {178140#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:08,466 INFO L290 TraceCheckUtils]: 48: Hoare triple {178140#(<= ~counter~0 4)} assume !(~r~0 < 0); {178140#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:08,467 INFO L290 TraceCheckUtils]: 49: Hoare triple {178140#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178165#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:08,467 INFO L290 TraceCheckUtils]: 50: Hoare triple {178165#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {178165#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:08,468 INFO L272 TraceCheckUtils]: 51: Hoare triple {178165#(<= ~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)); {178165#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:08,468 INFO L290 TraceCheckUtils]: 52: Hoare triple {178165#(<= ~counter~0 5)} ~cond := #in~cond; {178165#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:08,468 INFO L290 TraceCheckUtils]: 53: Hoare triple {178165#(<= ~counter~0 5)} assume !(0 == ~cond); {178165#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:08,468 INFO L290 TraceCheckUtils]: 54: Hoare triple {178165#(<= ~counter~0 5)} assume true; {178165#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:08,469 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {178165#(<= ~counter~0 5)} {178165#(<= ~counter~0 5)} #94#return; {178165#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:08,469 INFO L290 TraceCheckUtils]: 56: Hoare triple {178165#(<= ~counter~0 5)} assume !!(0 != ~r~0); {178165#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:08,471 INFO L290 TraceCheckUtils]: 57: Hoare triple {178165#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178190#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:08,471 INFO L290 TraceCheckUtils]: 58: Hoare triple {178190#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {178190#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:08,471 INFO L272 TraceCheckUtils]: 59: Hoare triple {178190#(<= ~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)); {178190#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:08,472 INFO L290 TraceCheckUtils]: 60: Hoare triple {178190#(<= ~counter~0 6)} ~cond := #in~cond; {178190#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:08,472 INFO L290 TraceCheckUtils]: 61: Hoare triple {178190#(<= ~counter~0 6)} assume !(0 == ~cond); {178190#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:08,472 INFO L290 TraceCheckUtils]: 62: Hoare triple {178190#(<= ~counter~0 6)} assume true; {178190#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:08,473 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {178190#(<= ~counter~0 6)} {178190#(<= ~counter~0 6)} #96#return; {178190#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:08,473 INFO L290 TraceCheckUtils]: 64: Hoare triple {178190#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {178190#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:08,474 INFO L290 TraceCheckUtils]: 65: Hoare triple {178190#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178215#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:08,474 INFO L290 TraceCheckUtils]: 66: Hoare triple {178215#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {178215#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:08,475 INFO L272 TraceCheckUtils]: 67: Hoare triple {178215#(<= ~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)); {178215#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:08,475 INFO L290 TraceCheckUtils]: 68: Hoare triple {178215#(<= ~counter~0 7)} ~cond := #in~cond; {178215#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:08,475 INFO L290 TraceCheckUtils]: 69: Hoare triple {178215#(<= ~counter~0 7)} assume !(0 == ~cond); {178215#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:08,476 INFO L290 TraceCheckUtils]: 70: Hoare triple {178215#(<= ~counter~0 7)} assume true; {178215#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:08,476 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {178215#(<= ~counter~0 7)} {178215#(<= ~counter~0 7)} #96#return; {178215#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:08,477 INFO L290 TraceCheckUtils]: 72: Hoare triple {178215#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {178215#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:08,478 INFO L290 TraceCheckUtils]: 73: Hoare triple {178215#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178240#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:08,478 INFO L290 TraceCheckUtils]: 74: Hoare triple {178240#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {178240#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:08,479 INFO L272 TraceCheckUtils]: 75: Hoare triple {178240#(<= ~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)); {178240#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:08,479 INFO L290 TraceCheckUtils]: 76: Hoare triple {178240#(<= ~counter~0 8)} ~cond := #in~cond; {178240#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:08,479 INFO L290 TraceCheckUtils]: 77: Hoare triple {178240#(<= ~counter~0 8)} assume !(0 == ~cond); {178240#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:08,479 INFO L290 TraceCheckUtils]: 78: Hoare triple {178240#(<= ~counter~0 8)} assume true; {178240#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:08,480 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {178240#(<= ~counter~0 8)} {178240#(<= ~counter~0 8)} #96#return; {178240#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:08,480 INFO L290 TraceCheckUtils]: 80: Hoare triple {178240#(<= ~counter~0 8)} assume !(~r~0 > 0); {178240#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:08,482 INFO L290 TraceCheckUtils]: 81: Hoare triple {178240#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178265#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:08,482 INFO L290 TraceCheckUtils]: 82: Hoare triple {178265#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {178265#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:08,482 INFO L272 TraceCheckUtils]: 83: Hoare triple {178265#(<= ~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)); {178265#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:08,483 INFO L290 TraceCheckUtils]: 84: Hoare triple {178265#(<= ~counter~0 9)} ~cond := #in~cond; {178265#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:08,483 INFO L290 TraceCheckUtils]: 85: Hoare triple {178265#(<= ~counter~0 9)} assume !(0 == ~cond); {178265#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:08,483 INFO L290 TraceCheckUtils]: 86: Hoare triple {178265#(<= ~counter~0 9)} assume true; {178265#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:08,484 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {178265#(<= ~counter~0 9)} {178265#(<= ~counter~0 9)} #98#return; {178265#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:08,484 INFO L290 TraceCheckUtils]: 88: Hoare triple {178265#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {178265#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:08,485 INFO L290 TraceCheckUtils]: 89: Hoare triple {178265#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178290#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:08,486 INFO L290 TraceCheckUtils]: 90: Hoare triple {178290#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {178290#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:08,486 INFO L272 TraceCheckUtils]: 91: Hoare triple {178290#(<= ~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)); {178290#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:08,486 INFO L290 TraceCheckUtils]: 92: Hoare triple {178290#(<= ~counter~0 10)} ~cond := #in~cond; {178290#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:08,487 INFO L290 TraceCheckUtils]: 93: Hoare triple {178290#(<= ~counter~0 10)} assume !(0 == ~cond); {178290#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:08,487 INFO L290 TraceCheckUtils]: 94: Hoare triple {178290#(<= ~counter~0 10)} assume true; {178290#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:08,487 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {178290#(<= ~counter~0 10)} {178290#(<= ~counter~0 10)} #98#return; {178290#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:08,488 INFO L290 TraceCheckUtils]: 96: Hoare triple {178290#(<= ~counter~0 10)} assume !(~r~0 < 0); {178290#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:08,489 INFO L290 TraceCheckUtils]: 97: Hoare triple {178290#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178315#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:08,489 INFO L290 TraceCheckUtils]: 98: Hoare triple {178315#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {178315#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:08,490 INFO L272 TraceCheckUtils]: 99: Hoare triple {178315#(<= ~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)); {178315#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:08,490 INFO L290 TraceCheckUtils]: 100: Hoare triple {178315#(<= ~counter~0 11)} ~cond := #in~cond; {178315#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:08,490 INFO L290 TraceCheckUtils]: 101: Hoare triple {178315#(<= ~counter~0 11)} assume !(0 == ~cond); {178315#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:08,491 INFO L290 TraceCheckUtils]: 102: Hoare triple {178315#(<= ~counter~0 11)} assume true; {178315#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:08,491 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {178315#(<= ~counter~0 11)} {178315#(<= ~counter~0 11)} #94#return; {178315#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:08,491 INFO L290 TraceCheckUtils]: 104: Hoare triple {178315#(<= ~counter~0 11)} assume !!(0 != ~r~0); {178315#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:08,493 INFO L290 TraceCheckUtils]: 105: Hoare triple {178315#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178340#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:08,493 INFO L290 TraceCheckUtils]: 106: Hoare triple {178340#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {178340#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:08,494 INFO L272 TraceCheckUtils]: 107: Hoare triple {178340#(<= ~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)); {178340#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:08,494 INFO L290 TraceCheckUtils]: 108: Hoare triple {178340#(<= ~counter~0 12)} ~cond := #in~cond; {178340#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:08,494 INFO L290 TraceCheckUtils]: 109: Hoare triple {178340#(<= ~counter~0 12)} assume !(0 == ~cond); {178340#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:08,494 INFO L290 TraceCheckUtils]: 110: Hoare triple {178340#(<= ~counter~0 12)} assume true; {178340#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:08,495 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {178340#(<= ~counter~0 12)} {178340#(<= ~counter~0 12)} #96#return; {178340#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:08,495 INFO L290 TraceCheckUtils]: 112: Hoare triple {178340#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {178340#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:08,496 INFO L290 TraceCheckUtils]: 113: Hoare triple {178340#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178365#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:08,497 INFO L290 TraceCheckUtils]: 114: Hoare triple {178365#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {178365#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:08,497 INFO L272 TraceCheckUtils]: 115: Hoare triple {178365#(<= ~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)); {178365#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:08,497 INFO L290 TraceCheckUtils]: 116: Hoare triple {178365#(<= ~counter~0 13)} ~cond := #in~cond; {178365#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:08,498 INFO L290 TraceCheckUtils]: 117: Hoare triple {178365#(<= ~counter~0 13)} assume !(0 == ~cond); {178365#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:08,498 INFO L290 TraceCheckUtils]: 118: Hoare triple {178365#(<= ~counter~0 13)} assume true; {178365#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:08,498 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {178365#(<= ~counter~0 13)} {178365#(<= ~counter~0 13)} #96#return; {178365#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:08,499 INFO L290 TraceCheckUtils]: 120: Hoare triple {178365#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {178365#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:08,500 INFO L290 TraceCheckUtils]: 121: Hoare triple {178365#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178390#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:08,500 INFO L290 TraceCheckUtils]: 122: Hoare triple {178390#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {178390#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:08,501 INFO L272 TraceCheckUtils]: 123: Hoare triple {178390#(<= ~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)); {178390#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:08,501 INFO L290 TraceCheckUtils]: 124: Hoare triple {178390#(<= ~counter~0 14)} ~cond := #in~cond; {178390#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:08,501 INFO L290 TraceCheckUtils]: 125: Hoare triple {178390#(<= ~counter~0 14)} assume !(0 == ~cond); {178390#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:08,502 INFO L290 TraceCheckUtils]: 126: Hoare triple {178390#(<= ~counter~0 14)} assume true; {178390#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:08,502 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {178390#(<= ~counter~0 14)} {178390#(<= ~counter~0 14)} #96#return; {178390#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:08,502 INFO L290 TraceCheckUtils]: 128: Hoare triple {178390#(<= ~counter~0 14)} assume !(~r~0 > 0); {178390#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:08,504 INFO L290 TraceCheckUtils]: 129: Hoare triple {178390#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178415#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:08,504 INFO L290 TraceCheckUtils]: 130: Hoare triple {178415#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {178415#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:08,504 INFO L272 TraceCheckUtils]: 131: Hoare triple {178415#(<= ~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)); {178415#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:08,505 INFO L290 TraceCheckUtils]: 132: Hoare triple {178415#(<= ~counter~0 15)} ~cond := #in~cond; {178415#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:08,505 INFO L290 TraceCheckUtils]: 133: Hoare triple {178415#(<= ~counter~0 15)} assume !(0 == ~cond); {178415#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:08,505 INFO L290 TraceCheckUtils]: 134: Hoare triple {178415#(<= ~counter~0 15)} assume true; {178415#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:08,506 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {178415#(<= ~counter~0 15)} {178415#(<= ~counter~0 15)} #98#return; {178415#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:08,506 INFO L290 TraceCheckUtils]: 136: Hoare triple {178415#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {178415#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:08,508 INFO L290 TraceCheckUtils]: 137: Hoare triple {178415#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178440#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:08,508 INFO L290 TraceCheckUtils]: 138: Hoare triple {178440#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {178440#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:08,508 INFO L272 TraceCheckUtils]: 139: Hoare triple {178440#(<= ~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)); {178440#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:08,509 INFO L290 TraceCheckUtils]: 140: Hoare triple {178440#(<= ~counter~0 16)} ~cond := #in~cond; {178440#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:08,509 INFO L290 TraceCheckUtils]: 141: Hoare triple {178440#(<= ~counter~0 16)} assume !(0 == ~cond); {178440#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:08,509 INFO L290 TraceCheckUtils]: 142: Hoare triple {178440#(<= ~counter~0 16)} assume true; {178440#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:08,510 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {178440#(<= ~counter~0 16)} {178440#(<= ~counter~0 16)} #98#return; {178440#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:08,510 INFO L290 TraceCheckUtils]: 144: Hoare triple {178440#(<= ~counter~0 16)} assume !(~r~0 < 0); {178440#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:08,511 INFO L290 TraceCheckUtils]: 145: Hoare triple {178440#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178465#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:08,512 INFO L290 TraceCheckUtils]: 146: Hoare triple {178465#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {178465#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:08,512 INFO L272 TraceCheckUtils]: 147: Hoare triple {178465#(<= ~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)); {178465#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:08,515 INFO L290 TraceCheckUtils]: 148: Hoare triple {178465#(<= ~counter~0 17)} ~cond := #in~cond; {178465#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:08,515 INFO L290 TraceCheckUtils]: 149: Hoare triple {178465#(<= ~counter~0 17)} assume !(0 == ~cond); {178465#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:08,516 INFO L290 TraceCheckUtils]: 150: Hoare triple {178465#(<= ~counter~0 17)} assume true; {178465#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:08,516 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {178465#(<= ~counter~0 17)} {178465#(<= ~counter~0 17)} #94#return; {178465#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:08,516 INFO L290 TraceCheckUtils]: 152: Hoare triple {178465#(<= ~counter~0 17)} assume !!(0 != ~r~0); {178465#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:08,517 INFO L290 TraceCheckUtils]: 153: Hoare triple {178465#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178490#(<= |main_#t~post7| 17)} is VALID [2022-04-15 15:21:08,517 INFO L290 TraceCheckUtils]: 154: Hoare triple {178490#(<= |main_#t~post7| 17)} assume !(#t~post7 < 100);havoc #t~post7; {178009#false} is VALID [2022-04-15 15:21:08,517 INFO L290 TraceCheckUtils]: 155: Hoare triple {178009#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178009#false} is VALID [2022-04-15 15:21:08,517 INFO L290 TraceCheckUtils]: 156: Hoare triple {178009#false} assume !(#t~post8 < 100);havoc #t~post8; {178009#false} is VALID [2022-04-15 15:21:08,517 INFO L290 TraceCheckUtils]: 157: Hoare triple {178009#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178009#false} is VALID [2022-04-15 15:21:08,517 INFO L290 TraceCheckUtils]: 158: Hoare triple {178009#false} assume !(#t~post6 < 100);havoc #t~post6; {178009#false} is VALID [2022-04-15 15:21:08,517 INFO L272 TraceCheckUtils]: 159: Hoare triple {178009#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)); {178009#false} is VALID [2022-04-15 15:21:08,518 INFO L290 TraceCheckUtils]: 160: Hoare triple {178009#false} ~cond := #in~cond; {178009#false} is VALID [2022-04-15 15:21:08,518 INFO L290 TraceCheckUtils]: 161: Hoare triple {178009#false} assume 0 == ~cond; {178009#false} is VALID [2022-04-15 15:21:08,518 INFO L290 TraceCheckUtils]: 162: Hoare triple {178009#false} assume !false; {178009#false} is VALID [2022-04-15 15:21:08,518 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 726 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:21:08,518 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:21:09,561 INFO L290 TraceCheckUtils]: 162: Hoare triple {178009#false} assume !false; {178009#false} is VALID [2022-04-15 15:21:09,561 INFO L290 TraceCheckUtils]: 161: Hoare triple {178009#false} assume 0 == ~cond; {178009#false} is VALID [2022-04-15 15:21:09,561 INFO L290 TraceCheckUtils]: 160: Hoare triple {178009#false} ~cond := #in~cond; {178009#false} is VALID [2022-04-15 15:21:09,562 INFO L272 TraceCheckUtils]: 159: Hoare triple {178009#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)); {178009#false} is VALID [2022-04-15 15:21:09,562 INFO L290 TraceCheckUtils]: 158: Hoare triple {178009#false} assume !(#t~post6 < 100);havoc #t~post6; {178009#false} is VALID [2022-04-15 15:21:09,562 INFO L290 TraceCheckUtils]: 157: Hoare triple {178009#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178009#false} is VALID [2022-04-15 15:21:09,562 INFO L290 TraceCheckUtils]: 156: Hoare triple {178009#false} assume !(#t~post8 < 100);havoc #t~post8; {178009#false} is VALID [2022-04-15 15:21:09,562 INFO L290 TraceCheckUtils]: 155: Hoare triple {178009#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178009#false} is VALID [2022-04-15 15:21:09,562 INFO L290 TraceCheckUtils]: 154: Hoare triple {178542#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {178009#false} is VALID [2022-04-15 15:21:09,562 INFO L290 TraceCheckUtils]: 153: Hoare triple {178546#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178542#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:21:09,563 INFO L290 TraceCheckUtils]: 152: Hoare triple {178546#(< ~counter~0 100)} assume !!(0 != ~r~0); {178546#(< ~counter~0 100)} is VALID [2022-04-15 15:21:09,563 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {178008#true} {178546#(< ~counter~0 100)} #94#return; {178546#(< ~counter~0 100)} is VALID [2022-04-15 15:21:09,563 INFO L290 TraceCheckUtils]: 150: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,563 INFO L290 TraceCheckUtils]: 149: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,563 INFO L290 TraceCheckUtils]: 148: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,564 INFO L272 TraceCheckUtils]: 147: Hoare triple {178546#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,564 INFO L290 TraceCheckUtils]: 146: Hoare triple {178546#(< ~counter~0 100)} assume !!(#t~post6 < 100);havoc #t~post6; {178546#(< ~counter~0 100)} is VALID [2022-04-15 15:21:09,567 INFO L290 TraceCheckUtils]: 145: Hoare triple {178571#(< ~counter~0 99)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178546#(< ~counter~0 100)} is VALID [2022-04-15 15:21:09,567 INFO L290 TraceCheckUtils]: 144: Hoare triple {178571#(< ~counter~0 99)} assume !(~r~0 < 0); {178571#(< ~counter~0 99)} is VALID [2022-04-15 15:21:09,568 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {178008#true} {178571#(< ~counter~0 99)} #98#return; {178571#(< ~counter~0 99)} is VALID [2022-04-15 15:21:09,568 INFO L290 TraceCheckUtils]: 142: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,568 INFO L290 TraceCheckUtils]: 141: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,568 INFO L290 TraceCheckUtils]: 140: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,568 INFO L272 TraceCheckUtils]: 139: Hoare triple {178571#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,568 INFO L290 TraceCheckUtils]: 138: Hoare triple {178571#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {178571#(< ~counter~0 99)} is VALID [2022-04-15 15:21:09,570 INFO L290 TraceCheckUtils]: 137: Hoare triple {178596#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178571#(< ~counter~0 99)} is VALID [2022-04-15 15:21:09,570 INFO L290 TraceCheckUtils]: 136: Hoare triple {178596#(< ~counter~0 98)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {178596#(< ~counter~0 98)} is VALID [2022-04-15 15:21:09,571 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {178008#true} {178596#(< ~counter~0 98)} #98#return; {178596#(< ~counter~0 98)} is VALID [2022-04-15 15:21:09,571 INFO L290 TraceCheckUtils]: 134: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,571 INFO L290 TraceCheckUtils]: 133: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,571 INFO L290 TraceCheckUtils]: 132: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,571 INFO L272 TraceCheckUtils]: 131: Hoare triple {178596#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,571 INFO L290 TraceCheckUtils]: 130: Hoare triple {178596#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {178596#(< ~counter~0 98)} is VALID [2022-04-15 15:21:09,573 INFO L290 TraceCheckUtils]: 129: Hoare triple {178621#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178596#(< ~counter~0 98)} is VALID [2022-04-15 15:21:09,573 INFO L290 TraceCheckUtils]: 128: Hoare triple {178621#(< ~counter~0 97)} assume !(~r~0 > 0); {178621#(< ~counter~0 97)} is VALID [2022-04-15 15:21:09,574 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {178008#true} {178621#(< ~counter~0 97)} #96#return; {178621#(< ~counter~0 97)} is VALID [2022-04-15 15:21:09,574 INFO L290 TraceCheckUtils]: 126: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,574 INFO L290 TraceCheckUtils]: 125: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,574 INFO L290 TraceCheckUtils]: 124: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,574 INFO L272 TraceCheckUtils]: 123: Hoare triple {178621#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,574 INFO L290 TraceCheckUtils]: 122: Hoare triple {178621#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {178621#(< ~counter~0 97)} is VALID [2022-04-15 15:21:09,575 INFO L290 TraceCheckUtils]: 121: Hoare triple {178646#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178621#(< ~counter~0 97)} is VALID [2022-04-15 15:21:09,576 INFO L290 TraceCheckUtils]: 120: Hoare triple {178646#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {178646#(< ~counter~0 96)} is VALID [2022-04-15 15:21:09,576 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {178008#true} {178646#(< ~counter~0 96)} #96#return; {178646#(< ~counter~0 96)} is VALID [2022-04-15 15:21:09,576 INFO L290 TraceCheckUtils]: 118: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,576 INFO L290 TraceCheckUtils]: 117: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,576 INFO L290 TraceCheckUtils]: 116: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,577 INFO L272 TraceCheckUtils]: 115: Hoare triple {178646#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,577 INFO L290 TraceCheckUtils]: 114: Hoare triple {178646#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {178646#(< ~counter~0 96)} is VALID [2022-04-15 15:21:09,578 INFO L290 TraceCheckUtils]: 113: Hoare triple {178671#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178646#(< ~counter~0 96)} is VALID [2022-04-15 15:21:09,578 INFO L290 TraceCheckUtils]: 112: Hoare triple {178671#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {178671#(< ~counter~0 95)} is VALID [2022-04-15 15:21:09,579 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {178008#true} {178671#(< ~counter~0 95)} #96#return; {178671#(< ~counter~0 95)} is VALID [2022-04-15 15:21:09,579 INFO L290 TraceCheckUtils]: 110: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,579 INFO L290 TraceCheckUtils]: 109: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,579 INFO L290 TraceCheckUtils]: 108: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,579 INFO L272 TraceCheckUtils]: 107: Hoare triple {178671#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,579 INFO L290 TraceCheckUtils]: 106: Hoare triple {178671#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {178671#(< ~counter~0 95)} is VALID [2022-04-15 15:21:09,581 INFO L290 TraceCheckUtils]: 105: Hoare triple {178696#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178671#(< ~counter~0 95)} is VALID [2022-04-15 15:21:09,581 INFO L290 TraceCheckUtils]: 104: Hoare triple {178696#(< ~counter~0 94)} assume !!(0 != ~r~0); {178696#(< ~counter~0 94)} is VALID [2022-04-15 15:21:09,582 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {178008#true} {178696#(< ~counter~0 94)} #94#return; {178696#(< ~counter~0 94)} is VALID [2022-04-15 15:21:09,582 INFO L290 TraceCheckUtils]: 102: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,582 INFO L290 TraceCheckUtils]: 101: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,582 INFO L290 TraceCheckUtils]: 100: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,582 INFO L272 TraceCheckUtils]: 99: Hoare triple {178696#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,582 INFO L290 TraceCheckUtils]: 98: Hoare triple {178696#(< ~counter~0 94)} assume !!(#t~post6 < 100);havoc #t~post6; {178696#(< ~counter~0 94)} is VALID [2022-04-15 15:21:09,583 INFO L290 TraceCheckUtils]: 97: Hoare triple {178721#(< ~counter~0 93)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178696#(< ~counter~0 94)} is VALID [2022-04-15 15:21:09,584 INFO L290 TraceCheckUtils]: 96: Hoare triple {178721#(< ~counter~0 93)} assume !(~r~0 < 0); {178721#(< ~counter~0 93)} is VALID [2022-04-15 15:21:09,584 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {178008#true} {178721#(< ~counter~0 93)} #98#return; {178721#(< ~counter~0 93)} is VALID [2022-04-15 15:21:09,584 INFO L290 TraceCheckUtils]: 94: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,584 INFO L290 TraceCheckUtils]: 93: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,584 INFO L290 TraceCheckUtils]: 92: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,585 INFO L272 TraceCheckUtils]: 91: Hoare triple {178721#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,585 INFO L290 TraceCheckUtils]: 90: Hoare triple {178721#(< ~counter~0 93)} assume !!(#t~post8 < 100);havoc #t~post8; {178721#(< ~counter~0 93)} is VALID [2022-04-15 15:21:09,586 INFO L290 TraceCheckUtils]: 89: Hoare triple {178746#(< ~counter~0 92)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178721#(< ~counter~0 93)} is VALID [2022-04-15 15:21:09,586 INFO L290 TraceCheckUtils]: 88: Hoare triple {178746#(< ~counter~0 92)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {178746#(< ~counter~0 92)} is VALID [2022-04-15 15:21:09,587 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {178008#true} {178746#(< ~counter~0 92)} #98#return; {178746#(< ~counter~0 92)} is VALID [2022-04-15 15:21:09,587 INFO L290 TraceCheckUtils]: 86: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,587 INFO L290 TraceCheckUtils]: 85: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,587 INFO L290 TraceCheckUtils]: 84: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,587 INFO L272 TraceCheckUtils]: 83: Hoare triple {178746#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,587 INFO L290 TraceCheckUtils]: 82: Hoare triple {178746#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {178746#(< ~counter~0 92)} is VALID [2022-04-15 15:21:09,589 INFO L290 TraceCheckUtils]: 81: Hoare triple {178771#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178746#(< ~counter~0 92)} is VALID [2022-04-15 15:21:09,589 INFO L290 TraceCheckUtils]: 80: Hoare triple {178771#(< ~counter~0 91)} assume !(~r~0 > 0); {178771#(< ~counter~0 91)} is VALID [2022-04-15 15:21:09,590 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {178008#true} {178771#(< ~counter~0 91)} #96#return; {178771#(< ~counter~0 91)} is VALID [2022-04-15 15:21:09,590 INFO L290 TraceCheckUtils]: 78: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,590 INFO L290 TraceCheckUtils]: 77: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,590 INFO L290 TraceCheckUtils]: 76: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,590 INFO L272 TraceCheckUtils]: 75: Hoare triple {178771#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,590 INFO L290 TraceCheckUtils]: 74: Hoare triple {178771#(< ~counter~0 91)} assume !!(#t~post7 < 100);havoc #t~post7; {178771#(< ~counter~0 91)} is VALID [2022-04-15 15:21:09,592 INFO L290 TraceCheckUtils]: 73: Hoare triple {178796#(< ~counter~0 90)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178771#(< ~counter~0 91)} is VALID [2022-04-15 15:21:09,592 INFO L290 TraceCheckUtils]: 72: Hoare triple {178796#(< ~counter~0 90)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {178796#(< ~counter~0 90)} is VALID [2022-04-15 15:21:09,592 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {178008#true} {178796#(< ~counter~0 90)} #96#return; {178796#(< ~counter~0 90)} is VALID [2022-04-15 15:21:09,592 INFO L290 TraceCheckUtils]: 70: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,593 INFO L290 TraceCheckUtils]: 69: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,593 INFO L290 TraceCheckUtils]: 68: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,593 INFO L272 TraceCheckUtils]: 67: Hoare triple {178796#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,593 INFO L290 TraceCheckUtils]: 66: Hoare triple {178796#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {178796#(< ~counter~0 90)} is VALID [2022-04-15 15:21:09,594 INFO L290 TraceCheckUtils]: 65: Hoare triple {178821#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178796#(< ~counter~0 90)} is VALID [2022-04-15 15:21:09,594 INFO L290 TraceCheckUtils]: 64: Hoare triple {178821#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {178821#(< ~counter~0 89)} is VALID [2022-04-15 15:21:09,595 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {178008#true} {178821#(< ~counter~0 89)} #96#return; {178821#(< ~counter~0 89)} is VALID [2022-04-15 15:21:09,595 INFO L290 TraceCheckUtils]: 62: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,595 INFO L290 TraceCheckUtils]: 61: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,595 INFO L290 TraceCheckUtils]: 60: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,595 INFO L272 TraceCheckUtils]: 59: Hoare triple {178821#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,596 INFO L290 TraceCheckUtils]: 58: Hoare triple {178821#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {178821#(< ~counter~0 89)} is VALID [2022-04-15 15:21:09,597 INFO L290 TraceCheckUtils]: 57: Hoare triple {178846#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178821#(< ~counter~0 89)} is VALID [2022-04-15 15:21:09,597 INFO L290 TraceCheckUtils]: 56: Hoare triple {178846#(< ~counter~0 88)} assume !!(0 != ~r~0); {178846#(< ~counter~0 88)} is VALID [2022-04-15 15:21:09,598 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {178008#true} {178846#(< ~counter~0 88)} #94#return; {178846#(< ~counter~0 88)} is VALID [2022-04-15 15:21:09,598 INFO L290 TraceCheckUtils]: 54: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,598 INFO L290 TraceCheckUtils]: 53: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,598 INFO L290 TraceCheckUtils]: 52: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,598 INFO L272 TraceCheckUtils]: 51: Hoare triple {178846#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,598 INFO L290 TraceCheckUtils]: 50: Hoare triple {178846#(< ~counter~0 88)} assume !!(#t~post6 < 100);havoc #t~post6; {178846#(< ~counter~0 88)} is VALID [2022-04-15 15:21:09,600 INFO L290 TraceCheckUtils]: 49: Hoare triple {178871#(< ~counter~0 87)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178846#(< ~counter~0 88)} is VALID [2022-04-15 15:21:09,600 INFO L290 TraceCheckUtils]: 48: Hoare triple {178871#(< ~counter~0 87)} assume !(~r~0 < 0); {178871#(< ~counter~0 87)} is VALID [2022-04-15 15:21:09,600 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {178008#true} {178871#(< ~counter~0 87)} #98#return; {178871#(< ~counter~0 87)} is VALID [2022-04-15 15:21:09,600 INFO L290 TraceCheckUtils]: 46: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,600 INFO L290 TraceCheckUtils]: 45: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,601 INFO L290 TraceCheckUtils]: 44: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,601 INFO L272 TraceCheckUtils]: 43: Hoare triple {178871#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,601 INFO L290 TraceCheckUtils]: 42: Hoare triple {178871#(< ~counter~0 87)} assume !!(#t~post8 < 100);havoc #t~post8; {178871#(< ~counter~0 87)} is VALID [2022-04-15 15:21:09,602 INFO L290 TraceCheckUtils]: 41: Hoare triple {178896#(< ~counter~0 86)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178871#(< ~counter~0 87)} is VALID [2022-04-15 15:21:09,603 INFO L290 TraceCheckUtils]: 40: Hoare triple {178896#(< ~counter~0 86)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {178896#(< ~counter~0 86)} is VALID [2022-04-15 15:21:09,603 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {178008#true} {178896#(< ~counter~0 86)} #98#return; {178896#(< ~counter~0 86)} is VALID [2022-04-15 15:21:09,603 INFO L290 TraceCheckUtils]: 38: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,603 INFO L290 TraceCheckUtils]: 37: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,603 INFO L290 TraceCheckUtils]: 36: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,603 INFO L272 TraceCheckUtils]: 35: Hoare triple {178896#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {178896#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {178896#(< ~counter~0 86)} is VALID [2022-04-15 15:21:09,605 INFO L290 TraceCheckUtils]: 33: Hoare triple {178921#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {178896#(< ~counter~0 86)} is VALID [2022-04-15 15:21:09,605 INFO L290 TraceCheckUtils]: 32: Hoare triple {178921#(< ~counter~0 85)} assume !(~r~0 > 0); {178921#(< ~counter~0 85)} is VALID [2022-04-15 15:21:09,606 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {178008#true} {178921#(< ~counter~0 85)} #96#return; {178921#(< ~counter~0 85)} is VALID [2022-04-15 15:21:09,606 INFO L290 TraceCheckUtils]: 30: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,606 INFO L290 TraceCheckUtils]: 29: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,606 INFO L290 TraceCheckUtils]: 28: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,606 INFO L272 TraceCheckUtils]: 27: Hoare triple {178921#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,606 INFO L290 TraceCheckUtils]: 26: Hoare triple {178921#(< ~counter~0 85)} assume !!(#t~post7 < 100);havoc #t~post7; {178921#(< ~counter~0 85)} is VALID [2022-04-15 15:21:09,608 INFO L290 TraceCheckUtils]: 25: Hoare triple {178946#(< ~counter~0 84)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {178921#(< ~counter~0 85)} is VALID [2022-04-15 15:21:09,608 INFO L290 TraceCheckUtils]: 24: Hoare triple {178946#(< ~counter~0 84)} assume !!(0 != ~r~0); {178946#(< ~counter~0 84)} is VALID [2022-04-15 15:21:09,608 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {178008#true} {178946#(< ~counter~0 84)} #94#return; {178946#(< ~counter~0 84)} is VALID [2022-04-15 15:21:09,609 INFO L290 TraceCheckUtils]: 22: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,609 INFO L272 TraceCheckUtils]: 19: Hoare triple {178946#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {178946#(< ~counter~0 84)} assume !!(#t~post6 < 100);havoc #t~post6; {178946#(< ~counter~0 84)} is VALID [2022-04-15 15:21:09,610 INFO L290 TraceCheckUtils]: 17: Hoare triple {178971#(< ~counter~0 83)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {178946#(< ~counter~0 84)} is VALID [2022-04-15 15:21:09,611 INFO L290 TraceCheckUtils]: 16: Hoare triple {178971#(< ~counter~0 83)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {178971#(< ~counter~0 83)} is VALID [2022-04-15 15:21:09,611 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {178008#true} {178971#(< ~counter~0 83)} #92#return; {178971#(< ~counter~0 83)} is VALID [2022-04-15 15:21:09,611 INFO L290 TraceCheckUtils]: 14: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,611 INFO L290 TraceCheckUtils]: 12: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,611 INFO L272 TraceCheckUtils]: 11: Hoare triple {178971#(< ~counter~0 83)} 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)); {178008#true} is VALID [2022-04-15 15:21:09,612 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {178008#true} {178971#(< ~counter~0 83)} #90#return; {178971#(< ~counter~0 83)} is VALID [2022-04-15 15:21:09,612 INFO L290 TraceCheckUtils]: 9: Hoare triple {178008#true} assume true; {178008#true} is VALID [2022-04-15 15:21:09,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {178008#true} assume !(0 == ~cond); {178008#true} is VALID [2022-04-15 15:21:09,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {178008#true} ~cond := #in~cond; {178008#true} is VALID [2022-04-15 15:21:09,612 INFO L272 TraceCheckUtils]: 6: Hoare triple {178971#(< ~counter~0 83)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {178008#true} is VALID [2022-04-15 15:21:09,612 INFO L290 TraceCheckUtils]: 5: Hoare triple {178971#(< ~counter~0 83)} 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; {178971#(< ~counter~0 83)} is VALID [2022-04-15 15:21:09,613 INFO L272 TraceCheckUtils]: 4: Hoare triple {178971#(< ~counter~0 83)} call #t~ret9 := main(); {178971#(< ~counter~0 83)} is VALID [2022-04-15 15:21:09,613 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {178971#(< ~counter~0 83)} {178008#true} #102#return; {178971#(< ~counter~0 83)} is VALID [2022-04-15 15:21:09,613 INFO L290 TraceCheckUtils]: 2: Hoare triple {178971#(< ~counter~0 83)} assume true; {178971#(< ~counter~0 83)} is VALID [2022-04-15 15:21:09,614 INFO L290 TraceCheckUtils]: 1: Hoare triple {178008#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; {178971#(< ~counter~0 83)} is VALID [2022-04-15 15:21:09,614 INFO L272 TraceCheckUtils]: 0: Hoare triple {178008#true} call ULTIMATE.init(); {178008#true} is VALID [2022-04-15 15:21:09,614 INFO L134 CoverageAnalysis]: Checked inductivity of 784 backedges. 54 proven. 182 refuted. 0 times theorem prover too weak. 548 trivial. 0 not checked. [2022-04-15 15:21:09,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:21:09,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1534780969] [2022-04-15 15:21:09,614 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:21:09,614 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1207269008] [2022-04-15 15:21:09,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1207269008] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:21:09,615 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:21:09,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21] total 40 [2022-04-15 15:21:09,615 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:21:09,615 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [938204938] [2022-04-15 15:21:09,615 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [938204938] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:21:09,615 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:21:09,615 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [] total 21 [2022-04-15 15:21:09,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235263656] [2022-04-15 15:21:09,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:21:09,616 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 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 163 [2022-04-15 15:21:09,616 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:21:09,616 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 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-15 15:21:09,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:09,835 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-04-15 15:21:09,835 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:09,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-04-15 15:21:09,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=708, Invalid=852, Unknown=0, NotChecked=0, Total=1560 [2022-04-15 15:21:09,836 INFO L87 Difference]: Start difference. First operand 894 states and 1190 transitions. Second operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 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-15 15:21:16,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:16,020 INFO L93 Difference]: Finished difference Result 1081 states and 1468 transitions. [2022-04-15 15:21:16,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 15:21:16,020 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 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 163 [2022-04-15 15:21:16,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:21:16,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 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-15 15:21:16,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-15 15:21:16,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 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-15 15:21:16,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 376 transitions. [2022-04-15 15:21:16,027 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 376 transitions. [2022-04-15 15:21:16,565 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 376 edges. 376 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:16,603 INFO L225 Difference]: With dead ends: 1081 [2022-04-15 15:21:16,603 INFO L226 Difference]: Without dead ends: 911 [2022-04-15 15:21:16,604 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 341 GetRequests, 287 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1316, Invalid=1764, Unknown=0, NotChecked=0, Total=3080 [2022-04-15 15:21:16,604 INFO L913 BasicCegarLoop]: 81 mSDtfsCounter, 292 mSDsluCounter, 291 mSDsCounter, 0 mSdLazyCounter, 260 mSolverCounterSat, 277 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 292 SdHoareTripleChecker+Valid, 372 SdHoareTripleChecker+Invalid, 537 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 277 IncrementalHoareTripleChecker+Valid, 260 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 15:21:16,604 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [292 Valid, 372 Invalid, 537 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [277 Valid, 260 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 15:21:16,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 911 states. [2022-04-15 15:21:20,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 911 to 911. [2022-04-15 15:21:20,275 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:21:20,275 INFO L82 GeneralOperation]: Start isEquivalent. First operand 911 states. Second operand has 911 states, 686 states have (on average 1.1734693877551021) internal successors, (805), 693 states have internal predecessors, (805), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:21:20,276 INFO L74 IsIncluded]: Start isIncluded. First operand 911 states. Second operand has 911 states, 686 states have (on average 1.1734693877551021) internal successors, (805), 693 states have internal predecessors, (805), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:21:20,277 INFO L87 Difference]: Start difference. First operand 911 states. Second operand has 911 states, 686 states have (on average 1.1734693877551021) internal successors, (805), 693 states have internal predecessors, (805), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:21:20,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:20,302 INFO L93 Difference]: Finished difference Result 911 states and 1207 transitions. [2022-04-15 15:21:20,302 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1207 transitions. [2022-04-15 15:21:20,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:20,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:20,303 INFO L74 IsIncluded]: Start isIncluded. First operand has 911 states, 686 states have (on average 1.1734693877551021) internal successors, (805), 693 states have internal predecessors, (805), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 911 states. [2022-04-15 15:21:20,304 INFO L87 Difference]: Start difference. First operand has 911 states, 686 states have (on average 1.1734693877551021) internal successors, (805), 693 states have internal predecessors, (805), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) Second operand 911 states. [2022-04-15 15:21:20,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:20,329 INFO L93 Difference]: Finished difference Result 911 states and 1207 transitions. [2022-04-15 15:21:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1207 transitions. [2022-04-15 15:21:20,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:20,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:20,330 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:21:20,330 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:21:20,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 911 states, 686 states have (on average 1.1734693877551021) internal successors, (805), 693 states have internal predecessors, (805), 202 states have call successors, (202), 24 states have call predecessors, (202), 22 states have return successors, (200), 193 states have call predecessors, (200), 200 states have call successors, (200) [2022-04-15 15:21:20,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 911 states to 911 states and 1207 transitions. [2022-04-15 15:21:20,364 INFO L78 Accepts]: Start accepts. Automaton has 911 states and 1207 transitions. Word has length 163 [2022-04-15 15:21:20,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:21:20,365 INFO L478 AbstractCegarLoop]: Abstraction has 911 states and 1207 transitions. [2022-04-15 15:21:20,365 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 21 states have (on average 5.619047619047619) internal successors, (118), 20 states have internal predecessors, (118), 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-15 15:21:20,365 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 911 states and 1207 transitions. [2022-04-15 15:21:30,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1207 edges. 1205 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:30,994 INFO L276 IsEmpty]: Start isEmpty. Operand 911 states and 1207 transitions. [2022-04-15 15:21:30,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 168 [2022-04-15 15:21:30,996 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:21:30,996 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 9, 9, 9, 6, 6, 6, 6, 6, 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-15 15:21:31,015 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (58)] Forceful destruction successful, exit code 0 [2022-04-15 15:21:31,207 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 58 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable56 [2022-04-15 15:21:31,207 INFO L403 AbstractCegarLoop]: === Iteration 58 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:21:31,207 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:21:31,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 19 times [2022-04-15 15:21:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:31,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1006447198] [2022-04-15 15:21:31,208 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:21:31,208 INFO L85 PathProgramCache]: Analyzing trace with hash -1797417137, now seen corresponding path program 20 times [2022-04-15 15:21:31,208 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:21:31,208 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [432071162] [2022-04-15 15:21:31,208 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:21:31,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:21:31,222 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:21:31,222 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [103181917] [2022-04-15 15:21:31,223 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:21:31,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:31,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:21:31,224 INFO L229 MonitoredProcess]: Starting monitored process 59 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:21:31,247 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Waiting until timeout for monitored process [2022-04-15 15:21:31,312 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:21:31,312 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:21:31,313 INFO L263 TraceCheckSpWp]: Trace formula consists of 399 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 15:21:31,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:21:31,349 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:21:32,301 INFO L272 TraceCheckUtils]: 0: Hoare triple {184863#true} call ULTIMATE.init(); {184863#true} is VALID [2022-04-15 15:21:32,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {184863#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; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {184871#(<= ~counter~0 0)} assume true; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,309 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {184871#(<= ~counter~0 0)} {184863#true} #102#return; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,310 INFO L272 TraceCheckUtils]: 4: Hoare triple {184871#(<= ~counter~0 0)} call #t~ret9 := main(); {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {184871#(<= ~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; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,311 INFO L272 TraceCheckUtils]: 6: Hoare triple {184871#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,311 INFO L290 TraceCheckUtils]: 7: Hoare triple {184871#(<= ~counter~0 0)} ~cond := #in~cond; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,311 INFO L290 TraceCheckUtils]: 8: Hoare triple {184871#(<= ~counter~0 0)} assume !(0 == ~cond); {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,312 INFO L290 TraceCheckUtils]: 9: Hoare triple {184871#(<= ~counter~0 0)} assume true; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,312 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {184871#(<= ~counter~0 0)} {184871#(<= ~counter~0 0)} #90#return; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,312 INFO L272 TraceCheckUtils]: 11: Hoare triple {184871#(<= ~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)); {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,313 INFO L290 TraceCheckUtils]: 12: Hoare triple {184871#(<= ~counter~0 0)} ~cond := #in~cond; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {184871#(<= ~counter~0 0)} assume !(0 == ~cond); {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,313 INFO L290 TraceCheckUtils]: 14: Hoare triple {184871#(<= ~counter~0 0)} assume true; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,314 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {184871#(<= ~counter~0 0)} {184871#(<= ~counter~0 0)} #92#return; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {184871#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {184871#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:32,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {184871#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {184920#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:32,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {184920#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {184920#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:32,318 INFO L272 TraceCheckUtils]: 19: Hoare triple {184920#(<= ~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)); {184920#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:32,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {184920#(<= ~counter~0 1)} ~cond := #in~cond; {184920#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:32,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {184920#(<= ~counter~0 1)} assume !(0 == ~cond); {184920#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:32,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {184920#(<= ~counter~0 1)} assume true; {184920#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:32,320 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {184920#(<= ~counter~0 1)} {184920#(<= ~counter~0 1)} #94#return; {184920#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:32,320 INFO L290 TraceCheckUtils]: 24: Hoare triple {184920#(<= ~counter~0 1)} assume !!(0 != ~r~0); {184920#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:32,321 INFO L290 TraceCheckUtils]: 25: Hoare triple {184920#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {184945#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:32,322 INFO L290 TraceCheckUtils]: 26: Hoare triple {184945#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {184945#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:32,322 INFO L272 TraceCheckUtils]: 27: Hoare triple {184945#(<= ~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)); {184945#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:32,322 INFO L290 TraceCheckUtils]: 28: Hoare triple {184945#(<= ~counter~0 2)} ~cond := #in~cond; {184945#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:32,323 INFO L290 TraceCheckUtils]: 29: Hoare triple {184945#(<= ~counter~0 2)} assume !(0 == ~cond); {184945#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:32,323 INFO L290 TraceCheckUtils]: 30: Hoare triple {184945#(<= ~counter~0 2)} assume true; {184945#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:32,323 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {184945#(<= ~counter~0 2)} {184945#(<= ~counter~0 2)} #96#return; {184945#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:32,324 INFO L290 TraceCheckUtils]: 32: Hoare triple {184945#(<= ~counter~0 2)} assume !(~r~0 > 0); {184945#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:32,325 INFO L290 TraceCheckUtils]: 33: Hoare triple {184945#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184970#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:32,325 INFO L290 TraceCheckUtils]: 34: Hoare triple {184970#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {184970#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:32,326 INFO L272 TraceCheckUtils]: 35: Hoare triple {184970#(<= ~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)); {184970#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:32,326 INFO L290 TraceCheckUtils]: 36: Hoare triple {184970#(<= ~counter~0 3)} ~cond := #in~cond; {184970#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:32,326 INFO L290 TraceCheckUtils]: 37: Hoare triple {184970#(<= ~counter~0 3)} assume !(0 == ~cond); {184970#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:32,327 INFO L290 TraceCheckUtils]: 38: Hoare triple {184970#(<= ~counter~0 3)} assume true; {184970#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:32,327 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {184970#(<= ~counter~0 3)} {184970#(<= ~counter~0 3)} #98#return; {184970#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:32,327 INFO L290 TraceCheckUtils]: 40: Hoare triple {184970#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {184970#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:32,329 INFO L290 TraceCheckUtils]: 41: Hoare triple {184970#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {184995#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:32,329 INFO L290 TraceCheckUtils]: 42: Hoare triple {184995#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {184995#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:32,330 INFO L272 TraceCheckUtils]: 43: Hoare triple {184995#(<= ~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)); {184995#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:32,330 INFO L290 TraceCheckUtils]: 44: Hoare triple {184995#(<= ~counter~0 4)} ~cond := #in~cond; {184995#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:32,330 INFO L290 TraceCheckUtils]: 45: Hoare triple {184995#(<= ~counter~0 4)} assume !(0 == ~cond); {184995#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:32,330 INFO L290 TraceCheckUtils]: 46: Hoare triple {184995#(<= ~counter~0 4)} assume true; {184995#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:32,331 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {184995#(<= ~counter~0 4)} {184995#(<= ~counter~0 4)} #98#return; {184995#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:32,331 INFO L290 TraceCheckUtils]: 48: Hoare triple {184995#(<= ~counter~0 4)} assume !(~r~0 < 0); {184995#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:32,332 INFO L290 TraceCheckUtils]: 49: Hoare triple {184995#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185020#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:32,333 INFO L290 TraceCheckUtils]: 50: Hoare triple {185020#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {185020#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:32,333 INFO L272 TraceCheckUtils]: 51: Hoare triple {185020#(<= ~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)); {185020#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:32,333 INFO L290 TraceCheckUtils]: 52: Hoare triple {185020#(<= ~counter~0 5)} ~cond := #in~cond; {185020#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:32,334 INFO L290 TraceCheckUtils]: 53: Hoare triple {185020#(<= ~counter~0 5)} assume !(0 == ~cond); {185020#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:32,334 INFO L290 TraceCheckUtils]: 54: Hoare triple {185020#(<= ~counter~0 5)} assume true; {185020#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:32,334 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {185020#(<= ~counter~0 5)} {185020#(<= ~counter~0 5)} #94#return; {185020#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:32,335 INFO L290 TraceCheckUtils]: 56: Hoare triple {185020#(<= ~counter~0 5)} assume !!(0 != ~r~0); {185020#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:32,336 INFO L290 TraceCheckUtils]: 57: Hoare triple {185020#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185045#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:32,336 INFO L290 TraceCheckUtils]: 58: Hoare triple {185045#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {185045#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:32,337 INFO L272 TraceCheckUtils]: 59: Hoare triple {185045#(<= ~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)); {185045#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:32,337 INFO L290 TraceCheckUtils]: 60: Hoare triple {185045#(<= ~counter~0 6)} ~cond := #in~cond; {185045#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:32,337 INFO L290 TraceCheckUtils]: 61: Hoare triple {185045#(<= ~counter~0 6)} assume !(0 == ~cond); {185045#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:32,338 INFO L290 TraceCheckUtils]: 62: Hoare triple {185045#(<= ~counter~0 6)} assume true; {185045#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:32,338 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {185045#(<= ~counter~0 6)} {185045#(<= ~counter~0 6)} #96#return; {185045#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:32,338 INFO L290 TraceCheckUtils]: 64: Hoare triple {185045#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185045#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:32,340 INFO L290 TraceCheckUtils]: 65: Hoare triple {185045#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185070#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:32,340 INFO L290 TraceCheckUtils]: 66: Hoare triple {185070#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {185070#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:32,341 INFO L272 TraceCheckUtils]: 67: Hoare triple {185070#(<= ~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)); {185070#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:32,341 INFO L290 TraceCheckUtils]: 68: Hoare triple {185070#(<= ~counter~0 7)} ~cond := #in~cond; {185070#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:32,341 INFO L290 TraceCheckUtils]: 69: Hoare triple {185070#(<= ~counter~0 7)} assume !(0 == ~cond); {185070#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:32,341 INFO L290 TraceCheckUtils]: 70: Hoare triple {185070#(<= ~counter~0 7)} assume true; {185070#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:32,342 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {185070#(<= ~counter~0 7)} {185070#(<= ~counter~0 7)} #96#return; {185070#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:32,342 INFO L290 TraceCheckUtils]: 72: Hoare triple {185070#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185070#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:32,344 INFO L290 TraceCheckUtils]: 73: Hoare triple {185070#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185095#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:32,344 INFO L290 TraceCheckUtils]: 74: Hoare triple {185095#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {185095#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:32,344 INFO L272 TraceCheckUtils]: 75: Hoare triple {185095#(<= ~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)); {185095#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:32,345 INFO L290 TraceCheckUtils]: 76: Hoare triple {185095#(<= ~counter~0 8)} ~cond := #in~cond; {185095#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:32,345 INFO L290 TraceCheckUtils]: 77: Hoare triple {185095#(<= ~counter~0 8)} assume !(0 == ~cond); {185095#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:32,345 INFO L290 TraceCheckUtils]: 78: Hoare triple {185095#(<= ~counter~0 8)} assume true; {185095#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:32,346 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {185095#(<= ~counter~0 8)} {185095#(<= ~counter~0 8)} #96#return; {185095#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:32,346 INFO L290 TraceCheckUtils]: 80: Hoare triple {185095#(<= ~counter~0 8)} assume !(~r~0 > 0); {185095#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:32,347 INFO L290 TraceCheckUtils]: 81: Hoare triple {185095#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185120#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:32,348 INFO L290 TraceCheckUtils]: 82: Hoare triple {185120#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {185120#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:32,348 INFO L272 TraceCheckUtils]: 83: Hoare triple {185120#(<= ~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)); {185120#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:32,348 INFO L290 TraceCheckUtils]: 84: Hoare triple {185120#(<= ~counter~0 9)} ~cond := #in~cond; {185120#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:32,349 INFO L290 TraceCheckUtils]: 85: Hoare triple {185120#(<= ~counter~0 9)} assume !(0 == ~cond); {185120#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:32,349 INFO L290 TraceCheckUtils]: 86: Hoare triple {185120#(<= ~counter~0 9)} assume true; {185120#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:32,349 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {185120#(<= ~counter~0 9)} {185120#(<= ~counter~0 9)} #98#return; {185120#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:32,350 INFO L290 TraceCheckUtils]: 88: Hoare triple {185120#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185120#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:32,351 INFO L290 TraceCheckUtils]: 89: Hoare triple {185120#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185145#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:32,351 INFO L290 TraceCheckUtils]: 90: Hoare triple {185145#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {185145#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:32,352 INFO L272 TraceCheckUtils]: 91: Hoare triple {185145#(<= ~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)); {185145#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:32,352 INFO L290 TraceCheckUtils]: 92: Hoare triple {185145#(<= ~counter~0 10)} ~cond := #in~cond; {185145#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:32,352 INFO L290 TraceCheckUtils]: 93: Hoare triple {185145#(<= ~counter~0 10)} assume !(0 == ~cond); {185145#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:32,353 INFO L290 TraceCheckUtils]: 94: Hoare triple {185145#(<= ~counter~0 10)} assume true; {185145#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:32,353 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {185145#(<= ~counter~0 10)} {185145#(<= ~counter~0 10)} #98#return; {185145#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:32,353 INFO L290 TraceCheckUtils]: 96: Hoare triple {185145#(<= ~counter~0 10)} assume !(~r~0 < 0); {185145#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:32,355 INFO L290 TraceCheckUtils]: 97: Hoare triple {185145#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185170#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:32,355 INFO L290 TraceCheckUtils]: 98: Hoare triple {185170#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {185170#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:32,356 INFO L272 TraceCheckUtils]: 99: Hoare triple {185170#(<= ~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)); {185170#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:32,356 INFO L290 TraceCheckUtils]: 100: Hoare triple {185170#(<= ~counter~0 11)} ~cond := #in~cond; {185170#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:32,356 INFO L290 TraceCheckUtils]: 101: Hoare triple {185170#(<= ~counter~0 11)} assume !(0 == ~cond); {185170#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:32,356 INFO L290 TraceCheckUtils]: 102: Hoare triple {185170#(<= ~counter~0 11)} assume true; {185170#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:32,357 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {185170#(<= ~counter~0 11)} {185170#(<= ~counter~0 11)} #94#return; {185170#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:32,357 INFO L290 TraceCheckUtils]: 104: Hoare triple {185170#(<= ~counter~0 11)} assume !!(0 != ~r~0); {185170#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:32,359 INFO L290 TraceCheckUtils]: 105: Hoare triple {185170#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185195#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:32,359 INFO L290 TraceCheckUtils]: 106: Hoare triple {185195#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {185195#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:32,359 INFO L272 TraceCheckUtils]: 107: Hoare triple {185195#(<= ~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)); {185195#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:32,360 INFO L290 TraceCheckUtils]: 108: Hoare triple {185195#(<= ~counter~0 12)} ~cond := #in~cond; {185195#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:32,360 INFO L290 TraceCheckUtils]: 109: Hoare triple {185195#(<= ~counter~0 12)} assume !(0 == ~cond); {185195#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:32,360 INFO L290 TraceCheckUtils]: 110: Hoare triple {185195#(<= ~counter~0 12)} assume true; {185195#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:32,361 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {185195#(<= ~counter~0 12)} {185195#(<= ~counter~0 12)} #96#return; {185195#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:32,361 INFO L290 TraceCheckUtils]: 112: Hoare triple {185195#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185195#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:32,362 INFO L290 TraceCheckUtils]: 113: Hoare triple {185195#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185220#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:32,363 INFO L290 TraceCheckUtils]: 114: Hoare triple {185220#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {185220#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:32,363 INFO L272 TraceCheckUtils]: 115: Hoare triple {185220#(<= ~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)); {185220#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:32,363 INFO L290 TraceCheckUtils]: 116: Hoare triple {185220#(<= ~counter~0 13)} ~cond := #in~cond; {185220#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:32,364 INFO L290 TraceCheckUtils]: 117: Hoare triple {185220#(<= ~counter~0 13)} assume !(0 == ~cond); {185220#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:32,364 INFO L290 TraceCheckUtils]: 118: Hoare triple {185220#(<= ~counter~0 13)} assume true; {185220#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:32,364 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {185220#(<= ~counter~0 13)} {185220#(<= ~counter~0 13)} #96#return; {185220#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:32,365 INFO L290 TraceCheckUtils]: 120: Hoare triple {185220#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185220#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:32,366 INFO L290 TraceCheckUtils]: 121: Hoare triple {185220#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185245#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:32,366 INFO L290 TraceCheckUtils]: 122: Hoare triple {185245#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {185245#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:32,367 INFO L272 TraceCheckUtils]: 123: Hoare triple {185245#(<= ~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)); {185245#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:32,367 INFO L290 TraceCheckUtils]: 124: Hoare triple {185245#(<= ~counter~0 14)} ~cond := #in~cond; {185245#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:32,367 INFO L290 TraceCheckUtils]: 125: Hoare triple {185245#(<= ~counter~0 14)} assume !(0 == ~cond); {185245#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:32,368 INFO L290 TraceCheckUtils]: 126: Hoare triple {185245#(<= ~counter~0 14)} assume true; {185245#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:32,368 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {185245#(<= ~counter~0 14)} {185245#(<= ~counter~0 14)} #96#return; {185245#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:32,368 INFO L290 TraceCheckUtils]: 128: Hoare triple {185245#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185245#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:32,370 INFO L290 TraceCheckUtils]: 129: Hoare triple {185245#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185270#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:32,370 INFO L290 TraceCheckUtils]: 130: Hoare triple {185270#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {185270#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:32,371 INFO L272 TraceCheckUtils]: 131: Hoare triple {185270#(<= ~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)); {185270#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:32,371 INFO L290 TraceCheckUtils]: 132: Hoare triple {185270#(<= ~counter~0 15)} ~cond := #in~cond; {185270#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:32,371 INFO L290 TraceCheckUtils]: 133: Hoare triple {185270#(<= ~counter~0 15)} assume !(0 == ~cond); {185270#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:32,371 INFO L290 TraceCheckUtils]: 134: Hoare triple {185270#(<= ~counter~0 15)} assume true; {185270#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:32,372 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {185270#(<= ~counter~0 15)} {185270#(<= ~counter~0 15)} #96#return; {185270#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:32,372 INFO L290 TraceCheckUtils]: 136: Hoare triple {185270#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185270#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:32,374 INFO L290 TraceCheckUtils]: 137: Hoare triple {185270#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185295#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:32,374 INFO L290 TraceCheckUtils]: 138: Hoare triple {185295#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {185295#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:32,374 INFO L272 TraceCheckUtils]: 139: Hoare triple {185295#(<= ~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)); {185295#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:32,375 INFO L290 TraceCheckUtils]: 140: Hoare triple {185295#(<= ~counter~0 16)} ~cond := #in~cond; {185295#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:32,375 INFO L290 TraceCheckUtils]: 141: Hoare triple {185295#(<= ~counter~0 16)} assume !(0 == ~cond); {185295#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:32,375 INFO L290 TraceCheckUtils]: 142: Hoare triple {185295#(<= ~counter~0 16)} assume true; {185295#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:32,376 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {185295#(<= ~counter~0 16)} {185295#(<= ~counter~0 16)} #96#return; {185295#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:32,376 INFO L290 TraceCheckUtils]: 144: Hoare triple {185295#(<= ~counter~0 16)} assume !(~r~0 > 0); {185295#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:32,377 INFO L290 TraceCheckUtils]: 145: Hoare triple {185295#(<= ~counter~0 16)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185320#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:32,378 INFO L290 TraceCheckUtils]: 146: Hoare triple {185320#(<= ~counter~0 17)} assume !!(#t~post8 < 100);havoc #t~post8; {185320#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:32,378 INFO L272 TraceCheckUtils]: 147: Hoare triple {185320#(<= ~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)); {185320#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:32,378 INFO L290 TraceCheckUtils]: 148: Hoare triple {185320#(<= ~counter~0 17)} ~cond := #in~cond; {185320#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:32,379 INFO L290 TraceCheckUtils]: 149: Hoare triple {185320#(<= ~counter~0 17)} assume !(0 == ~cond); {185320#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:32,379 INFO L290 TraceCheckUtils]: 150: Hoare triple {185320#(<= ~counter~0 17)} assume true; {185320#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:32,380 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {185320#(<= ~counter~0 17)} {185320#(<= ~counter~0 17)} #98#return; {185320#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:32,380 INFO L290 TraceCheckUtils]: 152: Hoare triple {185320#(<= ~counter~0 17)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185320#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:32,381 INFO L290 TraceCheckUtils]: 153: Hoare triple {185320#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185345#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:32,381 INFO L290 TraceCheckUtils]: 154: Hoare triple {185345#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {185345#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:32,382 INFO L272 TraceCheckUtils]: 155: Hoare triple {185345#(<= ~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)); {185345#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:32,382 INFO L290 TraceCheckUtils]: 156: Hoare triple {185345#(<= ~counter~0 18)} ~cond := #in~cond; {185345#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:32,383 INFO L290 TraceCheckUtils]: 157: Hoare triple {185345#(<= ~counter~0 18)} assume !(0 == ~cond); {185345#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:32,383 INFO L290 TraceCheckUtils]: 158: Hoare triple {185345#(<= ~counter~0 18)} assume true; {185345#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:32,383 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {185345#(<= ~counter~0 18)} {185345#(<= ~counter~0 18)} #98#return; {185345#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:32,384 INFO L290 TraceCheckUtils]: 160: Hoare triple {185345#(<= ~counter~0 18)} assume !(~r~0 < 0); {185345#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:32,384 INFO L290 TraceCheckUtils]: 161: Hoare triple {185345#(<= ~counter~0 18)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185370#(<= |main_#t~post6| 18)} is VALID [2022-04-15 15:21:32,384 INFO L290 TraceCheckUtils]: 162: Hoare triple {185370#(<= |main_#t~post6| 18)} assume !(#t~post6 < 100);havoc #t~post6; {184864#false} is VALID [2022-04-15 15:21:32,384 INFO L272 TraceCheckUtils]: 163: Hoare triple {184864#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)); {184864#false} is VALID [2022-04-15 15:21:32,384 INFO L290 TraceCheckUtils]: 164: Hoare triple {184864#false} ~cond := #in~cond; {184864#false} is VALID [2022-04-15 15:21:32,384 INFO L290 TraceCheckUtils]: 165: Hoare triple {184864#false} assume 0 == ~cond; {184864#false} is VALID [2022-04-15 15:21:32,385 INFO L290 TraceCheckUtils]: 166: Hoare triple {184864#false} assume !false; {184864#false} is VALID [2022-04-15 15:21:32,385 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 834 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:21:32,385 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:21:33,460 INFO L290 TraceCheckUtils]: 166: Hoare triple {184864#false} assume !false; {184864#false} is VALID [2022-04-15 15:21:33,460 INFO L290 TraceCheckUtils]: 165: Hoare triple {184864#false} assume 0 == ~cond; {184864#false} is VALID [2022-04-15 15:21:33,460 INFO L290 TraceCheckUtils]: 164: Hoare triple {184864#false} ~cond := #in~cond; {184864#false} is VALID [2022-04-15 15:21:33,461 INFO L272 TraceCheckUtils]: 163: Hoare triple {184864#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)); {184864#false} is VALID [2022-04-15 15:21:33,461 INFO L290 TraceCheckUtils]: 162: Hoare triple {185398#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {184864#false} is VALID [2022-04-15 15:21:33,461 INFO L290 TraceCheckUtils]: 161: Hoare triple {185402#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185398#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:21:33,461 INFO L290 TraceCheckUtils]: 160: Hoare triple {185402#(< ~counter~0 100)} assume !(~r~0 < 0); {185402#(< ~counter~0 100)} is VALID [2022-04-15 15:21:33,462 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {184863#true} {185402#(< ~counter~0 100)} #98#return; {185402#(< ~counter~0 100)} is VALID [2022-04-15 15:21:33,462 INFO L290 TraceCheckUtils]: 158: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,462 INFO L290 TraceCheckUtils]: 157: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,462 INFO L290 TraceCheckUtils]: 156: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,462 INFO L272 TraceCheckUtils]: 155: Hoare triple {185402#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,463 INFO L290 TraceCheckUtils]: 154: Hoare triple {185402#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {185402#(< ~counter~0 100)} is VALID [2022-04-15 15:21:33,466 INFO L290 TraceCheckUtils]: 153: Hoare triple {185427#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185402#(< ~counter~0 100)} is VALID [2022-04-15 15:21:33,466 INFO L290 TraceCheckUtils]: 152: Hoare triple {185427#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185427#(< ~counter~0 99)} is VALID [2022-04-15 15:21:33,467 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {184863#true} {185427#(< ~counter~0 99)} #98#return; {185427#(< ~counter~0 99)} is VALID [2022-04-15 15:21:33,467 INFO L290 TraceCheckUtils]: 150: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,467 INFO L290 TraceCheckUtils]: 149: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,467 INFO L290 TraceCheckUtils]: 148: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,467 INFO L272 TraceCheckUtils]: 147: Hoare triple {185427#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,467 INFO L290 TraceCheckUtils]: 146: Hoare triple {185427#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {185427#(< ~counter~0 99)} is VALID [2022-04-15 15:21:33,469 INFO L290 TraceCheckUtils]: 145: Hoare triple {185452#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185427#(< ~counter~0 99)} is VALID [2022-04-15 15:21:33,469 INFO L290 TraceCheckUtils]: 144: Hoare triple {185452#(< ~counter~0 98)} assume !(~r~0 > 0); {185452#(< ~counter~0 98)} is VALID [2022-04-15 15:21:33,470 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {184863#true} {185452#(< ~counter~0 98)} #96#return; {185452#(< ~counter~0 98)} is VALID [2022-04-15 15:21:33,470 INFO L290 TraceCheckUtils]: 142: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,470 INFO L290 TraceCheckUtils]: 141: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,470 INFO L290 TraceCheckUtils]: 140: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,470 INFO L272 TraceCheckUtils]: 139: Hoare triple {185452#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,470 INFO L290 TraceCheckUtils]: 138: Hoare triple {185452#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {185452#(< ~counter~0 98)} is VALID [2022-04-15 15:21:33,472 INFO L290 TraceCheckUtils]: 137: Hoare triple {185477#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185452#(< ~counter~0 98)} is VALID [2022-04-15 15:21:33,472 INFO L290 TraceCheckUtils]: 136: Hoare triple {185477#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185477#(< ~counter~0 97)} is VALID [2022-04-15 15:21:33,472 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {184863#true} {185477#(< ~counter~0 97)} #96#return; {185477#(< ~counter~0 97)} is VALID [2022-04-15 15:21:33,472 INFO L290 TraceCheckUtils]: 134: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,473 INFO L290 TraceCheckUtils]: 133: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,473 INFO L290 TraceCheckUtils]: 132: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,473 INFO L272 TraceCheckUtils]: 131: Hoare triple {185477#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,473 INFO L290 TraceCheckUtils]: 130: Hoare triple {185477#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {185477#(< ~counter~0 97)} is VALID [2022-04-15 15:21:33,474 INFO L290 TraceCheckUtils]: 129: Hoare triple {185502#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185477#(< ~counter~0 97)} is VALID [2022-04-15 15:21:33,475 INFO L290 TraceCheckUtils]: 128: Hoare triple {185502#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185502#(< ~counter~0 96)} is VALID [2022-04-15 15:21:33,475 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {184863#true} {185502#(< ~counter~0 96)} #96#return; {185502#(< ~counter~0 96)} is VALID [2022-04-15 15:21:33,475 INFO L290 TraceCheckUtils]: 126: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,475 INFO L290 TraceCheckUtils]: 125: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,475 INFO L290 TraceCheckUtils]: 124: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,475 INFO L272 TraceCheckUtils]: 123: Hoare triple {185502#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,476 INFO L290 TraceCheckUtils]: 122: Hoare triple {185502#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {185502#(< ~counter~0 96)} is VALID [2022-04-15 15:21:33,477 INFO L290 TraceCheckUtils]: 121: Hoare triple {185527#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185502#(< ~counter~0 96)} is VALID [2022-04-15 15:21:33,477 INFO L290 TraceCheckUtils]: 120: Hoare triple {185527#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185527#(< ~counter~0 95)} is VALID [2022-04-15 15:21:33,478 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {184863#true} {185527#(< ~counter~0 95)} #96#return; {185527#(< ~counter~0 95)} is VALID [2022-04-15 15:21:33,478 INFO L290 TraceCheckUtils]: 118: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,478 INFO L290 TraceCheckUtils]: 117: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,478 INFO L290 TraceCheckUtils]: 116: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,478 INFO L272 TraceCheckUtils]: 115: Hoare triple {185527#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,478 INFO L290 TraceCheckUtils]: 114: Hoare triple {185527#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {185527#(< ~counter~0 95)} is VALID [2022-04-15 15:21:33,480 INFO L290 TraceCheckUtils]: 113: Hoare triple {185552#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185527#(< ~counter~0 95)} is VALID [2022-04-15 15:21:33,480 INFO L290 TraceCheckUtils]: 112: Hoare triple {185552#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185552#(< ~counter~0 94)} is VALID [2022-04-15 15:21:33,481 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {184863#true} {185552#(< ~counter~0 94)} #96#return; {185552#(< ~counter~0 94)} is VALID [2022-04-15 15:21:33,481 INFO L290 TraceCheckUtils]: 110: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,481 INFO L290 TraceCheckUtils]: 109: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,481 INFO L290 TraceCheckUtils]: 108: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,481 INFO L272 TraceCheckUtils]: 107: Hoare triple {185552#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,481 INFO L290 TraceCheckUtils]: 106: Hoare triple {185552#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {185552#(< ~counter~0 94)} is VALID [2022-04-15 15:21:33,483 INFO L290 TraceCheckUtils]: 105: Hoare triple {185577#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185552#(< ~counter~0 94)} is VALID [2022-04-15 15:21:33,483 INFO L290 TraceCheckUtils]: 104: Hoare triple {185577#(< ~counter~0 93)} assume !!(0 != ~r~0); {185577#(< ~counter~0 93)} is VALID [2022-04-15 15:21:33,483 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {184863#true} {185577#(< ~counter~0 93)} #94#return; {185577#(< ~counter~0 93)} is VALID [2022-04-15 15:21:33,483 INFO L290 TraceCheckUtils]: 102: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,484 INFO L290 TraceCheckUtils]: 101: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,484 INFO L290 TraceCheckUtils]: 100: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,484 INFO L272 TraceCheckUtils]: 99: Hoare triple {185577#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,484 INFO L290 TraceCheckUtils]: 98: Hoare triple {185577#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {185577#(< ~counter~0 93)} is VALID [2022-04-15 15:21:33,485 INFO L290 TraceCheckUtils]: 97: Hoare triple {185602#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185577#(< ~counter~0 93)} is VALID [2022-04-15 15:21:33,486 INFO L290 TraceCheckUtils]: 96: Hoare triple {185602#(< ~counter~0 92)} assume !(~r~0 < 0); {185602#(< ~counter~0 92)} is VALID [2022-04-15 15:21:33,486 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {184863#true} {185602#(< ~counter~0 92)} #98#return; {185602#(< ~counter~0 92)} is VALID [2022-04-15 15:21:33,486 INFO L290 TraceCheckUtils]: 94: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,486 INFO L290 TraceCheckUtils]: 93: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,486 INFO L290 TraceCheckUtils]: 92: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,487 INFO L272 TraceCheckUtils]: 91: Hoare triple {185602#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,487 INFO L290 TraceCheckUtils]: 90: Hoare triple {185602#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {185602#(< ~counter~0 92)} is VALID [2022-04-15 15:21:33,488 INFO L290 TraceCheckUtils]: 89: Hoare triple {185627#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185602#(< ~counter~0 92)} is VALID [2022-04-15 15:21:33,489 INFO L290 TraceCheckUtils]: 88: Hoare triple {185627#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185627#(< ~counter~0 91)} is VALID [2022-04-15 15:21:33,489 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {184863#true} {185627#(< ~counter~0 91)} #98#return; {185627#(< ~counter~0 91)} is VALID [2022-04-15 15:21:33,489 INFO L290 TraceCheckUtils]: 86: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,489 INFO L290 TraceCheckUtils]: 85: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,489 INFO L290 TraceCheckUtils]: 84: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,489 INFO L272 TraceCheckUtils]: 83: Hoare triple {185627#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,490 INFO L290 TraceCheckUtils]: 82: Hoare triple {185627#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {185627#(< ~counter~0 91)} is VALID [2022-04-15 15:21:33,491 INFO L290 TraceCheckUtils]: 81: Hoare triple {185652#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185627#(< ~counter~0 91)} is VALID [2022-04-15 15:21:33,491 INFO L290 TraceCheckUtils]: 80: Hoare triple {185652#(< ~counter~0 90)} assume !(~r~0 > 0); {185652#(< ~counter~0 90)} is VALID [2022-04-15 15:21:33,492 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {184863#true} {185652#(< ~counter~0 90)} #96#return; {185652#(< ~counter~0 90)} is VALID [2022-04-15 15:21:33,498 INFO L290 TraceCheckUtils]: 78: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,499 INFO L290 TraceCheckUtils]: 77: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,499 INFO L290 TraceCheckUtils]: 76: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,499 INFO L272 TraceCheckUtils]: 75: Hoare triple {185652#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,499 INFO L290 TraceCheckUtils]: 74: Hoare triple {185652#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {185652#(< ~counter~0 90)} is VALID [2022-04-15 15:21:33,503 INFO L290 TraceCheckUtils]: 73: Hoare triple {185677#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185652#(< ~counter~0 90)} is VALID [2022-04-15 15:21:33,503 INFO L290 TraceCheckUtils]: 72: Hoare triple {185677#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185677#(< ~counter~0 89)} is VALID [2022-04-15 15:21:33,504 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {184863#true} {185677#(< ~counter~0 89)} #96#return; {185677#(< ~counter~0 89)} is VALID [2022-04-15 15:21:33,504 INFO L290 TraceCheckUtils]: 70: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,504 INFO L290 TraceCheckUtils]: 69: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,504 INFO L290 TraceCheckUtils]: 68: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,504 INFO L272 TraceCheckUtils]: 67: Hoare triple {185677#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,504 INFO L290 TraceCheckUtils]: 66: Hoare triple {185677#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {185677#(< ~counter~0 89)} is VALID [2022-04-15 15:21:33,506 INFO L290 TraceCheckUtils]: 65: Hoare triple {185702#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185677#(< ~counter~0 89)} is VALID [2022-04-15 15:21:33,506 INFO L290 TraceCheckUtils]: 64: Hoare triple {185702#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {185702#(< ~counter~0 88)} is VALID [2022-04-15 15:21:33,507 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {184863#true} {185702#(< ~counter~0 88)} #96#return; {185702#(< ~counter~0 88)} is VALID [2022-04-15 15:21:33,507 INFO L290 TraceCheckUtils]: 62: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,507 INFO L290 TraceCheckUtils]: 61: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,507 INFO L290 TraceCheckUtils]: 60: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,507 INFO L272 TraceCheckUtils]: 59: Hoare triple {185702#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,507 INFO L290 TraceCheckUtils]: 58: Hoare triple {185702#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {185702#(< ~counter~0 88)} is VALID [2022-04-15 15:21:33,509 INFO L290 TraceCheckUtils]: 57: Hoare triple {185727#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185702#(< ~counter~0 88)} is VALID [2022-04-15 15:21:33,509 INFO L290 TraceCheckUtils]: 56: Hoare triple {185727#(< ~counter~0 87)} assume !!(0 != ~r~0); {185727#(< ~counter~0 87)} is VALID [2022-04-15 15:21:33,509 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {184863#true} {185727#(< ~counter~0 87)} #94#return; {185727#(< ~counter~0 87)} is VALID [2022-04-15 15:21:33,509 INFO L290 TraceCheckUtils]: 54: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,510 INFO L290 TraceCheckUtils]: 53: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,510 INFO L290 TraceCheckUtils]: 52: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,510 INFO L272 TraceCheckUtils]: 51: Hoare triple {185727#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,510 INFO L290 TraceCheckUtils]: 50: Hoare triple {185727#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {185727#(< ~counter~0 87)} is VALID [2022-04-15 15:21:33,511 INFO L290 TraceCheckUtils]: 49: Hoare triple {185752#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185727#(< ~counter~0 87)} is VALID [2022-04-15 15:21:33,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {185752#(< ~counter~0 86)} assume !(~r~0 < 0); {185752#(< ~counter~0 86)} is VALID [2022-04-15 15:21:33,512 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {184863#true} {185752#(< ~counter~0 86)} #98#return; {185752#(< ~counter~0 86)} is VALID [2022-04-15 15:21:33,512 INFO L290 TraceCheckUtils]: 46: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,512 INFO L290 TraceCheckUtils]: 45: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,512 INFO L290 TraceCheckUtils]: 44: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,512 INFO L272 TraceCheckUtils]: 43: Hoare triple {185752#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,513 INFO L290 TraceCheckUtils]: 42: Hoare triple {185752#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {185752#(< ~counter~0 86)} is VALID [2022-04-15 15:21:33,514 INFO L290 TraceCheckUtils]: 41: Hoare triple {185777#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185752#(< ~counter~0 86)} is VALID [2022-04-15 15:21:33,514 INFO L290 TraceCheckUtils]: 40: Hoare triple {185777#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {185777#(< ~counter~0 85)} is VALID [2022-04-15 15:21:33,515 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {184863#true} {185777#(< ~counter~0 85)} #98#return; {185777#(< ~counter~0 85)} is VALID [2022-04-15 15:21:33,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,515 INFO L290 TraceCheckUtils]: 37: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,515 INFO L290 TraceCheckUtils]: 36: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,515 INFO L272 TraceCheckUtils]: 35: Hoare triple {185777#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,515 INFO L290 TraceCheckUtils]: 34: Hoare triple {185777#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {185777#(< ~counter~0 85)} is VALID [2022-04-15 15:21:33,517 INFO L290 TraceCheckUtils]: 33: Hoare triple {185802#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {185777#(< ~counter~0 85)} is VALID [2022-04-15 15:21:33,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {185802#(< ~counter~0 84)} assume !(~r~0 > 0); {185802#(< ~counter~0 84)} is VALID [2022-04-15 15:21:33,518 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {184863#true} {185802#(< ~counter~0 84)} #96#return; {185802#(< ~counter~0 84)} is VALID [2022-04-15 15:21:33,518 INFO L290 TraceCheckUtils]: 30: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,518 INFO L290 TraceCheckUtils]: 29: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,518 INFO L290 TraceCheckUtils]: 28: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,518 INFO L272 TraceCheckUtils]: 27: Hoare triple {185802#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,518 INFO L290 TraceCheckUtils]: 26: Hoare triple {185802#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {185802#(< ~counter~0 84)} is VALID [2022-04-15 15:21:33,520 INFO L290 TraceCheckUtils]: 25: Hoare triple {185827#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {185802#(< ~counter~0 84)} is VALID [2022-04-15 15:21:33,520 INFO L290 TraceCheckUtils]: 24: Hoare triple {185827#(< ~counter~0 83)} assume !!(0 != ~r~0); {185827#(< ~counter~0 83)} is VALID [2022-04-15 15:21:33,520 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {184863#true} {185827#(< ~counter~0 83)} #94#return; {185827#(< ~counter~0 83)} is VALID [2022-04-15 15:21:33,520 INFO L290 TraceCheckUtils]: 22: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,520 INFO L290 TraceCheckUtils]: 21: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,520 INFO L290 TraceCheckUtils]: 20: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,521 INFO L272 TraceCheckUtils]: 19: Hoare triple {185827#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,521 INFO L290 TraceCheckUtils]: 18: Hoare triple {185827#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {185827#(< ~counter~0 83)} is VALID [2022-04-15 15:21:33,522 INFO L290 TraceCheckUtils]: 17: Hoare triple {185852#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {185827#(< ~counter~0 83)} is VALID [2022-04-15 15:21:33,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {185852#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {185852#(< ~counter~0 82)} is VALID [2022-04-15 15:21:33,523 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {184863#true} {185852#(< ~counter~0 82)} #92#return; {185852#(< ~counter~0 82)} is VALID [2022-04-15 15:21:33,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,523 INFO L290 TraceCheckUtils]: 12: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,523 INFO L272 TraceCheckUtils]: 11: Hoare triple {185852#(< ~counter~0 82)} 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)); {184863#true} is VALID [2022-04-15 15:21:33,524 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {184863#true} {185852#(< ~counter~0 82)} #90#return; {185852#(< ~counter~0 82)} is VALID [2022-04-15 15:21:33,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {184863#true} assume true; {184863#true} is VALID [2022-04-15 15:21:33,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {184863#true} assume !(0 == ~cond); {184863#true} is VALID [2022-04-15 15:21:33,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {184863#true} ~cond := #in~cond; {184863#true} is VALID [2022-04-15 15:21:33,524 INFO L272 TraceCheckUtils]: 6: Hoare triple {185852#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {184863#true} is VALID [2022-04-15 15:21:33,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {185852#(< ~counter~0 82)} 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; {185852#(< ~counter~0 82)} is VALID [2022-04-15 15:21:33,524 INFO L272 TraceCheckUtils]: 4: Hoare triple {185852#(< ~counter~0 82)} call #t~ret9 := main(); {185852#(< ~counter~0 82)} is VALID [2022-04-15 15:21:33,525 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {185852#(< ~counter~0 82)} {184863#true} #102#return; {185852#(< ~counter~0 82)} is VALID [2022-04-15 15:21:33,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {185852#(< ~counter~0 82)} assume true; {185852#(< ~counter~0 82)} is VALID [2022-04-15 15:21:33,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {184863#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; {185852#(< ~counter~0 82)} is VALID [2022-04-15 15:21:33,526 INFO L272 TraceCheckUtils]: 0: Hoare triple {184863#true} call ULTIMATE.init(); {184863#true} is VALID [2022-04-15 15:21:33,526 INFO L134 CoverageAnalysis]: Checked inductivity of 874 backedges. 36 proven. 222 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-15 15:21:33,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:21:33,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [432071162] [2022-04-15 15:21:33,526 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:21:33,526 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [103181917] [2022-04-15 15:21:33,526 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [103181917] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:21:33,526 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:21:33,526 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-15 15:21:33,527 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:21:33,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1006447198] [2022-04-15 15:21:33,527 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1006447198] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:21:33,527 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:21:33,527 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 15:21:33,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094283224] [2022-04-15 15:21:33,527 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:21:33,531 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 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 167 [2022-04-15 15:21:33,531 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:21:33,532 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 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-15 15:21:33,819 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-15 15:21:33,820 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 15:21:33,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:33,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 15:21:33,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 15:21:33,820 INFO L87 Difference]: Start difference. First operand 911 states and 1207 transitions. Second operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 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-15 15:21:40,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:40,553 INFO L93 Difference]: Finished difference Result 962 states and 1277 transitions. [2022-04-15 15:21:40,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2022-04-15 15:21:40,553 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 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 167 [2022-04-15 15:21:40,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:21:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 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-15 15:21:40,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-15 15:21:40,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 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-15 15:21:40,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 374 transitions. [2022-04-15 15:21:40,558 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 37 states and 374 transitions. [2022-04-15 15:21:41,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 374 edges. 374 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:41,115 INFO L225 Difference]: With dead ends: 962 [2022-04-15 15:21:41,115 INFO L226 Difference]: Without dead ends: 957 [2022-04-15 15:21:41,115 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 348 GetRequests, 293 SyntacticMatches, 0 SemanticMatches, 55 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 160 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1358, Invalid=1834, Unknown=0, NotChecked=0, Total=3192 [2022-04-15 15:21:41,115 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 350 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 332 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 629 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 332 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:21:41,115 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 420 Invalid, 629 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [332 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 15:21:41,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 957 states. [2022-04-15 15:21:44,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 957 to 935. [2022-04-15 15:21:44,865 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:21:44,866 INFO L82 GeneralOperation]: Start isEquivalent. First operand 957 states. Second operand has 935 states, 696 states have (on average 1.1738505747126438) internal successors, (817), 713 states have internal predecessors, (817), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:21:44,866 INFO L74 IsIncluded]: Start isIncluded. First operand 957 states. Second operand has 935 states, 696 states have (on average 1.1738505747126438) internal successors, (817), 713 states have internal predecessors, (817), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:21:44,867 INFO L87 Difference]: Start difference. First operand 957 states. Second operand has 935 states, 696 states have (on average 1.1738505747126438) internal successors, (817), 713 states have internal predecessors, (817), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:21:44,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:44,894 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-15 15:21:44,894 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-15 15:21:44,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:44,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:44,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 935 states, 696 states have (on average 1.1738505747126438) internal successors, (817), 713 states have internal predecessors, (817), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 957 states. [2022-04-15 15:21:44,896 INFO L87 Difference]: Start difference. First operand has 935 states, 696 states have (on average 1.1738505747126438) internal successors, (817), 713 states have internal predecessors, (817), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) Second operand 957 states. [2022-04-15 15:21:44,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:21:44,930 INFO L93 Difference]: Finished difference Result 957 states and 1271 transitions. [2022-04-15 15:21:44,930 INFO L276 IsEmpty]: Start isEmpty. Operand 957 states and 1271 transitions. [2022-04-15 15:21:44,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:21:44,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:21:44,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:21:44,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:21:44,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 935 states, 696 states have (on average 1.1738505747126438) internal successors, (817), 713 states have internal predecessors, (817), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 196 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:21:44,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 935 states to 935 states and 1245 transitions. [2022-04-15 15:21:44,974 INFO L78 Accepts]: Start accepts. Automaton has 935 states and 1245 transitions. Word has length 167 [2022-04-15 15:21:44,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:21:44,975 INFO L478 AbstractCegarLoop]: Abstraction has 935 states and 1245 transitions. [2022-04-15 15:21:44,975 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.454545454545454) internal successors, (120), 21 states have internal predecessors, (120), 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-15 15:21:44,975 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 935 states and 1245 transitions. [2022-04-15 15:21:56,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1245 edges. 1243 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:56,570 INFO L276 IsEmpty]: Start isEmpty. Operand 935 states and 1245 transitions. [2022-04-15 15:21:56,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 170 [2022-04-15 15:21:56,572 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:21:56,572 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 10, 10, 10, 10, 7, 6, 5, 5, 5, 4, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:21:56,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (59)] Forceful destruction successful, exit code 0 [2022-04-15 15:21:56,772 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 59 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable57 [2022-04-15 15:21:56,772 INFO L403 AbstractCegarLoop]: === Iteration 59 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:21:56,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:21:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 31 times [2022-04-15 15:21:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:56,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [741121015] [2022-04-15 15:21:56,773 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:21:56,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1993951238, now seen corresponding path program 32 times [2022-04-15 15:21:56,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:21:56,773 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1401430151] [2022-04-15 15:21:56,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:21:56,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:21:56,788 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:21:56,788 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [827942516] [2022-04-15 15:21:56,788 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-04-15 15:21:56,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:21:56,788 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:21:56,789 INFO L229 MonitoredProcess]: Starting monitored process 60 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:21:56,790 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Waiting until timeout for monitored process [2022-04-15 15:21:56,861 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-04-15 15:21:56,861 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:21:56,863 INFO L263 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 15:21:56,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:21:56,897 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:21:57,843 INFO L272 TraceCheckUtils]: 0: Hoare triple {191644#true} call ULTIMATE.init(); {191644#true} is VALID [2022-04-15 15:21:57,844 INFO L290 TraceCheckUtils]: 1: Hoare triple {191644#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; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,844 INFO L290 TraceCheckUtils]: 2: Hoare triple {191652#(<= ~counter~0 0)} assume true; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,844 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {191652#(<= ~counter~0 0)} {191644#true} #102#return; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,845 INFO L272 TraceCheckUtils]: 4: Hoare triple {191652#(<= ~counter~0 0)} call #t~ret9 := main(); {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,845 INFO L290 TraceCheckUtils]: 5: Hoare triple {191652#(<= ~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; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,845 INFO L272 TraceCheckUtils]: 6: Hoare triple {191652#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {191652#(<= ~counter~0 0)} ~cond := #in~cond; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,846 INFO L290 TraceCheckUtils]: 8: Hoare triple {191652#(<= ~counter~0 0)} assume !(0 == ~cond); {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,846 INFO L290 TraceCheckUtils]: 9: Hoare triple {191652#(<= ~counter~0 0)} assume true; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,847 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {191652#(<= ~counter~0 0)} {191652#(<= ~counter~0 0)} #90#return; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,847 INFO L272 TraceCheckUtils]: 11: Hoare triple {191652#(<= ~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)); {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,847 INFO L290 TraceCheckUtils]: 12: Hoare triple {191652#(<= ~counter~0 0)} ~cond := #in~cond; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,848 INFO L290 TraceCheckUtils]: 13: Hoare triple {191652#(<= ~counter~0 0)} assume !(0 == ~cond); {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,848 INFO L290 TraceCheckUtils]: 14: Hoare triple {191652#(<= ~counter~0 0)} assume true; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,848 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {191652#(<= ~counter~0 0)} {191652#(<= ~counter~0 0)} #92#return; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,848 INFO L290 TraceCheckUtils]: 16: Hoare triple {191652#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {191652#(<= ~counter~0 0)} is VALID [2022-04-15 15:21:57,852 INFO L290 TraceCheckUtils]: 17: Hoare triple {191652#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191701#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:57,852 INFO L290 TraceCheckUtils]: 18: Hoare triple {191701#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {191701#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:57,853 INFO L272 TraceCheckUtils]: 19: Hoare triple {191701#(<= ~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)); {191701#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:57,853 INFO L290 TraceCheckUtils]: 20: Hoare triple {191701#(<= ~counter~0 1)} ~cond := #in~cond; {191701#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:57,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {191701#(<= ~counter~0 1)} assume !(0 == ~cond); {191701#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:57,854 INFO L290 TraceCheckUtils]: 22: Hoare triple {191701#(<= ~counter~0 1)} assume true; {191701#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:57,854 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {191701#(<= ~counter~0 1)} {191701#(<= ~counter~0 1)} #94#return; {191701#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:57,855 INFO L290 TraceCheckUtils]: 24: Hoare triple {191701#(<= ~counter~0 1)} assume !!(0 != ~r~0); {191701#(<= ~counter~0 1)} is VALID [2022-04-15 15:21:57,856 INFO L290 TraceCheckUtils]: 25: Hoare triple {191701#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191726#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:57,856 INFO L290 TraceCheckUtils]: 26: Hoare triple {191726#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {191726#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:57,857 INFO L272 TraceCheckUtils]: 27: Hoare triple {191726#(<= ~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)); {191726#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:57,857 INFO L290 TraceCheckUtils]: 28: Hoare triple {191726#(<= ~counter~0 2)} ~cond := #in~cond; {191726#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:57,857 INFO L290 TraceCheckUtils]: 29: Hoare triple {191726#(<= ~counter~0 2)} assume !(0 == ~cond); {191726#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:57,858 INFO L290 TraceCheckUtils]: 30: Hoare triple {191726#(<= ~counter~0 2)} assume true; {191726#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:57,858 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {191726#(<= ~counter~0 2)} {191726#(<= ~counter~0 2)} #96#return; {191726#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:57,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {191726#(<= ~counter~0 2)} assume !(~r~0 > 0); {191726#(<= ~counter~0 2)} is VALID [2022-04-15 15:21:57,860 INFO L290 TraceCheckUtils]: 33: Hoare triple {191726#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191751#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:57,860 INFO L290 TraceCheckUtils]: 34: Hoare triple {191751#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {191751#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:57,861 INFO L272 TraceCheckUtils]: 35: Hoare triple {191751#(<= ~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)); {191751#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:57,861 INFO L290 TraceCheckUtils]: 36: Hoare triple {191751#(<= ~counter~0 3)} ~cond := #in~cond; {191751#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:57,861 INFO L290 TraceCheckUtils]: 37: Hoare triple {191751#(<= ~counter~0 3)} assume !(0 == ~cond); {191751#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:57,861 INFO L290 TraceCheckUtils]: 38: Hoare triple {191751#(<= ~counter~0 3)} assume true; {191751#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:57,862 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {191751#(<= ~counter~0 3)} {191751#(<= ~counter~0 3)} #98#return; {191751#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:57,862 INFO L290 TraceCheckUtils]: 40: Hoare triple {191751#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {191751#(<= ~counter~0 3)} is VALID [2022-04-15 15:21:57,864 INFO L290 TraceCheckUtils]: 41: Hoare triple {191751#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191776#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:57,864 INFO L290 TraceCheckUtils]: 42: Hoare triple {191776#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {191776#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:57,865 INFO L272 TraceCheckUtils]: 43: Hoare triple {191776#(<= ~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)); {191776#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:57,865 INFO L290 TraceCheckUtils]: 44: Hoare triple {191776#(<= ~counter~0 4)} ~cond := #in~cond; {191776#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:57,865 INFO L290 TraceCheckUtils]: 45: Hoare triple {191776#(<= ~counter~0 4)} assume !(0 == ~cond); {191776#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:57,865 INFO L290 TraceCheckUtils]: 46: Hoare triple {191776#(<= ~counter~0 4)} assume true; {191776#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:57,866 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {191776#(<= ~counter~0 4)} {191776#(<= ~counter~0 4)} #98#return; {191776#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:57,866 INFO L290 TraceCheckUtils]: 48: Hoare triple {191776#(<= ~counter~0 4)} assume !(~r~0 < 0); {191776#(<= ~counter~0 4)} is VALID [2022-04-15 15:21:57,868 INFO L290 TraceCheckUtils]: 49: Hoare triple {191776#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191801#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:57,868 INFO L290 TraceCheckUtils]: 50: Hoare triple {191801#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {191801#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:57,868 INFO L272 TraceCheckUtils]: 51: Hoare triple {191801#(<= ~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)); {191801#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:57,869 INFO L290 TraceCheckUtils]: 52: Hoare triple {191801#(<= ~counter~0 5)} ~cond := #in~cond; {191801#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:57,869 INFO L290 TraceCheckUtils]: 53: Hoare triple {191801#(<= ~counter~0 5)} assume !(0 == ~cond); {191801#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:57,869 INFO L290 TraceCheckUtils]: 54: Hoare triple {191801#(<= ~counter~0 5)} assume true; {191801#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:57,870 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {191801#(<= ~counter~0 5)} {191801#(<= ~counter~0 5)} #94#return; {191801#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:57,870 INFO L290 TraceCheckUtils]: 56: Hoare triple {191801#(<= ~counter~0 5)} assume !!(0 != ~r~0); {191801#(<= ~counter~0 5)} is VALID [2022-04-15 15:21:57,872 INFO L290 TraceCheckUtils]: 57: Hoare triple {191801#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191826#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:57,872 INFO L290 TraceCheckUtils]: 58: Hoare triple {191826#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {191826#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:57,872 INFO L272 TraceCheckUtils]: 59: Hoare triple {191826#(<= ~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)); {191826#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:57,873 INFO L290 TraceCheckUtils]: 60: Hoare triple {191826#(<= ~counter~0 6)} ~cond := #in~cond; {191826#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:57,873 INFO L290 TraceCheckUtils]: 61: Hoare triple {191826#(<= ~counter~0 6)} assume !(0 == ~cond); {191826#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:57,873 INFO L290 TraceCheckUtils]: 62: Hoare triple {191826#(<= ~counter~0 6)} assume true; {191826#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:57,874 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {191826#(<= ~counter~0 6)} {191826#(<= ~counter~0 6)} #96#return; {191826#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:57,874 INFO L290 TraceCheckUtils]: 64: Hoare triple {191826#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191826#(<= ~counter~0 6)} is VALID [2022-04-15 15:21:57,875 INFO L290 TraceCheckUtils]: 65: Hoare triple {191826#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191851#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:57,876 INFO L290 TraceCheckUtils]: 66: Hoare triple {191851#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {191851#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:57,876 INFO L272 TraceCheckUtils]: 67: Hoare triple {191851#(<= ~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)); {191851#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:57,876 INFO L290 TraceCheckUtils]: 68: Hoare triple {191851#(<= ~counter~0 7)} ~cond := #in~cond; {191851#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:57,877 INFO L290 TraceCheckUtils]: 69: Hoare triple {191851#(<= ~counter~0 7)} assume !(0 == ~cond); {191851#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:57,877 INFO L290 TraceCheckUtils]: 70: Hoare triple {191851#(<= ~counter~0 7)} assume true; {191851#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:57,877 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {191851#(<= ~counter~0 7)} {191851#(<= ~counter~0 7)} #96#return; {191851#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:57,878 INFO L290 TraceCheckUtils]: 72: Hoare triple {191851#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191851#(<= ~counter~0 7)} is VALID [2022-04-15 15:21:57,879 INFO L290 TraceCheckUtils]: 73: Hoare triple {191851#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191876#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:57,880 INFO L290 TraceCheckUtils]: 74: Hoare triple {191876#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {191876#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:57,880 INFO L272 TraceCheckUtils]: 75: Hoare triple {191876#(<= ~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)); {191876#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:57,880 INFO L290 TraceCheckUtils]: 76: Hoare triple {191876#(<= ~counter~0 8)} ~cond := #in~cond; {191876#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:57,881 INFO L290 TraceCheckUtils]: 77: Hoare triple {191876#(<= ~counter~0 8)} assume !(0 == ~cond); {191876#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:57,881 INFO L290 TraceCheckUtils]: 78: Hoare triple {191876#(<= ~counter~0 8)} assume true; {191876#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:57,881 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {191876#(<= ~counter~0 8)} {191876#(<= ~counter~0 8)} #96#return; {191876#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:57,882 INFO L290 TraceCheckUtils]: 80: Hoare triple {191876#(<= ~counter~0 8)} assume !(~r~0 > 0); {191876#(<= ~counter~0 8)} is VALID [2022-04-15 15:21:57,883 INFO L290 TraceCheckUtils]: 81: Hoare triple {191876#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191901#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:57,883 INFO L290 TraceCheckUtils]: 82: Hoare triple {191901#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {191901#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:57,884 INFO L272 TraceCheckUtils]: 83: Hoare triple {191901#(<= ~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)); {191901#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:57,884 INFO L290 TraceCheckUtils]: 84: Hoare triple {191901#(<= ~counter~0 9)} ~cond := #in~cond; {191901#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:57,884 INFO L290 TraceCheckUtils]: 85: Hoare triple {191901#(<= ~counter~0 9)} assume !(0 == ~cond); {191901#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:57,885 INFO L290 TraceCheckUtils]: 86: Hoare triple {191901#(<= ~counter~0 9)} assume true; {191901#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:57,885 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {191901#(<= ~counter~0 9)} {191901#(<= ~counter~0 9)} #98#return; {191901#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:57,885 INFO L290 TraceCheckUtils]: 88: Hoare triple {191901#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {191901#(<= ~counter~0 9)} is VALID [2022-04-15 15:21:57,887 INFO L290 TraceCheckUtils]: 89: Hoare triple {191901#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {191926#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:57,887 INFO L290 TraceCheckUtils]: 90: Hoare triple {191926#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {191926#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:57,888 INFO L272 TraceCheckUtils]: 91: Hoare triple {191926#(<= ~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)); {191926#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:57,888 INFO L290 TraceCheckUtils]: 92: Hoare triple {191926#(<= ~counter~0 10)} ~cond := #in~cond; {191926#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:57,888 INFO L290 TraceCheckUtils]: 93: Hoare triple {191926#(<= ~counter~0 10)} assume !(0 == ~cond); {191926#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:57,888 INFO L290 TraceCheckUtils]: 94: Hoare triple {191926#(<= ~counter~0 10)} assume true; {191926#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:57,889 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {191926#(<= ~counter~0 10)} {191926#(<= ~counter~0 10)} #98#return; {191926#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:57,889 INFO L290 TraceCheckUtils]: 96: Hoare triple {191926#(<= ~counter~0 10)} assume !(~r~0 < 0); {191926#(<= ~counter~0 10)} is VALID [2022-04-15 15:21:57,891 INFO L290 TraceCheckUtils]: 97: Hoare triple {191926#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191951#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:57,891 INFO L290 TraceCheckUtils]: 98: Hoare triple {191951#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {191951#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:57,891 INFO L272 TraceCheckUtils]: 99: Hoare triple {191951#(<= ~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)); {191951#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:57,892 INFO L290 TraceCheckUtils]: 100: Hoare triple {191951#(<= ~counter~0 11)} ~cond := #in~cond; {191951#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:57,892 INFO L290 TraceCheckUtils]: 101: Hoare triple {191951#(<= ~counter~0 11)} assume !(0 == ~cond); {191951#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:57,892 INFO L290 TraceCheckUtils]: 102: Hoare triple {191951#(<= ~counter~0 11)} assume true; {191951#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:57,893 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {191951#(<= ~counter~0 11)} {191951#(<= ~counter~0 11)} #94#return; {191951#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:57,893 INFO L290 TraceCheckUtils]: 104: Hoare triple {191951#(<= ~counter~0 11)} assume !!(0 != ~r~0); {191951#(<= ~counter~0 11)} is VALID [2022-04-15 15:21:57,894 INFO L290 TraceCheckUtils]: 105: Hoare triple {191951#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {191976#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:57,895 INFO L290 TraceCheckUtils]: 106: Hoare triple {191976#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {191976#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:57,895 INFO L272 TraceCheckUtils]: 107: Hoare triple {191976#(<= ~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)); {191976#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:57,896 INFO L290 TraceCheckUtils]: 108: Hoare triple {191976#(<= ~counter~0 12)} ~cond := #in~cond; {191976#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:57,896 INFO L290 TraceCheckUtils]: 109: Hoare triple {191976#(<= ~counter~0 12)} assume !(0 == ~cond); {191976#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:57,896 INFO L290 TraceCheckUtils]: 110: Hoare triple {191976#(<= ~counter~0 12)} assume true; {191976#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:57,897 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {191976#(<= ~counter~0 12)} {191976#(<= ~counter~0 12)} #96#return; {191976#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:57,897 INFO L290 TraceCheckUtils]: 112: Hoare triple {191976#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {191976#(<= ~counter~0 12)} is VALID [2022-04-15 15:21:57,898 INFO L290 TraceCheckUtils]: 113: Hoare triple {191976#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192001#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:57,899 INFO L290 TraceCheckUtils]: 114: Hoare triple {192001#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {192001#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:57,899 INFO L272 TraceCheckUtils]: 115: Hoare triple {192001#(<= ~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)); {192001#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:57,899 INFO L290 TraceCheckUtils]: 116: Hoare triple {192001#(<= ~counter~0 13)} ~cond := #in~cond; {192001#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:57,900 INFO L290 TraceCheckUtils]: 117: Hoare triple {192001#(<= ~counter~0 13)} assume !(0 == ~cond); {192001#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:57,900 INFO L290 TraceCheckUtils]: 118: Hoare triple {192001#(<= ~counter~0 13)} assume true; {192001#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:57,900 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {192001#(<= ~counter~0 13)} {192001#(<= ~counter~0 13)} #96#return; {192001#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:57,901 INFO L290 TraceCheckUtils]: 120: Hoare triple {192001#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192001#(<= ~counter~0 13)} is VALID [2022-04-15 15:21:57,902 INFO L290 TraceCheckUtils]: 121: Hoare triple {192001#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192026#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:57,902 INFO L290 TraceCheckUtils]: 122: Hoare triple {192026#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {192026#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:57,903 INFO L272 TraceCheckUtils]: 123: Hoare triple {192026#(<= ~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)); {192026#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:57,903 INFO L290 TraceCheckUtils]: 124: Hoare triple {192026#(<= ~counter~0 14)} ~cond := #in~cond; {192026#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:57,904 INFO L290 TraceCheckUtils]: 125: Hoare triple {192026#(<= ~counter~0 14)} assume !(0 == ~cond); {192026#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:57,904 INFO L290 TraceCheckUtils]: 126: Hoare triple {192026#(<= ~counter~0 14)} assume true; {192026#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:57,904 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {192026#(<= ~counter~0 14)} {192026#(<= ~counter~0 14)} #96#return; {192026#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:57,905 INFO L290 TraceCheckUtils]: 128: Hoare triple {192026#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192026#(<= ~counter~0 14)} is VALID [2022-04-15 15:21:57,906 INFO L290 TraceCheckUtils]: 129: Hoare triple {192026#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192051#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:57,906 INFO L290 TraceCheckUtils]: 130: Hoare triple {192051#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {192051#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:57,907 INFO L272 TraceCheckUtils]: 131: Hoare triple {192051#(<= ~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)); {192051#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:57,907 INFO L290 TraceCheckUtils]: 132: Hoare triple {192051#(<= ~counter~0 15)} ~cond := #in~cond; {192051#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:57,907 INFO L290 TraceCheckUtils]: 133: Hoare triple {192051#(<= ~counter~0 15)} assume !(0 == ~cond); {192051#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:57,908 INFO L290 TraceCheckUtils]: 134: Hoare triple {192051#(<= ~counter~0 15)} assume true; {192051#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:57,908 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {192051#(<= ~counter~0 15)} {192051#(<= ~counter~0 15)} #96#return; {192051#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:57,908 INFO L290 TraceCheckUtils]: 136: Hoare triple {192051#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192051#(<= ~counter~0 15)} is VALID [2022-04-15 15:21:57,910 INFO L290 TraceCheckUtils]: 137: Hoare triple {192051#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192076#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:57,910 INFO L290 TraceCheckUtils]: 138: Hoare triple {192076#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {192076#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:57,911 INFO L272 TraceCheckUtils]: 139: Hoare triple {192076#(<= ~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)); {192076#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:57,911 INFO L290 TraceCheckUtils]: 140: Hoare triple {192076#(<= ~counter~0 16)} ~cond := #in~cond; {192076#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:57,911 INFO L290 TraceCheckUtils]: 141: Hoare triple {192076#(<= ~counter~0 16)} assume !(0 == ~cond); {192076#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:57,912 INFO L290 TraceCheckUtils]: 142: Hoare triple {192076#(<= ~counter~0 16)} assume true; {192076#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:57,912 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {192076#(<= ~counter~0 16)} {192076#(<= ~counter~0 16)} #96#return; {192076#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:57,912 INFO L290 TraceCheckUtils]: 144: Hoare triple {192076#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192076#(<= ~counter~0 16)} is VALID [2022-04-15 15:21:57,914 INFO L290 TraceCheckUtils]: 145: Hoare triple {192076#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192101#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:57,914 INFO L290 TraceCheckUtils]: 146: Hoare triple {192101#(<= ~counter~0 17)} assume !!(#t~post7 < 100);havoc #t~post7; {192101#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:57,915 INFO L272 TraceCheckUtils]: 147: Hoare triple {192101#(<= ~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)); {192101#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:57,915 INFO L290 TraceCheckUtils]: 148: Hoare triple {192101#(<= ~counter~0 17)} ~cond := #in~cond; {192101#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:57,915 INFO L290 TraceCheckUtils]: 149: Hoare triple {192101#(<= ~counter~0 17)} assume !(0 == ~cond); {192101#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:57,915 INFO L290 TraceCheckUtils]: 150: Hoare triple {192101#(<= ~counter~0 17)} assume true; {192101#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:57,916 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {192101#(<= ~counter~0 17)} {192101#(<= ~counter~0 17)} #96#return; {192101#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:57,916 INFO L290 TraceCheckUtils]: 152: Hoare triple {192101#(<= ~counter~0 17)} assume !(~r~0 > 0); {192101#(<= ~counter~0 17)} is VALID [2022-04-15 15:21:57,918 INFO L290 TraceCheckUtils]: 153: Hoare triple {192101#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192126#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:57,918 INFO L290 TraceCheckUtils]: 154: Hoare triple {192126#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {192126#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:57,918 INFO L272 TraceCheckUtils]: 155: Hoare triple {192126#(<= ~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)); {192126#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:57,919 INFO L290 TraceCheckUtils]: 156: Hoare triple {192126#(<= ~counter~0 18)} ~cond := #in~cond; {192126#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:57,919 INFO L290 TraceCheckUtils]: 157: Hoare triple {192126#(<= ~counter~0 18)} assume !(0 == ~cond); {192126#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:57,919 INFO L290 TraceCheckUtils]: 158: Hoare triple {192126#(<= ~counter~0 18)} assume true; {192126#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:57,920 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {192126#(<= ~counter~0 18)} {192126#(<= ~counter~0 18)} #98#return; {192126#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:57,920 INFO L290 TraceCheckUtils]: 160: Hoare triple {192126#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {192126#(<= ~counter~0 18)} is VALID [2022-04-15 15:21:57,920 INFO L290 TraceCheckUtils]: 161: Hoare triple {192126#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192151#(<= |main_#t~post8| 18)} is VALID [2022-04-15 15:21:57,921 INFO L290 TraceCheckUtils]: 162: Hoare triple {192151#(<= |main_#t~post8| 18)} assume !(#t~post8 < 100);havoc #t~post8; {191645#false} is VALID [2022-04-15 15:21:57,921 INFO L290 TraceCheckUtils]: 163: Hoare triple {191645#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191645#false} is VALID [2022-04-15 15:21:57,921 INFO L290 TraceCheckUtils]: 164: Hoare triple {191645#false} assume !(#t~post6 < 100);havoc #t~post6; {191645#false} is VALID [2022-04-15 15:21:57,921 INFO L272 TraceCheckUtils]: 165: Hoare triple {191645#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)); {191645#false} is VALID [2022-04-15 15:21:57,921 INFO L290 TraceCheckUtils]: 166: Hoare triple {191645#false} ~cond := #in~cond; {191645#false} is VALID [2022-04-15 15:21:57,921 INFO L290 TraceCheckUtils]: 167: Hoare triple {191645#false} assume 0 == ~cond; {191645#false} is VALID [2022-04-15 15:21:57,921 INFO L290 TraceCheckUtils]: 168: Hoare triple {191645#false} assume !false; {191645#false} is VALID [2022-04-15 15:21:57,921 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 42 proven. 854 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:21:57,922 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:21:59,058 INFO L290 TraceCheckUtils]: 168: Hoare triple {191645#false} assume !false; {191645#false} is VALID [2022-04-15 15:21:59,058 INFO L290 TraceCheckUtils]: 167: Hoare triple {191645#false} assume 0 == ~cond; {191645#false} is VALID [2022-04-15 15:21:59,058 INFO L290 TraceCheckUtils]: 166: Hoare triple {191645#false} ~cond := #in~cond; {191645#false} is VALID [2022-04-15 15:21:59,059 INFO L272 TraceCheckUtils]: 165: Hoare triple {191645#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)); {191645#false} is VALID [2022-04-15 15:21:59,059 INFO L290 TraceCheckUtils]: 164: Hoare triple {191645#false} assume !(#t~post6 < 100);havoc #t~post6; {191645#false} is VALID [2022-04-15 15:21:59,059 INFO L290 TraceCheckUtils]: 163: Hoare triple {191645#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {191645#false} is VALID [2022-04-15 15:21:59,059 INFO L290 TraceCheckUtils]: 162: Hoare triple {192191#(< |main_#t~post8| 100)} assume !(#t~post8 < 100);havoc #t~post8; {191645#false} is VALID [2022-04-15 15:21:59,059 INFO L290 TraceCheckUtils]: 161: Hoare triple {192195#(< ~counter~0 100)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192191#(< |main_#t~post8| 100)} is VALID [2022-04-15 15:21:59,060 INFO L290 TraceCheckUtils]: 160: Hoare triple {192195#(< ~counter~0 100)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {192195#(< ~counter~0 100)} is VALID [2022-04-15 15:21:59,060 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {191644#true} {192195#(< ~counter~0 100)} #98#return; {192195#(< ~counter~0 100)} is VALID [2022-04-15 15:21:59,060 INFO L290 TraceCheckUtils]: 158: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,060 INFO L290 TraceCheckUtils]: 157: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,060 INFO L290 TraceCheckUtils]: 156: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,060 INFO L272 TraceCheckUtils]: 155: Hoare triple {192195#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,061 INFO L290 TraceCheckUtils]: 154: Hoare triple {192195#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {192195#(< ~counter~0 100)} is VALID [2022-04-15 15:21:59,064 INFO L290 TraceCheckUtils]: 153: Hoare triple {192220#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192195#(< ~counter~0 100)} is VALID [2022-04-15 15:21:59,065 INFO L290 TraceCheckUtils]: 152: Hoare triple {192220#(< ~counter~0 99)} assume !(~r~0 > 0); {192220#(< ~counter~0 99)} is VALID [2022-04-15 15:21:59,065 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {191644#true} {192220#(< ~counter~0 99)} #96#return; {192220#(< ~counter~0 99)} is VALID [2022-04-15 15:21:59,065 INFO L290 TraceCheckUtils]: 150: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,065 INFO L290 TraceCheckUtils]: 149: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,065 INFO L290 TraceCheckUtils]: 148: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,065 INFO L272 TraceCheckUtils]: 147: Hoare triple {192220#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,066 INFO L290 TraceCheckUtils]: 146: Hoare triple {192220#(< ~counter~0 99)} assume !!(#t~post7 < 100);havoc #t~post7; {192220#(< ~counter~0 99)} is VALID [2022-04-15 15:21:59,067 INFO L290 TraceCheckUtils]: 145: Hoare triple {192245#(< ~counter~0 98)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192220#(< ~counter~0 99)} is VALID [2022-04-15 15:21:59,067 INFO L290 TraceCheckUtils]: 144: Hoare triple {192245#(< ~counter~0 98)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192245#(< ~counter~0 98)} is VALID [2022-04-15 15:21:59,068 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {191644#true} {192245#(< ~counter~0 98)} #96#return; {192245#(< ~counter~0 98)} is VALID [2022-04-15 15:21:59,068 INFO L290 TraceCheckUtils]: 142: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,068 INFO L290 TraceCheckUtils]: 141: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,068 INFO L290 TraceCheckUtils]: 140: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,068 INFO L272 TraceCheckUtils]: 139: Hoare triple {192245#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,068 INFO L290 TraceCheckUtils]: 138: Hoare triple {192245#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {192245#(< ~counter~0 98)} is VALID [2022-04-15 15:21:59,070 INFO L290 TraceCheckUtils]: 137: Hoare triple {192270#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192245#(< ~counter~0 98)} is VALID [2022-04-15 15:21:59,070 INFO L290 TraceCheckUtils]: 136: Hoare triple {192270#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192270#(< ~counter~0 97)} is VALID [2022-04-15 15:21:59,071 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {191644#true} {192270#(< ~counter~0 97)} #96#return; {192270#(< ~counter~0 97)} is VALID [2022-04-15 15:21:59,071 INFO L290 TraceCheckUtils]: 134: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,071 INFO L290 TraceCheckUtils]: 133: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,071 INFO L290 TraceCheckUtils]: 132: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,071 INFO L272 TraceCheckUtils]: 131: Hoare triple {192270#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,071 INFO L290 TraceCheckUtils]: 130: Hoare triple {192270#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {192270#(< ~counter~0 97)} is VALID [2022-04-15 15:21:59,073 INFO L290 TraceCheckUtils]: 129: Hoare triple {192295#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192270#(< ~counter~0 97)} is VALID [2022-04-15 15:21:59,073 INFO L290 TraceCheckUtils]: 128: Hoare triple {192295#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192295#(< ~counter~0 96)} is VALID [2022-04-15 15:21:59,073 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {191644#true} {192295#(< ~counter~0 96)} #96#return; {192295#(< ~counter~0 96)} is VALID [2022-04-15 15:21:59,074 INFO L290 TraceCheckUtils]: 126: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,074 INFO L290 TraceCheckUtils]: 125: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,074 INFO L290 TraceCheckUtils]: 124: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,074 INFO L272 TraceCheckUtils]: 123: Hoare triple {192295#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,074 INFO L290 TraceCheckUtils]: 122: Hoare triple {192295#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {192295#(< ~counter~0 96)} is VALID [2022-04-15 15:21:59,075 INFO L290 TraceCheckUtils]: 121: Hoare triple {192320#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192295#(< ~counter~0 96)} is VALID [2022-04-15 15:21:59,076 INFO L290 TraceCheckUtils]: 120: Hoare triple {192320#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192320#(< ~counter~0 95)} is VALID [2022-04-15 15:21:59,076 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {191644#true} {192320#(< ~counter~0 95)} #96#return; {192320#(< ~counter~0 95)} is VALID [2022-04-15 15:21:59,076 INFO L290 TraceCheckUtils]: 118: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,076 INFO L290 TraceCheckUtils]: 117: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,076 INFO L290 TraceCheckUtils]: 116: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,076 INFO L272 TraceCheckUtils]: 115: Hoare triple {192320#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,077 INFO L290 TraceCheckUtils]: 114: Hoare triple {192320#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {192320#(< ~counter~0 95)} is VALID [2022-04-15 15:21:59,078 INFO L290 TraceCheckUtils]: 113: Hoare triple {192345#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192320#(< ~counter~0 95)} is VALID [2022-04-15 15:21:59,078 INFO L290 TraceCheckUtils]: 112: Hoare triple {192345#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192345#(< ~counter~0 94)} is VALID [2022-04-15 15:21:59,079 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {191644#true} {192345#(< ~counter~0 94)} #96#return; {192345#(< ~counter~0 94)} is VALID [2022-04-15 15:21:59,079 INFO L290 TraceCheckUtils]: 110: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,079 INFO L290 TraceCheckUtils]: 109: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,079 INFO L290 TraceCheckUtils]: 108: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,079 INFO L272 TraceCheckUtils]: 107: Hoare triple {192345#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,079 INFO L290 TraceCheckUtils]: 106: Hoare triple {192345#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {192345#(< ~counter~0 94)} is VALID [2022-04-15 15:21:59,081 INFO L290 TraceCheckUtils]: 105: Hoare triple {192370#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192345#(< ~counter~0 94)} is VALID [2022-04-15 15:21:59,081 INFO L290 TraceCheckUtils]: 104: Hoare triple {192370#(< ~counter~0 93)} assume !!(0 != ~r~0); {192370#(< ~counter~0 93)} is VALID [2022-04-15 15:21:59,082 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {191644#true} {192370#(< ~counter~0 93)} #94#return; {192370#(< ~counter~0 93)} is VALID [2022-04-15 15:21:59,082 INFO L290 TraceCheckUtils]: 102: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,082 INFO L290 TraceCheckUtils]: 101: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,082 INFO L290 TraceCheckUtils]: 100: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,082 INFO L272 TraceCheckUtils]: 99: Hoare triple {192370#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,082 INFO L290 TraceCheckUtils]: 98: Hoare triple {192370#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {192370#(< ~counter~0 93)} is VALID [2022-04-15 15:21:59,084 INFO L290 TraceCheckUtils]: 97: Hoare triple {192395#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {192370#(< ~counter~0 93)} is VALID [2022-04-15 15:21:59,084 INFO L290 TraceCheckUtils]: 96: Hoare triple {192395#(< ~counter~0 92)} assume !(~r~0 < 0); {192395#(< ~counter~0 92)} is VALID [2022-04-15 15:21:59,085 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {191644#true} {192395#(< ~counter~0 92)} #98#return; {192395#(< ~counter~0 92)} is VALID [2022-04-15 15:21:59,085 INFO L290 TraceCheckUtils]: 94: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,085 INFO L290 TraceCheckUtils]: 93: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,085 INFO L290 TraceCheckUtils]: 92: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,085 INFO L272 TraceCheckUtils]: 91: Hoare triple {192395#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,085 INFO L290 TraceCheckUtils]: 90: Hoare triple {192395#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {192395#(< ~counter~0 92)} is VALID [2022-04-15 15:21:59,087 INFO L290 TraceCheckUtils]: 89: Hoare triple {192420#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192395#(< ~counter~0 92)} is VALID [2022-04-15 15:21:59,087 INFO L290 TraceCheckUtils]: 88: Hoare triple {192420#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {192420#(< ~counter~0 91)} is VALID [2022-04-15 15:21:59,087 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {191644#true} {192420#(< ~counter~0 91)} #98#return; {192420#(< ~counter~0 91)} is VALID [2022-04-15 15:21:59,087 INFO L290 TraceCheckUtils]: 86: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,087 INFO L290 TraceCheckUtils]: 85: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,088 INFO L290 TraceCheckUtils]: 84: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,088 INFO L272 TraceCheckUtils]: 83: Hoare triple {192420#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,088 INFO L290 TraceCheckUtils]: 82: Hoare triple {192420#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {192420#(< ~counter~0 91)} is VALID [2022-04-15 15:21:59,089 INFO L290 TraceCheckUtils]: 81: Hoare triple {192445#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192420#(< ~counter~0 91)} is VALID [2022-04-15 15:21:59,090 INFO L290 TraceCheckUtils]: 80: Hoare triple {192445#(< ~counter~0 90)} assume !(~r~0 > 0); {192445#(< ~counter~0 90)} is VALID [2022-04-15 15:21:59,090 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {191644#true} {192445#(< ~counter~0 90)} #96#return; {192445#(< ~counter~0 90)} is VALID [2022-04-15 15:21:59,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,090 INFO L290 TraceCheckUtils]: 77: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,090 INFO L290 TraceCheckUtils]: 76: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,090 INFO L272 TraceCheckUtils]: 75: Hoare triple {192445#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,091 INFO L290 TraceCheckUtils]: 74: Hoare triple {192445#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {192445#(< ~counter~0 90)} is VALID [2022-04-15 15:21:59,092 INFO L290 TraceCheckUtils]: 73: Hoare triple {192470#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192445#(< ~counter~0 90)} is VALID [2022-04-15 15:21:59,092 INFO L290 TraceCheckUtils]: 72: Hoare triple {192470#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192470#(< ~counter~0 89)} is VALID [2022-04-15 15:21:59,093 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {191644#true} {192470#(< ~counter~0 89)} #96#return; {192470#(< ~counter~0 89)} is VALID [2022-04-15 15:21:59,093 INFO L290 TraceCheckUtils]: 70: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,093 INFO L290 TraceCheckUtils]: 69: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,093 INFO L290 TraceCheckUtils]: 68: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,093 INFO L272 TraceCheckUtils]: 67: Hoare triple {192470#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,093 INFO L290 TraceCheckUtils]: 66: Hoare triple {192470#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {192470#(< ~counter~0 89)} is VALID [2022-04-15 15:21:59,095 INFO L290 TraceCheckUtils]: 65: Hoare triple {192495#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192470#(< ~counter~0 89)} is VALID [2022-04-15 15:21:59,095 INFO L290 TraceCheckUtils]: 64: Hoare triple {192495#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {192495#(< ~counter~0 88)} is VALID [2022-04-15 15:21:59,096 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {191644#true} {192495#(< ~counter~0 88)} #96#return; {192495#(< ~counter~0 88)} is VALID [2022-04-15 15:21:59,096 INFO L290 TraceCheckUtils]: 62: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,096 INFO L290 TraceCheckUtils]: 61: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,096 INFO L290 TraceCheckUtils]: 60: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,096 INFO L272 TraceCheckUtils]: 59: Hoare triple {192495#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,096 INFO L290 TraceCheckUtils]: 58: Hoare triple {192495#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {192495#(< ~counter~0 88)} is VALID [2022-04-15 15:21:59,098 INFO L290 TraceCheckUtils]: 57: Hoare triple {192520#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192495#(< ~counter~0 88)} is VALID [2022-04-15 15:21:59,098 INFO L290 TraceCheckUtils]: 56: Hoare triple {192520#(< ~counter~0 87)} assume !!(0 != ~r~0); {192520#(< ~counter~0 87)} is VALID [2022-04-15 15:21:59,098 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {191644#true} {192520#(< ~counter~0 87)} #94#return; {192520#(< ~counter~0 87)} is VALID [2022-04-15 15:21:59,098 INFO L290 TraceCheckUtils]: 54: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,099 INFO L290 TraceCheckUtils]: 53: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,099 INFO L290 TraceCheckUtils]: 52: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,099 INFO L272 TraceCheckUtils]: 51: Hoare triple {192520#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,099 INFO L290 TraceCheckUtils]: 50: Hoare triple {192520#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {192520#(< ~counter~0 87)} is VALID [2022-04-15 15:21:59,100 INFO L290 TraceCheckUtils]: 49: Hoare triple {192545#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {192520#(< ~counter~0 87)} is VALID [2022-04-15 15:21:59,101 INFO L290 TraceCheckUtils]: 48: Hoare triple {192545#(< ~counter~0 86)} assume !(~r~0 < 0); {192545#(< ~counter~0 86)} is VALID [2022-04-15 15:21:59,101 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {191644#true} {192545#(< ~counter~0 86)} #98#return; {192545#(< ~counter~0 86)} is VALID [2022-04-15 15:21:59,101 INFO L290 TraceCheckUtils]: 46: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,101 INFO L290 TraceCheckUtils]: 45: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,101 INFO L290 TraceCheckUtils]: 44: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,102 INFO L272 TraceCheckUtils]: 43: Hoare triple {192545#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,102 INFO L290 TraceCheckUtils]: 42: Hoare triple {192545#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {192545#(< ~counter~0 86)} is VALID [2022-04-15 15:21:59,103 INFO L290 TraceCheckUtils]: 41: Hoare triple {192570#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192545#(< ~counter~0 86)} is VALID [2022-04-15 15:21:59,103 INFO L290 TraceCheckUtils]: 40: Hoare triple {192570#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {192570#(< ~counter~0 85)} is VALID [2022-04-15 15:21:59,104 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {191644#true} {192570#(< ~counter~0 85)} #98#return; {192570#(< ~counter~0 85)} is VALID [2022-04-15 15:21:59,104 INFO L290 TraceCheckUtils]: 38: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,104 INFO L290 TraceCheckUtils]: 37: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,104 INFO L290 TraceCheckUtils]: 36: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,104 INFO L272 TraceCheckUtils]: 35: Hoare triple {192570#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {192570#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {192570#(< ~counter~0 85)} is VALID [2022-04-15 15:21:59,106 INFO L290 TraceCheckUtils]: 33: Hoare triple {192595#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {192570#(< ~counter~0 85)} is VALID [2022-04-15 15:21:59,106 INFO L290 TraceCheckUtils]: 32: Hoare triple {192595#(< ~counter~0 84)} assume !(~r~0 > 0); {192595#(< ~counter~0 84)} is VALID [2022-04-15 15:21:59,107 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {191644#true} {192595#(< ~counter~0 84)} #96#return; {192595#(< ~counter~0 84)} is VALID [2022-04-15 15:21:59,107 INFO L290 TraceCheckUtils]: 30: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,107 INFO L290 TraceCheckUtils]: 29: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,107 INFO L290 TraceCheckUtils]: 28: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,107 INFO L272 TraceCheckUtils]: 27: Hoare triple {192595#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,107 INFO L290 TraceCheckUtils]: 26: Hoare triple {192595#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {192595#(< ~counter~0 84)} is VALID [2022-04-15 15:21:59,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {192620#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {192595#(< ~counter~0 84)} is VALID [2022-04-15 15:21:59,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {192620#(< ~counter~0 83)} assume !!(0 != ~r~0); {192620#(< ~counter~0 83)} is VALID [2022-04-15 15:21:59,110 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {191644#true} {192620#(< ~counter~0 83)} #94#return; {192620#(< ~counter~0 83)} is VALID [2022-04-15 15:21:59,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,110 INFO L272 TraceCheckUtils]: 19: Hoare triple {192620#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,110 INFO L290 TraceCheckUtils]: 18: Hoare triple {192620#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {192620#(< ~counter~0 83)} is VALID [2022-04-15 15:21:59,111 INFO L290 TraceCheckUtils]: 17: Hoare triple {192645#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {192620#(< ~counter~0 83)} is VALID [2022-04-15 15:21:59,112 INFO L290 TraceCheckUtils]: 16: Hoare triple {192645#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {192645#(< ~counter~0 82)} is VALID [2022-04-15 15:21:59,112 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {191644#true} {192645#(< ~counter~0 82)} #92#return; {192645#(< ~counter~0 82)} is VALID [2022-04-15 15:21:59,112 INFO L290 TraceCheckUtils]: 14: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,112 INFO L290 TraceCheckUtils]: 13: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,112 INFO L290 TraceCheckUtils]: 12: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,112 INFO L272 TraceCheckUtils]: 11: Hoare triple {192645#(< ~counter~0 82)} 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)); {191644#true} is VALID [2022-04-15 15:21:59,113 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {191644#true} {192645#(< ~counter~0 82)} #90#return; {192645#(< ~counter~0 82)} is VALID [2022-04-15 15:21:59,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {191644#true} assume true; {191644#true} is VALID [2022-04-15 15:21:59,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {191644#true} assume !(0 == ~cond); {191644#true} is VALID [2022-04-15 15:21:59,113 INFO L290 TraceCheckUtils]: 7: Hoare triple {191644#true} ~cond := #in~cond; {191644#true} is VALID [2022-04-15 15:21:59,113 INFO L272 TraceCheckUtils]: 6: Hoare triple {192645#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {191644#true} is VALID [2022-04-15 15:21:59,113 INFO L290 TraceCheckUtils]: 5: Hoare triple {192645#(< ~counter~0 82)} 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; {192645#(< ~counter~0 82)} is VALID [2022-04-15 15:21:59,114 INFO L272 TraceCheckUtils]: 4: Hoare triple {192645#(< ~counter~0 82)} call #t~ret9 := main(); {192645#(< ~counter~0 82)} is VALID [2022-04-15 15:21:59,114 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {192645#(< ~counter~0 82)} {191644#true} #102#return; {192645#(< ~counter~0 82)} is VALID [2022-04-15 15:21:59,114 INFO L290 TraceCheckUtils]: 2: Hoare triple {192645#(< ~counter~0 82)} assume true; {192645#(< ~counter~0 82)} is VALID [2022-04-15 15:21:59,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {191644#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; {192645#(< ~counter~0 82)} is VALID [2022-04-15 15:21:59,115 INFO L272 TraceCheckUtils]: 0: Hoare triple {191644#true} call ULTIMATE.init(); {191644#true} is VALID [2022-04-15 15:21:59,115 INFO L134 CoverageAnalysis]: Checked inductivity of 900 backedges. 42 proven. 242 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-15 15:21:59,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:21:59,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1401430151] [2022-04-15 15:21:59,115 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:21:59,115 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827942516] [2022-04-15 15:21:59,115 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827942516] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:21:59,116 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:21:59,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-15 15:21:59,116 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:21:59,116 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [741121015] [2022-04-15 15:21:59,116 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [741121015] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:21:59,116 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:21:59,116 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 15:21:59,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185925145] [2022-04-15 15:21:59,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:21:59,117 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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 169 [2022-04-15 15:21:59,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:21:59,117 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-15 15:21:59,346 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 166 edges. 166 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:21:59,346 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 15:21:59,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:21:59,346 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 15:21:59,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 15:21:59,347 INFO L87 Difference]: Start difference. First operand 935 states and 1245 transitions. Second operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-15 15:22:06,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:06,056 INFO L93 Difference]: Finished difference Result 1139 states and 1547 transitions. [2022-04-15 15:22:06,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2022-04-15 15:22:06,056 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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 169 [2022-04-15 15:22:06,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:22:06,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-15 15:22:06,060 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-15 15:22:06,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-15 15:22:06,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 396 transitions. [2022-04-15 15:22:06,064 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 38 states and 396 transitions. [2022-04-15 15:22:06,650 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:06,697 INFO L225 Difference]: With dead ends: 1139 [2022-04-15 15:22:06,697 INFO L226 Difference]: Without dead ends: 961 [2022-04-15 15:22:06,698 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 353 GetRequests, 297 SyntacticMatches, 0 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 175 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1409, Invalid=1897, Unknown=0, NotChecked=0, Total=3306 [2022-04-15 15:22:06,698 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 345 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 267 mSolverCounterSat, 317 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 584 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 317 IncrementalHoareTripleChecker+Valid, 267 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 15:22:06,698 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 386 Invalid, 584 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [317 Valid, 267 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 15:22:06,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 961 states. [2022-04-15 15:22:10,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 961 to 950. [2022-04-15 15:22:10,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:22:10,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 961 states. Second operand has 950 states, 711 states have (on average 1.1744022503516174) internal successors, (835), 723 states have internal predecessors, (835), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:22:10,583 INFO L74 IsIncluded]: Start isIncluded. First operand 961 states. Second operand has 950 states, 711 states have (on average 1.1744022503516174) internal successors, (835), 723 states have internal predecessors, (835), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:22:10,584 INFO L87 Difference]: Start difference. First operand 961 states. Second operand has 950 states, 711 states have (on average 1.1744022503516174) internal successors, (835), 723 states have internal predecessors, (835), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:22:10,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:10,611 INFO L93 Difference]: Finished difference Result 961 states and 1274 transitions. [2022-04-15 15:22:10,611 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1274 transitions. [2022-04-15 15:22:10,611 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:10,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:10,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 950 states, 711 states have (on average 1.1744022503516174) internal successors, (835), 723 states have internal predecessors, (835), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) Second operand 961 states. [2022-04-15 15:22:10,613 INFO L87 Difference]: Start difference. First operand has 950 states, 711 states have (on average 1.1744022503516174) internal successors, (835), 723 states have internal predecessors, (835), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) Second operand 961 states. [2022-04-15 15:22:10,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:10,642 INFO L93 Difference]: Finished difference Result 961 states and 1274 transitions. [2022-04-15 15:22:10,642 INFO L276 IsEmpty]: Start isEmpty. Operand 961 states and 1274 transitions. [2022-04-15 15:22:10,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:10,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:10,643 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:22:10,643 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:22:10,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 950 states, 711 states have (on average 1.1744022503516174) internal successors, (835), 723 states have internal predecessors, (835), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 201 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:22:10,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 950 states to 950 states and 1263 transitions. [2022-04-15 15:22:10,682 INFO L78 Accepts]: Start accepts. Automaton has 950 states and 1263 transitions. Word has length 169 [2022-04-15 15:22:10,683 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:22:10,683 INFO L478 AbstractCegarLoop]: Abstraction has 950 states and 1263 transitions. [2022-04-15 15:22:10,683 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.545454545454546) internal successors, (122), 21 states have internal predecessors, (122), 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-15 15:22:10,683 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 950 states and 1263 transitions. [2022-04-15 15:22:19,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1263 edges. 1262 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:19,478 INFO L276 IsEmpty]: Start isEmpty. Operand 950 states and 1263 transitions. [2022-04-15 15:22:19,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 172 [2022-04-15 15:22:19,480 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:22:19,480 INFO L499 BasicCegarLoop]: trace histogram [19, 18, 18, 9, 8, 8, 8, 7, 6, 6, 6, 5, 5, 4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-04-15 15:22:19,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (60)] Forceful destruction successful, exit code 0 [2022-04-15 15:22:19,680 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 60 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable58 [2022-04-15 15:22:19,680 INFO L403 AbstractCegarLoop]: === Iteration 60 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:22:19,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:22:19,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 27 times [2022-04-15 15:22:19,680 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:19,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1985043852] [2022-04-15 15:22:19,681 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:22:19,681 INFO L85 PathProgramCache]: Analyzing trace with hash -1121656631, now seen corresponding path program 28 times [2022-04-15 15:22:19,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:22:19,681 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [598778767] [2022-04-15 15:22:19,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:22:19,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:22:19,695 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:22:19,695 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [91529644] [2022-04-15 15:22:19,695 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:22:19,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:22:19,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:22:19,696 INFO L229 MonitoredProcess]: Starting monitored process 61 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:22:19,699 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Waiting until timeout for monitored process [2022-04-15 15:22:19,829 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:22:19,830 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:22:19,831 INFO L263 TraceCheckSpWp]: Trace formula consists of 405 conjuncts, 41 conjunts are in the unsatisfiable core [2022-04-15 15:22:19,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:22:19,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:22:20,739 INFO L272 TraceCheckUtils]: 0: Hoare triple {198831#true} call ULTIMATE.init(); {198831#true} is VALID [2022-04-15 15:22:20,740 INFO L290 TraceCheckUtils]: 1: Hoare triple {198831#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; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,740 INFO L290 TraceCheckUtils]: 2: Hoare triple {198839#(<= ~counter~0 0)} assume true; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,740 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {198839#(<= ~counter~0 0)} {198831#true} #102#return; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,741 INFO L272 TraceCheckUtils]: 4: Hoare triple {198839#(<= ~counter~0 0)} call #t~ret9 := main(); {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {198839#(<= ~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; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,741 INFO L272 TraceCheckUtils]: 6: Hoare triple {198839#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {198839#(<= ~counter~0 0)} ~cond := #in~cond; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {198839#(<= ~counter~0 0)} assume !(0 == ~cond); {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {198839#(<= ~counter~0 0)} assume true; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,742 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {198839#(<= ~counter~0 0)} {198839#(<= ~counter~0 0)} #90#return; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,743 INFO L272 TraceCheckUtils]: 11: Hoare triple {198839#(<= ~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)); {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,743 INFO L290 TraceCheckUtils]: 12: Hoare triple {198839#(<= ~counter~0 0)} ~cond := #in~cond; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,743 INFO L290 TraceCheckUtils]: 13: Hoare triple {198839#(<= ~counter~0 0)} assume !(0 == ~cond); {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,744 INFO L290 TraceCheckUtils]: 14: Hoare triple {198839#(<= ~counter~0 0)} assume true; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,744 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {198839#(<= ~counter~0 0)} {198839#(<= ~counter~0 0)} #92#return; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,744 INFO L290 TraceCheckUtils]: 16: Hoare triple {198839#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {198839#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:20,748 INFO L290 TraceCheckUtils]: 17: Hoare triple {198839#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198888#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:20,748 INFO L290 TraceCheckUtils]: 18: Hoare triple {198888#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {198888#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:20,749 INFO L272 TraceCheckUtils]: 19: Hoare triple {198888#(<= ~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)); {198888#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:20,749 INFO L290 TraceCheckUtils]: 20: Hoare triple {198888#(<= ~counter~0 1)} ~cond := #in~cond; {198888#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:20,749 INFO L290 TraceCheckUtils]: 21: Hoare triple {198888#(<= ~counter~0 1)} assume !(0 == ~cond); {198888#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:20,750 INFO L290 TraceCheckUtils]: 22: Hoare triple {198888#(<= ~counter~0 1)} assume true; {198888#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:20,750 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {198888#(<= ~counter~0 1)} {198888#(<= ~counter~0 1)} #94#return; {198888#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:20,750 INFO L290 TraceCheckUtils]: 24: Hoare triple {198888#(<= ~counter~0 1)} assume !!(0 != ~r~0); {198888#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:20,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {198888#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {198913#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:20,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {198913#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {198913#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:20,753 INFO L272 TraceCheckUtils]: 27: Hoare triple {198913#(<= ~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)); {198913#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:20,753 INFO L290 TraceCheckUtils]: 28: Hoare triple {198913#(<= ~counter~0 2)} ~cond := #in~cond; {198913#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:20,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {198913#(<= ~counter~0 2)} assume !(0 == ~cond); {198913#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:20,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {198913#(<= ~counter~0 2)} assume true; {198913#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:20,754 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {198913#(<= ~counter~0 2)} {198913#(<= ~counter~0 2)} #96#return; {198913#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:20,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {198913#(<= ~counter~0 2)} assume !(~r~0 > 0); {198913#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:20,756 INFO L290 TraceCheckUtils]: 33: Hoare triple {198913#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198938#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:20,756 INFO L290 TraceCheckUtils]: 34: Hoare triple {198938#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {198938#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:20,756 INFO L272 TraceCheckUtils]: 35: Hoare triple {198938#(<= ~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)); {198938#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:20,757 INFO L290 TraceCheckUtils]: 36: Hoare triple {198938#(<= ~counter~0 3)} ~cond := #in~cond; {198938#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:20,757 INFO L290 TraceCheckUtils]: 37: Hoare triple {198938#(<= ~counter~0 3)} assume !(0 == ~cond); {198938#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:20,757 INFO L290 TraceCheckUtils]: 38: Hoare triple {198938#(<= ~counter~0 3)} assume true; {198938#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:20,758 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {198938#(<= ~counter~0 3)} {198938#(<= ~counter~0 3)} #98#return; {198938#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:20,758 INFO L290 TraceCheckUtils]: 40: Hoare triple {198938#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {198938#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:20,760 INFO L290 TraceCheckUtils]: 41: Hoare triple {198938#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198963#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:20,760 INFO L290 TraceCheckUtils]: 42: Hoare triple {198963#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {198963#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:20,760 INFO L272 TraceCheckUtils]: 43: Hoare triple {198963#(<= ~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)); {198963#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:20,761 INFO L290 TraceCheckUtils]: 44: Hoare triple {198963#(<= ~counter~0 4)} ~cond := #in~cond; {198963#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:20,761 INFO L290 TraceCheckUtils]: 45: Hoare triple {198963#(<= ~counter~0 4)} assume !(0 == ~cond); {198963#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:20,761 INFO L290 TraceCheckUtils]: 46: Hoare triple {198963#(<= ~counter~0 4)} assume true; {198963#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:20,762 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {198963#(<= ~counter~0 4)} {198963#(<= ~counter~0 4)} #98#return; {198963#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:20,762 INFO L290 TraceCheckUtils]: 48: Hoare triple {198963#(<= ~counter~0 4)} assume !(~r~0 < 0); {198963#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:20,764 INFO L290 TraceCheckUtils]: 49: Hoare triple {198963#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198988#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:20,764 INFO L290 TraceCheckUtils]: 50: Hoare triple {198988#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {198988#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:20,764 INFO L272 TraceCheckUtils]: 51: Hoare triple {198988#(<= ~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)); {198988#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:20,765 INFO L290 TraceCheckUtils]: 52: Hoare triple {198988#(<= ~counter~0 5)} ~cond := #in~cond; {198988#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:20,765 INFO L290 TraceCheckUtils]: 53: Hoare triple {198988#(<= ~counter~0 5)} assume !(0 == ~cond); {198988#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:20,765 INFO L290 TraceCheckUtils]: 54: Hoare triple {198988#(<= ~counter~0 5)} assume true; {198988#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:20,766 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {198988#(<= ~counter~0 5)} {198988#(<= ~counter~0 5)} #94#return; {198988#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:20,766 INFO L290 TraceCheckUtils]: 56: Hoare triple {198988#(<= ~counter~0 5)} assume !!(0 != ~r~0); {198988#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:20,767 INFO L290 TraceCheckUtils]: 57: Hoare triple {198988#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199013#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:20,768 INFO L290 TraceCheckUtils]: 58: Hoare triple {199013#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {199013#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:20,768 INFO L272 TraceCheckUtils]: 59: Hoare triple {199013#(<= ~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)); {199013#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:20,768 INFO L290 TraceCheckUtils]: 60: Hoare triple {199013#(<= ~counter~0 6)} ~cond := #in~cond; {199013#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:20,769 INFO L290 TraceCheckUtils]: 61: Hoare triple {199013#(<= ~counter~0 6)} assume !(0 == ~cond); {199013#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:20,769 INFO L290 TraceCheckUtils]: 62: Hoare triple {199013#(<= ~counter~0 6)} assume true; {199013#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:20,769 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {199013#(<= ~counter~0 6)} {199013#(<= ~counter~0 6)} #96#return; {199013#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:20,770 INFO L290 TraceCheckUtils]: 64: Hoare triple {199013#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199013#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:20,771 INFO L290 TraceCheckUtils]: 65: Hoare triple {199013#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199038#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:20,772 INFO L290 TraceCheckUtils]: 66: Hoare triple {199038#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {199038#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:20,772 INFO L272 TraceCheckUtils]: 67: Hoare triple {199038#(<= ~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)); {199038#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:20,772 INFO L290 TraceCheckUtils]: 68: Hoare triple {199038#(<= ~counter~0 7)} ~cond := #in~cond; {199038#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:20,773 INFO L290 TraceCheckUtils]: 69: Hoare triple {199038#(<= ~counter~0 7)} assume !(0 == ~cond); {199038#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:20,773 INFO L290 TraceCheckUtils]: 70: Hoare triple {199038#(<= ~counter~0 7)} assume true; {199038#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:20,773 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {199038#(<= ~counter~0 7)} {199038#(<= ~counter~0 7)} #96#return; {199038#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:20,774 INFO L290 TraceCheckUtils]: 72: Hoare triple {199038#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199038#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:20,775 INFO L290 TraceCheckUtils]: 73: Hoare triple {199038#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199063#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:20,776 INFO L290 TraceCheckUtils]: 74: Hoare triple {199063#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {199063#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:20,776 INFO L272 TraceCheckUtils]: 75: Hoare triple {199063#(<= ~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)); {199063#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:20,776 INFO L290 TraceCheckUtils]: 76: Hoare triple {199063#(<= ~counter~0 8)} ~cond := #in~cond; {199063#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:20,777 INFO L290 TraceCheckUtils]: 77: Hoare triple {199063#(<= ~counter~0 8)} assume !(0 == ~cond); {199063#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:20,777 INFO L290 TraceCheckUtils]: 78: Hoare triple {199063#(<= ~counter~0 8)} assume true; {199063#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:20,777 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {199063#(<= ~counter~0 8)} {199063#(<= ~counter~0 8)} #96#return; {199063#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:20,778 INFO L290 TraceCheckUtils]: 80: Hoare triple {199063#(<= ~counter~0 8)} assume !(~r~0 > 0); {199063#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:20,779 INFO L290 TraceCheckUtils]: 81: Hoare triple {199063#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199088#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:20,779 INFO L290 TraceCheckUtils]: 82: Hoare triple {199088#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {199088#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:20,780 INFO L272 TraceCheckUtils]: 83: Hoare triple {199088#(<= ~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)); {199088#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:20,780 INFO L290 TraceCheckUtils]: 84: Hoare triple {199088#(<= ~counter~0 9)} ~cond := #in~cond; {199088#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:20,780 INFO L290 TraceCheckUtils]: 85: Hoare triple {199088#(<= ~counter~0 9)} assume !(0 == ~cond); {199088#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:20,781 INFO L290 TraceCheckUtils]: 86: Hoare triple {199088#(<= ~counter~0 9)} assume true; {199088#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:20,781 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {199088#(<= ~counter~0 9)} {199088#(<= ~counter~0 9)} #98#return; {199088#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:20,782 INFO L290 TraceCheckUtils]: 88: Hoare triple {199088#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {199088#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:20,783 INFO L290 TraceCheckUtils]: 89: Hoare triple {199088#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199113#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:20,783 INFO L290 TraceCheckUtils]: 90: Hoare triple {199113#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {199113#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:20,784 INFO L272 TraceCheckUtils]: 91: Hoare triple {199113#(<= ~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)); {199113#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:20,784 INFO L290 TraceCheckUtils]: 92: Hoare triple {199113#(<= ~counter~0 10)} ~cond := #in~cond; {199113#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:20,784 INFO L290 TraceCheckUtils]: 93: Hoare triple {199113#(<= ~counter~0 10)} assume !(0 == ~cond); {199113#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:20,785 INFO L290 TraceCheckUtils]: 94: Hoare triple {199113#(<= ~counter~0 10)} assume true; {199113#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:20,785 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {199113#(<= ~counter~0 10)} {199113#(<= ~counter~0 10)} #98#return; {199113#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:20,785 INFO L290 TraceCheckUtils]: 96: Hoare triple {199113#(<= ~counter~0 10)} assume !(~r~0 < 0); {199113#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:20,787 INFO L290 TraceCheckUtils]: 97: Hoare triple {199113#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {199138#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:20,787 INFO L290 TraceCheckUtils]: 98: Hoare triple {199138#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {199138#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:20,788 INFO L272 TraceCheckUtils]: 99: Hoare triple {199138#(<= ~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)); {199138#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:20,788 INFO L290 TraceCheckUtils]: 100: Hoare triple {199138#(<= ~counter~0 11)} ~cond := #in~cond; {199138#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:20,788 INFO L290 TraceCheckUtils]: 101: Hoare triple {199138#(<= ~counter~0 11)} assume !(0 == ~cond); {199138#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:20,789 INFO L290 TraceCheckUtils]: 102: Hoare triple {199138#(<= ~counter~0 11)} assume true; {199138#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:20,789 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {199138#(<= ~counter~0 11)} {199138#(<= ~counter~0 11)} #94#return; {199138#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:20,789 INFO L290 TraceCheckUtils]: 104: Hoare triple {199138#(<= ~counter~0 11)} assume !!(0 != ~r~0); {199138#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:20,791 INFO L290 TraceCheckUtils]: 105: Hoare triple {199138#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199163#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:20,791 INFO L290 TraceCheckUtils]: 106: Hoare triple {199163#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {199163#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:20,792 INFO L272 TraceCheckUtils]: 107: Hoare triple {199163#(<= ~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)); {199163#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:20,792 INFO L290 TraceCheckUtils]: 108: Hoare triple {199163#(<= ~counter~0 12)} ~cond := #in~cond; {199163#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:20,792 INFO L290 TraceCheckUtils]: 109: Hoare triple {199163#(<= ~counter~0 12)} assume !(0 == ~cond); {199163#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:20,792 INFO L290 TraceCheckUtils]: 110: Hoare triple {199163#(<= ~counter~0 12)} assume true; {199163#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:20,793 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {199163#(<= ~counter~0 12)} {199163#(<= ~counter~0 12)} #96#return; {199163#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:20,793 INFO L290 TraceCheckUtils]: 112: Hoare triple {199163#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199163#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:20,795 INFO L290 TraceCheckUtils]: 113: Hoare triple {199163#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199188#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:20,795 INFO L290 TraceCheckUtils]: 114: Hoare triple {199188#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {199188#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:20,795 INFO L272 TraceCheckUtils]: 115: Hoare triple {199188#(<= ~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)); {199188#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:20,796 INFO L290 TraceCheckUtils]: 116: Hoare triple {199188#(<= ~counter~0 13)} ~cond := #in~cond; {199188#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:20,796 INFO L290 TraceCheckUtils]: 117: Hoare triple {199188#(<= ~counter~0 13)} assume !(0 == ~cond); {199188#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:20,796 INFO L290 TraceCheckUtils]: 118: Hoare triple {199188#(<= ~counter~0 13)} assume true; {199188#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:20,797 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {199188#(<= ~counter~0 13)} {199188#(<= ~counter~0 13)} #96#return; {199188#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:20,797 INFO L290 TraceCheckUtils]: 120: Hoare triple {199188#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199188#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:20,799 INFO L290 TraceCheckUtils]: 121: Hoare triple {199188#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199213#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:20,799 INFO L290 TraceCheckUtils]: 122: Hoare triple {199213#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {199213#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:20,799 INFO L272 TraceCheckUtils]: 123: Hoare triple {199213#(<= ~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)); {199213#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:20,800 INFO L290 TraceCheckUtils]: 124: Hoare triple {199213#(<= ~counter~0 14)} ~cond := #in~cond; {199213#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:20,800 INFO L290 TraceCheckUtils]: 125: Hoare triple {199213#(<= ~counter~0 14)} assume !(0 == ~cond); {199213#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:20,800 INFO L290 TraceCheckUtils]: 126: Hoare triple {199213#(<= ~counter~0 14)} assume true; {199213#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:20,801 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {199213#(<= ~counter~0 14)} {199213#(<= ~counter~0 14)} #96#return; {199213#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:20,801 INFO L290 TraceCheckUtils]: 128: Hoare triple {199213#(<= ~counter~0 14)} assume !(~r~0 > 0); {199213#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:20,803 INFO L290 TraceCheckUtils]: 129: Hoare triple {199213#(<= ~counter~0 14)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199238#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:20,804 INFO L290 TraceCheckUtils]: 130: Hoare triple {199238#(<= ~counter~0 15)} assume !!(#t~post8 < 100);havoc #t~post8; {199238#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:20,804 INFO L272 TraceCheckUtils]: 131: Hoare triple {199238#(<= ~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)); {199238#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:20,804 INFO L290 TraceCheckUtils]: 132: Hoare triple {199238#(<= ~counter~0 15)} ~cond := #in~cond; {199238#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:20,805 INFO L290 TraceCheckUtils]: 133: Hoare triple {199238#(<= ~counter~0 15)} assume !(0 == ~cond); {199238#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:20,805 INFO L290 TraceCheckUtils]: 134: Hoare triple {199238#(<= ~counter~0 15)} assume true; {199238#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:20,805 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {199238#(<= ~counter~0 15)} {199238#(<= ~counter~0 15)} #98#return; {199238#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:20,806 INFO L290 TraceCheckUtils]: 136: Hoare triple {199238#(<= ~counter~0 15)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {199238#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:20,807 INFO L290 TraceCheckUtils]: 137: Hoare triple {199238#(<= ~counter~0 15)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199263#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:20,808 INFO L290 TraceCheckUtils]: 138: Hoare triple {199263#(<= ~counter~0 16)} assume !!(#t~post8 < 100);havoc #t~post8; {199263#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:20,808 INFO L272 TraceCheckUtils]: 139: Hoare triple {199263#(<= ~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)); {199263#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:20,808 INFO L290 TraceCheckUtils]: 140: Hoare triple {199263#(<= ~counter~0 16)} ~cond := #in~cond; {199263#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:20,809 INFO L290 TraceCheckUtils]: 141: Hoare triple {199263#(<= ~counter~0 16)} assume !(0 == ~cond); {199263#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:20,809 INFO L290 TraceCheckUtils]: 142: Hoare triple {199263#(<= ~counter~0 16)} assume true; {199263#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:20,809 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {199263#(<= ~counter~0 16)} {199263#(<= ~counter~0 16)} #98#return; {199263#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:20,810 INFO L290 TraceCheckUtils]: 144: Hoare triple {199263#(<= ~counter~0 16)} assume !(~r~0 < 0); {199263#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:20,811 INFO L290 TraceCheckUtils]: 145: Hoare triple {199263#(<= ~counter~0 16)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {199288#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:20,812 INFO L290 TraceCheckUtils]: 146: Hoare triple {199288#(<= ~counter~0 17)} assume !!(#t~post6 < 100);havoc #t~post6; {199288#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:20,812 INFO L272 TraceCheckUtils]: 147: Hoare triple {199288#(<= ~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)); {199288#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:20,812 INFO L290 TraceCheckUtils]: 148: Hoare triple {199288#(<= ~counter~0 17)} ~cond := #in~cond; {199288#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:20,813 INFO L290 TraceCheckUtils]: 149: Hoare triple {199288#(<= ~counter~0 17)} assume !(0 == ~cond); {199288#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:20,813 INFO L290 TraceCheckUtils]: 150: Hoare triple {199288#(<= ~counter~0 17)} assume true; {199288#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:20,813 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {199288#(<= ~counter~0 17)} {199288#(<= ~counter~0 17)} #94#return; {199288#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:20,814 INFO L290 TraceCheckUtils]: 152: Hoare triple {199288#(<= ~counter~0 17)} assume !!(0 != ~r~0); {199288#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:20,815 INFO L290 TraceCheckUtils]: 153: Hoare triple {199288#(<= ~counter~0 17)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199313#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:20,816 INFO L290 TraceCheckUtils]: 154: Hoare triple {199313#(<= ~counter~0 18)} assume !!(#t~post7 < 100);havoc #t~post7; {199313#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:20,816 INFO L272 TraceCheckUtils]: 155: Hoare triple {199313#(<= ~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)); {199313#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:20,816 INFO L290 TraceCheckUtils]: 156: Hoare triple {199313#(<= ~counter~0 18)} ~cond := #in~cond; {199313#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:20,817 INFO L290 TraceCheckUtils]: 157: Hoare triple {199313#(<= ~counter~0 18)} assume !(0 == ~cond); {199313#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:20,817 INFO L290 TraceCheckUtils]: 158: Hoare triple {199313#(<= ~counter~0 18)} assume true; {199313#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:20,817 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {199313#(<= ~counter~0 18)} {199313#(<= ~counter~0 18)} #96#return; {199313#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:20,818 INFO L290 TraceCheckUtils]: 160: Hoare triple {199313#(<= ~counter~0 18)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199313#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:20,818 INFO L290 TraceCheckUtils]: 161: Hoare triple {199313#(<= ~counter~0 18)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199338#(<= |main_#t~post7| 18)} is VALID [2022-04-15 15:22:20,818 INFO L290 TraceCheckUtils]: 162: Hoare triple {199338#(<= |main_#t~post7| 18)} assume !(#t~post7 < 100);havoc #t~post7; {198832#false} is VALID [2022-04-15 15:22:20,818 INFO L290 TraceCheckUtils]: 163: Hoare triple {198832#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198832#false} is VALID [2022-04-15 15:22:20,819 INFO L290 TraceCheckUtils]: 164: Hoare triple {198832#false} assume !(#t~post8 < 100);havoc #t~post8; {198832#false} is VALID [2022-04-15 15:22:20,819 INFO L290 TraceCheckUtils]: 165: Hoare triple {198832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198832#false} is VALID [2022-04-15 15:22:20,819 INFO L290 TraceCheckUtils]: 166: Hoare triple {198832#false} assume !(#t~post6 < 100);havoc #t~post6; {198832#false} is VALID [2022-04-15 15:22:20,819 INFO L272 TraceCheckUtils]: 167: Hoare triple {198832#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)); {198832#false} is VALID [2022-04-15 15:22:20,819 INFO L290 TraceCheckUtils]: 168: Hoare triple {198832#false} ~cond := #in~cond; {198832#false} is VALID [2022-04-15 15:22:20,819 INFO L290 TraceCheckUtils]: 169: Hoare triple {198832#false} assume 0 == ~cond; {198832#false} is VALID [2022-04-15 15:22:20,819 INFO L290 TraceCheckUtils]: 170: Hoare triple {198832#false} assume !false; {198832#false} is VALID [2022-04-15 15:22:20,819 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 56 proven. 824 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:22:20,819 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:22:21,933 INFO L290 TraceCheckUtils]: 170: Hoare triple {198832#false} assume !false; {198832#false} is VALID [2022-04-15 15:22:21,933 INFO L290 TraceCheckUtils]: 169: Hoare triple {198832#false} assume 0 == ~cond; {198832#false} is VALID [2022-04-15 15:22:21,933 INFO L290 TraceCheckUtils]: 168: Hoare triple {198832#false} ~cond := #in~cond; {198832#false} is VALID [2022-04-15 15:22:21,933 INFO L272 TraceCheckUtils]: 167: Hoare triple {198832#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)); {198832#false} is VALID [2022-04-15 15:22:21,933 INFO L290 TraceCheckUtils]: 166: Hoare triple {198832#false} assume !(#t~post6 < 100);havoc #t~post6; {198832#false} is VALID [2022-04-15 15:22:21,933 INFO L290 TraceCheckUtils]: 165: Hoare triple {198832#false} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {198832#false} is VALID [2022-04-15 15:22:21,933 INFO L290 TraceCheckUtils]: 164: Hoare triple {198832#false} assume !(#t~post8 < 100);havoc #t~post8; {198832#false} is VALID [2022-04-15 15:22:21,933 INFO L290 TraceCheckUtils]: 163: Hoare triple {198832#false} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {198832#false} is VALID [2022-04-15 15:22:21,934 INFO L290 TraceCheckUtils]: 162: Hoare triple {199390#(< |main_#t~post7| 100)} assume !(#t~post7 < 100);havoc #t~post7; {198832#false} is VALID [2022-04-15 15:22:21,934 INFO L290 TraceCheckUtils]: 161: Hoare triple {199394#(< ~counter~0 100)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199390#(< |main_#t~post7| 100)} is VALID [2022-04-15 15:22:21,934 INFO L290 TraceCheckUtils]: 160: Hoare triple {199394#(< ~counter~0 100)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199394#(< ~counter~0 100)} is VALID [2022-04-15 15:22:21,935 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {198831#true} {199394#(< ~counter~0 100)} #96#return; {199394#(< ~counter~0 100)} is VALID [2022-04-15 15:22:21,935 INFO L290 TraceCheckUtils]: 158: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,935 INFO L290 TraceCheckUtils]: 157: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,935 INFO L290 TraceCheckUtils]: 156: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,935 INFO L272 TraceCheckUtils]: 155: Hoare triple {199394#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,935 INFO L290 TraceCheckUtils]: 154: Hoare triple {199394#(< ~counter~0 100)} assume !!(#t~post7 < 100);havoc #t~post7; {199394#(< ~counter~0 100)} is VALID [2022-04-15 15:22:21,939 INFO L290 TraceCheckUtils]: 153: Hoare triple {199419#(< ~counter~0 99)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199394#(< ~counter~0 100)} is VALID [2022-04-15 15:22:21,940 INFO L290 TraceCheckUtils]: 152: Hoare triple {199419#(< ~counter~0 99)} assume !!(0 != ~r~0); {199419#(< ~counter~0 99)} is VALID [2022-04-15 15:22:21,940 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {198831#true} {199419#(< ~counter~0 99)} #94#return; {199419#(< ~counter~0 99)} is VALID [2022-04-15 15:22:21,940 INFO L290 TraceCheckUtils]: 150: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,940 INFO L290 TraceCheckUtils]: 149: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,941 INFO L290 TraceCheckUtils]: 148: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,941 INFO L272 TraceCheckUtils]: 147: Hoare triple {199419#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,941 INFO L290 TraceCheckUtils]: 146: Hoare triple {199419#(< ~counter~0 99)} assume !!(#t~post6 < 100);havoc #t~post6; {199419#(< ~counter~0 99)} is VALID [2022-04-15 15:22:21,943 INFO L290 TraceCheckUtils]: 145: Hoare triple {199444#(< ~counter~0 98)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {199419#(< ~counter~0 99)} is VALID [2022-04-15 15:22:21,943 INFO L290 TraceCheckUtils]: 144: Hoare triple {199444#(< ~counter~0 98)} assume !(~r~0 < 0); {199444#(< ~counter~0 98)} is VALID [2022-04-15 15:22:21,943 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {198831#true} {199444#(< ~counter~0 98)} #98#return; {199444#(< ~counter~0 98)} is VALID [2022-04-15 15:22:21,944 INFO L290 TraceCheckUtils]: 142: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,944 INFO L290 TraceCheckUtils]: 141: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,944 INFO L290 TraceCheckUtils]: 140: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,944 INFO L272 TraceCheckUtils]: 139: Hoare triple {199444#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,944 INFO L290 TraceCheckUtils]: 138: Hoare triple {199444#(< ~counter~0 98)} assume !!(#t~post8 < 100);havoc #t~post8; {199444#(< ~counter~0 98)} is VALID [2022-04-15 15:22:21,946 INFO L290 TraceCheckUtils]: 137: Hoare triple {199469#(< ~counter~0 97)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199444#(< ~counter~0 98)} is VALID [2022-04-15 15:22:21,946 INFO L290 TraceCheckUtils]: 136: Hoare triple {199469#(< ~counter~0 97)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {199469#(< ~counter~0 97)} is VALID [2022-04-15 15:22:21,947 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {198831#true} {199469#(< ~counter~0 97)} #98#return; {199469#(< ~counter~0 97)} is VALID [2022-04-15 15:22:21,947 INFO L290 TraceCheckUtils]: 134: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,947 INFO L290 TraceCheckUtils]: 133: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,947 INFO L290 TraceCheckUtils]: 132: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,947 INFO L272 TraceCheckUtils]: 131: Hoare triple {199469#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,947 INFO L290 TraceCheckUtils]: 130: Hoare triple {199469#(< ~counter~0 97)} assume !!(#t~post8 < 100);havoc #t~post8; {199469#(< ~counter~0 97)} is VALID [2022-04-15 15:22:21,949 INFO L290 TraceCheckUtils]: 129: Hoare triple {199494#(< ~counter~0 96)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199469#(< ~counter~0 97)} is VALID [2022-04-15 15:22:21,949 INFO L290 TraceCheckUtils]: 128: Hoare triple {199494#(< ~counter~0 96)} assume !(~r~0 > 0); {199494#(< ~counter~0 96)} is VALID [2022-04-15 15:22:21,950 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {198831#true} {199494#(< ~counter~0 96)} #96#return; {199494#(< ~counter~0 96)} is VALID [2022-04-15 15:22:21,950 INFO L290 TraceCheckUtils]: 126: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,950 INFO L290 TraceCheckUtils]: 125: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,950 INFO L290 TraceCheckUtils]: 124: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,950 INFO L272 TraceCheckUtils]: 123: Hoare triple {199494#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,950 INFO L290 TraceCheckUtils]: 122: Hoare triple {199494#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {199494#(< ~counter~0 96)} is VALID [2022-04-15 15:22:21,952 INFO L290 TraceCheckUtils]: 121: Hoare triple {199519#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199494#(< ~counter~0 96)} is VALID [2022-04-15 15:22:21,952 INFO L290 TraceCheckUtils]: 120: Hoare triple {199519#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199519#(< ~counter~0 95)} is VALID [2022-04-15 15:22:21,953 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {198831#true} {199519#(< ~counter~0 95)} #96#return; {199519#(< ~counter~0 95)} is VALID [2022-04-15 15:22:21,953 INFO L290 TraceCheckUtils]: 118: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,953 INFO L290 TraceCheckUtils]: 117: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,953 INFO L290 TraceCheckUtils]: 116: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,953 INFO L272 TraceCheckUtils]: 115: Hoare triple {199519#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,953 INFO L290 TraceCheckUtils]: 114: Hoare triple {199519#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {199519#(< ~counter~0 95)} is VALID [2022-04-15 15:22:21,955 INFO L290 TraceCheckUtils]: 113: Hoare triple {199544#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199519#(< ~counter~0 95)} is VALID [2022-04-15 15:22:21,955 INFO L290 TraceCheckUtils]: 112: Hoare triple {199544#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199544#(< ~counter~0 94)} is VALID [2022-04-15 15:22:21,956 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {198831#true} {199544#(< ~counter~0 94)} #96#return; {199544#(< ~counter~0 94)} is VALID [2022-04-15 15:22:21,956 INFO L290 TraceCheckUtils]: 110: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,956 INFO L290 TraceCheckUtils]: 109: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,956 INFO L290 TraceCheckUtils]: 108: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,956 INFO L272 TraceCheckUtils]: 107: Hoare triple {199544#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,956 INFO L290 TraceCheckUtils]: 106: Hoare triple {199544#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {199544#(< ~counter~0 94)} is VALID [2022-04-15 15:22:21,958 INFO L290 TraceCheckUtils]: 105: Hoare triple {199569#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199544#(< ~counter~0 94)} is VALID [2022-04-15 15:22:21,958 INFO L290 TraceCheckUtils]: 104: Hoare triple {199569#(< ~counter~0 93)} assume !!(0 != ~r~0); {199569#(< ~counter~0 93)} is VALID [2022-04-15 15:22:21,958 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {198831#true} {199569#(< ~counter~0 93)} #94#return; {199569#(< ~counter~0 93)} is VALID [2022-04-15 15:22:21,959 INFO L290 TraceCheckUtils]: 102: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,959 INFO L290 TraceCheckUtils]: 101: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,959 INFO L290 TraceCheckUtils]: 100: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,959 INFO L272 TraceCheckUtils]: 99: Hoare triple {199569#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,959 INFO L290 TraceCheckUtils]: 98: Hoare triple {199569#(< ~counter~0 93)} assume !!(#t~post6 < 100);havoc #t~post6; {199569#(< ~counter~0 93)} is VALID [2022-04-15 15:22:21,961 INFO L290 TraceCheckUtils]: 97: Hoare triple {199594#(< ~counter~0 92)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {199569#(< ~counter~0 93)} is VALID [2022-04-15 15:22:21,961 INFO L290 TraceCheckUtils]: 96: Hoare triple {199594#(< ~counter~0 92)} assume !(~r~0 < 0); {199594#(< ~counter~0 92)} is VALID [2022-04-15 15:22:21,961 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {198831#true} {199594#(< ~counter~0 92)} #98#return; {199594#(< ~counter~0 92)} is VALID [2022-04-15 15:22:21,961 INFO L290 TraceCheckUtils]: 94: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,961 INFO L290 TraceCheckUtils]: 93: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,962 INFO L290 TraceCheckUtils]: 92: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,962 INFO L272 TraceCheckUtils]: 91: Hoare triple {199594#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,962 INFO L290 TraceCheckUtils]: 90: Hoare triple {199594#(< ~counter~0 92)} assume !!(#t~post8 < 100);havoc #t~post8; {199594#(< ~counter~0 92)} is VALID [2022-04-15 15:22:21,964 INFO L290 TraceCheckUtils]: 89: Hoare triple {199619#(< ~counter~0 91)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199594#(< ~counter~0 92)} is VALID [2022-04-15 15:22:21,964 INFO L290 TraceCheckUtils]: 88: Hoare triple {199619#(< ~counter~0 91)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {199619#(< ~counter~0 91)} is VALID [2022-04-15 15:22:21,964 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {198831#true} {199619#(< ~counter~0 91)} #98#return; {199619#(< ~counter~0 91)} is VALID [2022-04-15 15:22:21,964 INFO L290 TraceCheckUtils]: 86: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,964 INFO L290 TraceCheckUtils]: 85: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,965 INFO L290 TraceCheckUtils]: 84: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,965 INFO L272 TraceCheckUtils]: 83: Hoare triple {199619#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,965 INFO L290 TraceCheckUtils]: 82: Hoare triple {199619#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {199619#(< ~counter~0 91)} is VALID [2022-04-15 15:22:21,967 INFO L290 TraceCheckUtils]: 81: Hoare triple {199644#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199619#(< ~counter~0 91)} is VALID [2022-04-15 15:22:21,967 INFO L290 TraceCheckUtils]: 80: Hoare triple {199644#(< ~counter~0 90)} assume !(~r~0 > 0); {199644#(< ~counter~0 90)} is VALID [2022-04-15 15:22:21,967 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {198831#true} {199644#(< ~counter~0 90)} #96#return; {199644#(< ~counter~0 90)} is VALID [2022-04-15 15:22:21,968 INFO L290 TraceCheckUtils]: 78: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,968 INFO L290 TraceCheckUtils]: 77: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,968 INFO L290 TraceCheckUtils]: 76: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,968 INFO L272 TraceCheckUtils]: 75: Hoare triple {199644#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,968 INFO L290 TraceCheckUtils]: 74: Hoare triple {199644#(< ~counter~0 90)} assume !!(#t~post7 < 100);havoc #t~post7; {199644#(< ~counter~0 90)} is VALID [2022-04-15 15:22:21,970 INFO L290 TraceCheckUtils]: 73: Hoare triple {199669#(< ~counter~0 89)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199644#(< ~counter~0 90)} is VALID [2022-04-15 15:22:21,970 INFO L290 TraceCheckUtils]: 72: Hoare triple {199669#(< ~counter~0 89)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199669#(< ~counter~0 89)} is VALID [2022-04-15 15:22:21,970 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {198831#true} {199669#(< ~counter~0 89)} #96#return; {199669#(< ~counter~0 89)} is VALID [2022-04-15 15:22:21,970 INFO L290 TraceCheckUtils]: 70: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,971 INFO L290 TraceCheckUtils]: 69: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,971 INFO L290 TraceCheckUtils]: 68: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,971 INFO L272 TraceCheckUtils]: 67: Hoare triple {199669#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,971 INFO L290 TraceCheckUtils]: 66: Hoare triple {199669#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {199669#(< ~counter~0 89)} is VALID [2022-04-15 15:22:21,973 INFO L290 TraceCheckUtils]: 65: Hoare triple {199694#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199669#(< ~counter~0 89)} is VALID [2022-04-15 15:22:21,973 INFO L290 TraceCheckUtils]: 64: Hoare triple {199694#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {199694#(< ~counter~0 88)} is VALID [2022-04-15 15:22:21,973 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {198831#true} {199694#(< ~counter~0 88)} #96#return; {199694#(< ~counter~0 88)} is VALID [2022-04-15 15:22:21,973 INFO L290 TraceCheckUtils]: 62: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,974 INFO L290 TraceCheckUtils]: 61: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,974 INFO L290 TraceCheckUtils]: 60: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,974 INFO L272 TraceCheckUtils]: 59: Hoare triple {199694#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,974 INFO L290 TraceCheckUtils]: 58: Hoare triple {199694#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {199694#(< ~counter~0 88)} is VALID [2022-04-15 15:22:21,976 INFO L290 TraceCheckUtils]: 57: Hoare triple {199719#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199694#(< ~counter~0 88)} is VALID [2022-04-15 15:22:21,976 INFO L290 TraceCheckUtils]: 56: Hoare triple {199719#(< ~counter~0 87)} assume !!(0 != ~r~0); {199719#(< ~counter~0 87)} is VALID [2022-04-15 15:22:21,977 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {198831#true} {199719#(< ~counter~0 87)} #94#return; {199719#(< ~counter~0 87)} is VALID [2022-04-15 15:22:21,977 INFO L290 TraceCheckUtils]: 54: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,977 INFO L290 TraceCheckUtils]: 53: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,977 INFO L290 TraceCheckUtils]: 52: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,977 INFO L272 TraceCheckUtils]: 51: Hoare triple {199719#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,977 INFO L290 TraceCheckUtils]: 50: Hoare triple {199719#(< ~counter~0 87)} assume !!(#t~post6 < 100);havoc #t~post6; {199719#(< ~counter~0 87)} is VALID [2022-04-15 15:22:21,979 INFO L290 TraceCheckUtils]: 49: Hoare triple {199744#(< ~counter~0 86)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {199719#(< ~counter~0 87)} is VALID [2022-04-15 15:22:21,979 INFO L290 TraceCheckUtils]: 48: Hoare triple {199744#(< ~counter~0 86)} assume !(~r~0 < 0); {199744#(< ~counter~0 86)} is VALID [2022-04-15 15:22:21,980 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {198831#true} {199744#(< ~counter~0 86)} #98#return; {199744#(< ~counter~0 86)} is VALID [2022-04-15 15:22:21,980 INFO L290 TraceCheckUtils]: 46: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,980 INFO L290 TraceCheckUtils]: 45: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,980 INFO L290 TraceCheckUtils]: 44: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,980 INFO L272 TraceCheckUtils]: 43: Hoare triple {199744#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,980 INFO L290 TraceCheckUtils]: 42: Hoare triple {199744#(< ~counter~0 86)} assume !!(#t~post8 < 100);havoc #t~post8; {199744#(< ~counter~0 86)} is VALID [2022-04-15 15:22:21,982 INFO L290 TraceCheckUtils]: 41: Hoare triple {199769#(< ~counter~0 85)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199744#(< ~counter~0 86)} is VALID [2022-04-15 15:22:21,982 INFO L290 TraceCheckUtils]: 40: Hoare triple {199769#(< ~counter~0 85)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {199769#(< ~counter~0 85)} is VALID [2022-04-15 15:22:21,983 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {198831#true} {199769#(< ~counter~0 85)} #98#return; {199769#(< ~counter~0 85)} is VALID [2022-04-15 15:22:21,983 INFO L290 TraceCheckUtils]: 38: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,983 INFO L290 TraceCheckUtils]: 37: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,983 INFO L290 TraceCheckUtils]: 36: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,983 INFO L272 TraceCheckUtils]: 35: Hoare triple {199769#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,983 INFO L290 TraceCheckUtils]: 34: Hoare triple {199769#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {199769#(< ~counter~0 85)} is VALID [2022-04-15 15:22:21,985 INFO L290 TraceCheckUtils]: 33: Hoare triple {199794#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {199769#(< ~counter~0 85)} is VALID [2022-04-15 15:22:21,985 INFO L290 TraceCheckUtils]: 32: Hoare triple {199794#(< ~counter~0 84)} assume !(~r~0 > 0); {199794#(< ~counter~0 84)} is VALID [2022-04-15 15:22:21,986 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {198831#true} {199794#(< ~counter~0 84)} #96#return; {199794#(< ~counter~0 84)} is VALID [2022-04-15 15:22:21,986 INFO L290 TraceCheckUtils]: 30: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,986 INFO L290 TraceCheckUtils]: 29: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,986 INFO L290 TraceCheckUtils]: 28: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,986 INFO L272 TraceCheckUtils]: 27: Hoare triple {199794#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,986 INFO L290 TraceCheckUtils]: 26: Hoare triple {199794#(< ~counter~0 84)} assume !!(#t~post7 < 100);havoc #t~post7; {199794#(< ~counter~0 84)} is VALID [2022-04-15 15:22:21,988 INFO L290 TraceCheckUtils]: 25: Hoare triple {199819#(< ~counter~0 83)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {199794#(< ~counter~0 84)} is VALID [2022-04-15 15:22:21,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {199819#(< ~counter~0 83)} assume !!(0 != ~r~0); {199819#(< ~counter~0 83)} is VALID [2022-04-15 15:22:21,989 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {198831#true} {199819#(< ~counter~0 83)} #94#return; {199819#(< ~counter~0 83)} is VALID [2022-04-15 15:22:21,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,989 INFO L272 TraceCheckUtils]: 19: Hoare triple {199819#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {199819#(< ~counter~0 83)} assume !!(#t~post6 < 100);havoc #t~post6; {199819#(< ~counter~0 83)} is VALID [2022-04-15 15:22:21,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {199844#(< ~counter~0 82)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {199819#(< ~counter~0 83)} is VALID [2022-04-15 15:22:21,991 INFO L290 TraceCheckUtils]: 16: Hoare triple {199844#(< ~counter~0 82)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {199844#(< ~counter~0 82)} is VALID [2022-04-15 15:22:21,992 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {198831#true} {199844#(< ~counter~0 82)} #92#return; {199844#(< ~counter~0 82)} is VALID [2022-04-15 15:22:21,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,992 INFO L290 TraceCheckUtils]: 12: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,992 INFO L272 TraceCheckUtils]: 11: Hoare triple {199844#(< ~counter~0 82)} 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)); {198831#true} is VALID [2022-04-15 15:22:21,992 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {198831#true} {199844#(< ~counter~0 82)} #90#return; {199844#(< ~counter~0 82)} is VALID [2022-04-15 15:22:21,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {198831#true} assume true; {198831#true} is VALID [2022-04-15 15:22:21,993 INFO L290 TraceCheckUtils]: 8: Hoare triple {198831#true} assume !(0 == ~cond); {198831#true} is VALID [2022-04-15 15:22:21,993 INFO L290 TraceCheckUtils]: 7: Hoare triple {198831#true} ~cond := #in~cond; {198831#true} is VALID [2022-04-15 15:22:21,993 INFO L272 TraceCheckUtils]: 6: Hoare triple {199844#(< ~counter~0 82)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {198831#true} is VALID [2022-04-15 15:22:21,993 INFO L290 TraceCheckUtils]: 5: Hoare triple {199844#(< ~counter~0 82)} 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; {199844#(< ~counter~0 82)} is VALID [2022-04-15 15:22:21,993 INFO L272 TraceCheckUtils]: 4: Hoare triple {199844#(< ~counter~0 82)} call #t~ret9 := main(); {199844#(< ~counter~0 82)} is VALID [2022-04-15 15:22:21,994 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {199844#(< ~counter~0 82)} {198831#true} #102#return; {199844#(< ~counter~0 82)} is VALID [2022-04-15 15:22:21,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {199844#(< ~counter~0 82)} assume true; {199844#(< ~counter~0 82)} is VALID [2022-04-15 15:22:21,994 INFO L290 TraceCheckUtils]: 1: Hoare triple {198831#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; {199844#(< ~counter~0 82)} is VALID [2022-04-15 15:22:21,994 INFO L272 TraceCheckUtils]: 0: Hoare triple {198831#true} call ULTIMATE.init(); {198831#true} is VALID [2022-04-15 15:22:21,995 INFO L134 CoverageAnalysis]: Checked inductivity of 884 backedges. 56 proven. 212 refuted. 0 times theorem prover too weak. 616 trivial. 0 not checked. [2022-04-15 15:22:21,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:22:21,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [598778767] [2022-04-15 15:22:21,995 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:22:21,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [91529644] [2022-04-15 15:22:21,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [91529644] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:22:21,995 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:22:21,995 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 42 [2022-04-15 15:22:21,995 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:22:21,995 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1985043852] [2022-04-15 15:22:21,995 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1985043852] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:22:21,995 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:22:21,996 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2022-04-15 15:22:21,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769579405] [2022-04-15 15:22:21,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:22:21,996 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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 171 [2022-04-15 15:22:21,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:22:21,996 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-15 15:22:22,256 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:22,256 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-04-15 15:22:22,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:22,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-04-15 15:22:22,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=785, Invalid=937, Unknown=0, NotChecked=0, Total=1722 [2022-04-15 15:22:22,257 INFO L87 Difference]: Start difference. First operand 950 states and 1263 transitions. Second operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-15 15:22:29,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:29,034 INFO L93 Difference]: Finished difference Result 1137 states and 1541 transitions. [2022-04-15 15:22:29,034 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 15:22:29,034 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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 171 [2022-04-15 15:22:29,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:22:29,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-15 15:22:29,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 396 transitions. [2022-04-15 15:22:29,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-15 15:22:29,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 396 transitions. [2022-04-15 15:22:29,042 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 396 transitions. [2022-04-15 15:22:29,613 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 396 edges. 396 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:29,660 INFO L225 Difference]: With dead ends: 1137 [2022-04-15 15:22:29,660 INFO L226 Difference]: Without dead ends: 967 [2022-04-15 15:22:29,661 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 358 GetRequests, 301 SyntacticMatches, 0 SemanticMatches, 57 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 191 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1465, Invalid=1957, Unknown=0, NotChecked=0, Total=3422 [2022-04-15 15:22:29,661 INFO L913 BasicCegarLoop]: 84 mSDtfsCounter, 253 mSDsluCounter, 324 mSDsCounter, 0 mSdLazyCounter, 307 mSolverCounterSat, 212 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 253 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 212 IncrementalHoareTripleChecker+Valid, 307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-04-15 15:22:29,661 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [253 Valid, 408 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [212 Valid, 307 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-04-15 15:22:29,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 967 states. [2022-04-15 15:22:33,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 967 to 967. [2022-04-15 15:22:33,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:22:33,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 967 states. Second operand has 967 states, 728 states have (on average 1.1703296703296704) internal successors, (852), 735 states have internal predecessors, (852), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:22:33,706 INFO L74 IsIncluded]: Start isIncluded. First operand 967 states. Second operand has 967 states, 728 states have (on average 1.1703296703296704) internal successors, (852), 735 states have internal predecessors, (852), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:22:33,707 INFO L87 Difference]: Start difference. First operand 967 states. Second operand has 967 states, 728 states have (on average 1.1703296703296704) internal successors, (852), 735 states have internal predecessors, (852), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:22:33,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:33,737 INFO L93 Difference]: Finished difference Result 967 states and 1280 transitions. [2022-04-15 15:22:33,737 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1280 transitions. [2022-04-15 15:22:33,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:33,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:33,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 967 states, 728 states have (on average 1.1703296703296704) internal successors, (852), 735 states have internal predecessors, (852), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) Second operand 967 states. [2022-04-15 15:22:33,739 INFO L87 Difference]: Start difference. First operand has 967 states, 728 states have (on average 1.1703296703296704) internal successors, (852), 735 states have internal predecessors, (852), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) Second operand 967 states. [2022-04-15 15:22:33,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:33,766 INFO L93 Difference]: Finished difference Result 967 states and 1280 transitions. [2022-04-15 15:22:33,766 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1280 transitions. [2022-04-15 15:22:33,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:33,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:33,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:22:33,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:22:33,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 967 states, 728 states have (on average 1.1703296703296704) internal successors, (852), 735 states have internal predecessors, (852), 215 states have call successors, (215), 25 states have call predecessors, (215), 23 states have return successors, (213), 206 states have call predecessors, (213), 213 states have call successors, (213) [2022-04-15 15:22:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 967 states to 967 states and 1280 transitions. [2022-04-15 15:22:33,806 INFO L78 Accepts]: Start accepts. Automaton has 967 states and 1280 transitions. Word has length 171 [2022-04-15 15:22:33,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:22:33,806 INFO L478 AbstractCegarLoop]: Abstraction has 967 states and 1280 transitions. [2022-04-15 15:22:33,806 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 5.636363636363637) internal successors, (124), 21 states have internal predecessors, (124), 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-15 15:22:33,806 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 967 states and 1280 transitions. [2022-04-15 15:22:44,121 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1280 edges. 1278 inductive. 0 not inductive. 2 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:44,121 INFO L276 IsEmpty]: Start isEmpty. Operand 967 states and 1280 transitions. [2022-04-15 15:22:44,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 176 [2022-04-15 15:22:44,122 INFO L491 BasicCegarLoop]: Found error trace [2022-04-15 15:22:44,123 INFO L499 BasicCegarLoop]: trace histogram [20, 19, 19, 10, 10, 10, 10, 7, 6, 6, 6, 6, 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-15 15:22:44,139 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (61)] Forceful destruction successful, exit code 0 [2022-04-15 15:22:44,323 WARN L460 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable59,61 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:22:44,323 INFO L403 AbstractCegarLoop]: === Iteration 61 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-04-15 15:22:44,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-04-15 15:22:44,323 INFO L85 PathProgramCache]: Analyzing trace with hash 1863737586, now seen corresponding path program 21 times [2022-04-15 15:22:44,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:44,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleAcceleratedInterpolation [1386105697] [2022-04-15 15:22:44,324 INFO L202 tedInterpolationCore]: No loops in this trace, falling back to nested interpolation [2022-04-15 15:22:44,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1863737586, now seen corresponding path program 22 times [2022-04-15 15:22:44,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-04-15 15:22:44,324 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1582743293] [2022-04-15 15:22:44,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-04-15 15:22:44,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-04-15 15:22:44,338 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-04-15 15:22:44,339 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1085316972] [2022-04-15 15:22:44,339 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-04-15 15:22:44,339 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-04-15 15:22:44,339 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-04-15 15:22:44,340 INFO L229 MonitoredProcess]: Starting monitored process 62 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-04-15 15:22:44,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (62)] Waiting until timeout for monitored process [2022-04-15 15:22:44,423 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-04-15 15:22:44,423 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-04-15 15:22:44,425 INFO L263 TraceCheckSpWp]: Trace formula consists of 418 conjuncts, 43 conjunts are in the unsatisfiable core [2022-04-15 15:22:44,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-04-15 15:22:44,464 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-04-15 15:22:45,378 INFO L272 TraceCheckUtils]: 0: Hoare triple {206074#true} call ULTIMATE.init(); {206074#true} is VALID [2022-04-15 15:22:45,379 INFO L290 TraceCheckUtils]: 1: Hoare triple {206074#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; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,379 INFO L290 TraceCheckUtils]: 2: Hoare triple {206082#(<= ~counter~0 0)} assume true; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,380 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {206082#(<= ~counter~0 0)} {206074#true} #102#return; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,380 INFO L272 TraceCheckUtils]: 4: Hoare triple {206082#(<= ~counter~0 0)} call #t~ret9 := main(); {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,380 INFO L290 TraceCheckUtils]: 5: Hoare triple {206082#(<= ~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; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,381 INFO L272 TraceCheckUtils]: 6: Hoare triple {206082#(<= ~counter~0 0)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,381 INFO L290 TraceCheckUtils]: 7: Hoare triple {206082#(<= ~counter~0 0)} ~cond := #in~cond; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,381 INFO L290 TraceCheckUtils]: 8: Hoare triple {206082#(<= ~counter~0 0)} assume !(0 == ~cond); {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,382 INFO L290 TraceCheckUtils]: 9: Hoare triple {206082#(<= ~counter~0 0)} assume true; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,382 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {206082#(<= ~counter~0 0)} {206082#(<= ~counter~0 0)} #90#return; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,382 INFO L272 TraceCheckUtils]: 11: Hoare triple {206082#(<= ~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)); {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,383 INFO L290 TraceCheckUtils]: 12: Hoare triple {206082#(<= ~counter~0 0)} ~cond := #in~cond; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,383 INFO L290 TraceCheckUtils]: 13: Hoare triple {206082#(<= ~counter~0 0)} assume !(0 == ~cond); {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,383 INFO L290 TraceCheckUtils]: 14: Hoare triple {206082#(<= ~counter~0 0)} assume true; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,384 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {206082#(<= ~counter~0 0)} {206082#(<= ~counter~0 0)} #92#return; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,384 INFO L290 TraceCheckUtils]: 16: Hoare triple {206082#(<= ~counter~0 0)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {206082#(<= ~counter~0 0)} is VALID [2022-04-15 15:22:45,388 INFO L290 TraceCheckUtils]: 17: Hoare triple {206082#(<= ~counter~0 0)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {206131#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:45,388 INFO L290 TraceCheckUtils]: 18: Hoare triple {206131#(<= ~counter~0 1)} assume !!(#t~post6 < 100);havoc #t~post6; {206131#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:45,389 INFO L272 TraceCheckUtils]: 19: Hoare triple {206131#(<= ~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)); {206131#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:45,389 INFO L290 TraceCheckUtils]: 20: Hoare triple {206131#(<= ~counter~0 1)} ~cond := #in~cond; {206131#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:45,389 INFO L290 TraceCheckUtils]: 21: Hoare triple {206131#(<= ~counter~0 1)} assume !(0 == ~cond); {206131#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:45,389 INFO L290 TraceCheckUtils]: 22: Hoare triple {206131#(<= ~counter~0 1)} assume true; {206131#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:45,390 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {206131#(<= ~counter~0 1)} {206131#(<= ~counter~0 1)} #94#return; {206131#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:45,390 INFO L290 TraceCheckUtils]: 24: Hoare triple {206131#(<= ~counter~0 1)} assume !!(0 != ~r~0); {206131#(<= ~counter~0 1)} is VALID [2022-04-15 15:22:45,392 INFO L290 TraceCheckUtils]: 25: Hoare triple {206131#(<= ~counter~0 1)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206156#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:45,392 INFO L290 TraceCheckUtils]: 26: Hoare triple {206156#(<= ~counter~0 2)} assume !!(#t~post7 < 100);havoc #t~post7; {206156#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:45,392 INFO L272 TraceCheckUtils]: 27: Hoare triple {206156#(<= ~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)); {206156#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:45,393 INFO L290 TraceCheckUtils]: 28: Hoare triple {206156#(<= ~counter~0 2)} ~cond := #in~cond; {206156#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:45,393 INFO L290 TraceCheckUtils]: 29: Hoare triple {206156#(<= ~counter~0 2)} assume !(0 == ~cond); {206156#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:45,393 INFO L290 TraceCheckUtils]: 30: Hoare triple {206156#(<= ~counter~0 2)} assume true; {206156#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:45,394 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {206156#(<= ~counter~0 2)} {206156#(<= ~counter~0 2)} #96#return; {206156#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:45,394 INFO L290 TraceCheckUtils]: 32: Hoare triple {206156#(<= ~counter~0 2)} assume !(~r~0 > 0); {206156#(<= ~counter~0 2)} is VALID [2022-04-15 15:22:45,395 INFO L290 TraceCheckUtils]: 33: Hoare triple {206156#(<= ~counter~0 2)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206181#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:45,396 INFO L290 TraceCheckUtils]: 34: Hoare triple {206181#(<= ~counter~0 3)} assume !!(#t~post8 < 100);havoc #t~post8; {206181#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:45,396 INFO L272 TraceCheckUtils]: 35: Hoare triple {206181#(<= ~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)); {206181#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:45,396 INFO L290 TraceCheckUtils]: 36: Hoare triple {206181#(<= ~counter~0 3)} ~cond := #in~cond; {206181#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:45,397 INFO L290 TraceCheckUtils]: 37: Hoare triple {206181#(<= ~counter~0 3)} assume !(0 == ~cond); {206181#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:45,397 INFO L290 TraceCheckUtils]: 38: Hoare triple {206181#(<= ~counter~0 3)} assume true; {206181#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:45,397 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {206181#(<= ~counter~0 3)} {206181#(<= ~counter~0 3)} #98#return; {206181#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:45,398 INFO L290 TraceCheckUtils]: 40: Hoare triple {206181#(<= ~counter~0 3)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {206181#(<= ~counter~0 3)} is VALID [2022-04-15 15:22:45,399 INFO L290 TraceCheckUtils]: 41: Hoare triple {206181#(<= ~counter~0 3)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206206#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:45,400 INFO L290 TraceCheckUtils]: 42: Hoare triple {206206#(<= ~counter~0 4)} assume !!(#t~post8 < 100);havoc #t~post8; {206206#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:45,400 INFO L272 TraceCheckUtils]: 43: Hoare triple {206206#(<= ~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)); {206206#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:45,400 INFO L290 TraceCheckUtils]: 44: Hoare triple {206206#(<= ~counter~0 4)} ~cond := #in~cond; {206206#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:45,401 INFO L290 TraceCheckUtils]: 45: Hoare triple {206206#(<= ~counter~0 4)} assume !(0 == ~cond); {206206#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:45,401 INFO L290 TraceCheckUtils]: 46: Hoare triple {206206#(<= ~counter~0 4)} assume true; {206206#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:45,401 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {206206#(<= ~counter~0 4)} {206206#(<= ~counter~0 4)} #98#return; {206206#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:45,402 INFO L290 TraceCheckUtils]: 48: Hoare triple {206206#(<= ~counter~0 4)} assume !(~r~0 < 0); {206206#(<= ~counter~0 4)} is VALID [2022-04-15 15:22:45,403 INFO L290 TraceCheckUtils]: 49: Hoare triple {206206#(<= ~counter~0 4)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {206231#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:45,404 INFO L290 TraceCheckUtils]: 50: Hoare triple {206231#(<= ~counter~0 5)} assume !!(#t~post6 < 100);havoc #t~post6; {206231#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:45,404 INFO L272 TraceCheckUtils]: 51: Hoare triple {206231#(<= ~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)); {206231#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:45,404 INFO L290 TraceCheckUtils]: 52: Hoare triple {206231#(<= ~counter~0 5)} ~cond := #in~cond; {206231#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:45,405 INFO L290 TraceCheckUtils]: 53: Hoare triple {206231#(<= ~counter~0 5)} assume !(0 == ~cond); {206231#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:45,405 INFO L290 TraceCheckUtils]: 54: Hoare triple {206231#(<= ~counter~0 5)} assume true; {206231#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:45,405 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {206231#(<= ~counter~0 5)} {206231#(<= ~counter~0 5)} #94#return; {206231#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:45,406 INFO L290 TraceCheckUtils]: 56: Hoare triple {206231#(<= ~counter~0 5)} assume !!(0 != ~r~0); {206231#(<= ~counter~0 5)} is VALID [2022-04-15 15:22:45,407 INFO L290 TraceCheckUtils]: 57: Hoare triple {206231#(<= ~counter~0 5)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206256#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:45,407 INFO L290 TraceCheckUtils]: 58: Hoare triple {206256#(<= ~counter~0 6)} assume !!(#t~post7 < 100);havoc #t~post7; {206256#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:45,408 INFO L272 TraceCheckUtils]: 59: Hoare triple {206256#(<= ~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)); {206256#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:45,408 INFO L290 TraceCheckUtils]: 60: Hoare triple {206256#(<= ~counter~0 6)} ~cond := #in~cond; {206256#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:45,408 INFO L290 TraceCheckUtils]: 61: Hoare triple {206256#(<= ~counter~0 6)} assume !(0 == ~cond); {206256#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:45,409 INFO L290 TraceCheckUtils]: 62: Hoare triple {206256#(<= ~counter~0 6)} assume true; {206256#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:45,409 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {206256#(<= ~counter~0 6)} {206256#(<= ~counter~0 6)} #96#return; {206256#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:45,409 INFO L290 TraceCheckUtils]: 64: Hoare triple {206256#(<= ~counter~0 6)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206256#(<= ~counter~0 6)} is VALID [2022-04-15 15:22:45,411 INFO L290 TraceCheckUtils]: 65: Hoare triple {206256#(<= ~counter~0 6)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206281#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:45,411 INFO L290 TraceCheckUtils]: 66: Hoare triple {206281#(<= ~counter~0 7)} assume !!(#t~post7 < 100);havoc #t~post7; {206281#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:45,412 INFO L272 TraceCheckUtils]: 67: Hoare triple {206281#(<= ~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)); {206281#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:45,412 INFO L290 TraceCheckUtils]: 68: Hoare triple {206281#(<= ~counter~0 7)} ~cond := #in~cond; {206281#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:45,412 INFO L290 TraceCheckUtils]: 69: Hoare triple {206281#(<= ~counter~0 7)} assume !(0 == ~cond); {206281#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:45,412 INFO L290 TraceCheckUtils]: 70: Hoare triple {206281#(<= ~counter~0 7)} assume true; {206281#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:45,413 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {206281#(<= ~counter~0 7)} {206281#(<= ~counter~0 7)} #96#return; {206281#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:45,413 INFO L290 TraceCheckUtils]: 72: Hoare triple {206281#(<= ~counter~0 7)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206281#(<= ~counter~0 7)} is VALID [2022-04-15 15:22:45,415 INFO L290 TraceCheckUtils]: 73: Hoare triple {206281#(<= ~counter~0 7)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206306#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:45,415 INFO L290 TraceCheckUtils]: 74: Hoare triple {206306#(<= ~counter~0 8)} assume !!(#t~post7 < 100);havoc #t~post7; {206306#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:45,416 INFO L272 TraceCheckUtils]: 75: Hoare triple {206306#(<= ~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)); {206306#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:45,416 INFO L290 TraceCheckUtils]: 76: Hoare triple {206306#(<= ~counter~0 8)} ~cond := #in~cond; {206306#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:45,416 INFO L290 TraceCheckUtils]: 77: Hoare triple {206306#(<= ~counter~0 8)} assume !(0 == ~cond); {206306#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:45,416 INFO L290 TraceCheckUtils]: 78: Hoare triple {206306#(<= ~counter~0 8)} assume true; {206306#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:45,417 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {206306#(<= ~counter~0 8)} {206306#(<= ~counter~0 8)} #96#return; {206306#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:45,417 INFO L290 TraceCheckUtils]: 80: Hoare triple {206306#(<= ~counter~0 8)} assume !(~r~0 > 0); {206306#(<= ~counter~0 8)} is VALID [2022-04-15 15:22:45,419 INFO L290 TraceCheckUtils]: 81: Hoare triple {206306#(<= ~counter~0 8)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206331#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:45,419 INFO L290 TraceCheckUtils]: 82: Hoare triple {206331#(<= ~counter~0 9)} assume !!(#t~post8 < 100);havoc #t~post8; {206331#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:45,419 INFO L272 TraceCheckUtils]: 83: Hoare triple {206331#(<= ~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)); {206331#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:45,420 INFO L290 TraceCheckUtils]: 84: Hoare triple {206331#(<= ~counter~0 9)} ~cond := #in~cond; {206331#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:45,420 INFO L290 TraceCheckUtils]: 85: Hoare triple {206331#(<= ~counter~0 9)} assume !(0 == ~cond); {206331#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:45,420 INFO L290 TraceCheckUtils]: 86: Hoare triple {206331#(<= ~counter~0 9)} assume true; {206331#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:45,421 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {206331#(<= ~counter~0 9)} {206331#(<= ~counter~0 9)} #98#return; {206331#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:45,421 INFO L290 TraceCheckUtils]: 88: Hoare triple {206331#(<= ~counter~0 9)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {206331#(<= ~counter~0 9)} is VALID [2022-04-15 15:22:45,423 INFO L290 TraceCheckUtils]: 89: Hoare triple {206331#(<= ~counter~0 9)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206356#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:45,423 INFO L290 TraceCheckUtils]: 90: Hoare triple {206356#(<= ~counter~0 10)} assume !!(#t~post8 < 100);havoc #t~post8; {206356#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:45,423 INFO L272 TraceCheckUtils]: 91: Hoare triple {206356#(<= ~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)); {206356#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:45,424 INFO L290 TraceCheckUtils]: 92: Hoare triple {206356#(<= ~counter~0 10)} ~cond := #in~cond; {206356#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:45,424 INFO L290 TraceCheckUtils]: 93: Hoare triple {206356#(<= ~counter~0 10)} assume !(0 == ~cond); {206356#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:45,424 INFO L290 TraceCheckUtils]: 94: Hoare triple {206356#(<= ~counter~0 10)} assume true; {206356#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:45,425 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {206356#(<= ~counter~0 10)} {206356#(<= ~counter~0 10)} #98#return; {206356#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:45,425 INFO L290 TraceCheckUtils]: 96: Hoare triple {206356#(<= ~counter~0 10)} assume !(~r~0 < 0); {206356#(<= ~counter~0 10)} is VALID [2022-04-15 15:22:45,426 INFO L290 TraceCheckUtils]: 97: Hoare triple {206356#(<= ~counter~0 10)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {206381#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:45,427 INFO L290 TraceCheckUtils]: 98: Hoare triple {206381#(<= ~counter~0 11)} assume !!(#t~post6 < 100);havoc #t~post6; {206381#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:45,427 INFO L272 TraceCheckUtils]: 99: Hoare triple {206381#(<= ~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)); {206381#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:45,427 INFO L290 TraceCheckUtils]: 100: Hoare triple {206381#(<= ~counter~0 11)} ~cond := #in~cond; {206381#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:45,428 INFO L290 TraceCheckUtils]: 101: Hoare triple {206381#(<= ~counter~0 11)} assume !(0 == ~cond); {206381#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:45,428 INFO L290 TraceCheckUtils]: 102: Hoare triple {206381#(<= ~counter~0 11)} assume true; {206381#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:45,428 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {206381#(<= ~counter~0 11)} {206381#(<= ~counter~0 11)} #94#return; {206381#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:45,429 INFO L290 TraceCheckUtils]: 104: Hoare triple {206381#(<= ~counter~0 11)} assume !!(0 != ~r~0); {206381#(<= ~counter~0 11)} is VALID [2022-04-15 15:22:45,430 INFO L290 TraceCheckUtils]: 105: Hoare triple {206381#(<= ~counter~0 11)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206406#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:45,431 INFO L290 TraceCheckUtils]: 106: Hoare triple {206406#(<= ~counter~0 12)} assume !!(#t~post7 < 100);havoc #t~post7; {206406#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:45,431 INFO L272 TraceCheckUtils]: 107: Hoare triple {206406#(<= ~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)); {206406#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:45,431 INFO L290 TraceCheckUtils]: 108: Hoare triple {206406#(<= ~counter~0 12)} ~cond := #in~cond; {206406#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:45,432 INFO L290 TraceCheckUtils]: 109: Hoare triple {206406#(<= ~counter~0 12)} assume !(0 == ~cond); {206406#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:45,432 INFO L290 TraceCheckUtils]: 110: Hoare triple {206406#(<= ~counter~0 12)} assume true; {206406#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:45,432 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {206406#(<= ~counter~0 12)} {206406#(<= ~counter~0 12)} #96#return; {206406#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:45,433 INFO L290 TraceCheckUtils]: 112: Hoare triple {206406#(<= ~counter~0 12)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206406#(<= ~counter~0 12)} is VALID [2022-04-15 15:22:45,434 INFO L290 TraceCheckUtils]: 113: Hoare triple {206406#(<= ~counter~0 12)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206431#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:45,434 INFO L290 TraceCheckUtils]: 114: Hoare triple {206431#(<= ~counter~0 13)} assume !!(#t~post7 < 100);havoc #t~post7; {206431#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:45,435 INFO L272 TraceCheckUtils]: 115: Hoare triple {206431#(<= ~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)); {206431#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:45,435 INFO L290 TraceCheckUtils]: 116: Hoare triple {206431#(<= ~counter~0 13)} ~cond := #in~cond; {206431#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:45,436 INFO L290 TraceCheckUtils]: 117: Hoare triple {206431#(<= ~counter~0 13)} assume !(0 == ~cond); {206431#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:45,436 INFO L290 TraceCheckUtils]: 118: Hoare triple {206431#(<= ~counter~0 13)} assume true; {206431#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:45,436 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {206431#(<= ~counter~0 13)} {206431#(<= ~counter~0 13)} #96#return; {206431#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:45,437 INFO L290 TraceCheckUtils]: 120: Hoare triple {206431#(<= ~counter~0 13)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206431#(<= ~counter~0 13)} is VALID [2022-04-15 15:22:45,438 INFO L290 TraceCheckUtils]: 121: Hoare triple {206431#(<= ~counter~0 13)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206456#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:45,438 INFO L290 TraceCheckUtils]: 122: Hoare triple {206456#(<= ~counter~0 14)} assume !!(#t~post7 < 100);havoc #t~post7; {206456#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:45,439 INFO L272 TraceCheckUtils]: 123: Hoare triple {206456#(<= ~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)); {206456#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:45,439 INFO L290 TraceCheckUtils]: 124: Hoare triple {206456#(<= ~counter~0 14)} ~cond := #in~cond; {206456#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:45,439 INFO L290 TraceCheckUtils]: 125: Hoare triple {206456#(<= ~counter~0 14)} assume !(0 == ~cond); {206456#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:45,440 INFO L290 TraceCheckUtils]: 126: Hoare triple {206456#(<= ~counter~0 14)} assume true; {206456#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:45,440 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {206456#(<= ~counter~0 14)} {206456#(<= ~counter~0 14)} #96#return; {206456#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:45,440 INFO L290 TraceCheckUtils]: 128: Hoare triple {206456#(<= ~counter~0 14)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206456#(<= ~counter~0 14)} is VALID [2022-04-15 15:22:45,442 INFO L290 TraceCheckUtils]: 129: Hoare triple {206456#(<= ~counter~0 14)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206481#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:45,442 INFO L290 TraceCheckUtils]: 130: Hoare triple {206481#(<= ~counter~0 15)} assume !!(#t~post7 < 100);havoc #t~post7; {206481#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:45,443 INFO L272 TraceCheckUtils]: 131: Hoare triple {206481#(<= ~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)); {206481#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:45,443 INFO L290 TraceCheckUtils]: 132: Hoare triple {206481#(<= ~counter~0 15)} ~cond := #in~cond; {206481#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:45,443 INFO L290 TraceCheckUtils]: 133: Hoare triple {206481#(<= ~counter~0 15)} assume !(0 == ~cond); {206481#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:45,444 INFO L290 TraceCheckUtils]: 134: Hoare triple {206481#(<= ~counter~0 15)} assume true; {206481#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:45,444 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {206481#(<= ~counter~0 15)} {206481#(<= ~counter~0 15)} #96#return; {206481#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:45,444 INFO L290 TraceCheckUtils]: 136: Hoare triple {206481#(<= ~counter~0 15)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206481#(<= ~counter~0 15)} is VALID [2022-04-15 15:22:45,446 INFO L290 TraceCheckUtils]: 137: Hoare triple {206481#(<= ~counter~0 15)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206506#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:45,446 INFO L290 TraceCheckUtils]: 138: Hoare triple {206506#(<= ~counter~0 16)} assume !!(#t~post7 < 100);havoc #t~post7; {206506#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:45,447 INFO L272 TraceCheckUtils]: 139: Hoare triple {206506#(<= ~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)); {206506#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:45,447 INFO L290 TraceCheckUtils]: 140: Hoare triple {206506#(<= ~counter~0 16)} ~cond := #in~cond; {206506#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:45,447 INFO L290 TraceCheckUtils]: 141: Hoare triple {206506#(<= ~counter~0 16)} assume !(0 == ~cond); {206506#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:45,447 INFO L290 TraceCheckUtils]: 142: Hoare triple {206506#(<= ~counter~0 16)} assume true; {206506#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:45,448 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {206506#(<= ~counter~0 16)} {206506#(<= ~counter~0 16)} #96#return; {206506#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:45,448 INFO L290 TraceCheckUtils]: 144: Hoare triple {206506#(<= ~counter~0 16)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206506#(<= ~counter~0 16)} is VALID [2022-04-15 15:22:45,450 INFO L290 TraceCheckUtils]: 145: Hoare triple {206506#(<= ~counter~0 16)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206531#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:45,450 INFO L290 TraceCheckUtils]: 146: Hoare triple {206531#(<= ~counter~0 17)} assume !!(#t~post7 < 100);havoc #t~post7; {206531#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:45,450 INFO L272 TraceCheckUtils]: 147: Hoare triple {206531#(<= ~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)); {206531#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:45,451 INFO L290 TraceCheckUtils]: 148: Hoare triple {206531#(<= ~counter~0 17)} ~cond := #in~cond; {206531#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:45,451 INFO L290 TraceCheckUtils]: 149: Hoare triple {206531#(<= ~counter~0 17)} assume !(0 == ~cond); {206531#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:45,451 INFO L290 TraceCheckUtils]: 150: Hoare triple {206531#(<= ~counter~0 17)} assume true; {206531#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:45,452 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {206531#(<= ~counter~0 17)} {206531#(<= ~counter~0 17)} #96#return; {206531#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:45,452 INFO L290 TraceCheckUtils]: 152: Hoare triple {206531#(<= ~counter~0 17)} assume !(~r~0 > 0); {206531#(<= ~counter~0 17)} is VALID [2022-04-15 15:22:45,454 INFO L290 TraceCheckUtils]: 153: Hoare triple {206531#(<= ~counter~0 17)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206556#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:45,454 INFO L290 TraceCheckUtils]: 154: Hoare triple {206556#(<= ~counter~0 18)} assume !!(#t~post8 < 100);havoc #t~post8; {206556#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:45,454 INFO L272 TraceCheckUtils]: 155: Hoare triple {206556#(<= ~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)); {206556#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:45,455 INFO L290 TraceCheckUtils]: 156: Hoare triple {206556#(<= ~counter~0 18)} ~cond := #in~cond; {206556#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:45,455 INFO L290 TraceCheckUtils]: 157: Hoare triple {206556#(<= ~counter~0 18)} assume !(0 == ~cond); {206556#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:45,455 INFO L290 TraceCheckUtils]: 158: Hoare triple {206556#(<= ~counter~0 18)} assume true; {206556#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:45,456 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {206556#(<= ~counter~0 18)} {206556#(<= ~counter~0 18)} #98#return; {206556#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:45,456 INFO L290 TraceCheckUtils]: 160: Hoare triple {206556#(<= ~counter~0 18)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {206556#(<= ~counter~0 18)} is VALID [2022-04-15 15:22:45,458 INFO L290 TraceCheckUtils]: 161: Hoare triple {206556#(<= ~counter~0 18)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206581#(<= ~counter~0 19)} is VALID [2022-04-15 15:22:45,458 INFO L290 TraceCheckUtils]: 162: Hoare triple {206581#(<= ~counter~0 19)} assume !!(#t~post8 < 100);havoc #t~post8; {206581#(<= ~counter~0 19)} is VALID [2022-04-15 15:22:45,458 INFO L272 TraceCheckUtils]: 163: Hoare triple {206581#(<= ~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)); {206581#(<= ~counter~0 19)} is VALID [2022-04-15 15:22:45,459 INFO L290 TraceCheckUtils]: 164: Hoare triple {206581#(<= ~counter~0 19)} ~cond := #in~cond; {206581#(<= ~counter~0 19)} is VALID [2022-04-15 15:22:45,459 INFO L290 TraceCheckUtils]: 165: Hoare triple {206581#(<= ~counter~0 19)} assume !(0 == ~cond); {206581#(<= ~counter~0 19)} is VALID [2022-04-15 15:22:45,459 INFO L290 TraceCheckUtils]: 166: Hoare triple {206581#(<= ~counter~0 19)} assume true; {206581#(<= ~counter~0 19)} is VALID [2022-04-15 15:22:45,460 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {206581#(<= ~counter~0 19)} {206581#(<= ~counter~0 19)} #98#return; {206581#(<= ~counter~0 19)} is VALID [2022-04-15 15:22:45,460 INFO L290 TraceCheckUtils]: 168: Hoare triple {206581#(<= ~counter~0 19)} assume !(~r~0 < 0); {206581#(<= ~counter~0 19)} is VALID [2022-04-15 15:22:45,460 INFO L290 TraceCheckUtils]: 169: Hoare triple {206581#(<= ~counter~0 19)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {206606#(<= |main_#t~post6| 19)} is VALID [2022-04-15 15:22:45,461 INFO L290 TraceCheckUtils]: 170: Hoare triple {206606#(<= |main_#t~post6| 19)} assume !(#t~post6 < 100);havoc #t~post6; {206075#false} is VALID [2022-04-15 15:22:45,461 INFO L272 TraceCheckUtils]: 171: Hoare triple {206075#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)); {206075#false} is VALID [2022-04-15 15:22:45,461 INFO L290 TraceCheckUtils]: 172: Hoare triple {206075#false} ~cond := #in~cond; {206075#false} is VALID [2022-04-15 15:22:45,461 INFO L290 TraceCheckUtils]: 173: Hoare triple {206075#false} assume 0 == ~cond; {206075#false} is VALID [2022-04-15 15:22:45,461 INFO L290 TraceCheckUtils]: 174: Hoare triple {206075#false} assume !false; {206075#false} is VALID [2022-04-15 15:22:45,461 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 38 proven. 942 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-04-15 15:22:45,461 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-04-15 15:22:46,609 INFO L290 TraceCheckUtils]: 174: Hoare triple {206075#false} assume !false; {206075#false} is VALID [2022-04-15 15:22:46,610 INFO L290 TraceCheckUtils]: 173: Hoare triple {206075#false} assume 0 == ~cond; {206075#false} is VALID [2022-04-15 15:22:46,610 INFO L290 TraceCheckUtils]: 172: Hoare triple {206075#false} ~cond := #in~cond; {206075#false} is VALID [2022-04-15 15:22:46,610 INFO L272 TraceCheckUtils]: 171: Hoare triple {206075#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)); {206075#false} is VALID [2022-04-15 15:22:46,610 INFO L290 TraceCheckUtils]: 170: Hoare triple {206634#(< |main_#t~post6| 100)} assume !(#t~post6 < 100);havoc #t~post6; {206075#false} is VALID [2022-04-15 15:22:46,610 INFO L290 TraceCheckUtils]: 169: Hoare triple {206638#(< ~counter~0 100)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {206634#(< |main_#t~post6| 100)} is VALID [2022-04-15 15:22:46,611 INFO L290 TraceCheckUtils]: 168: Hoare triple {206638#(< ~counter~0 100)} assume !(~r~0 < 0); {206638#(< ~counter~0 100)} is VALID [2022-04-15 15:22:46,611 INFO L284 TraceCheckUtils]: 167: Hoare quadruple {206074#true} {206638#(< ~counter~0 100)} #98#return; {206638#(< ~counter~0 100)} is VALID [2022-04-15 15:22:46,611 INFO L290 TraceCheckUtils]: 166: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,611 INFO L290 TraceCheckUtils]: 165: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,611 INFO L290 TraceCheckUtils]: 164: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,612 INFO L272 TraceCheckUtils]: 163: Hoare triple {206638#(< ~counter~0 100)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,612 INFO L290 TraceCheckUtils]: 162: Hoare triple {206638#(< ~counter~0 100)} assume !!(#t~post8 < 100);havoc #t~post8; {206638#(< ~counter~0 100)} is VALID [2022-04-15 15:22:46,616 INFO L290 TraceCheckUtils]: 161: Hoare triple {206663#(< ~counter~0 99)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206638#(< ~counter~0 100)} is VALID [2022-04-15 15:22:46,616 INFO L290 TraceCheckUtils]: 160: Hoare triple {206663#(< ~counter~0 99)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {206663#(< ~counter~0 99)} is VALID [2022-04-15 15:22:46,617 INFO L284 TraceCheckUtils]: 159: Hoare quadruple {206074#true} {206663#(< ~counter~0 99)} #98#return; {206663#(< ~counter~0 99)} is VALID [2022-04-15 15:22:46,617 INFO L290 TraceCheckUtils]: 158: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,617 INFO L290 TraceCheckUtils]: 157: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,617 INFO L290 TraceCheckUtils]: 156: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,617 INFO L272 TraceCheckUtils]: 155: Hoare triple {206663#(< ~counter~0 99)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,617 INFO L290 TraceCheckUtils]: 154: Hoare triple {206663#(< ~counter~0 99)} assume !!(#t~post8 < 100);havoc #t~post8; {206663#(< ~counter~0 99)} is VALID [2022-04-15 15:22:46,619 INFO L290 TraceCheckUtils]: 153: Hoare triple {206688#(< ~counter~0 98)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206663#(< ~counter~0 99)} is VALID [2022-04-15 15:22:46,619 INFO L290 TraceCheckUtils]: 152: Hoare triple {206688#(< ~counter~0 98)} assume !(~r~0 > 0); {206688#(< ~counter~0 98)} is VALID [2022-04-15 15:22:46,619 INFO L284 TraceCheckUtils]: 151: Hoare quadruple {206074#true} {206688#(< ~counter~0 98)} #96#return; {206688#(< ~counter~0 98)} is VALID [2022-04-15 15:22:46,620 INFO L290 TraceCheckUtils]: 150: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,620 INFO L290 TraceCheckUtils]: 149: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,620 INFO L290 TraceCheckUtils]: 148: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,620 INFO L272 TraceCheckUtils]: 147: Hoare triple {206688#(< ~counter~0 98)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,620 INFO L290 TraceCheckUtils]: 146: Hoare triple {206688#(< ~counter~0 98)} assume !!(#t~post7 < 100);havoc #t~post7; {206688#(< ~counter~0 98)} is VALID [2022-04-15 15:22:46,622 INFO L290 TraceCheckUtils]: 145: Hoare triple {206713#(< ~counter~0 97)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206688#(< ~counter~0 98)} is VALID [2022-04-15 15:22:46,622 INFO L290 TraceCheckUtils]: 144: Hoare triple {206713#(< ~counter~0 97)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206713#(< ~counter~0 97)} is VALID [2022-04-15 15:22:46,622 INFO L284 TraceCheckUtils]: 143: Hoare quadruple {206074#true} {206713#(< ~counter~0 97)} #96#return; {206713#(< ~counter~0 97)} is VALID [2022-04-15 15:22:46,622 INFO L290 TraceCheckUtils]: 142: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,622 INFO L290 TraceCheckUtils]: 141: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,623 INFO L290 TraceCheckUtils]: 140: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,623 INFO L272 TraceCheckUtils]: 139: Hoare triple {206713#(< ~counter~0 97)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,623 INFO L290 TraceCheckUtils]: 138: Hoare triple {206713#(< ~counter~0 97)} assume !!(#t~post7 < 100);havoc #t~post7; {206713#(< ~counter~0 97)} is VALID [2022-04-15 15:22:46,624 INFO L290 TraceCheckUtils]: 137: Hoare triple {206738#(< ~counter~0 96)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206713#(< ~counter~0 97)} is VALID [2022-04-15 15:22:46,625 INFO L290 TraceCheckUtils]: 136: Hoare triple {206738#(< ~counter~0 96)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206738#(< ~counter~0 96)} is VALID [2022-04-15 15:22:46,625 INFO L284 TraceCheckUtils]: 135: Hoare quadruple {206074#true} {206738#(< ~counter~0 96)} #96#return; {206738#(< ~counter~0 96)} is VALID [2022-04-15 15:22:46,625 INFO L290 TraceCheckUtils]: 134: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,625 INFO L290 TraceCheckUtils]: 133: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,625 INFO L290 TraceCheckUtils]: 132: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,625 INFO L272 TraceCheckUtils]: 131: Hoare triple {206738#(< ~counter~0 96)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,626 INFO L290 TraceCheckUtils]: 130: Hoare triple {206738#(< ~counter~0 96)} assume !!(#t~post7 < 100);havoc #t~post7; {206738#(< ~counter~0 96)} is VALID [2022-04-15 15:22:46,629 INFO L290 TraceCheckUtils]: 129: Hoare triple {206763#(< ~counter~0 95)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206738#(< ~counter~0 96)} is VALID [2022-04-15 15:22:46,629 INFO L290 TraceCheckUtils]: 128: Hoare triple {206763#(< ~counter~0 95)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206763#(< ~counter~0 95)} is VALID [2022-04-15 15:22:46,630 INFO L284 TraceCheckUtils]: 127: Hoare quadruple {206074#true} {206763#(< ~counter~0 95)} #96#return; {206763#(< ~counter~0 95)} is VALID [2022-04-15 15:22:46,630 INFO L290 TraceCheckUtils]: 126: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,630 INFO L290 TraceCheckUtils]: 125: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,630 INFO L290 TraceCheckUtils]: 124: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,630 INFO L272 TraceCheckUtils]: 123: Hoare triple {206763#(< ~counter~0 95)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,630 INFO L290 TraceCheckUtils]: 122: Hoare triple {206763#(< ~counter~0 95)} assume !!(#t~post7 < 100);havoc #t~post7; {206763#(< ~counter~0 95)} is VALID [2022-04-15 15:22:46,632 INFO L290 TraceCheckUtils]: 121: Hoare triple {206788#(< ~counter~0 94)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206763#(< ~counter~0 95)} is VALID [2022-04-15 15:22:46,632 INFO L290 TraceCheckUtils]: 120: Hoare triple {206788#(< ~counter~0 94)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206788#(< ~counter~0 94)} is VALID [2022-04-15 15:22:46,633 INFO L284 TraceCheckUtils]: 119: Hoare quadruple {206074#true} {206788#(< ~counter~0 94)} #96#return; {206788#(< ~counter~0 94)} is VALID [2022-04-15 15:22:46,633 INFO L290 TraceCheckUtils]: 118: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,633 INFO L290 TraceCheckUtils]: 117: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,633 INFO L290 TraceCheckUtils]: 116: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,633 INFO L272 TraceCheckUtils]: 115: Hoare triple {206788#(< ~counter~0 94)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,633 INFO L290 TraceCheckUtils]: 114: Hoare triple {206788#(< ~counter~0 94)} assume !!(#t~post7 < 100);havoc #t~post7; {206788#(< ~counter~0 94)} is VALID [2022-04-15 15:22:46,635 INFO L290 TraceCheckUtils]: 113: Hoare triple {206813#(< ~counter~0 93)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206788#(< ~counter~0 94)} is VALID [2022-04-15 15:22:46,635 INFO L290 TraceCheckUtils]: 112: Hoare triple {206813#(< ~counter~0 93)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206813#(< ~counter~0 93)} is VALID [2022-04-15 15:22:46,635 INFO L284 TraceCheckUtils]: 111: Hoare quadruple {206074#true} {206813#(< ~counter~0 93)} #96#return; {206813#(< ~counter~0 93)} is VALID [2022-04-15 15:22:46,635 INFO L290 TraceCheckUtils]: 110: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,636 INFO L290 TraceCheckUtils]: 109: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,636 INFO L290 TraceCheckUtils]: 108: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,636 INFO L272 TraceCheckUtils]: 107: Hoare triple {206813#(< ~counter~0 93)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,636 INFO L290 TraceCheckUtils]: 106: Hoare triple {206813#(< ~counter~0 93)} assume !!(#t~post7 < 100);havoc #t~post7; {206813#(< ~counter~0 93)} is VALID [2022-04-15 15:22:46,638 INFO L290 TraceCheckUtils]: 105: Hoare triple {206838#(< ~counter~0 92)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206813#(< ~counter~0 93)} is VALID [2022-04-15 15:22:46,638 INFO L290 TraceCheckUtils]: 104: Hoare triple {206838#(< ~counter~0 92)} assume !!(0 != ~r~0); {206838#(< ~counter~0 92)} is VALID [2022-04-15 15:22:46,638 INFO L284 TraceCheckUtils]: 103: Hoare quadruple {206074#true} {206838#(< ~counter~0 92)} #94#return; {206838#(< ~counter~0 92)} is VALID [2022-04-15 15:22:46,638 INFO L290 TraceCheckUtils]: 102: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,639 INFO L290 TraceCheckUtils]: 101: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,639 INFO L290 TraceCheckUtils]: 100: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,639 INFO L272 TraceCheckUtils]: 99: Hoare triple {206838#(< ~counter~0 92)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,639 INFO L290 TraceCheckUtils]: 98: Hoare triple {206838#(< ~counter~0 92)} assume !!(#t~post6 < 100);havoc #t~post6; {206838#(< ~counter~0 92)} is VALID [2022-04-15 15:22:46,641 INFO L290 TraceCheckUtils]: 97: Hoare triple {206863#(< ~counter~0 91)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {206838#(< ~counter~0 92)} is VALID [2022-04-15 15:22:46,641 INFO L290 TraceCheckUtils]: 96: Hoare triple {206863#(< ~counter~0 91)} assume !(~r~0 < 0); {206863#(< ~counter~0 91)} is VALID [2022-04-15 15:22:46,641 INFO L284 TraceCheckUtils]: 95: Hoare quadruple {206074#true} {206863#(< ~counter~0 91)} #98#return; {206863#(< ~counter~0 91)} is VALID [2022-04-15 15:22:46,642 INFO L290 TraceCheckUtils]: 94: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,642 INFO L290 TraceCheckUtils]: 93: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,642 INFO L290 TraceCheckUtils]: 92: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,642 INFO L272 TraceCheckUtils]: 91: Hoare triple {206863#(< ~counter~0 91)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,642 INFO L290 TraceCheckUtils]: 90: Hoare triple {206863#(< ~counter~0 91)} assume !!(#t~post8 < 100);havoc #t~post8; {206863#(< ~counter~0 91)} is VALID [2022-04-15 15:22:46,643 INFO L290 TraceCheckUtils]: 89: Hoare triple {206888#(< ~counter~0 90)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206863#(< ~counter~0 91)} is VALID [2022-04-15 15:22:46,644 INFO L290 TraceCheckUtils]: 88: Hoare triple {206888#(< ~counter~0 90)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {206888#(< ~counter~0 90)} is VALID [2022-04-15 15:22:46,644 INFO L284 TraceCheckUtils]: 87: Hoare quadruple {206074#true} {206888#(< ~counter~0 90)} #98#return; {206888#(< ~counter~0 90)} is VALID [2022-04-15 15:22:46,644 INFO L290 TraceCheckUtils]: 86: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,644 INFO L290 TraceCheckUtils]: 85: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,644 INFO L290 TraceCheckUtils]: 84: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,645 INFO L272 TraceCheckUtils]: 83: Hoare triple {206888#(< ~counter~0 90)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,645 INFO L290 TraceCheckUtils]: 82: Hoare triple {206888#(< ~counter~0 90)} assume !!(#t~post8 < 100);havoc #t~post8; {206888#(< ~counter~0 90)} is VALID [2022-04-15 15:22:46,646 INFO L290 TraceCheckUtils]: 81: Hoare triple {206913#(< ~counter~0 89)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {206888#(< ~counter~0 90)} is VALID [2022-04-15 15:22:46,647 INFO L290 TraceCheckUtils]: 80: Hoare triple {206913#(< ~counter~0 89)} assume !(~r~0 > 0); {206913#(< ~counter~0 89)} is VALID [2022-04-15 15:22:46,647 INFO L284 TraceCheckUtils]: 79: Hoare quadruple {206074#true} {206913#(< ~counter~0 89)} #96#return; {206913#(< ~counter~0 89)} is VALID [2022-04-15 15:22:46,647 INFO L290 TraceCheckUtils]: 78: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,647 INFO L290 TraceCheckUtils]: 77: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,647 INFO L290 TraceCheckUtils]: 76: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,647 INFO L272 TraceCheckUtils]: 75: Hoare triple {206913#(< ~counter~0 89)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,648 INFO L290 TraceCheckUtils]: 74: Hoare triple {206913#(< ~counter~0 89)} assume !!(#t~post7 < 100);havoc #t~post7; {206913#(< ~counter~0 89)} is VALID [2022-04-15 15:22:46,649 INFO L290 TraceCheckUtils]: 73: Hoare triple {206938#(< ~counter~0 88)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206913#(< ~counter~0 89)} is VALID [2022-04-15 15:22:46,649 INFO L290 TraceCheckUtils]: 72: Hoare triple {206938#(< ~counter~0 88)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206938#(< ~counter~0 88)} is VALID [2022-04-15 15:22:46,650 INFO L284 TraceCheckUtils]: 71: Hoare quadruple {206074#true} {206938#(< ~counter~0 88)} #96#return; {206938#(< ~counter~0 88)} is VALID [2022-04-15 15:22:46,650 INFO L290 TraceCheckUtils]: 70: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,650 INFO L290 TraceCheckUtils]: 69: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,650 INFO L290 TraceCheckUtils]: 68: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,650 INFO L272 TraceCheckUtils]: 67: Hoare triple {206938#(< ~counter~0 88)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,650 INFO L290 TraceCheckUtils]: 66: Hoare triple {206938#(< ~counter~0 88)} assume !!(#t~post7 < 100);havoc #t~post7; {206938#(< ~counter~0 88)} is VALID [2022-04-15 15:22:46,652 INFO L290 TraceCheckUtils]: 65: Hoare triple {206963#(< ~counter~0 87)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206938#(< ~counter~0 88)} is VALID [2022-04-15 15:22:46,652 INFO L290 TraceCheckUtils]: 64: Hoare triple {206963#(< ~counter~0 87)} assume !!(~r~0 > 0);~r~0 := ~r~0 - ~v~0;~v~0 := 2 + ~v~0; {206963#(< ~counter~0 87)} is VALID [2022-04-15 15:22:46,653 INFO L284 TraceCheckUtils]: 63: Hoare quadruple {206074#true} {206963#(< ~counter~0 87)} #96#return; {206963#(< ~counter~0 87)} is VALID [2022-04-15 15:22:46,653 INFO L290 TraceCheckUtils]: 62: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,653 INFO L290 TraceCheckUtils]: 61: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,653 INFO L290 TraceCheckUtils]: 60: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,653 INFO L272 TraceCheckUtils]: 59: Hoare triple {206963#(< ~counter~0 87)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,653 INFO L290 TraceCheckUtils]: 58: Hoare triple {206963#(< ~counter~0 87)} assume !!(#t~post7 < 100);havoc #t~post7; {206963#(< ~counter~0 87)} is VALID [2022-04-15 15:22:46,655 INFO L290 TraceCheckUtils]: 57: Hoare triple {206988#(< ~counter~0 86)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {206963#(< ~counter~0 87)} is VALID [2022-04-15 15:22:46,655 INFO L290 TraceCheckUtils]: 56: Hoare triple {206988#(< ~counter~0 86)} assume !!(0 != ~r~0); {206988#(< ~counter~0 86)} is VALID [2022-04-15 15:22:46,656 INFO L284 TraceCheckUtils]: 55: Hoare quadruple {206074#true} {206988#(< ~counter~0 86)} #94#return; {206988#(< ~counter~0 86)} is VALID [2022-04-15 15:22:46,656 INFO L290 TraceCheckUtils]: 54: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,656 INFO L290 TraceCheckUtils]: 53: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,656 INFO L290 TraceCheckUtils]: 52: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,656 INFO L272 TraceCheckUtils]: 51: Hoare triple {206988#(< ~counter~0 86)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {206988#(< ~counter~0 86)} assume !!(#t~post6 < 100);havoc #t~post6; {206988#(< ~counter~0 86)} is VALID [2022-04-15 15:22:46,658 INFO L290 TraceCheckUtils]: 49: Hoare triple {207013#(< ~counter~0 85)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {206988#(< ~counter~0 86)} is VALID [2022-04-15 15:22:46,658 INFO L290 TraceCheckUtils]: 48: Hoare triple {207013#(< ~counter~0 85)} assume !(~r~0 < 0); {207013#(< ~counter~0 85)} is VALID [2022-04-15 15:22:46,658 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {206074#true} {207013#(< ~counter~0 85)} #98#return; {207013#(< ~counter~0 85)} is VALID [2022-04-15 15:22:46,658 INFO L290 TraceCheckUtils]: 46: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,659 INFO L290 TraceCheckUtils]: 45: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,659 INFO L290 TraceCheckUtils]: 44: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,659 INFO L272 TraceCheckUtils]: 43: Hoare triple {207013#(< ~counter~0 85)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,659 INFO L290 TraceCheckUtils]: 42: Hoare triple {207013#(< ~counter~0 85)} assume !!(#t~post8 < 100);havoc #t~post8; {207013#(< ~counter~0 85)} is VALID [2022-04-15 15:22:46,660 INFO L290 TraceCheckUtils]: 41: Hoare triple {207038#(< ~counter~0 84)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {207013#(< ~counter~0 85)} is VALID [2022-04-15 15:22:46,661 INFO L290 TraceCheckUtils]: 40: Hoare triple {207038#(< ~counter~0 84)} assume !!(~r~0 < 0);~r~0 := ~r~0 + ~u~0;~u~0 := 2 + ~u~0; {207038#(< ~counter~0 84)} is VALID [2022-04-15 15:22:46,661 INFO L284 TraceCheckUtils]: 39: Hoare quadruple {206074#true} {207038#(< ~counter~0 84)} #98#return; {207038#(< ~counter~0 84)} is VALID [2022-04-15 15:22:46,661 INFO L290 TraceCheckUtils]: 38: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,661 INFO L290 TraceCheckUtils]: 37: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,661 INFO L290 TraceCheckUtils]: 36: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,661 INFO L272 TraceCheckUtils]: 35: Hoare triple {207038#(< ~counter~0 84)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,662 INFO L290 TraceCheckUtils]: 34: Hoare triple {207038#(< ~counter~0 84)} assume !!(#t~post8 < 100);havoc #t~post8; {207038#(< ~counter~0 84)} is VALID [2022-04-15 15:22:46,663 INFO L290 TraceCheckUtils]: 33: Hoare triple {207063#(< ~counter~0 83)} #t~post8 := ~counter~0;~counter~0 := 1 + #t~post8; {207038#(< ~counter~0 84)} is VALID [2022-04-15 15:22:46,664 INFO L290 TraceCheckUtils]: 32: Hoare triple {207063#(< ~counter~0 83)} assume !(~r~0 > 0); {207063#(< ~counter~0 83)} is VALID [2022-04-15 15:22:46,664 INFO L284 TraceCheckUtils]: 31: Hoare quadruple {206074#true} {207063#(< ~counter~0 83)} #96#return; {207063#(< ~counter~0 83)} is VALID [2022-04-15 15:22:46,664 INFO L290 TraceCheckUtils]: 30: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,664 INFO L290 TraceCheckUtils]: 28: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,664 INFO L272 TraceCheckUtils]: 27: Hoare triple {207063#(< ~counter~0 83)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,665 INFO L290 TraceCheckUtils]: 26: Hoare triple {207063#(< ~counter~0 83)} assume !!(#t~post7 < 100);havoc #t~post7; {207063#(< ~counter~0 83)} is VALID [2022-04-15 15:22:46,666 INFO L290 TraceCheckUtils]: 25: Hoare triple {207088#(< ~counter~0 82)} #t~post7 := ~counter~0;~counter~0 := 1 + #t~post7; {207063#(< ~counter~0 83)} is VALID [2022-04-15 15:22:46,666 INFO L290 TraceCheckUtils]: 24: Hoare triple {207088#(< ~counter~0 82)} assume !!(0 != ~r~0); {207088#(< ~counter~0 82)} is VALID [2022-04-15 15:22:46,667 INFO L284 TraceCheckUtils]: 23: Hoare quadruple {206074#true} {207088#(< ~counter~0 82)} #94#return; {207088#(< ~counter~0 82)} is VALID [2022-04-15 15:22:46,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,667 INFO L290 TraceCheckUtils]: 20: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,667 INFO L272 TraceCheckUtils]: 19: Hoare triple {207088#(< ~counter~0 82)} call __VERIFIER_assert((if 4 * (~A~0 + ~r~0) == ~u~0 * ~u~0 - ~v~0 * ~v~0 - 2 * ~u~0 + 2 * ~v~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,667 INFO L290 TraceCheckUtils]: 18: Hoare triple {207088#(< ~counter~0 82)} assume !!(#t~post6 < 100);havoc #t~post6; {207088#(< ~counter~0 82)} is VALID [2022-04-15 15:22:46,669 INFO L290 TraceCheckUtils]: 17: Hoare triple {207113#(< ~counter~0 81)} #t~post6 := ~counter~0;~counter~0 := 1 + #t~post6; {207088#(< ~counter~0 82)} is VALID [2022-04-15 15:22:46,669 INFO L290 TraceCheckUtils]: 16: Hoare triple {207113#(< ~counter~0 81)} ~u~0 := 1 + 2 * ~R~0;~v~0 := 1;~r~0 := ~R~0 * ~R~0 - ~A~0; {207113#(< ~counter~0 81)} is VALID [2022-04-15 15:22:46,670 INFO L284 TraceCheckUtils]: 15: Hoare quadruple {206074#true} {207113#(< ~counter~0 81)} #92#return; {207113#(< ~counter~0 81)} is VALID [2022-04-15 15:22:46,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,670 INFO L290 TraceCheckUtils]: 13: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,670 INFO L290 TraceCheckUtils]: 12: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,670 INFO L272 TraceCheckUtils]: 11: Hoare triple {207113#(< ~counter~0 81)} 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)); {206074#true} is VALID [2022-04-15 15:22:46,670 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {206074#true} {207113#(< ~counter~0 81)} #90#return; {207113#(< ~counter~0 81)} is VALID [2022-04-15 15:22:46,670 INFO L290 TraceCheckUtils]: 9: Hoare triple {206074#true} assume true; {206074#true} is VALID [2022-04-15 15:22:46,671 INFO L290 TraceCheckUtils]: 8: Hoare triple {206074#true} assume !(0 == ~cond); {206074#true} is VALID [2022-04-15 15:22:46,671 INFO L290 TraceCheckUtils]: 7: Hoare triple {206074#true} ~cond := #in~cond; {206074#true} is VALID [2022-04-15 15:22:46,671 INFO L272 TraceCheckUtils]: 6: Hoare triple {207113#(< ~counter~0 81)} call assume_abort_if_not((if (~R~0 - 1) * (~R~0 - 1) < ~A~0 then 1 else 0)); {206074#true} is VALID [2022-04-15 15:22:46,671 INFO L290 TraceCheckUtils]: 5: Hoare triple {207113#(< ~counter~0 81)} 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; {207113#(< ~counter~0 81)} is VALID [2022-04-15 15:22:46,671 INFO L272 TraceCheckUtils]: 4: Hoare triple {207113#(< ~counter~0 81)} call #t~ret9 := main(); {207113#(< ~counter~0 81)} is VALID [2022-04-15 15:22:46,672 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {207113#(< ~counter~0 81)} {206074#true} #102#return; {207113#(< ~counter~0 81)} is VALID [2022-04-15 15:22:46,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {207113#(< ~counter~0 81)} assume true; {207113#(< ~counter~0 81)} is VALID [2022-04-15 15:22:46,672 INFO L290 TraceCheckUtils]: 1: Hoare triple {206074#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; {207113#(< ~counter~0 81)} is VALID [2022-04-15 15:22:46,672 INFO L272 TraceCheckUtils]: 0: Hoare triple {206074#true} call ULTIMATE.init(); {206074#true} is VALID [2022-04-15 15:22:46,673 INFO L134 CoverageAnalysis]: Checked inductivity of 984 backedges. 38 proven. 258 refuted. 0 times theorem prover too weak. 688 trivial. 0 not checked. [2022-04-15 15:22:46,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-04-15 15:22:46,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1582743293] [2022-04-15 15:22:46,673 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-04-15 15:22:46,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1085316972] [2022-04-15 15:22:46,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1085316972] provided 0 perfect and 2 imperfect interpolant sequences [2022-04-15 15:22:46,673 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-04-15 15:22:46,673 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2022-04-15 15:22:46,673 INFO L136 FreeRefinementEngine]: Strategy ACCELERATED_INTERPOLATION found an infeasible trace [2022-04-15 15:22:46,673 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleAcceleratedInterpolation [1386105697] [2022-04-15 15:22:46,673 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleAcceleratedInterpolation [1386105697] provided 1 perfect and 0 imperfect interpolant sequences [2022-04-15 15:22:46,673 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-04-15 15:22:46,674 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [23] imperfect sequences [] total 23 [2022-04-15 15:22:46,674 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [667627996] [2022-04-15 15:22:46,674 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-04-15 15:22:46,674 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 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 175 [2022-04-15 15:22:46,674 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-04-15 15:22:46,674 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 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-15 15:22:46,927 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:46,927 INFO L554 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-04-15 15:22:46,927 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy ACCELERATED_INTERPOLATION [2022-04-15 15:22:46,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-04-15 15:22:46,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=866, Invalid=1026, Unknown=0, NotChecked=0, Total=1892 [2022-04-15 15:22:46,928 INFO L87 Difference]: Start difference. First operand 967 states and 1280 transitions. Second operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 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-15 15:22:54,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:54,168 INFO L93 Difference]: Finished difference Result 1018 states and 1350 transitions. [2022-04-15 15:22:54,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2022-04-15 15:22:54,168 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 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 175 [2022-04-15 15:22:54,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-04-15 15:22:54,168 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 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-15 15:22:54,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 394 transitions. [2022-04-15 15:22:54,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 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-15 15:22:54,173 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 394 transitions. [2022-04-15 15:22:54,173 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 39 states and 394 transitions. [2022-04-15 15:22:54,784 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 394 edges. 394 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-04-15 15:22:54,826 INFO L225 Difference]: With dead ends: 1018 [2022-04-15 15:22:54,826 INFO L226 Difference]: Without dead ends: 1013 [2022-04-15 15:22:54,827 INFO L912 BasicCegarLoop]: 0 DeclaredPredicates, 365 GetRequests, 307 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 178 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=1509, Invalid=2031, Unknown=0, NotChecked=0, Total=3540 [2022-04-15 15:22:54,827 INFO L913 BasicCegarLoop]: 87 mSDtfsCounter, 342 mSDsluCounter, 306 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 292 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 292 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-04-15 15:22:54,827 INFO L914 BasicCegarLoop]: SdHoareTripleChecker [342 Valid, 393 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [292 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-04-15 15:22:54,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1013 states. [2022-04-15 15:22:59,041 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1013 to 991. [2022-04-15 15:22:59,041 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-04-15 15:22:59,042 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1013 states. Second operand has 991 states, 738 states have (on average 1.170731707317073) internal successors, (864), 755 states have internal predecessors, (864), 228 states have call successors, (228), 26 states have call predecessors, (228), 24 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-15 15:22:59,043 INFO L74 IsIncluded]: Start isIncluded. First operand 1013 states. Second operand has 991 states, 738 states have (on average 1.170731707317073) internal successors, (864), 755 states have internal predecessors, (864), 228 states have call successors, (228), 26 states have call predecessors, (228), 24 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-15 15:22:59,043 INFO L87 Difference]: Start difference. First operand 1013 states. Second operand has 991 states, 738 states have (on average 1.170731707317073) internal successors, (864), 755 states have internal predecessors, (864), 228 states have call successors, (228), 26 states have call predecessors, (228), 24 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-15 15:22:59,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:59,078 INFO L93 Difference]: Finished difference Result 1013 states and 1344 transitions. [2022-04-15 15:22:59,078 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1344 transitions. [2022-04-15 15:22:59,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:59,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:59,080 INFO L74 IsIncluded]: Start isIncluded. First operand has 991 states, 738 states have (on average 1.170731707317073) internal successors, (864), 755 states have internal predecessors, (864), 228 states have call successors, (228), 26 states have call predecessors, (228), 24 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) Second operand 1013 states. [2022-04-15 15:22:59,080 INFO L87 Difference]: Start difference. First operand has 991 states, 738 states have (on average 1.170731707317073) internal successors, (864), 755 states have internal predecessors, (864), 228 states have call successors, (228), 26 states have call predecessors, (228), 24 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) Second operand 1013 states. [2022-04-15 15:22:59,110 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-04-15 15:22:59,110 INFO L93 Difference]: Finished difference Result 1013 states and 1344 transitions. [2022-04-15 15:22:59,110 INFO L276 IsEmpty]: Start isEmpty. Operand 1013 states and 1344 transitions. [2022-04-15 15:22:59,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-04-15 15:22:59,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-04-15 15:22:59,111 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-04-15 15:22:59,111 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-04-15 15:22:59,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 991 states, 738 states have (on average 1.170731707317073) internal successors, (864), 755 states have internal predecessors, (864), 228 states have call successors, (228), 26 states have call predecessors, (228), 24 states have return successors, (226), 209 states have call predecessors, (226), 226 states have call successors, (226) [2022-04-15 15:22:59,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 991 states to 991 states and 1318 transitions. [2022-04-15 15:22:59,152 INFO L78 Accepts]: Start accepts. Automaton has 991 states and 1318 transitions. Word has length 175 [2022-04-15 15:22:59,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-04-15 15:22:59,152 INFO L478 AbstractCegarLoop]: Abstraction has 991 states and 1318 transitions. [2022-04-15 15:22:59,152 INFO L479 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.478260869565218) internal successors, (126), 22 states have internal predecessors, (126), 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-15 15:22:59,152 INFO L86 InductivityCheck]: Starting inductivity check of a Floyd-Hoare automaton with 991 states and 1318 transitions.